scientific article; zbMATH DE number 4033820

MaRDI QIDQ3773945zbMATH OpenFDO

Authors Peter Stevenhagen

Publication date 1987

zbMATH Keywords

abelian extensionsAurifeuillian factorizationsAurifeuillian polynomialscyclotomic polynomialsEuclidean algorithmfactorization algorithmfactorization of \(a^n-b^n\)

Mathematics Subject Classification ID

Factorization; primality (11A51) Special sequences and polynomials (11B83) Polynomials in number theory (11C08) Factorization (11Y05)

Recommendations

• scientific article; zbMATH DE number 784880
• A question about Aurifeuillian factorizations
• scientific article; zbMATH DE number 1486921
• On Computing Factors of Cyclotomic Polynomials
• scientific article; zbMATH DE number 639506

Cited in

(14)

• Practical Aurifeuillian factorization
• A question about Aurifeuillian factorizations
• On the number of residues of linear recurrences
• On Computing Factors of Cyclotomic Polynomials
• On pseudoprimes having special forms and a solution of K. Szymiczek's problem
• scientific article; zbMATH DE number 639506 (Why is no real title available?)
• scientific article; zbMATH DE number 1092188 (Why is no real title available?)
• scientific article; zbMATH DE number 1474991 (Why is no real title available?)
• scientific article; zbMATH DE number 1486921 (Why is no real title available?)
• scientific article; zbMATH DE number 784880 (Why is no real title available?)
• Aurifeuillian factorization
• Near-squares in binary recurrence sequences
• Geometric sums as sums of two squares
• Some uses of microcomputers in number theory research

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3773945)