The mth prime
is classified as “good” if
for
. For example, 5 is a good prime because
is greater than
and
, but 7 is not because
.
Write a function to list the first n good primes.
Solution Stats
Problem Comments
4 Comments
Solution Comments
Show comments
Loading...
Problem Recent Solvers20
Suggested Problems
-
The Goldbach Conjecture, Part 2
2421 Solvers
-
Solve the set of simultaneous linear equations
513 Solvers
-
I've got the power! (Inspired by Project Euler problem 29)
151 Solvers
-
93 Solvers
-
351 Solvers
More from this Author330
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!
In the description, k>=1
Thanks--fixed.
Why is 2 not a good prime? With m = 1, it trivially holds that p_m^2 > p_{m-k} p_{m+k} for all 1 \le k \le m-1 since this is in fact an empty statement then.
It's not included in the lists I've seen probably because there is no zeroth prime.