Skip to main content
SpringerLink
Log in

Effective tests for cyclotomic polynomials

  • Algorithmic Number Theory
  • Conference paper
  • First Online:
Symbolic and Algebraic Computation (ISSAC 1988)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 358))

Included in the following conference series:

Abstract

We present two efficient tests that determine if a given polynomial is cyclotomic, or is a product of cyclotomics. The first method uses the fact that all the roots of a cyclotomic polynomial are roots of unity, and the second the fact that the degree of a cyclotomic polynomial is a value of φ(n), for some n. We can also find the cyclotomic factors of any polynomial.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Factoring Polynomials over Finite Fields, Berlekamp, E.R., Bell System Tech. J., 46(1967), pp. 1853–1859.

    Google Scholar 

  2. “Local Fields,” Cassels, J.W.S., London Mathematical Society Student Texts 3, Cambridge University Press, 1986.

    Google Scholar 

  3. Factorization of Sparse Polynomials, Davenport, J.H., Proceedings EUROCAL 1983, Springer LNCS 162, pp. 214–224.

    Google Scholar 

  4. Polynômes cyclotomiques, factorisation et l'opérateur K de Schinzel, Davenport, J.H., preprint, University of Strasbourg, 1988.

    Google Scholar 

  5. “An Introduction to the Theory of Numbers,” Hardy, G.H., and Wright, E.M., (5th edition) Clarendon Press, Oxford, 1979.

    Google Scholar 

  6. “Introduction to Numerical Analysis,” Hildebrand, F.B., International Series in Pure and Applied Mathematics, McGraw-Hill, 1956.

    Google Scholar 

  7. On the Irreducibility of Certain Trinomials and Quadrinomials, Ljunggren, W., Math. Scand. 8(1964), pp. 65–70.

    Google Scholar 

  8. “Selected Topics on Polynomials,” Schinzel, A., University of Michigan Press, Ann Arbor, Michigan, 1982.

    Google Scholar 

  9. Bounds for the Coefficients of Cyclotomic Polynomials, Vaughan, R.C., Michigan Math. J. 21(1974), pp. 289–295.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Mathematical Sciences, University of Bath, BA2 7AY, Claverton Down, Bath, England

    R. J. Bradford & J. H. Davenport

Authors
  1. R. J. Bradford
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. J. H. Davenport
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

P. Gianni

Rights and permissions

Reprints and permissions

Copyright information

© 1989 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Bradford, R.J., Davenport, J.H. (1989). Effective tests for cyclotomic polynomials. In: Gianni, P. (eds) Symbolic and Algebraic Computation. ISSAC 1988. Lecture Notes in Computer Science, vol 358. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-51084-2_22

Download citation

  • DOI: https://doi.org/10.1007/3-540-51084-2_22

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-51084-0

  • Online ISBN: 978-3-540-46153-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation