Test environment running 7.6.6

Cultural advice

The Australian National University acknowledges, celebrates and pays our respects to the Ngunnawal and Ngambri people of the Canberra region and to all First Nations Australians on whose traditional lands we meet and work, and whose cultures are among the oldest continuing cultures in human history.

Aboriginal and Torres Strait Islander peoples are advised that ANU Library collections may include images, names, voices, and other representations of deceased persons.

Material in the collection may contain terms, language or views that reflect the period in which the item was created and may be considered inappropriate today.

On computing factors of cyclotomic polynomials

Loading...
Thumbnail Image

Date

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

For odd square-free n > 1 the cyclotomic polynomial Φn(x) satisfies the identity of Gauss, 4Φ(x)=An2-(-1)(n-1)/2nBn2A similar identity of Aurifeuille, Le Lasseur, and Lucas is Φ((-1)(n-1)/2x)=Cn2-nxDn2or, in the case that n is even and square-free, ±Φn/2(-x2)=Cn2-nxDn2.Here, An(x), …, Dn(x) are polynomials with integer coefficients. We show how these coefficients can be computed by simple algorithms which require O(n2) arithmetic operations and work over the integers. We also give explicit formulae and generating functions for An(x), …, Dn(x) and illustrate the application to integer factorization with some numerical examples.

Description

Citation

Source

Mathematics of Computation

Book Title

Entity type

Access Statement

License Rights

Restricted until