Nonsolvable groups satisfying the one-prime hypothesis. (Q2643604)

A finite group \(G\) is said to satisfy the one-prime hypothesis if the greatest common divisor of any two distinct irreducible character degrees is either \(1\) or a prime number. Using the classification of finite simple groups, all nonsolvable groups satisfying the one-prime hypothesis are classified, and all possible sets of character degrees of such groups are determined. Combining this with earlier work of the first author, it follows that any finite group satisfying the one-prime hypothesis has at most 9 irreducible character degrees, and this bound is sharp. (For non-solvable groups only, the best possible bound turns out to be 8.)