Revision history of "2000 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) 15:18, 13 December 2023Tomasdiaz (talk | contribs). . (493 bytes) (+493). . (Created page with "== Problem == A convex hexagon is called "''pretty''" if it has four diagonals of length 1, whose ends include all the vertices of the hexagon. 1. Given any number <math>k</m...")