Sums of element orders in groups of odd order
Abstract
Denote by G a finite group and by (G) the sum of element orders in G. If t is a positive integer, denote by Ct the cyclic group of order t and write (t)=(Ct). In this paper we proved the following Theorem A: Let G be a non-cyclic group of odd order n=qm, where q is the smallest prime divisor of n and (m,q)=1. Then the following statements hold. (1) If q=3, then (G)(|G|)≤ 85301, and equality holds if and only if n=3· 7· m1 with (m1,42)=1 and G=(C7 C3)× Cm1, with C7 C3 non-abelian. (2) If q>3, then (G)(|G|)≤ p4+p3-p2+1p5+1, where p is the smallest prime bigger than q and equality holds if and only if n=qp2m1 with (m1,p!)=1 and G=Cq× Cp× Cp × Cm1.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.