28 November 2014

• curprev 22:1822:18, 28 November 2014 HYP135peppers talk contribs m 4,105 bytes +1 →Solution

19 July 2014

• curprev 16:1416:14, 19 July 2014 5849206328x talk contribs m 4,104 bytes +26 →Solution
• curprev 16:1116:11, 19 July 2014 5849206328x talk contribs 4,078 bytes +3,642 →Solution

18 July 2014

• curprev 12:5812:58, 18 July 2014 5849206328x talk contribs m 436 bytes +19 →Problem

4 July 2013

• curprev 12:4012:40, 4 July 2013 Nathan wailes talk contribs 417 bytes +15 No edit summary

8 April 2013

• curprev 13:5113:51, 8 April 2013 Yrushi talk contribs m 402 bytes +12 No edit summary

23 February 2012

• curprev 18:4618:46, 23 February 2012 Kubluck talk contribs 390 bytes +144 →Problem
• curprev 18:4518:45, 23 February 2012 Kubluck talk contribs 246 bytes +11 No edit summary
• curprev 18:4518:45, 23 February 2012 Kubluck talk contribs 235 bytes +235 Created page with "==Problem== For what values of <math>k > 0 </math> is it possible to dissect a <math> 1 \times k </math> rectangle into two similar, but incongruent, polygons? ==Solution== ==..."