Wilson's Theorem/Corollary 2/Historical Note
Jump to navigation
Jump to search
Historical Note on Corollary 2 to Wilson's Theorem
This corollary to Wilson's theorem was demonstrated, according to Donald E. Knuth: The Art of Computer Programming: Volume 1: Fundamental Algorithms (3rd ed.), by Ludwig Stickelberger in $1890$.
It is supposed that this appears in Stickelberger's $1890$ article Ueber eine Verallgemeinerung der Kreistheilung (Math. Ann. Vol. 37: pp. 321 – 367) during the course of his proof of Stickelberger's Theorem.
However, not only is the latter behind a paywall, it is also in a language the author of this page is not fluent in, and he has been disinclined to study it.
 | This page needs the help of a knowledgeable authority. In particular: Someone knowledgeable to resolve the above issue. If you are knowledgeable in this area, then you can help $\mathsf{Pr} \infty \mathsf{fWiki}$ by resolving the issues. To discuss this page in more detail, feel free to use the talk page. When this work has been completed, you may remove this instance of {{Help}} from the code.If you would welcome a second opinion as to whether your work is correct, add a call to {{Proofread}} the page. |
Sources
- 1890: Ludwig Stickelberger: Ueber eine Verallgemeinerung der Kreistheilung (Math. Ann. Vol. 37: pp. 321 – 367)
- 1997: Donald E. Knuth: The Art of Computer Programming: Volume 1: Fundamental Algorithms (3rd ed.) ... (previous) ... (next): $\S 1.2.5$: Permutations and Factorials: Exercise $14$