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

• Created by Ramon Villamangca
• Appears in Paper-&-pencil Games

×

Like (2)

Difficulty:

(35)

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

27.27% Correct | 72.73% Incorrect

• 11 Solutions
• 2 Solvers

Last Solution submitted on Apr 01, 2025

Last 200 Solutions

Solution Comments

ANNOUNCEMENT ×

Registration Now Open for MathWorks AUTOMOTIVE CONFERENCE 2025

Hello Community, We're excited to announce that registration is now open for the...

Problem Recent Solvers2

Suggested Problems

• Back to basics 5 - Clipboard

  346 Solvers

• Back to basics 22 - Rotate a matrix

  916 Solvers

• Replicate elements in vectors

  1172 Solvers

• Find maximum value of a curve

  111 Solvers

• Matrix of almost all zeros, except for main diagonal

  184 Solvers

More from this Author116

• Easy Sequences 108: Enclosing a Circle with Primitive Pythagorean Triangles

  1 Solvers

• Easy Sequences 97: One-line Code Challenge - Sequence with Constant Difference

  1 Solvers

• Easy Sequences 24: Number of Coprime Lattice Points

  7 Solvers

• Easy Sequences 13: Average Speed of Spaceship

  14 Solvers

• Easy Sequences 41: Boxes with Integer Edges

  5 Solvers