Readers like you keep news free for everyone.
More than 5,000 readers have already pitched in to keep free access to The Journal.
For the price of one cup of coffee each week you can help keep paywalls away.
Readers like you keep news free for everyone.
More than 5,000 readers have already pitched in to keep free access to The Journal.
For the price of one cup of coffee each week you can help keep paywalls away.
A TEXAS BANKER is upping the ante to $1 million (around €762,000) for whoever solves a tricky problem that’s been dogging mathematicians since the 1980s.
The American Mathematical Society said this week that the $1 million will be awarded for the publication of a solution to the Beal Conjecture number theory problem.
Dallas banker D. Andrew Beal first offered the Beal Prize in 1997 for $5,000. Over the years, the amount has grown.
American Mathematical Society spokesman Michael Breen says a solution is more difficult than the one for a related problem, Fermat’s Last Theorem, which didn’t have a published solution for hundreds of years.
Beal is a self-taught mathematician and says he wants to inspire young people to pursue math and science.
The Beal Conjecture says that the only solutions to the equation Ax + By = Cz, when A, B and C are positive integers and x,y and z are also positive integers greater than 2, are those in which A, and C have a common factor.
For example, 33 + 63 = 35, but the numbers that are the bases have a common factor of 3, so the equation does not disprove the theory; it is not a counter example.
- Additional reporting by Christine Bohan
To embed this post, copy the code below on your site