Authors: L K Lauderdale
Publish Date: 2013/07/03
Volume: 101, Issue: 1, Pages: 9-15
Abstract
For a finite group G let mG denote the set of maximal subgroups of G and πG denote the set of primes which divide G When G is a cyclic group an elementary calculation proves that mG = πG In this paper we prove lower bounds on mG when G is not cyclic In general mG geq piG+p where p in piG is the smallest prime that divides G If G has a noncyclic Sylow subgroup and q in piG is the smallest prime such that Q in rm syl qG is noncyclic then mG geq piG+q Both lower bounds are best possible
Keywords: