Problem 53965. Easy Sequences 67: Project Euler Problem 1 - Not Again!!!
Given two integers x and n, with
, find the sum of all positive integers below x, that are multiples of any of the integers from 2 up to n.
For example, for
and
, the sum of the multiples of 2, 3, 4 or 5 is:
Solution Stats
Problem Comments
-
2 Comments
Ramon Villamangca
on 27 Jan 2022
Hi David,
I avoided exceeding 'flintmax', minimized multiplication, division and conditional statements. For small n's, like in test 7, | only used a simple sieving algorithm. I also checked my solution with Elixir, and Java and I still get the same result for test 7.
David Hill
on 27 Jan 2022
I initially did a sieving algorithm, but it was not efficient enough for large n. I did not consider splitting with two different algorithms.
Solution Comments
Show commentsProblem Recent Solvers2
Suggested Problems
-
28 Solvers
-
Determine Whether an array is empty
768 Solvers
-
Find a subset that divides the vector into equal halves
386 Solvers
-
Matrix with different incremental runs
487 Solvers
-
We love vectorized solutions. Problem 1 : remove the row average.
810 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!