A good prime is a prime number whose square is greater than the product of any two primes at the same number of positions before and after it in the sequence of primes.

That is, good prime satisfies the inequality

${\displaystyle p_{n}^{2}>p_{n-i}\cdot p_{n+i))$

for all 1 ≤ in−1, where pk is the kth prime.

Example: the first primes are 2, 3, 5, 7 and 11. Since for 5 both the conditions

${\displaystyle 5^{2}>3\cdot 7}$
${\displaystyle 5^{2}>2\cdot 11}$

are fulfilled, 5 is a good prime.

There are infinitely many good primes.[1] The first few good primes are

5, 11, 17, 29, 37, 41, 53, 59, 67, 71, 79, 97, 101, 107, 127, 137, 149 (sequence A046869 in the OEIS).

## References

1. ^ Weisstein, Eric W. "Good Prime". MathWorld.