Papers
Topics
Authors
Recent
Search
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.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.