Write a function that outputs the
th prime after a given number n. For example, the
th prime after
is
.
NOTE: If n itself is prime start counting from the next prime greater than n.
Solution Stats
Problem Comments
3 Comments
Solution Comments
Show comments
Loading...
Problem Recent Solvers19
Suggested Problems
-
116847 Solvers
-
Project Euler: Problem 10, Sum of Primes
2129 Solvers
-
Project Euler: Problem 16, Sums of Digits of Powers of Two
186 Solvers
-
Sum of big primes without primes
246 Solvers
-
13071 Solvers
More from this Author116
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!
Anything but an easy problem.
I guess that Matlab gives some people the wrong impression that everything is easy.
And Java, apparently. (tip)