olymmath

Nemotron-IMO-Bench 2026 N42

    For every positive integer nn, let f(n)f(n), g(n)g(n) be the minimal positive integers such that 1+11!+12!+⋯+1n!=f(n)g(n).1+\frac{1}{1!}+\frac{1}{2!}+\dots +\frac{1}{n!}=\frac{f(n)}{g(n)}. Is there a positive integer nn for which g(n)>n0.999ng(n)>n^{0.999n}?

    Dataset text Nemotron-IMO-Bench. Open licence.

    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 nemotron-imo-bench/2026/n42 · Tag 3CCQT8DT54 · Edit this page on GitHub · Keys: j next, k previous