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 Solvers18
Suggested Problems
-
Find the peak 3n+1 sequence value
2573 Solvers
-
Replace NaNs with the number that appears to its left in the row.
3073 Solvers
-
Split a string into chunks of specified length
2157 Solvers
-
Circular Primes (based on Project Euler, problem 35)
658 Solvers
-
(Linear) Recurrence Equations - Generalised Fibonacci-like sequences
428 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.