27 December 2024

• curprev 01:4601:46, 27 December 2024 Modularbread talk contribs m 1,766 bytes −52 No edit summary

30 January 2023

• curprev 07:3207:32, 30 January 2023 Joe.joseph talk contribs m 1,818 bytes +10 The limit as n approaches infinity is 1/4, not 0

3 January 2023

• curprev 22:0722:07, 3 January 2023 Usamo2023 talk contribs 1,808 bytes +113 →Perplexing Edge Case
• curprev 22:0622:06, 3 January 2023 Usamo2023 talk contribs 1,695 bytes +1 →Solution
• curprev 22:0522:05, 3 January 2023 Usamo2023 talk contribs 1,694 bytes +250 →Solution

3 July 2013

• curprev 17:5417:54, 3 July 2013 Etude talk contribs 1,444 bytes +15 No edit summary

17 September 2012

• curprev 14:0814:08, 17 September 2012 1=2 talk contribs m 1,429 bytes +28 →Solution

16 September 2012

• curprev 07:2607:26, 16 September 2012 1=2 talk contribs m 1,401 bytes 0 No edit summary

2 April 2010

• curprev 15:4815:48, 2 April 2010 5849206328x talk contribs m 1,401 bytes +1 →Solution
• curprev 15:4815:48, 2 April 2010 5849206328x talk contribs m 1,400 bytes −230 →Solution

20 August 2009

• curprev 01:1401:14, 20 August 2009 God of Math talk contribs 1,630 bytes +69 →Solution
• curprev 01:1301:13, 20 August 2009 God of Math talk contribs 1,561 bytes +166 →Solution

11 February 2009

• curprev 13:4713:47, 11 February 2009 1=2 talk contribs 1,395 bytes +6 LaTeX housekeeping

31 January 2009

• curprev 12:3712:37, 31 January 2009 Misof talk contribs m 1,389 bytes 0 →Solution
• curprev 12:3712:37, 31 January 2009 Misof talk contribs 1,389 bytes +946 No edit summary

30 December 2008

• curprev 14:2414:24, 30 December 2008 Minsoens talk contribs 443 bytes +443 New page: ==Problem== Three distinct vertices are chosen at random from the vertices of a given regular polygon of <math>(2n+1)</math> sides. If all such choices are equally likely, what is the prob...