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).
Given an unsigned integer x, find the largest y by rearranging the bits in x
Swap the input arguments
Longest run of consecutive numbers
Matrix with different incremental runs
BLOCK x3 (Version 4)
Pandigital number n°1 (Inspired by Project Euler 32)
Without the French accent please!
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