Random (r,s)-generation of finite classical groups

Martin W. Liebeck*, Aner Shalev

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

16 Scopus citations


A proof is given that for primes r, s, not both 2, and for finite simple classical groups G of sufficiently large rank, the probability that two randomly chosen elements in G of orders r and s generate G tends to 1 as |G| ∞.

Original languageAmerican English
Pages (from-to)185-188
Number of pages4
JournalBulletin of the London Mathematical Society
Issue number2
StatePublished - Mar 2002

Bibliographical note

Funding Information:
The authors thank the Institute of Advanced Study at the Hebrew University for support. The second author acknowledges the support of a grant from the Israel Science Foundation.


Dive into the research topics of 'Random (r,s)-generation of finite classical groups'. Together they form a unique fingerprint.

Cite this