Erdős Problem #1161

GPT-5.2 Thinking found that the problem had already been solved in the literature (24 Jan 2026).

Problem
Erdős problem #1161 (group theory); current status: solved
Credit
GPT-5.2 Thinking · Literature search
Checked
Listed in Tao's wiki
Timeline
First AI contribution 2026-01-24 · wiki data as of 2026-06-30
Sources
Problem page (erdosproblems.com)Tao's AI-contributions wiki
PRIOR
ARTPer Tao's AI-contributions wiki

The problem

Let fk(n)f_k(n) count the number of elements of SnS_n of order kk. For which values of kk will fk(n)f_k(n) be maximal?

Statement quoted from erdosproblems.com/1161, maintained by Thomas Bloom. Original source: [Va99,5.72]. Current status there: solved.

AI contributions

As recorded in Terence Tao's wiki AI contributions to Erdős problems (data as of 30 Jun 2026). 🟢 full, 🟡 partial, ⚪ unverified, 🔴 incorrect.

Date Kind AI systems Outcome
24 Jan, 2026 Literature search GPT-5.2 Thinking 🟢 Full solution found

Caveats

The wiki's classifications are provisional and are not a benchmark. Many Erdős problems have never had a thorough literature review, so a result that looks new may later turn out to be known; some problems were also stated ambiguously or incorrectly. See the problem page for the full discussion.

∎