28 October 2022

• curprev 18:4718:47, 28 October 2022 Mathbrek talk contribs m 4,556 bytes +11 →Solution 2

17 November 2013

• curprev 02:2602:26, 17 November 2013 Talkinaway talk contribs 4,545 bytes +1,375 Solution 2

5 July 2013

• curprev 13:3013:30, 5 July 2013 Nathan wailes talk contribs 3,170 bytes +15 No edit summary

7 January 2009

• curprev 09:5609:56, 7 January 2009 Misof talk contribs 3,155 bytes +3,155 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...