OBM 1991 Problem 4

Show that there exists $n>2$ such that $1991 | 1999 \ldots 91$ (with $n$ 9's).

Dataset text AI-MO AoPS. Quoted with source.

Solutions

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

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

Locator br-obm/1991/p4 · Tag 7P4T39V381 · Edit this page on GitHub · Keys: j next, k previous