An answer to a conjecture on the sum of element orders

Abstract

Let [Formula: see text] be a finite group and [Formula: see text], where [Formula: see text] denotes the order of [Formula: see text]. The function [Formula: see text] was introduced by Tărnăuceanu. In [M. Tărnăuceanu, Detecting structural properties of finite groups by the sum of element orders, Israel J. Math. (2020), https://doi.org/10.1007/s11856-020-2033-9 ], some lower bounds for [Formula: see text] are determined such that if [Formula: see text] is greater than each of them, then [Formula: see text] is cyclic, abelian, nilpotent, supersolvable and solvable. Also, an open problem aroused about finite groups [Formula: see text] such that [Formula: see text] is equal to the amount of each lower bound. In this paper, we give an answer to the equality condition which is a partial answer to the open problem posed by Tărnăuceanu. Also, in [M. Baniasad Azad and B. Khosravi, A criterion for p-nilpotency and p-closedness by the sum of element orders, Commun. Algebra (2020), https://doi.org/10.1080/00927872.2020.1788571 ], it is shown that: If [Formula: see text], where [Formula: see text] is a prime number, then [Formula: see text] and [Formula: see text] is cyclic. As the next result, we show that if [Formula: see text] is not a [Formula: see text]-nilpotent group and [Formula: see text], then [Formula: see text].