Aw drat. I was going to submit the n'th prime problem until I saw this.
Sadly, I see there are too few test cases, and the problem is too easy to cook.
why 'nthprime' not allowed?
Another great problem!
This solution doesn't use any of the built-in MATLAB functions primes() or isprime(). It works for all integers N > 0, and requires only (N^0.75) iterations.
I do not know how the size are computed. Would someone please tell me?. Thanks in advance.
See https://au.mathworks.com/matlabcentral/about/cody/#solve_problems for basic concept. The best way to figure out the details is from experience — just try different alternatives.
Project Euler: Problem 8, Find largest product in a large string of numbers
315 Solvers
Implement simple rotation cypher
943 Solvers
420 Solvers
Relative ratio of "1" in binary number
393 Solvers
Solving Quadratic Equations (Version 1)
427 Solvers
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!