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. 1 · DiscoverMeet the questionLearn when it appeared and why it still holds people’s attention.
  2. 2 · ChallengeTest one caseMake your first observation in five minutes with a drawing, calculation, or colors.
  3. 3 · DevelopYou are hereBuild on ideasPublish an observation and grow it through comparisons, conjectures, and counterexamples.
Week 5 · ClassicalOpen
Primary source

Beal's Conjecture — The Million-Dollar Generalization of Fermat

Research level· Posed 1997

Problem

If Ax+By=CzA^x + B^y = C^z in positive integers with x,y,z>2x, y, z > 2, then AA, BB, CC share a common prime factor. A generalization of Fermat's Last Theorem (case x=y=zx=y=z).

Why it matters

Fermat's Last Theorem (case x=y=zx=y=z) was solved by Wiles (1995) after 358 years. In 1997 Texas banker–amateur Andrew Beal generalized it to different exponents. The prize started at 5,000in1997andwasraisedto5{,}000 in 1997 and was raised to *1{,}000{,}000 in 2013*. Frey curves and modular forms (Wiles' tools) don't apply directly — new ideas are needed.

Progress so far

Verified for A,B,C1000A,B,C \le 1000 and x,y,z7x,y,z \le 7 (Norvig and others). Partial results for some special exponent combinations. The prize is administered by the AMS — paid for either a proof or a counterexample.

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.

Markdown + KaTeX supported (`$x^2$` inline, `$$\sum_{k=1}^n k$$` display)
0 / 3000 characters

moderation policy. Sign in after submitting if you want to edit or delete this attempt from another device.

Loading…