Let $G$ be a finite group of order $n$ and $\psi(G)$ be the sum of element orders of $G$. Then $\psi(G)\leq\psi(C_n)$, where $C_n$ is the cyclic group of order $n$ (see "Sums of element orders in finite groups", Comm. Algebra 37 (2009), 29782980). Is it true a similar inequality for the product of element orders of $G$?
Take the 2minute tour
×
MathOverflow is a question and answer site for professional mathematicians. It's 100% free, no registration required.

Denoting the order of $g$ by $o(g)$, you can show that for any decreasing function $f$ the following inequality holds $$\sum_{g\in G}f(o(g))\geq \sum_{g\in \mathbb Z/n\mathbb Z}f(o(g)).$$ This is because one can actually construct a bijection $\sigma:G\to\mathbb Z/n\mathbb Z$ which satisfies $$o(\sigma(g))\geq o(g)$$ for all $g\in G$. The main ingredient is a classical theorem of Frobenius saying that when $k$ divides the order of a group, the number of elements of order dividing $k$ is divisible by $k$, then proceed by induction. An application of this exact idea is for example problem 10775 on the American Math Monthly. For your question we just need $f(x)=\log x$. 

