I have had some problems to get trough the test suite, one of them was that my primes where in UINT32 and that failed the 'isprime' assertion.
Maybe you could change the following line
Double implemented in test suite. Intent is to find the primes, not to get snared by errant function limitations.
Currently the MATLAB function primes is able to solve this problem. Since systems always evolve, the problem's author will probably have to be constantly updating it. Or at least, once a year.
Nice merger of primes with a customized sieving to set a new speed record on a limited memory system.
Sorry, but can't get code to run at all. So try to get some help this way...
Return the 3n+1 sequence for n
Back to basics 1 - Saving
Fill a zeros matrix
GJam March 2016 IOW: Clock Dance
Minimum Distance Point to Segment
Access a web hosted copy of the Tiles Contest MAT file
Solve Quadratic : No * - or key functions permitted
Mastermind II: Solve in 8 or less
Find the treasures in MATLAB Central and discover how the community can help you!
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