TOPICS
Search

Good Prime


A good prime is a prime p_n with n>=2 such that

 p_n^2>p_(n-i)p_(n+i)

for all integers i with 1<=i<=n-1, where p_n is the nth prime (there is a typo in Guy 1994 in which the is are replaced by 1s). There are infinitely many good primes (Pomerance 1979, pp. 399-400). The first few are 5, 11, 17, 29, 37, 41, 53, ... (OEIS A028388).


See also

Andrica's Conjecture, Landau's Problems, Pólya Conjecture

Explore with Wolfram|Alpha

References

Guy, R. K. "'Good' Primes and the Prime Number Graph." §A14 in Unsolved Problems in Number Theory, 2nd ed. New York: Springer-Verlag, pp. 32-33, 1994.Pomerance, C. "The Prime Number Graph." Math. Comput. 33, 399-408, 1979. https://doi.org/10.1090/S0025-5718-1979-0514836-7.Sloane, N. J. A. Sequence A028388 in "The On-Line Encyclopedia of Integer Sequences."

Referenced on Wolfram|Alpha

Good Prime

Cite this as:

Weisstein, Eric W. "Good Prime." From MathWorld--A Wolfram Resource. https://mathworld.wolfram.com/GoodPrime.html

Subject classifications