Revision history of "2023 SSMO Speed Round Problems/Problem 4"

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:20, 3 July 2023Pinkpig (talk | contribs). . (1,336 bytes) (+1,336). . (Created page with "==Problem== Let <math>F_1 = F_2 = 1</math> and <math>F_n = F_{n-1} + F_{n-2}</math> for all <math>n\geq 2</math> be the Fibonacci numbers. If distinct positive integers <math>...")