Timeline for Clarification about theorem on vanishing polynomials
Current License: CC BY-SA 4.0
10 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| May 14, 2022 at 11:05 | comment | added | Mark Wildon | From Definition 2 of the paper: $n(m)$ is the least integer $n$ such that $m$ divide $n!$. From Definition 3: $S_k(X) = (X+1) \ldots (X+k)$. | |
| S May 4, 2022 at 19:51 | history | suggested | F Zaldivar | CC BY-SA 4.0 |
Corrected a typo for the definition of the function f defined by F
|
| May 4, 2022 at 15:07 | comment | added | F Zaldivar | The theorem is characterizing when the function $f$ induced by $F$ is $0$, and the characterization is as Andreas Blass pointed out. | |
| May 4, 2022 at 15:03 | review | Suggested edits | |||
| S May 4, 2022 at 19:51 | |||||
| May 4, 2022 at 13:42 | review | Close votes | |||
| May 30, 2022 at 3:03 | |||||
| May 4, 2022 at 13:27 | history | edited | Michael Albanese | CC BY-SA 4.0 |
added 234 characters in body; edited title
|
| May 4, 2022 at 13:26 | comment | added | Andreas Blass | It's what you called "the other way around". Once $F$ is chosen, there's only one $F_n, ..., on (up to congruence) $a_k$ satisfying the equation and the constraints given. | |
| May 4, 2022 at 13:24 | history | edited | YCor | CC BY-SA 4.0 |
removed capitals from title
|
| S May 4, 2022 at 13:19 | review | First questions | |||
| May 4, 2022 at 13:27 | |||||
| S May 4, 2022 at 13:19 | history | asked | Justin Zhang | CC BY-SA 4.0 |