
Glossary: Prime Pages: Top 5000: 
Any prime generalized Fermat number F_{b,n} = (with b an integer greater than one) is called a generalized Fermat prime (because they are
Fermat primes in the special case b=2).
Why is the exponent a power of two? Because if m is an odd divisor of n, then b^{n/m}+1 divides b^{n}+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 base b.
See Also: Fermats, Mersennes, Cullens Related pages (outside of this work)
References:
Chris K. Caldwell © 19992018 (all rights reserved)
