Wilson's Theorem/Corollary 2/Historical Note
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.
Someone knowledgeable to resolve the above issue.
If you are particularly knowledgeable in this area, then you can help ProofWiki by resolving the issues.
To discuss this page in more detail, feel free to use the talk page.
If you are able to do so, then when you have finished you can 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 (see the proofread template for usage).
Sources
- 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$
