← Complete problem index

PROJECT EULER · #0303

Multiples with Small Digits

Statement only · SolvedOriginal problem ↗

For a positive integer n, define f(n) as the least positive multiple of n that, written in base 10, uses only digits 2.

Thus f(2)=2, f(3)=12, f(7)=21, f(42)=210, f(89)=1121222.

Also, n=1100f(n)n=11363107.

Find n=110000f(n)n.

Write-up coming later

The complete problem is available here. An approach, code, and answer will be added later.