2000 character limit reached
On a bound of Cocke and Venkataraman
Published 4 May 2021 in math.GR | (2105.01301v1)
Abstract: Let G be a finite group with exactly k elements of largest possible order m. Let q(m) be the product of gcd(m,4) and the odd prime divisors of m. We show that |G|\le q(m)k2/\phi(m) where \phi denotes Euler's totient function. This strengthens a recent result of Cocke and Venkataraman. As an application we classify all finite groups with k<36. This is motivated by a conjecture of Thompson and unifies several partial results in the literature.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.