6 June 2025

• curprev 05:4705:47, 6 June 2025 Sevenoptimus talk contribs m 4,904 bytes −4 Adjusted table of contents
• curprev 05:4405:44, 6 June 2025 Sevenoptimus talk contribs m 4,908 bytes +11 Slightly improved formatting of Solution 2

30 November 2021

• curprev 14:2314:23, 30 November 2021 StellarG talk contribs 4,897 bytes +55 →Solution 2

23 August 2020

• curprev 18:2818:28, 23 August 2020 Aray10 talk contribs 4,842 bytes +1,280 No edit summary

3 July 2020

• curprev 11:4011:40, 3 July 2020 Theasian talk contribs 3,562 bytes −62 →Solution 1.5
• curprev 11:3811:38, 3 July 2020 Theasian talk contribs 3,624 bytes +1,914 No edit summary

3 March 2016

• curprev 21:2621:26, 3 March 2016 Pisgood talk contribs m 1,710 bytes −19 →Solution

3 July 2013

• curprev 20:0420:04, 3 July 2013 Nathan wailes talk contribs 1,729 bytes +15 →See Also

18 February 2013

• curprev 12:3012:30, 18 February 2013 Davidhua25 talk contribs 1,714 bytes +13 →Solution
• curprev 12:3012:30, 18 February 2013 Davidhua25 talk contribs 1,701 bytes +18 →Solution

16 February 2009

• curprev 14:1714:17, 16 February 2009 Misof talk contribs 1,683 bytes +1,683 New page: == Problem == A point <math>P</math> is selected at random from the interior of the pentagon with vertices <math>A = (0,2)</math>, <math>B = (4,0)</math>, <math>C = (2 \pi + 1, 0)</math>,...