We are all familiar with Project Euler Problem 1. This time let's try it on bigger multiples and larger range.
Find the sum of all the multiples of the first input or the second input for all positive integers below the third input.
Solution Stats
Problem Comments
1 Comment
Solution Comments
Show comments
Loading...
Problem Recent Solvers14
Suggested Problems
-
Find the longest sequence of 1's in a binary sequence.
6685 Solvers
-
988 Solvers
-
537 Solvers
-
518 Solvers
-
Mersenne Primes vs. All Primes
844 Solvers
More from this Author116
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!
It's not exactly Euler Problem 1 since we need to calculate the lcm between the two numbers, but it's ok.