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 
.
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
-
790 Solvers
-
Number of 1s in a binary string
10966 Solvers
-
Check if number exists in vector
13794 Solvers
-
generate number in particular way
116 Solvers
-
Sums of cubes and squares of sums
369 Solvers
More from this Author321
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.