1 million dollar prize to prove or disprove the Beal Conjecture

Main post link -> http://newsfeed.time.com/2013/06/11/solve-this-math-problem-win-a-million-bucks/?hpt=hp_t3

We know many of you are into Fermat's last theorem and thought you might be interested in the Beal Conjecture as well. Expanding the frontier of number theory probably isn't the easiest way to make a million bucks, or even the best reason to work on that kind of problem. That is an impressive prize though, here is the prize page from the American Mathematical Society.

Note by Peter Taylor
5 years, 7 months ago

No vote yet
17 votes

  Easy Math Editor

MarkdownAppears as
*italics* or _italics_ italics
**bold** or __bold__ bold

- bulleted
- list

  • bulleted
  • list

1. numbered
2. list

  1. numbered
  2. list
Note: you must add a full line of space before and after lists for them to show up correctly
paragraph 1

paragraph 2

paragraph 1

paragraph 2

[example link](https://brilliant.org)example link
> This is a quote
This is a quote
    # I indented these lines
    # 4 spaces, and now they show
    # up as a code block.

    print "hello world"
# I indented these lines
# 4 spaces, and now they show
# up as a code block.

print "hello world"
MathAppears as
Remember to wrap math in \( ... \) or \[ ... \] to ensure proper formatting.
2 \times 3 \( 2 \times 3 \)
2^{34} \( 2^{34} \)
a_{i-1} \( a_{i-1} \)
\frac{2}{3} \( \frac{2}{3} \)
\sqrt{2} \( \sqrt{2} \)
\sum_{i=1}^3 \( \sum_{i=1}^3 \)
\sin \theta \( \sin \theta \)
\boxed{123} \( \boxed{123} \)

Comments

Sort by:

Top Newest

There are 6(originally 7) unsolved conjectures known as the millennium prize problems and for solving each,the Clay Mathematical Institution offers a million bucks.The Poincare Conjecture is the only one that has been proved.

Edward Elric - 5 years, 7 months ago

Log in to reply

thanks a lot for giving such a great problem i'll surely give it a try

Tejas Kasetty - 5 years, 7 months ago

Log in to reply

Maybe Fermat proved his last theorem using the Beal equation? (see if you can find out how)

Taehyung Kim - 5 years, 7 months ago

Log in to reply

Wait maybe we can use fermat's little theorem to turn it into a more simpler problem..

Taehyung Kim - 5 years, 7 months ago

Log in to reply

×

Problem Loading...

Note Loading...

Set Loading...