On Computing Factors of Cyclotomic Polynomials
From MaRDI portal
Abstract: For odd square-free n > 1 the n-th cyclotomic polynomial satisfies an identity of Gauss. There are similar identity of Aurifeuille, Le Lasseur and Lucas. These identities all involve certain polynomials with integer coefficients. We show how these coefficients can be computed by simple algorithms which require O(n^2) arithmetic operations and work over the integers. We also give explicit formulae and generating functions for the polynomials, and illustrate the application to integer factorization with some numerical examples.
Recommendations
Cites work
- Factorizations of 𝑏ⁿ±1, 𝑏=2, 3, 5, 6, 7, 10, 11, 12 Up to High Powers
- Fast Algorithms for Manipulating Formal Power Series
- Fast solution of toeplitz systems of equations and computation of Padé approximants
- scientific article; zbMATH DE number 4033820 (Why is no real title available?)
- scientific article; zbMATH DE number 3679828 (Why is no real title available?)
- scientific article; zbMATH DE number 3708485 (Why is no real title available?)
- scientific article; zbMATH DE number 3750146 (Why is no real title available?)
- scientific article; zbMATH DE number 3760283 (Why is no real title available?)
- scientific article; zbMATH DE number 45378 (Why is no real title available?)
- scientific article; zbMATH DE number 3511563 (Why is no real title available?)
- scientific article; zbMATH DE number 3185064 (Why is no real title available?)
- scientific article; zbMATH DE number 3032896 (Why is no real title available?)
- scientific article; zbMATH DE number 3069887 (Why is no real title available?)
- scientific article; zbMATH DE number 3076698 (Why is no real title available?)
- Prime numbers and computer methods for factorization
Cited in
(28)- A note about the cyclotomic polynomial \(\Phi_{pq}(x)\) and some related results
- A deformation of the class number formula of real quadratic fields
- A note on cyclotomic polynomials
- Calculating cyclotomic polynomials
- Finding special factors of values of polynomials at integer points
- scientific article; zbMATH DE number 3889669 (Why is no real title available?)
- On the minimal polynomial of Gauss periods for prime powers
- Fractalized cyclotomic polynomials
- scientific article; zbMATH DE number 4145977 (Why is no real title available?)
- scientific article; zbMATH DE number 4027549 (Why is no real title available?)
- scientific article; zbMATH DE number 4033820 (Why is no real title available?)
- scientific article; zbMATH DE number 4079497 (Why is no real title available?)
- scientific article; zbMATH DE number 16709 (Why is no real title available?)
- scientific article; zbMATH DE number 107574 (Why is no real title available?)
- Fast arithmetics in Artin-Schreier towers over finite fields
- On explicit relations between cyclotomic numbers
- scientific article; zbMATH DE number 953230 (Why is no real title available?)
- scientific article; zbMATH DE number 1829770 (Why is no real title available?)
- Classification of characteristic polynomials of simple supersingular abelian varieties over finite fields
- scientific article; zbMATH DE number 784881 (Why is no real title available?)
- Aurifeuillian factorizations and the period of the Bell numbers modulo a prime
- Computations of Cyclotomic Lattices
- On Cyclotomic Polynomials with ± 1 Coefficients
- Bézout's identity for cyclotomic polynomials over the integers
- Generalization of Jarden's theorem
- Aurifeuillian factorization
- Near-squares in binary recurrence sequences
- Geometric sums as sums of two squares
This page was built for publication: On Computing Factors of Cyclotomic Polynomials
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3137454)
