Revision history of "1994 OIM Problems/Problem 6"

Diff selection: Mark the radio boxes of the revisions to compare and hit enter or the button at the bottom.
Legend: (cur) = difference with latest revision, (prev) = difference with preceding revision, m = minor edit.

  • (cur | prev) 13:37, 13 December 2023Tomasdiaz (talk | contribs). . (646 bytes) (+646). . (Created page with "== Problem == Show that every natural number <math>n \le 2^{1,000,000}</math> can be obtained after 1 by doing less than 1,100,000 additions; more precisely, there is a finite...")