Your function will be given lower and upper integer bounds. Your task is to return a vector containing the first five prime numbers in that range that contain the number five. But, if you can't find at least five such numbers, the function should give up and return -1.
For example, for n_min = 60 and n_max = 1000, the set of prime numbers is:
p = [61,67,71,73,79, … 149,151,157,163, … 241,251,257,263, … 349,353,359,367, … 983,991,997]
This set contains at least five numbers that contain a five; the first five are:
p5 = [151,157,251,257,353]
which is the set that your function should return in this case. If, however, n_max were set at 300, five such numbers do not exist and the function should then give up (return -1).
Solution Stats
Problem Comments
2 Comments
Solution Comments
Show comments
Loading...
Problem Recent Solvers451
Suggested Problems
-
2361 Solvers
-
498 Solvers
-
501 Solvers
-
533 Solvers
-
Sums of Multiple Pairs of Triangular Numbers
245 Solvers
More from this Author139
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!
I wrote & timed a bunch of sieve type algorithms until I realized the problem was much simpler. Interesting problem.
For all of those having "server error", your code takes too much time on last test. Hint: you don't need to evaluate all numbers between n_min & n_max