We use cookies to distinguish you from other users and to provide you with a better experience on our websites. Close this message to accept cookies or find out how to manage your cookie settings.
We use cookies to distinguish you from other users and to provide you with a better experience on our websites. Close this message to accept cookies or find out how to manage your cookie settings.
Let 
$\def \xmlpi #1{}\def \mathsfbi #1{\boldsymbol {\mathsf {#1}}}\let \le =\leqslant \let \leq =\leqslant \let \ge =\geqslant \let \geq =\geqslant \def \Pr {\mathit {Pr}}\def \Fr {\mathit {Fr}}\def \Rey {\mathit {Re}}G$ be a finite group of order 
$n$, and let 
$\text {C}_n$ be the cyclic group of order 
$n$. For 
$g\in G$, let 
${\mathrm{o}}(g)$ denote the order of 
$g$. Let 
$\phi $ denote the Euler totient function. We show that 
$\sum _{g \in \text {C}_n} \phi ({\mathrm{o}}(g))\geq \sum _{g \in G} \phi ({\mathrm{o}}(g))$, with equality if and only if 
$G$ is isomorphic to 
$\text {C}_n$. As an application, we show that among all finite groups of a given order, the cyclic group of that order has the maximum number of bidirectional edges in its directed power graph.
