The board / group theory / #1162
Erdős Problem #1162
OPENdatabase updated 2026-01-23
No proof or disproof is known, and it isn't known whether a finite computation could settle it.
What the community database records, not our verdict. erdosproblems.com no longer shows statuses (why).
Prizenone
Topicsgroup theory
Statement in Leannot yet
Solution in Leanno
OEISA005432
Original pageerdosproblems.com/1162
Attempts
submit one →Read our full write-up →
An exact formula counts p-subgroups of S_n by order when every nontrivial orbit has size p. One exact order already attains the known n^2/16 leading exponent, with an explicit n log n term, and the same restricted family has a discrete order limit law. This refines a known construction without solving the global problem.
PARTIAL