Year: 2001
Type: article
Abstract: Numbers of the form F b , n = b 2 n + 1 F_{b,n}=b^{2^n}+1 are called Generalized Fermat Numbers (GFN). A computational method for testing the probable primality of a GFN is described which is as fast as testing a number of the form 2 m − 1 2^m-1 . The theoretical distributions of GFN primes, for fixed n n , are derived and compared to the actual distributions. The predictions are surprisingly accurate and can be used to support Bateman and Horn’s quantitative form of “Hypothesis H" of Schinzel and Sierpiński. A list of the current largest known GFN primes is included.
Source: Mathematics of Computation
Authors: Harvey Dubner, Yves Gallot
Language: English
Subfield: Algebra and Number Theory
Field: Mathematics
Domain: Physical Sciences
Open Access status: bronze
OpenAlex ID: W2015779408