Answers are grounded in this paper and cite their sources.
Although the title of the paper suggests that the nature of the problem considered is group theoretic, our methods are almost completely combinatorial and number theoretic in nature, the group theory entering only insofar as it leads us to various recursions that we study. Let T n denote the number of solutions of x 2 = 1 in S n the symmetric group of degree n.
No takes yet. Share an insight, caveat, or question.
Chowla et al. (1951) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: