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.
Beal's Conjecture — The Million-Dollar Generalization of Fermat
Problem
If in positive integers with , then , , share a common prime factor. A generalization of Fermat's Last Theorem (case ).
Why it matters
Wiles' proof of Fermat's Last Theorem was published in 1995. Andrew Beal formulated the different-exponent conjecture in 1993; a 1,000,000 in 2013. Frey curves and modular forms do not by themselves settle this broader problem.
Progress so far
Finite searches have excluded several large but differently shaped regions. Norvig records a distributed search with bases up to 200,000 and exponents up to 5,000, as well as slices such as bases up to 250,000 with exponents up to 7. These are finite negative searches, not a proof. The AMS administers the $1,000,000 prize.
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.