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

2022-10-23, 22:08   #45
R. Gerbicz

"Robert Gerbicz"
Oct 2005
Hungary

24×101 Posts

Quote:
 Originally Posted by paulunderwood Have you confirmed it with Pari/GP? Maybe his (JS?) code suffers from a flaw.
Nope, do not need to try it out, it would pass those checks also in Pari-Gp.
Btw, my first "counterexample" discovered when not even looked the source code of the page. There is not one type of check, so it takes time to figure out what it is actually doing.

Last fiddled with by R. Gerbicz on 2022-10-23 at 22:08

2022-10-23, 22:16   #46
chalsall
If I May

"Chris Halsall"
Sep 2002

5×7×317 Posts

Quote:
 Originally Posted by R. Gerbicz Nope, do not need to try it out, it would pass those checks also in...
Yeah. Realatively simple.

Somewhat similar.

2022-10-23, 22:34   #47
R. Gerbicz

"Robert Gerbicz"
Oct 2005
Hungary

110010100002 Posts

Quote:
 Originally Posted by Batalov In most implementations, you don't know c or z. And why would scan over those? Wasteful. It is simpler than that, you sum ax + by, then run any implementation of ispower() on the result and ispower() will return 1 or 2 (which is of no use) ... or >2 and only then you have the solution. With the disclaimer that this is just an answer to "your" approach. The real approach is that there are tons of theoretical results on restrictions on what triples are even eligible to start search. Those should be used and that will be 99% of the code. Checking a double for loop with ispower() inside is <1% of the "code".
On the newer page it is not quite clear what Peter Norvig is actually doing, but in fact he is doing (almost) the same thing what he has done in the past: http://norvig.com/beal2000.html . So search A,B,C for some M limit and exponents X,Y,Z to another E limit, what is in the new code is that for some reason he considered only the exponent=4 or prime>2.

In this way he was able to do the check in only (average) O(1) time for each sum, exactly O(1) time is also possible. And note also that to compute the "sum" is also in O(1) time, since he considered the sum only mod m, for some fixed m. These are quite unreachable times with an ispower() routine, since C>M or exponent>E is possible.

 2022-10-24, 13:56 #48 paulunderwood     Sep 2002 Database er0rr 24×281 Posts Moderator note: Thread moved to OP's blog on the grounds there is no mathematical content,
2022-10-24, 20:57   #49
chalsall
If I May

"Chris Halsall"
Sep 2002

5·7·317 Posts

Quote:
 Originally Posted by paulunderwood Moderator note: Thread moved to OP's blog on the grounds there is no mathematical content,
Some jolly good fun in there, though... 9-)

2022-10-25, 15:46   #50
storm5510
Random Account

Aug 2009
Not U. + S.A.

47608 Posts

Quote:
 Originally Posted by chalsall Some jolly good fun in there, though... 9-)
Ditto! Not everything has to have mathematical content. This place would be really dry if it did.

 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 21:34.

Wed Feb 8 21:34:35 UTC 2023 up 174 days, 19:03, 1 user, load averages: 1.12, 1.15, 1.02