The minimum generating set problem (Q6142842)

If \(G\) is a finite group then \(d(G)\) denotes the minimum number of elements necessary to generate \(G\). A subset \(X \subset G\) such that \(G=\langle X \rangle\) and \(|X|=d(G)\) is a minimum generating set of \(G\). Checking whether a given subset of \(G\) generates \(G\) is called a generating test for \(G\). The authors prove the following result (Theorem 2): The number of generating tests needed to determine a minimum generating set of a finite group \(G\) is at most \(|G|^{\frac{13}{5}}\).