Source authenticated
Kourovka Problem 18.50 - Prescribed Permuted-Product Cardinality
Given $n$ and $1 \le c \le n!$, can $n$ distinct group elements be chosen so that their $n!$ ordered products take exactly $c$ distinct values? Constructions realize every $c$.
Exact FrontierDelta
Prior state unknown→proved
Scope and record
Occurred: Jul 20, 2026
Delta type: SOURCE CLAIM
Assumptions: VibeMathed verification: lean-verified. Publication: preprint. AI contribution: ai-discovered. Imported under CC BY 4.0.
Canonical aliases: Kourovka Problem 18.50 - Prescribed Permuted-Product Cardinality · Kourovka 18.50
Confidence: Not scored
Registry verification: lean verified · preprint · resolved
Lineage and corrections
This event attributed to Aristotle