olymmath

DK-GEORGMOHR 2001 Problem 2

    If there is a natural number nn such that the number n!n! has exactly 1111 zeros at the end? (With n!n! is denoted the number 1⋅2⋅3⋅...(n−)1⋅n1\cdot 2\cdot 3 \cdot ... (n - )1 \cdot n ).

    Dataset text AI-MO AoPS. Quoted with source.

    Official text: Georg Mohr Contest 2001 official paper, page 1.

    Solutions

    No solution is on olymmath yet. Official and human solutions come first when they arrive. AI solutions come after them, with a label.

    Add a solution

    Similar problems

    These problems have the most words in common with this statement.

    Locator dk-georgmohr/2001/p2 · Tag MJZNATTPS5 · Edit this page on GitHub · Keys: j next, k previous