Revision history of "2019 OIM Problems/Problem 1"

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:00, 14 December 2023Tomasdiaz (talk | contribs). . (397 bytes) (+397). . (Created page with "== Problem == For each positive integer <math>n</math>, let <math>s(n)</math> be the sum of the squares of the digits of <math>n</math>. For example, <math>s(15) = 1^2 + 5^2 =...")