30 August 2025

• curprev 01:4001:40, 30 August 2025 Rolt talk contribs 6,330 bytes +2,007 →Solution 5 (Recursion)

26 December 2022

• curprev 23:5023:50, 26 December 2022 Isabelchen talk contribs m 4,323 bytes −6 →Solution 5 (Recursion)
• curprev 23:4923:49, 26 December 2022 Isabelchen talk contribs 4,329 bytes +17 →Solution 5 (Recursion)
• curprev 23:4723:47, 26 December 2022 Isabelchen talk contribs m 4,312 bytes +210 →Solution 5 (Recursion)
• curprev 23:4523:45, 26 December 2022 Isabelchen talk contribs m 4,102 bytes −163 →Solution 5 (Recursion)
• curprev 23:3723:37, 26 December 2022 Isabelchen talk contribs 4,265 bytes +74 →Solution 5 (Recursion)
• curprev 23:2623:26, 26 December 2022 Isabelchen talk contribs m 4,191 bytes +38 →Solution 5 (Recursion)
• curprev 23:2123:21, 26 December 2022 Isabelchen talk contribs 4,153 bytes +196 →Solution 5 (Recursion)
• curprev 23:1323:13, 26 December 2022 Isabelchen talk contribs 3,957 bytes +470 No edit summary

11 October 2020

• curprev 20:1520:15, 11 October 2020 Smileymittens112307 talk contribs 3,487 bytes +1 →Video Solution

4 April 2020

• curprev 16:0316:03, 4 April 2020 Dolphin7 talk contribs 3,486 bytes +12 →Video Solution by Richard Rusczyk
• curprev 15:4815:48, 4 April 2020 Dolphin7 talk contribs 3,474 bytes +97 No edit summary

26 January 2020

• curprev 20:4620:46, 26 January 2020 Bluedragon0131 talk contribs 3,377 bytes +439 →Solution 3 (Noticing Stuff) and Solution 4 (fast and clever)
• curprev 18:5618:56, 26 January 2020 Icematrix talk contribs m 2,938 bytes +61 No edit summary

19 January 2020

• curprev 23:4923:49, 19 January 2020 Bjhhar talk contribs 2,877 bytes +5 →Solution 2
• curprev 23:4823:48, 19 January 2020 Bjhhar talk contribs 2,872 bytes −4 →Solution 2
• curprev 23:4723:47, 19 January 2020 Bjhhar talk contribs 2,876 bytes −14 →Solution 2
• curprev 23:4623:46, 19 January 2020 Bjhhar talk contribs 2,890 bytes +745 No edit summary

9 December 2015

• curprev 21:1021:10, 9 December 2015 Equationcrunchor talk contribs m 2,145 bytes −6 →Solution 2 (Noticing Stuff): removed unnecesary face

1 September 2015

• curprev 00:3100:31, 1 September 2015 Daniellionyang talk contribs 2,151 bytes +6 →Solution 2 (Noticing Stuff)
• curprev 00:3100:31, 1 September 2015 Daniellionyang talk contribs 2,145 bytes −3 →Solution 2 (Noticing Stuff)
• curprev 00:3100:31, 1 September 2015 Daniellionyang talk contribs 2,148 bytes +332 →Solution

4 July 2013

• curprev 10:0610:06, 4 July 2013 Nathan wailes talk contribs 1,816 bytes +15 No edit summary

7 April 2013

• curprev 08:5208:52, 7 April 2013 JWK750 talk contribs 1,801 bytes +50 →See Also

12 January 2013

• curprev 22:2122:21, 12 January 2013 Username222 talk contribs 1,751 bytes +65 No edit summary

4 December 2012

• curprev 10:2010:20, 4 December 2012 Lightest talk contribs 1,686 bytes +1,686 Created page with "== Problem 18 == Let <math>(a_1,a_2, \dots ,a_{10})</math> be a list of the first 10 positive integers such that for each <math>2 \le i \le 10</math> either <math>a_i+1</math> o..."