Revision history of "2022 SSMO Tiebreaker Round Problems"

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) 21:01, 31 May 2023Pinkpig (talk | contribs). . (941 bytes) (+941). . (Created page with "==Problem 1== For all positive integers <math>n,</math> let <math>S(n)</math> denote the least positive integer <math>x</math> such that <math>n+x</math> is a palindrome. Fin...")