On the number of generators and composition length of finite linear groups (Q5949388)

\textit{J. D. Dixon} and \textit{L. G. Kovács} [Q. J. Math., Oxf. II. Ser. 44, No. 173, 1-15 (1993; Zbl 0808.20033)] showed that for each field \(K\) which has finite degree over its prime subfield, there is a number \(d_K\) such that every finite nilpotent irreducible linear group of degree \(n\geq 2\) over \(K\) can be generated by \([d_Kn/\sqrt{\log n}]\) elements. \textit{R. M. Bryant, L. G. Kovács} and \textit{G. R. Robinson} [ibid. 46, No. 184, 385-407 (1995; Zbl 0854.20001)] proved that the same is true for solvable linear groups. The question naturally arises: Is it possible to remove the solvability hypothesis? In an earlier paper, the authors [J. Algebra 223, No. 1, 154-170 (2000; Zbl 1063.20501)] gave a positive answer for the case of finite fields. In this paper, the authors completely solve this problem. To prove the result, the authors also investigate the composition length of a finite subgroup of the general linear group.