Problem 53965. Easy Sequences 67: Project Euler Problem 1 - Not Again!!!

Created by Ramon Villamangca

Difficulty:Rate

Solve Later
Add To GroupÃ‚

You know the drill...
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:
            .

Solve

Solution Stats

11 Solutions
2 Solvers

Last Solution submitted on Jun 14, 2025

Last 200 Solutions

Problem Comments

2 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 comments

Problem Recent Solvers2

Problem Tags

Community Treasure Hunt

Find the treasures in MATLAB Central and discover how the community can help you!

Start Hunting!

Problem 53965. Easy Sequences 67: Project Euler Problem 1 - Not Again!!!

Solution Stats

Last 200 Solutions

Problem Comments

Solution Comments

Problem Recent Solvers2

Suggested Problems

More from this Author116

Problem Tags

Community Treasure Hunt

Problem 53965. Easy Sequences 67: Project Euler Problem 1 - Not Again!!!

Solution Stats

Last 200 Solutions

Problem Comments

Solution Comments

Problem Recent Solvers2

Suggested Problems

More from this Author116

Problem Tags

Community Treasure Hunt

Players