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 Solvers17
Suggested Problems
-
432 Solvers
-
185 Solvers
-
Return fibonacci sequence do not use loop and condition
854 Solvers
-
Write c^3 as sum of two squares a^2+b^2
328 Solvers
-
378 Solvers
More from this Author322
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.