# Euler Problem 5: Smallest Multiple

[This article was first published on

Want to share your content on R-bloggers? click here if you have a blog, or here if you don't.

**The Devil is in the Data**, and kindly contributed to R-bloggers]. (You can report issue about the content on this page here)Want to share your content on R-bloggers? click here if you have a blog, or here if you don't.

Euler Problem 5 relates to the divisibility of numbers.

## Euler Problem 5

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?

## Solution

The solution will also be divisible by the number 1 to 10 so we can start at 2520 and increment by 2520. The loop checks whether the number is divisible by the numbers 1 to 20.

# Start as high as possible i <- 2520 # Check consecutive numbers for divisibility by 1:20 while (sum(i%%(1:20)) != 0) { i <- i + 2520 # Increase by smallest number divisible by 1:10 } answer <- i

The post Euler Problem 5: Smallest Multiple appeared first on The Devil is in the Data.

To

**leave a comment**for the author, please follow the link and comment on their blog:**The Devil is in the Data**.R-bloggers.com offers

**daily e-mail updates**about R news and tutorials about learning R and many other topics. Click here if you're looking to post or find an R/data-science job.

Want to share your content on R-bloggers? click here if you have a blog, or here if you don't.