One great problem, three kinds of immersion
From a story to your own conjecture
Problem stories open curiosity. The problem workshop is the next place, where curiosity becomes a testable idea.
- 1 · DiscoverMeet the questionLearn when it appeared and why it still holds people’s attention.
- 2 · ChallengeTest one caseMake your first observation in five minutes with a drawing, calculation, or colors.
- 3 · DevelopYou are hereBuild on ideasPublish an observation and grow it through comparisons, conjectures, and counterexamples.
Perfect Cuboid — Can All 7 Lengths Be Integers?
Problem
Does there exist a rectangular cuboid whose edges , three face diagonals , and space diagonal are all simultaneously integers?
Why it matters
Paul Halcke recorded the smallest Euler brick in 1719: six integer outer lengths but a non-integer space diagonal. Artemas Martin published the perfect-cuboid question in 1894. No box satisfying all four Diophantine constraints is known.
Progress so far
Matson's computer search implies that any solution must have an odd edge above and a smallest edge above . Huge negative searches and many necessary conditions are known, but neither a solution nor a nonexistence proof.
Further reading
💡 Explore together, one line at a time(0 contributions)
Contributions are not ranked by popularity. Curator feedback names what is clear or reproducible, and peer signals mean someone understood or actually reproduced it.
What did you notice?
You do not need a complete proof. A small observation can open the next path.
moderation policy. Sign in after submitting if you want to edit or delete this attempt from another device.