Workshop season · 22 days
Beyond the Attempt List — 22 Readings and Explorations
A season visiting 22 pages for 18 distinct problems without a matching claim found in the openai/math family-title and summary search as of 2026-10-27. This does not mean AI never attempted them, cannot solve them, or that all remain unsolved. Story and workshop pages for the same problem offer different reading tasks. Read one a day or explore in any order, separating what you checked from what you do not yet know.
Start anywhere. Every reading remains available after the season ends.
Read the search scope and claim ledger- Day 1
Collatz Conjecture (3n+1) — A Child Can State It, Yet No One Has Solved It
Explore this question →Collatz: state the rule and distinguish finite checks from all integers
- Day 2
Odd Perfect Numbers — Not One Found in 388 Years
Explore this question →Odd perfect numbers: distinguish the divisor-sum condition from necessary conditions
- Day 3
The Perfect Cuboid — Can All Seven Lengths Be Integers?
Explore this question →Perfect cuboid: separate the edge, face-diagonal, and space-diagonal conditions
- Day 4
The Inscribed Square — Does Every Loop Hide a Square?
Explore this question →Inscribed squares: identify the assumptions placed on the curve
- Day 5
Moving Sofa Problem — A Claimed Optimality Proof Under Review
Explore this question →Moving sofa: distinguish a candidate area from a proof of optimality
- Day 6
Erdős #1196 — From an AI-Suggested Method to a Collaborative Proof
Explore this question →Erdős #1196: see why a separate solution record does not contradict this list
- Day 7
Collatz Conjecture — The Simplest Unsolved Problem
Explore this question →Collatz workshop: compare the trajectories of two small starting values
- Day 8
Odd Perfect Number — Does One Exist?
Explore this question →Odd perfect number workshop: compute proper-divisor sums of small odd numbers
- Day 9
Beal's Conjecture — The Million-Dollar Generalization of Fermat
Explore this question →Beal: inspect the exponent and common-prime-factor conditions separately
- Day 10
Lonely Runner Conjecture — A Moment of Solitude
Explore this question →Lonely runner: sketch distinct speeds and distances
- Day 11
Singmaster's Conjecture — Repeated Entries in Pascal's Triangle
Explore this question →Singmaster: count occurrences of an integer in Pascal’s triangle
- Day 12
Aliquot Sequence 276 — Wandering Forever?
Explore this question →Aliquot 276: distinguish the end of a computation from a divergence proof
- Day 13
Recamán's Sequence — Does Every Integer Appear?
Explore this question →Recamán: apply the rule for avoiding previously used values
- Day 14
Erdős–Moser Equation — Is the Only Solution?
Explore this question →Erdős–Moser: inspect small examples of sums of powers
- Day 15
Brocard's Problem — When Is a Perfect Square?
Explore this question →Brocard: substitute the known solutions into n!+1=m²
- Day 16
Magic Square of Squares — Can 3×3 Be Done?
Explore this question →Magic square of squares: separate line sums from distinct-square constraints
- Day 17
Inscribed Square Problem — Does Every Closed Curve Inscribe a Square?
Explore this question →Inscribed-square workshop: identify the gap between a drawing and a general proof
- Day 18
Frankl's Union-Closed Conjecture — Is Some Element in Half the Sets?
Explore this question →Frankl: count element frequencies in a small union-closed family
- Day 19
Lehmer's Mahler Measure Problem — The Smallest Value Above 1
Explore this question →Lehmer: connect polynomial roots with Mahler measure
- Day 20
Happy Ending Problem — How Many Points to Force a Convex n-gon?
Explore this question →Happy ending: find convex polygons in a point configuration
- Day 21
Perfect Cuboid — Can All 7 Lengths Be Integers?
Explore this question →Perfect-cuboid workshop: find the equation missing from a partial example
- Day 22
Polynomial Hirsch Conjecture — Is Polytope Diameter Polynomial?
Explore this question →Polynomial Hirsch: distinguish dimension, facet count, and graph diameter