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.
Return the 3n+1 sequence for n
Project Euler: Problem 3, Largest prime factor
Return the Fibonacci Sequence
Generate a vector like 1,2,2,3,3,3,4,4,4,4
Number of digits in an integer
Find perfect placement of non-rotating dominoes (easier)
Is this is a Tic Tac Toe X Win?
Poker Series 06: isThreeKind
Implement simple rotation cypher
Poker Series 01: isStraightFlush
Choose a web site to get translated content where available and see local events and offers. Based on your location, we recommend that you select: .
You can also select a web site from the following list:
Select the China site (in Chinese or English) for best site performance. Other MathWorks country sites are not optimized for visits from your location.
Contact your local office