Timeline for Integral polynomials dividing N!
Current License: CC BY-SA 4.0
10 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| May 22, 2019 at 14:32 | history | edited | José Hdz. Stgo. | CC BY-SA 4.0 |
deleted 1 character in body
|
| Nov 12, 2016 at 5:50 | comment | added | Jyrki Lahtonen | $N^3+1\mid N!$ is easy. See this question at Math.SE. If you can give an elementary answer to $N^5+1\mid N!$, my bounty offer there can be renewed :-) | |
| Nov 11, 2016 at 18:45 | comment | added | José Hdz. Stgo. | @PietroMajer: You are absolutely right! | |
| Nov 11, 2016 at 18:45 | history | edited | José Hdz. Stgo. | CC BY-SA 3.0 |
added 27 characters in body
|
| Nov 11, 2016 at 17:21 | history | edited | Greg Martin | CC BY-SA 3.0 |
edited body
|
| Nov 11, 2016 at 17:09 | comment | added | José Hdz. Stgo. | Not that I know of... | |
| Nov 11, 2016 at 16:54 | history | edited | José Hdz. Stgo. | CC BY-SA 3.0 |
added 197 characters in body
|
| Nov 11, 2016 at 16:54 | comment | added | Gerhard Paseman | Do you have an algorithm to produce Q(k) such that P(Q(k)) is Q(k) smooth? Gerhard "Belt Sander Is Not Working" Paseman, 2016.11.11. | |
| Nov 11, 2016 at 16:52 | history | edited | José Hdz. Stgo. | CC BY-SA 3.0 |
added 197 characters in body
|
| Nov 11, 2016 at 16:44 | history | answered | José Hdz. Stgo. | CC BY-SA 3.0 |