mersenneforum.org > Math Beal's conjecture prize
 Register FAQ Search Today's Posts Mark Forums Read

 2022-06-18, 01:46 #1 MattcAnderson     "Matthew Anderson" Dec 2010 Oregon, USA 5·233 Posts Beal's conjecture prize Hi again everybody, Matt here with some exciting (old) news. The prize is US\$1 million per problem. There were 7 unsolved (very) hard mathematics problems set out by the Clay Mathematics Institute around the year 2,000. One of them was (sort of) recently solved. Now, let's look at the Beal conjecture. It is a generalization of Fermat's last theorem. The Beal Conjecture is something like a^x + b^y = c^z where all variables are both positive and integers. Wow! What a problem. see wikipedia.org https://en.wikipedia.org/wiki/Millennium_Prize_Problems and https://en.wikipedia.org/wiki/Beal_conjecture This is the sort of problem that definitely takes collaboration. One person cannot (yet) do it alone. IMHO (In My Humble Opinion) Have a nice day. Matthew
2022-06-19, 19:03   #2
xilman
Bamboozled!

"๐บ๐๐ท๐ท๐ญ"
May 2003
Down not across

101100100111102 Posts
Beal's (Conjecture Prize)

Someone who wishes to remain anonymous has brought this to my attention, hence my careful parenthesization ot this post's title.

Quote:
 Attribution to Beal is in dispute. Both Zagier and Tijdeman mentioned the problem prior to Beal. At an 1985 conference at Humboldt State Univ. John Tate gave a superb talk on the recently discovered connection between FLT and the Taniyama Shimura conjecture. (proved by Wiles). At the end of the talk a member of the audience (name unknown) casually asked whether it could be applied to the case of unequal exponents. Beal publicized the problem and offered money. It should be called the Beal Prize for the Tijdeman-Zagier conjecture.

2022-06-19, 23:49   #3
storm5510
Random Account

Aug 2009
Not U. + S.A.

2·19·59 Posts

Quote:
 Originally Posted by MattcAnderson The Beal Conjecture is something like a^x + b^y = c^z where all variables are both positive and integers.
This very much resembles something I saw in a trade school class: a2 + b2 = c2. Pythagorean Theorem, to be exact. The resolution was c = Sqrt(a2 + b2), if memory serves. The length of the hypotenuse of a right triangle. It was a long time ago.

2022-06-20, 00:26   #4
jwaltos

117628 Posts

Quote:
 Originally Posted by xilman Someone who wishes to remain anonymous has brought this to my attention, hence my careful parenthesization ot this post's title.
"Beal publicized the problem and offered money. It should be called the Beal Prize for the Tijdeman-Zagier conjecture."

If history is any guide...Farey...Haros (who the hell is Haros?)..Euler..Pell (what was it that Pell did again?)..equitable attribution in mathematics..there's more than enough precedent to lay waste to any claims of "fair and appropriate" attribution. Might as well name a planet Pluto and expect that to stick..

2022-06-20, 08:48   #5
xilman
Bamboozled!

"๐บ๐๐ท๐ท๐ญ"
May 2003
Down not across

101100100111102 Posts

Quote:
 Originally Posted by MattcAnderson There were 7 unsolved (very) hard mathematics problems set out by the Clay Mathematics Institute around the year 2,000. One of them was (sort of) recently solved.
Why, in your professional opinion, do you think the Poincarรฉ conjecture is only "sort of" solved?

2022-06-20, 16:05   #6
storm5510
Random Account

Aug 2009
Not U. + S.A.

2·19·59 Posts

Quote:
 Originally Posted by MattcAnderson ...This is the sort of problem that definitely takes collaboration. One person cannot (yet) do it alone. IMHO (In My Humble Opinion) Have a nice day. Matthew
Someone here, with the ability, should write a program to do this, unless something already exists. There would need to be an ordered progression and not random numbers. The language platform would need to handle very large numbers. The only one I am familiar with can handle 64-bit unsigned integer types, 0 to 18,446,744,073,709,551,615, (FFFF FFFF FFFF FFFF). This might be large enough, then again, it may not.

2022-06-20, 16:41   #7
mathwiz

Mar 2019

3×97 Posts

Quote:
 Originally Posted by storm5510 Someone here, with the ability, should write a program to do this, unless something already exists.
Let me Google that for you.

 2022-06-20, 17:23 #8 rogue     "Mark" Apr 2003 Between here and the 2·32·7·53 Posts Just don't bring up Don Blazys's proof. He was a crackpot who could not accept that his proof had flaws. You can search the forum for our debates with him on his proof. He tried passing off his proof in many places and just assumed it was correct if nobody disagreed. It doesn't mean that anyone agreed...
 2022-06-20, 21:47 #9 storm5510 Random Account     Aug 2009 Not U. + S.A. 224210 Posts This is most definitely over my head. Not a language I recognize.
2022-06-20, 22:22   #10
kriesel

"TF79LL86GIMPS96gpu17"
Mar 2017
US midwest

6,673 Posts

Quote:
 Originally Posted by storm5510 This is most definitely over my head. Not a language I recognize.
Quote:
 I ported it from Python 1.5 to 3.5

2022-06-20, 22:30   #11
chalsall
If I May

"Chris Halsall"
Sep 2002

32×52×47 Posts

Quote:
 Originally Posted by storm5510 This is most definitely over my head. Not a language I recognize.
Yeah...

In at least one case it has been well documented that if you're going to do an exhaustive search, it is best to use C. If not hand-crafted assembly, tuned to each processor...

 Similar Threads Thread Thread Starter Forum Replies Last Post Awojobi Miscellaneous Math 14 2022-04-12 04:56 didgogns Miscellaneous Math 1 2020-08-05 06:51 Arxenar Miscellaneous Math 1 2013-09-07 09:59 Joshua2 Math 54 2009-10-19 02:21 Joshua2 Open Projects 0 2009-04-20 06:58

All times are UTC. The time now is 23:27.

Mon Aug 8 23:27:36 UTC 2022 up 32 days, 18:14, 1 user, load averages: 1.34, 1.53, 1.56