## Factors of generalized Fermat numbers

HTML articles powered by AMS MathViewer

- by Anders Björn and Hans Riesel PDF
- Math. Comp.
**67**(1998), 441-446 Request permission

## Abstract:

A search for prime factors of the generalized Fermat numbers $F_n(a,b)=a^{2^n}+b^{2^n}$ has been carried out for all pairs $(a,b)$ with $a,b\leq 12$ and GCD$(a,b)=1$. The search limit $k$ on the factors, which all have the form $p=k\cdot 2^m+1$, was $k=10^9$ for $m\leq 100$ and $k=3\cdot 10^6$ for $101\leq m\leq 1000$. Many larger primes of this form have also been tried as factors of $F_n(a,b)$. Several thousand new factors were found, which are given in our tables.—For the smaller of the numbers, i.e. for $n\leq 15$, or, if $a,b\leq 8$, for $n\leq 16$, the cofactors, after removal of the factors found, were subjected to primality tests, and if composite with $n\leq 11$, searched for larger factors by using the ECM, and in some cases the MPQS, PPMPQS, or SNFS. As a result all numbers with $n\leq 7$ are now completely factored.## References

- Harvey Dubner and Wilfrid Keller,
*Factors of generalized Fermat numbers*, Math. Comp.**64**(1995), no. 209, 397–405. MR**1270618**, DOI 10.1090/S0025-5718-1995-1270618-1 - E. Lindelöf,
*Le Calcul des Résidus et ses Applications a la Théorie des Fonctions,*Gauthier-Villars, Paris 1905, formula (3) on p. 78. - Hans Riesel,
*Some factors of the numbers $G_{n}=6^{2n}+1$ and $H_{n}=10^{2n}+1$*, Math. Comp.**23**(1969), 413–415. MR**245507**, DOI 10.1090/S0025-5718-1969-0245507-6 - Hans Riesel,
*Common prime factors of the numbers $A_{n}=a^{2^{n}}+1$*, Nordisk Tidskr. Informationsbehandling (BIT)**9**(1969), 264–269. MR**258735**, DOI 10.1007/bf01946818 - Hans Riesel and Anders Björn,
*Generalized Fermat numbers*, Mathematics of Computation 1943–1993: a half-century of computational mathematics (Vancouver, BC, 1993) Proc. Sympos. Appl. Math., vol. 48, Amer. Math. Soc., Providence, RI, 1994, pp. 583–587. MR**1314895**, DOI 10.1090/S0025-5718-05-01816-8 - H. Riesel,
*Summation of Double Series Using the Euler–MacLaurin Sum Formula,*BIT**36**(1996), 860–862.

## Additional Information

**Anders Björn**- Affiliation: Department of Mathematics, Linköping University, S-581 83 Linköping, Sweden
- Email: anbjo@mai.liu.se
**Hans Riesel**- Affiliation: Department of Numerical Analysis and Computing Science, Royal Institute of Technology, S-100 44 Stockholm, Sweden
- Email: riesel@nada.kth.se
- Received by editor(s): May 6, 1996
- Received by editor(s) in revised form: September 19, 1996
- © Copyright 1998 American Mathematical Society
- Journal: Math. Comp.
**67**(1998), 441-446 - MSC (1991): Primary 11-04, 11A51, 11Y05, 11Y11
- DOI: https://doi.org/10.1090/S0025-5718-98-00891-6
- MathSciNet review: 1433262