Computing Aurifeuillian Factors

  • Richard P. Brent
Part of the Mathematics and Its Applications book series (MAIA, volume 325)


For odd square-free n > 1 the cyclotomic polynomial Φ n (x) satisfies an identity Φ n (x) = C n (x)2 ± nx D n (x)2 of Aurifeuille, Le Lasseur and Lucas. Here C n (x) and D n (x) are monic polynomials with integer coefficients. These coefficients can be computed by simple algorithms which require O(n 2) arithmetic operations over the integers. Also, there are explicit formulas and generating functions for C n (x) and D n (x). This paper is a preliminary report which states the results for the case n ≡ 1 mod 4, and gives some numerical examples. The proofs, generalisations to other square-free n, and similar results for the identities of Gauss and Dirichlet, appear elsewhere[1].


Arithmetic Operation Monic Polynomial Quadratic Field Integer Coefficient Euclidean Algorithm 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    R. P. Brent, On computing factors of cyclotomic polynomials, Math. Comp. (D. H. Lehmer memorial issue) 61 (1993), 131–149.Google Scholar
  2. [2]
    R. P. Brent and H. T. Kung, Fast algorithms for manipulating formal power series, J. ACM 25 (1978), 581–595.MathSciNetzbMATHCrossRefGoogle Scholar
  3. [3]
    R. P. Brent and H. J. J. te Riele, Factorizations of an + 1, 13 ≤ a < 100, Report NM—R9212, Department of Numerical Mathematics, Centrum voor Wiskunde en Informatica, Amsterdam, June 1992. Available with updates by anonymous ftp from dcssoft. anu. edu. au (rpb134. *. Z in directory pub/Brent).Google Scholar
  4. [4]
    J. Brillhart, D.H. Lehmer, J. L. Selfridge, B. Tuckerman and S. S. Wagstaff, Jr., Factorizations of bn±1, b = 2, 3, 5, 6, 7,10,11, 12 up to high powers, second edition, Contemporary Mathematics 22, Providence: American Mathematical Society, Providence, Rhode Island, 1988.Google Scholar
  5. [5]
    A. J. C. Cunningham, Factorisation of N = yv 1 and x=v yxv, Messenger of Math. (2), 45 (1915), 49–75.Google Scholar
  6. [6]
    A. J. C. Cunningham and H. J. Woodall, Factorisation of yn T 1, y = 2, 3, 5, 6, 7, 10, 11, 12 up to high powers (n), London: Hodgson, 1925.Google Scholar
  7. [7]
    H. Davenport, Multiplicative Number Theory, second edition (revised by H. L. Montgomery), New York: Springer—Verlag, 1980.Google Scholar
  8. [8]
    P. G. Lejeune Dirichlet, Vorlesungen über Zahlentheorie,fourth edition (rev. R. Dedekind), Braunschweig: Friedr. Vieweg and Sohn, 1894, Chapter 5 and Supplement 7.Google Scholar
  9. [9]
    G. H. Hardy and E. M. Wright, An Introduction to the Theory of Numbers,fifth edition, Oxford: Clarendon Press, 1984, Ch. 16.Google Scholar
  10. [10]
    D. E. Knuth, The Art of Computer Programming, Volume 2: Seminumerical Algorithms ( second edition ), Menlo Park: Addison—Wesley, 1981, Chapter 3.Google Scholar
  11. [11]
    M. Kraitchik, Décomposition de an + bn en facteurs dans le cas où nab est un carré parfait avec une table des décompositions numériques pour toutes les valeurs de a et b inférieures à 100, Paris: Gauthiers—Villars, 1922.Google Scholar
  12. [12]
    M. Kraitchik, Recherches sur la Théorie des Nombres, Volume 1, Paris: Gauthiers—Villars, 1924.Google Scholar
  13. [13]
    E. Lucas, Théorèmes d’arithmétique, Atti. R. Acad. Sc. Torino 13 (1877–8), 271–284.Google Scholar
  14. [14]
    E. Lucas, Sur la série récurrente de Fermat, Bull. Bibl. Storia Sc. Mat. e Fis. 11 (1878), 783–789.Google Scholar
  15. [15]
    E. Lucas, Sur les formules de Cauchy et de Lejeune—Dirichlet, Ass. Française pour l’Avanc. des Sci., Comptes Rendus 7 (1878), 164–173.Google Scholar
  16. [16]
    Hans Riesel, Prime Numbers and Computer Methods for Factorization, Boston: Birkhäuser, 1985.zbMATHCrossRefGoogle Scholar
  17. [17]
    A. Schinzel, On the primitive prime factors of an — bn, Proc. Cambridge Philos. Soc. 58 (1962), 555–562.Google Scholar
  18. [18]
    Peter Stevenhagen, OnAurifeuillian factorizations,Nederl. Akad. Wetensch. Indag. Math. 49 (1987), 451–468.Google Scholar

Copyright information

© Springer Science+Business Media Dordrecht 1995

Authors and Affiliations

  • Richard P. Brent
    • 1
  1. 1.Computer Sciences LabAustralian National UniversityCanberraAustralia

Personalised recommendations