Geodesic
The smallest Prime Value of xn + a
Canadian journal of mathematics, Tome 38 (1986) no. 4, pp. 925-936

Voir la notice de l'article provenant de la source Cambridge University Press

Let a and n be positive integers such that f(x) = xn + a is irreducible over the integers. A conjecture made by Bouniakowsky [4] in 1857 would imply that there exist infinitely many integers x such that f(x) is prime. An even stronger conjecture of Bateman and Horn [1, 2] would imply that where π(x;f) is the number of integers m with 0 ≧ m ≧ x for which f(m) is prime, and where w(p) is the number of solutions of the congruence Except for the trivial case n = 1, neither of these conjectures has ever been resolved. 
McCurley, Kevin S. The smallest Prime Value of xn + a. Canadian journal of mathematics, Tome 38 (1986) no. 4, pp. 925-936. doi: 10.4153/CJM-1986-045-9
@article{10_4153_CJM_1986_045_9,
     author = {McCurley, Kevin S.},
     title = {The smallest {Prime} {Value} of xn + a},
     journal = {Canadian journal of mathematics},
     pages = {925--936},
     year = {1986},
     volume = {38},
     number = {4},
     doi = {10.4153/CJM-1986-045-9},
     url = {http://geodesic.mathdoc.fr/articles/10.4153/CJM-1986-045-9/}
}
TY  - JOUR
AU  - McCurley, Kevin S.
TI  - The smallest Prime Value of xn + a
JO  - Canadian journal of mathematics
PY  - 1986
SP  - 925
EP  - 936
VL  - 38
IS  - 4
UR  - http://geodesic.mathdoc.fr/articles/10.4153/CJM-1986-045-9/
DO  - 10.4153/CJM-1986-045-9
ID  - 10_4153_CJM_1986_045_9
ER  - 
%0 Journal Article
%A McCurley, Kevin S.
%T The smallest Prime Value of xn + a
%J Canadian journal of mathematics
%D 1986
%P 925-936
%V 38
%N 4
%U http://geodesic.mathdoc.fr/articles/10.4153/CJM-1986-045-9/
%R 10.4153/CJM-1986-045-9
%F 10_4153_CJM_1986_045_9

[1] 1. Bateman, P. and Horn, R., A heuristic asymptotic formula concerning the distribution of prime numbers, Math. Comp. 16 (1962), 363–367. Google Scholar

[2] 2. Bateman, P. and Horn, R., Primes represented by polynomials in one variable, Proc. Symp. Pure Math. 8 (1965), 119–135. Google Scholar

[3] 3. Bombieri, E., Le grand crible dans la théorie analytique des nombres. Avec une sommaire en anglais, Astérisque 18 (Société Mathématiques de France, Paris, 1974). Google Scholar

[4] 4. Bouniakowsky, V., Sur les diviseurs numériques invariables des fonctions rationelles entières, Mem. Acad. Sci. St. Petersburg 6 (1857), 305–329. Google Scholar

[5] 5. Brillhart, J., Note on irreducibility testing, Math. Comp. 35 (1980), 1379–1381. Google Scholar

[6] 6. de Bruijn, N. G., On the number of positive integers ≦ x and free of prime factors > y, Nederl. Akad. Wetensch. Proc. Ser. A 54 (1951), 50–60. Google Scholar

[7] 7. LeVeque, W. J., Fundamentals of number theory (Addison-Wesley, Reading, MA, 1977). Google Scholar

[8] 8. McCurley, K. S., Prime values of polynomials and irreducibility testing, Bull. Amer. Math. Soc. (N.S.) 77 (1984), 155–158. Google Scholar

[9] 9. Norton, K. K., On the number of restricted prime factors of an integer I, Illinois J. Math. 20 (1976), 681–705. Google Scholar

[10] 10. Rankin, R. A., The difference between consecutive prime numbers V, Proc. Edinburgh Math. Soc. (2) 13 (1962/63), 331–332. Google Scholar

Cité par Sources :