20 July 2025

• curprev 08:0908:09, 20 July 2025 Jj empire10 talk contribs 6,223 bytes +90 No edit summary

16 February 2025

• curprev 16:4416:44, 16 February 2025 Boxtheanswer talk contribs 6,133 bytes +39 →See Also

4 February 2025

• curprev 17:1417:14, 4 February 2025 Athreyay talk contribs m 6,094 bytes +5 →Solution 3

13 January 2025

• curprev 09:1409:14, 13 January 2025 Charking talk contribs 6,089 bytes +34 Formatting

1 October 2021

• curprev 20:4920:49, 1 October 2021 Asdf334 talk contribs 6,055 bytes +428 No edit summary

15 August 2021

• curprev 09:5609:56, 15 August 2021 MRENTHUSIASM talk contribs m 5,627 bytes +12 No edit summary
• curprev 09:5109:51, 15 August 2021 Math fj talk contribs m 5,615 bytes 0 →Solution 5

19 October 2020

• curprev 09:0509:05, 19 October 2020 Skyguy88 talk contribs m 5,615 bytes 0 →Solution 5

26 August 2020

• curprev 12:3812:38, 26 August 2020 Olympushero talk contribs 5,615 bytes −54 No edit summary
• curprev 12:3712:37, 26 August 2020 Olympushero talk contribs 5,669 bytes +1,869 No edit summary

21 May 2020

• curprev 16:1316:13, 21 May 2020 Amitav2005 talk contribs 3,800 bytes +2 →Solution 4

5 June 2016

• curprev 10:5810:58, 5 June 2016 Zsp talk contribs m 3,798 bytes +1 →Solution 4
• curprev 10:5710:57, 5 June 2016 Zsp talk contribs m 3,797 bytes −44 →Solution 4

23 March 2015

• curprev 19:2319:23, 23 March 2015 Morgandaciuk talk contribs 3,841 bytes +14 →Solution 1
• curprev 19:1719:17, 23 March 2015 Morgandaciuk talk contribs 3,827 bytes −1 →Solution 1
• curprev 19:1619:16, 23 March 2015 Morgandaciuk talk contribs 3,828 bytes 0 →Solution 1
• curprev 19:1519:15, 23 March 2015 Morgandaciuk talk contribs m 3,828 bytes +1 →Solution

5 July 2014

• curprev 16:1316:13, 5 July 2014 Ptes77 talk contribs 3,827 bytes +6 →Solution

27 April 2014

• curprev 20:5820:58, 27 April 2014 Jeff10 talk contribs 3,821 bytes +1,119 No edit summary

4 July 2013

• curprev 12:1912:19, 4 July 2013 Nathan wailes talk contribs 2,702 bytes +15 No edit summary

11 October 2011

• curprev 04:1304:13, 11 October 2011 LastPrime talk contribs 2,687 bytes −26 →Solution 3
• curprev 04:1304:13, 11 October 2011 LastPrime talk contribs 2,713 bytes +13 →Solution 3
• curprev 04:1304:13, 11 October 2011 LastPrime talk contribs 2,700 bytes +418 No edit summary

17 May 2011

• curprev 00:0800:08, 17 May 2011 Xantos C. Guin talk contribs 2,282 bytes +855 Added second solution.

13 May 2011

• curprev 23:3823:38, 13 May 2011 Danielguo94 talk contribs 1,427 bytes +12 No edit summary

28 April 2011

• curprev 19:4319:43, 28 April 2011 Hrithikguy talk contribs 1,415 bytes +122 No edit summary
• curprev 19:3919:39, 28 April 2011 Hrithikguy talk contribs 1,293 bytes +1,293 Created page with 'Let <math>2^n + 12^n + 2011^n = x^2</math> <math>(-1)^n + 1 \equiv x^2 \pmod {3}</math>. Since all perfect squares are congruent to 0 or 1 modulo 3, this means that n must be odd…'