|
Generalized Fermat |
Why is the exponent a power of two? Because if m is an odd divisor of n, then bn/m+1 divides bn+1, so for the latter to be prime, m must be one. Because the exponent is a power of two, it seems reasonable to conjecture that the number of Generalized Fermat primes is finite for every fixed b.
rank prime digits who when comment 1 24518262144+1 1150678 g413 Mar 2008 Generalized Fermat 2 1372930131072+1 804474 g236 Sep 2003 Generalized Fermat 3 1361244131072+1 803988 g236 Jul 2004 Generalized Fermat 4 1176694131072+1 795695 g236 Aug 2003 Generalized Fermat 5 572186131072+1 754652 g0 Jan 2004 Generalized Fermat 6 130816131072+1 670651 g308 Jul 2003 Generalized Fermat 7 62722131072+1 628808 g308 Feb 2003 Generalized Fermat 8 81 · 21606848+1 483712 gt Mar 2007 Generalized Fermat 9 1950221265536+1 477763 p160 Jan 2005 Generalized Fermat 10 1768482865536+1 474979 g410 Aug 2007 Generalized Fermat 11 1765544465536+1 474932 g410 Aug 2007 Generalized Fermat 12 1762939865536+1 474890 g410 Aug 2007 Generalized Fermat 13 217703865536+1 415359 g260 Nov 2008 Generalized Fermat 14 216206865536+1 415162 g260 Jul 2008 Generalized Fermat 15 187451265536+1 411101 g413 Jun 2008 Generalized Fermat 16 182850265536+1 410393 GF2 Mar 2005 Generalized Fermat 17 154055065536+1 405516 GF2 May 2003 Generalized Fermat 18 148307665536+1 404434 GF2 Jan 2003 Generalized Fermat 19 147803665536+1 404337 GF2 Oct 2002 Generalized Fermat 20 137403865536+1 402260 GF3 May 2003 Generalized Fermat
- BR98
- A. Björn and H. Riesel, "Factors of generalized Fermat numbers," Math. Comp., 67 (1998) 441--446. MR 98e:11008 (Abstract available)
- DK95
- H. Dubner and W. Keller, "Factors of generalized Fermat numbers," Math. Comp., 64 (1995) 397--405. MR 95c:11010
- Dubner86
- H. Dubner, "Generalized Fermat primes," J. Recreational Math., 18 (1985-86) 279--280. MR 2002j:11156
- Morimoto86
- M. Morimoto, "On prime numbers of Fermat types," Sûgaku, 38:4 (1986) 350--354. Japanese. MR 88h:11007
- RB94
- H. Riesel and A. Börn, Generalized Fermat numbers. In "Mathematics of Computation 1943-1993: A Half-Century of Computational Mathematics," W. Gautschi editor, Proc. Symp. Appl. Math. volume 48, Amer. Math. Soc., Providence, RI, pp. 583-587, 1994. MR 95j:11006
- Riesel69
- H. Riesel, "Some factors of the numbers Gn = 62n + 1 and Hn = 102n + 1," Math. Comp., 23:106 (1969) 413--415. MR 39:6813
- Riesel69b
- H. Riesel, "Common prime factors of the numbers An =a2n+1," BIT, 9 (1969) 264-269. MR 41:3381