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.
While evaluating the solution, the server encountered an error caused by long running MATLAB code. Edit the code if needed and then submit.
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).
Arrange Vector in descending order
Project Euler: Problem 10, Sum of Primes
Create a square matrix of multiples
CONVERT TAN TO SIN
Find last zero for each column
Divisors for big integer
Without the French accent please!
Pandigital number n°2 (Inspired by Project Euler 32)
Find my secret number
Find the path through the cell
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