The probability of generating the symmetric group (Q5916480)

\textit{J. D. Dixon} [Math. Z. 110, 199-205 (1969; Zbl 0176.299)] proved that the probability that a pair of random permutations generates a transitive group is \(1-1/n+O(n^{-2})\). He also proved that the same estimation holds for generating a primitive group. Basing on these results he conjectured that this would be the correct estimate for the probability of generating either \(A_ n\) or \(S_ n.\) In the present paper it is proved that the probability of generating a primitive group other than \(A_ n\) or \(S_ n\) is less than \(n^{\sqrt{n}}/n!\) (for large n), implying thus Dixon's conjecture. The proof makes use of the following consequence of the classification of finite simple groups: The number of simple groups of order \(\leq m\) is O(m/log m).