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 Solvers17
Suggested Problems
-
Given an unsigned integer x, find the largest y by rearranging the bits in x
2075 Solvers
-
Unique values without using UNIQUE function
457 Solvers
-
Golomb's self-describing sequence (based on Euler 341)
191 Solvers
-
Count consecutive 0's in between values of 1
546 Solvers
-
1135 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.