Distribution of generalized Fermat prime numbers

Harvey Dubner, Yves Gallot

Mathematics of Computation · 2001 · 18 citations · 13 references

DOIFull text

Open access

Concepts

Abstract

Numbers of the form <inline-formula content-type="math/mathml"> <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" alttext="upper F Subscript b comma n Baseline equals b Superscript 2 Super Superscript n Baseline plus 1"> <mml:semantics> <mml:mrow> <mml:msub> <mml:mi>F</mml:mi> <mml:mrow class="MJX-TeXAtom-ORD"> <mml:mi>b</mml:mi> <mml:mo>,</mml:mo> <mml:mi>n</mml:mi> </mml:mrow> </mml:msub> <mml:mo>=</mml:mo> <mml:msup> <mml:mi>b</mml:mi> <mml:mrow class="MJX-TeXAtom-ORD"> <mml:msup> <mml:mn>2</mml:mn> <mml:mi>n</mml:mi> </mml:msup> </mml:mrow> </mml:msup> <mml:mo>+</mml:mo> <mml:mn>1</mml:mn> </mml:mrow> <mml:annotation encoding="application/x-tex">F_{b,n}=b^{2^n}+1</mml:annotation> </mml:semantics> </mml:math> </inline-formula> 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 <inline-formula content-type="math/mathml"> <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" alttext="2 Superscript m Baseline minus 1"> <mml:semantics> <mml:mrow> <mml:msup> <mml:mn>2</mml:mn> <mml:mi>m</mml:mi> </mml:msup> <mml:mo> − </mml:mo> <mml:mn>1</mml:mn> </mml:mrow> <mml:annotation encoding="application/x-tex">2^m-1</mml:annotation> </mml:semantics> </mml:math> </inline-formula> . The theoretical distributions of GFN primes, for fixed <inline-formula content-type="math/mathml"> <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" alttext="n"> <mml:semantics> <mml:mi>n</mml:mi> <mml:annotation encoding="application/x-tex">n</mml:annotation> </mml:semantics> </mml:math> </inline-formula> , 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.

References

13