22 October 2025

• curprev 11:0311:03, 22 October 2025 MRENTHUSIASM talk contribs 2,994 bytes −668 Removed repetitive solutions.
• curprev 10:2810:28, 22 October 2025 Totallynotsimon talk contribs 3,662 bytes +5 →Solution 3 (literally just wrote solution 1 again)
• curprev 10:2810:28, 22 October 2025 Totallynotsimon talk contribs 3,657 bytes +40 →Solution 3

21 October 2025

• curprev 23:1323:13, 21 October 2025 Jb2015007 talk contribs 3,617 bytes +16 →Solution 2 (Casework)
• curprev 23:1323:13, 21 October 2025 Jb2015007 talk contribs 3,601 bytes +607 →Solution 2 (Casework)

14 November 2022

• curprev 19:2919:29, 14 November 2022 MRENTHUSIASM talk contribs 2,994 bytes +28 No edit summary
• curprev 19:1919:19, 14 November 2022 Puffer13 talk contribs m 2,966 bytes −14 →Solution 2 (Casework)
• curprev 19:1819:18, 14 November 2022 Puffer13 talk contribs m 2,980 bytes −14 →Solution 1 (Stars and Bars)

28 October 2021

• curprev 01:2001:20, 28 October 2021 MRENTHUSIASM talk contribs 2,994 bytes −427 →Solution 3 (Answer Choices): Hmm, this solution is not very convincing that the answer needs to be divisible by 4. What if a=c and b!=d? If we swap (a,c) and (b,d), we only get two solutions.

26 October 2021

• curprev 22:5822:58, 26 October 2021 MRENTHUSIASM talk contribs m 3,421 bytes +1 →Solution 2 (Casework)
• curprev 21:3221:32, 26 October 2021 MRENTHUSIASM talk contribs 3,420 bytes +534 No edit summary
• curprev 15:0215:02, 26 October 2021 MRENTHUSIASM talk contribs 2,886 bytes +78 Not done yet. Will return to Sol 2.
• curprev 09:3809:38, 26 October 2021 MRENTHUSIASM talk contribs m 2,808 bytes −9 →Solution 1
• curprev 07:1707:17, 26 October 2021 MRENTHUSIASM talk contribs 2,817 bytes +474 No edit summary

1 August 2020

• curprev 23:4223:42, 1 August 2020 Star32 talk contribs m 2,343 bytes −6 →Solution 3 (BASH)

3 December 2019

• curprev 22:4522:45, 3 December 2019 Bjhhar talk contribs 2,349 bytes +989 No edit summary

18 July 2019

• curprev 13:4613:46, 18 July 2019 Drunkenninja talk contribs 1,360 bytes −138 →Solution

25 January 2019

• curprev 04:5104:51, 25 January 2019 Mathdummy talk contribs 1,498 bytes +187 →Solution

7 December 2018

• curprev 10:1010:10, 7 December 2018 Karolina.newgard talk contribs m 1,311 bytes −1 →Solution

21 October 2018

• curprev 18:5918:59, 21 October 2018 Blossomstream talk contribs m 1,312 bytes 0 →Solution 2

18 June 2018

• curprev 16:3816:38, 18 June 2018 Rockmanex3 talk contribs 1,312 bytes +93 →See Also

7 June 2018

• curprev 16:5316:53, 7 June 2018 Quortle talk contribs 1,219 bytes +4 →Solution
• curprev 16:5116:51, 7 June 2018 Quortle talk contribs 1,215 bytes +38 →Solution 2
• curprev 16:4916:49, 7 June 2018 Quortle talk contribs 1,177 bytes 0 No edit summary
• curprev 16:4816:48, 7 June 2018 Quortle talk contribs 1,177 bytes +372 No edit summary

16 February 2018

• curprev 13:5213:52, 16 February 2018 Benq talk contribs 805 bytes +805 Created page with "== Problem == Consider polynomials <math>P(x)</math> of degree at most <math>3</math>, each of whose coefficients is an element of <math>\{0, 1, 2, 3, 4, 5, 6, 7, 8, 9\}</mat..."