“…Since |P | is even and q is odd, by Maschke's theorem, X F q is completely reducible, and moreover, is faithful since X is faithful. Using the FongSwan theorem [23,Theorem 10.1] on lifts of irreducible Brauer characters in solvable groups, we conclude that P has a complex faithful character, say χ, of degree n. Now we apply [12, Theorem A] to deduce that the number of generators in a minimal generating set for P , say d(P ), is at most (3/2)(n − s) + s, where s is the number of linear constituents of χ. In particular, d(P ) ≤ [3n/2], and it follows that…”