30 December 2017

• curprev 01:3001:30, 30 December 2017 Ccx09 talk contribs m 3,917 bytes −9 →Solution 3

5 August 2014

• curprev 22:3722:37, 5 August 2014 Suli talk contribs m 3,926 bytes +1 →Solution 3
• curprev 22:3522:35, 5 August 2014 Suli talk contribs 3,925 bytes −4 →Solution 3
• curprev 22:3522:35, 5 August 2014 Suli talk contribs 3,929 bytes +1,505 No edit summary

18 May 2014

• curprev 10:2210:22, 18 May 2014 Hurdler talk contribs 2,424 bytes +1 →Solution 2
• curprev 10:2210:22, 18 May 2014 Hurdler talk contribs 2,423 bytes +178 →Solution 2

3 July 2013

• curprev 17:5817:58, 3 July 2013 Etude talk contribs 2,245 bytes +15 No edit summary

17 September 2012

• curprev 14:1014:10, 17 September 2012 1=2 talk contribs m 2,230 bytes +28 →Solutions
• curprev 14:0314:03, 17 September 2012 1=2 talk contribs m 2,202 bytes +1 No edit summary

20 June 2011

• curprev 06:4206:42, 20 June 2011 1=2 talk contribs 2,201 bytes +17 No edit summary

13 May 2011

• curprev 13:1313:13, 13 May 2011 Yugrey talk contribs 2,184 bytes +523 Yay nice solution I came up with

4 August 2009

• curprev 12:0012:00, 4 August 2009 God of Math talk contribs 1,661 bytes −9 →Solution
• curprev 11:5911:59, 4 August 2009 God of Math talk contribs 1,670 bytes +631 →Solution
• curprev 11:5311:53, 4 August 2009 God of Math talk contribs 1,039 bytes 0 →Solution
• curprev 11:5311:53, 4 August 2009 God of Math talk contribs 1,039 bytes +39 →Solution
• curprev 11:5211:52, 4 August 2009 God of Math talk contribs 1,000 bytes +26 →Solution
• curprev 11:5111:51, 4 August 2009 God of Math talk contribs 974 bytes +12 →Solution
• curprev 11:4811:48, 4 August 2009 God of Math talk contribs 962 bytes +475 →Solution

30 December 2008

• curprev 17:3217:32, 30 December 2008 Minsoens talk contribs 487 bytes +487 New page: ==Problem== A deck of <math>n</math> playing cards, which contains three aces, is shuffled at random (it is assumed that all possible card distributions are equally likely). The cards are ...