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).
Project Euler: Problem 7, Nth prime
Is A the inverse of B?
Replace Vector Elements
Convert a Cell Array into an Array
Array of Ones
Chess ELO rating system
Find files with extension ext in the current directory
Find my secret number
Recycled Numbers (CodeJam Qualification Round 2012)
Pandigital number n°3 (Inspired by Project Euler 32)
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