Effective tests for cyclotomic polynomials

  • R. J. Bradford
  • J. H. Davenport
Algorithmic Number Theory

DOI: 10.1007/3-540-51084-2_22

Part of the Lecture Notes in Computer Science book series (LNCS, volume 358)
Cite this paper as:
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

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag 1989

Authors and Affiliations

  • R. J. Bradford
    • 1
  • J. H. Davenport
    • 1
  1. 1.School of Mathematical SciencesUniversity of BathClaverton DownEngland

Personalised recommendations