Project Euler 24 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.

Lexicographic permutations

A permutation is an ordered arrangement of objects. For example, 3124 is one possible permutation of the digits 1, 2, 3 and 4. If all of the permutations are listed numerically or alphabetically, we call it lexicographic order. The lexicographic permutations of 0, 1 and 2 are:

The Puzzle

Consider now the lexicographic permutations of the digits 0, 1, 2, 3, 4, 5, 6, 7, 8, and 9. The 1,000^th permutation is 0124658793.

To find this geocache, first find the 411,258^th lexicographic permutation.