1 min to read

# Smallest multiple | Project Euler Solution

## Smallest multiple

Smallest multiple - The Number is divisible by all the numbers from 1 to n, where n is the given number. In this post, we are going to solve Project Euler “Smallest multiple” programming problem.

### Problem Statement:

2520 is the smallest number that can be divided by each of the numbers from 1 to 10 without any remainder.

What is the smallest positive number that is evenly divisible by all of the numbers from 1 to 20?

You can find the original question here -> Project Euler

### Smallest multiple - Project Euler Solution in python

Share Your Solutions for smallest multiple