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 8, Find largest product in a large string of numbers
Clock Hand Angle 1
What is the distance from point P(x,y) to the line Ax + By + C = 0?
Is it an Armstrong number?
Sum of series V
BLOCK x3 (Version 3)
Generalised Hamming Number
Chess ELO rating system
BLOCK x3 (Version 1)
Clear all empty variables from the workspace
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