← Complete problem index

PROJECT EULER · #0383

Divisibility Comparison Between Factorials

Statement only · UnsolvedOriginal problem ↗

Let f5(n) be the largest integer x for which 5x divides n.
For example, f5(625000)=7.

Let T5(n) be the number of integers i which satisfy f5((2i1)!)<2f5(i!) and 1in.
It can be verified that T5(103)=68 and T5(109)=2408210.

Find T5(1018).

Write-up coming later

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