Currently there may be errors shown on top of a page, because of a missing Wiki update (PHP version and extension DPL3). |
Navigation
Topics | Help • Register • News • History • How to • Sequences statistics • Template prototypes |
Difference between revisions of "Generalized Fermat number"
(navbox) |
(update link to Factors of generalized Fermat numbers found after Björn & Riesel) |
||
Line 28: | Line 28: | ||
*[[Wikipedia:Fermat_number#Generalized_Fermat_numbers|Generalized Fermat numbers]] | *[[Wikipedia:Fermat_number#Generalized_Fermat_numbers|Generalized Fermat numbers]] | ||
*[http://www.alpertron.com.ar/MODFERM.HTM Factorization of numbers of the form F<sub>n,2</sub>]: it includes a program to factor generalized Fermat numbers. | *[http://www.alpertron.com.ar/MODFERM.HTM Factorization of numbers of the form F<sub>n,2</sub>]: it includes a program to factor generalized Fermat numbers. | ||
− | * | + | *[http://prothsearch.com/GFNfacs.html Factors of generalized Fermat numbers found after Björn & Riesel] |
*[http://members.cox.net/jfoug/GFNFacts_Riesel.html Factors of generalized Fermat numbers found after Björn & Riesel (original)] | *[http://members.cox.net/jfoug/GFNFacts_Riesel.html Factors of generalized Fermat numbers found after Björn & Riesel (original)] | ||
*[http://mathworld.wolfram.com/GeneralizedFermatNumber.html MathWorld article] | *[http://mathworld.wolfram.com/GeneralizedFermatNumber.html MathWorld article] |
Revision as of 21:54, 9 August 2021
There are different kinds of generalized Fermat numbers.
John Cosgrave
John Cosgrave has studied the following numbers:
Numbers of the form:
generates the Mersenne numbers. generates the Fermat numbers. generates the Saouter numbers.
Cosgrave has proven the following properties:
- If number
is prime, then . numbers are pairwise relatively prime within a rank and across ranks: for all n, m, i and j.- They satisfy a product property like Fermat numbers have. And every
passes Fermat's test to base 2.
Saouter has proven that
Dubner
In 1985, Dubner for the first time built a list of large primes of the form: b2m+1, b ≥ 2 and m ≥ 1.
See also: H.Dubner, W.Keller: "Factors of generalized Fermat numbers" (1995)[1]
Björn & Riesel
In 1998, Björn & Riesel[2] for the first time built a list of large primes of the form: a2m+b2m, b > a ≥ 2 and m ≥ 1.
External links
- Generalized Fermat numbers
- Factorization of numbers of the form Fn,2: it includes a program to factor generalized Fermat numbers.
- Factors of generalized Fermat numbers found after Björn & Riesel
- Factors of generalized Fermat numbers found after Björn & Riesel (original)
- MathWorld article
- Generalized Fermat Prime Search
- List of generalized Fermat primes in bases up to 1000
- List of generalized Fermat primes in bases up to 1030
References
- Jump up ↑ H.Dubner, W.Keller: "Factors of generalized Fermat numbers" Math. Comp. 64 (1995), 397-405
- Jump up ↑ A.Björn, H.Riesel: "Factors of generalized Fermat numbers", Math. Comp. 67 (1998), pp. 441-446
Generalized Fermat numbers
Miscellaneous |
Fermat numbers |
|
Gen. Fermat primes |
Gen. Fermat primes |
Gen. Fermat primes categories |
GF Divisors |