Random generation of finite and profinite groups and group enumeration

We obtain a surprisingly explicit formula for the number of random elements needed to generate a finite d-generator group with high probability. As a corollary we prove that if G is a d-generated linear group of dimension n then cd+ log n random generators suffice. Changing perspective we investigate profinite groups F which can be generated by a bounded… CONTINUE READING