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 Solvers17
Suggested Problems
-
Project Euler: Problem 16, Sums of Digits of Powers of Two
178 Solvers
-
13216 Solvers
-
305 Solvers
-
354 Solvers
-
(Linear) Recurrence Equations - Generalised Fibonacci-like sequences
409 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)