Be careful, I've implemented the sieve, but not all versions of it are sufficiently fast to handle the biggest numbers in the test suite.
This doesn't use primes(x),but still feels a little like cheating.
The whole point of using the sieve is not knowing which numbers are prime. So it is no different than sum(primes).
Circular Primes (based on Project Euler, problem 35)
Generate a NaN...on purpose
MATLAB Basic: rounding III
Two functions (to be sure)
Rank of magic square (for beginners)
Decrypt the cypher using XOR encryption (for beginners)
BLOCK x3 (Version 1)
Divisors for big integer
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