Project Euler 5 Mystery Cache

Acknowledgements

This cache was inspired by Project Euler.

General notes

• To solve Project Euler puzzles, you will probably have to write a computer program.
• Many of the containers are small, and contain neither pen nor pencil.
• There are explicit finding notes in each geochecker.

The puzzle

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

Define f_i(n) to be the first i digits of the smallest number that can be divided by each of the numbers from 1 to n without any remainder.

For example, f₃(10) = 252.

To find this cache, first calculate:

• f₂(125),
• f₂(64),
• f₃(1370),
• 0,
• f₁(81),
• f₃(4158).