zbMATH — the first resource for mathematics

Polynomials taking prime values. (Polynômes prenant des valeurs premières.) (French) Zbl 1005.11042
Summary: We describe two heuristic probabilistic models that give the number \(k\) of prime values of quadratic polynomials on an interval of \(n\) consecutive values of the variable. The first model is devoted to the case \(k=n\) and reveals a “Schinzel barrier” of size \(n^n\): below this barrier, the event “\(n\) prime values for \(n\) consecutive values of the variable” is statistically exceptional, and above, it is statistically frequent provided that there is no arithmetic obstruction. The second model is devoted to the case \(k<n\) and is based on a binomial law with a probability deriving from the Hardy-Littlewood constant. For both models, numerical experiments show a satisfactory similarity. This work is illustrated with a list of the best polynomials found for \(n< 40338\). We also give some numerical results for polynomials of degree 3, 4 and 5.
11N32 Primes represented by polynomials; other multiplicative structures of polynomial values
11Y35 Analytic computations
Full Text: DOI EuDML
[1] Bateman P. T., Math. Comp. 16 pp 363– (1962) · doi:10.1090/S0025-5718-1962-0148632-7
[2] Boston N., Amer. Math. Monthly 102 pp 595– (1995) · Zbl 0843.11044 · doi:10.2307/2974555
[3] Fung G. W., Math. Comp. 55 (191) pp 345– (1990) · doi:10.1090/S0025-5718-1990-1023759-3
[4] Goetgheluck P., Elem. Math. 44 pp 70– (1989)
[5] Hardy G. H., Acta Math. 44 (1923)
[6] Lukes R. F., Nieuw Arch. Wisk. (4) 13 pp 113– (1995)
[7] Mollin R. A., Quadratics (1996) · Zbl 0858.11001
[8] Mollin R. A., Number theory and cryptography (Sydney, 1989) pp 177– (1990) · doi:10.1017/CBO9781107325838.017
[9] Rabinowitch, G. ”Eindeutgkeit der Zerlegung in Primzahlfaktoren in quadratischen Zahlkörpen”. Proc. Fifth Inter. Congress Math.). 1912, Cambridge. Edited by: Hobson, E. W. and Love, A. E. H. vol. 1, pp.418–421. Cambridge Univ. Press. [Rabinowitch 1913]
[10] Ribenboim P., The new book of prime number records (1996) · Zbl 0856.11001 · doi:10.1007/978-1-4612-0759-7
[11] Schinzel A., Acta Arith. (1961)
[12] Schinzel A., Acta Arith. pp 185– (1958)
[13] Stephens A. J., Number theory and cryptography (Sydney, 1989) (1990)
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.