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...
Make a vector of prime numbers
find the roots of a quadratic equation
GJam 2014 China Rd A: Rational Number Tree (Large Values)
Primes Faster for Large N
GJam 2017 Kickstart: Vote (Large)
String Find with Wildcards of a Cell array
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