Hostname: page-component-586b7cd67f-2plfb Total loading time: 0 Render date: 2024-11-28T06:52:08.226Z Has data issue: false hasContentIssue false

COMMON FACTORS OF RESULTANTS MODULO p

Published online by Cambridge University Press:  13 March 2009

DOMINGO GOMEZ
Affiliation:
University of Cantabria, E-39071 Santander, Spain (email: [email protected])
JAIME GUTIERREZ*
Affiliation:
University of Cantabria, E-39071 Santander, Spain (email: [email protected])
ÁLVAR IBEAS
Affiliation:
University of Cantabria, E-39071 Santander, Spain (email: [email protected])
DAVID SEVILLA
Affiliation:
Johann Radon Institute for Computational and Applied Mathematics (RICAM), Austrian Academy of Sciences, Altenbergerstraße 69, A-4040 Linz, Austria (email: [email protected])
*
For correspondence; e-mail: [email protected]
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

We show that the multiplicity of a prime p as a factor of the resultant of two polynomials with integer coefficients is at least the degree of their greatest common divisor modulo p. This answers an open question by Konyagin and Shparlinski.

Type
Research Article
Copyright
Copyright © Australian Mathematical Society 2009

Footnotes

This work is partially supported by the Spanish Ministry of Education and Science grant MTM2007-67088.

References

[1] Konyagin, S. V. and Shparlinski, I., Character Sums with Exponential Functions and their Applications (Cambridge University Press, Cambridge, 1999).CrossRefGoogle Scholar
[2] Lidl, R. and Niederreiter, H., Finite Fields (Cambridge University Press, Cambridge, 1997).Google Scholar
[3] van der Waerden, B. L., Modern Algebra (Frederick Ungar Publishing Co., New York, 1964).Google Scholar