arXiv (All)
open access
Odd square roots and the sum of element orders on Sn and An
For a finite group $G$ let $ψ(G)$ be the sum of the orders of its elements. The quotient $S_n/A_n$ has order two. Hence $ψ(S_n/A_n)=3$. The quantity to be compared with $ψ(S_n)$ is therefore $3ψ(A_n)$. Computation indicates that $3ψ(A_n)>ψ(S_n)$ for every $n\ge3$. We reduce this inequality to a ques
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- The number of groups of cubefree order#821985
- The Codegree Isomorphism Conjecture for Finite Simple Groups#927969
- Square-free sets in groups and groups with many roots#410845
- Dissecting the relationship between haplotypes around ATXN2 CAG repeats and the number of CAA interruptions by long-read sequencing#471387
- Exceptional sets for compositions involving Euler's function,the divisor-sum function and Dedekind's function#973322
Record · ID 973434
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive