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 Solvers18
Suggested Problems
-
Find the longest sequence of 1's in a binary sequence.
6847 Solvers
-
1251 Solvers
-
Renaming a field in a structure array
1581 Solvers
-
631 Solvers
-
Create a square matrix of multiples
502 Solvers
More from this Author329
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.