Dixon's Theorem (Group Theory)

This proof is about Dixon's Theorem in the context of Group Theory. For other uses, see Dixon's Theorem.

Theorem

Let $P_1$ and $P_2$ be distinct elements of the symmetric group on $n$ letters.


The probability that $\set {P_1, P_2}$ forms a generator of $S_n$ approaches $\dfrac 3 4$ as $n$ tends to infinity.


Proof


This theorem requires a proof.
You can help $\mathsf{Pr} \infty \mathsf{fWiki}$ by crafting such a proof.
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 {{ProofWanted}} from the code.
If you would welcome a second opinion as to whether your work is correct, add a call to {{Proofread}} the page.



Source of Name

This entry was named for John Douglas Dixon.


Historical Note

started out as a conjecture made by Eugen Otto Erwin Netto, and published by him in his $1882$ work Substitutionentheorie und ihre Anwendung auf die Algebra.

As a consequence, it was referred to as Netto's Conjecture.

It was finally proved by John Douglas Dixon in $1967$.

Since then it has been called .


Sources

  • 1983: François Le Lionnais and Jean Brette: Les Nombres Remarquables ... (previous) ... (next): $0,75$
This article is issued from ProofWiki. The text is available under Creative Commons Attribution-ShareAlike License unless otherwise noted. Additional terms may apply for the media files.