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).
Finding Perfect Squares
Alphabetize by last name
Remove the two elements next to NaN value
Equal to their cube
03 - Matrix Variables 4
Find my secret number
How many monitors are connected ?
Find indices of diagonal elements
Pandigital number n°3 (Inspired by Project Euler 32)
Return a list sorted by number of consecutive occurrences
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