论文信息 - Distribution of generalized Fermat prime numbers

Distribution of generalized Fermat prime numbers

Numbers of the form Fb,n = b2n ±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 2m - 1. The theoretical distributions of GFN primes, for fixed 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 Sierpinski. A list of the current largest known GFN primes is included.

Harvey Dubner | Yves Gallot | H. Dubner | Y. Gallot

[1] Janusz Zalewski,et al. Topics in advanced scientific computation , 1996, IEEE Parallel & Distributed Technology: Systems & Applications.

[2] B. Fagin,et al. Discrete weighted transforms and large-integer arithmetic , 1994 .

[3] Wilfrid Joseph Dixon,et al. Introduction to statistical analysis, 2nd ed. , 1957 .

[4] P. Ribenboim. The new book of prime number records , 1996 .

[5] Anders Björn,et al. Factors of generalized Fermat numbers , 1998, Math. Comput..

[6] Daniel Shanks,et al. On the conjecture of Hardy & Littlewood concerning the number of primes of the form ²+ , 1960 .

[7] Daniel Shanks. On numbers of the form $n^{4}+1$ , 1961 .

[8] Richard E. Crandall,et al. Projects in scientific computation , 1994 .

[9] W. Sierpinski,et al. Sur certaines hypothèses concernant les nombres premiers , 1958 .

[10] R. Horn,et al. A heuristic asymptotic formula concerning the distribution of prime numbers , 1962 .

[11] E. T.. An Introduction to the Theory of Numbers , 1946, Nature.