13 August 2025

• curprev 16:2716:27, 13 August 2025 Camapital talk contribs 4,416 bytes −1,723 This is not a legitimate proof. This specific triplet of divisors is not a consecutive triplet of divisors for larger values of n and thus does not provide a counterexample.

6 March 2025

• curprev 23:0823:08, 6 March 2025 Brandonyee talk contribs 6,139 bytes +1,723 →Solution 3
• curprev 23:0623:06, 6 March 2025 Brandonyee talk contribs 4,416 bytes −456 Undo revision 244451 by Brandonyee (talk) Tag: Undo
• curprev 23:0523:05, 6 March 2025 Brandonyee talk contribs 4,872 bytes +456 →Solution 3

27 July 2024

• curprev 00:5000:50, 27 July 2024 Alexanderruan talk contribs 4,416 bytes +9 →Solution (Explanation of Video)

23 June 2024

• curprev 04:3304:33, 23 June 2024 Scratch123 talk contribs 4,407 bytes +1,251 →Solution (Explanation of Video)

12 May 2024

• curprev 17:2117:21, 12 May 2024 Mathophobia talk contribs 3,156 bytes +760 →Solution (Explanation of Video)

18 April 2024

• curprev 09:5409:54, 18 April 2024 Jeffersonj talk contribs 2,396 bytes +1 →See Also
• curprev 09:5309:53, 18 April 2024 Jeffersonj talk contribs 2,395 bytes +13 →See Also
• curprev 09:5209:52, 18 April 2024 Jeffersonj talk contribs 2,382 bytes 0 →See Also
• curprev 09:5209:52, 18 April 2024 Jeffersonj talk contribs m 2,382 bytes +72 No edit summary

11 April 2024

• curprev 23:3223:32, 11 April 2024 Alexanderruan talk contribs 2,310 bytes +11 No edit summary
• curprev 23:3123:31, 11 April 2024 Alexanderruan talk contribs 2,299 bytes −81 No edit summary
• curprev 01:5701:57, 11 April 2024 Alexanderruan talk contribs 2,380 bytes +4 No edit summary
• curprev 01:5401:54, 11 April 2024 Alexanderruan talk contribs 2,376 bytes +8 No edit summary
• curprev 01:5201:52, 11 April 2024 Alexanderruan talk contribs 2,368 bytes +2,012 No edit summary

29 March 2024

• curprev 20:5520:55, 29 March 2024 Renrenthehamster talk contribs 356 bytes +90 No edit summary

20 March 2024

• curprev 21:3321:33, 20 March 2024 Anyu-tsuruko talk contribs 266 bytes +266 Created page with "Find all integers <math>n \geq 3</math> such that the following property holds: if we list the divisors of <math>n !</math> in increasing order as <math>1=d_1<d_2<\cdots<d_k=n..."