Revision history of "1998 AHSME Problems/Problem 25"

From AoPSWiki

Browse history

From year (and earlier): From month (and earlier): all January February March April May June July August September October November December 

(Latest | Earliest) View (newer 50) (older 50) (20 | 50 | 100 | 250 | 500)

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

• (cur) (prev) 14:56, 7 January 2009 Misof (Talk | contribs) (3,155 bytes) (New page: == Problem == A piece of graph paper is folded once so that <math>(0,2)</math> is matched with <math>(4,0)</math>, and <math>(7,3)</math> is matched with <math>(m,n)</math>. Find <math>m+n...)

(Latest | Earliest) View (newer 50) (older 50) (20 | 50 | 100 | 250 | 500)