![]() |
![]() |
#45 | |
"Robert Gerbicz"
Oct 2005
Hungary
24×101 Posts |
![]() Quote:
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 |
|
![]() |
![]() |
![]() |
#46 | |
If I May
"Chris Halsall"
Sep 2002
Barbados
5×7×317 Posts |
![]() Quote:
Somewhat similar. |
|
![]() |
![]() |
![]() |
#47 | |
"Robert Gerbicz"
Oct 2005
Hungary
110010100002 Posts |
![]() Quote:
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. |
|
![]() |
![]() |
![]() |
#48 |
Sep 2002
Database er0rr
24×281 Posts |
![]()
Moderator note: Thread moved to OP's blog on the grounds there is no mathematical content,
|
![]() |
![]() |
![]() |
#49 |
If I May
"Chris Halsall"
Sep 2002
Barbados
5·7·317 Posts |
![]() |
![]() |
![]() |
![]() |
#50 |
Random Account
Aug 2009
Not U. + S.A.
47608 Posts |
![]() |
![]() |
![]() |
![]() |
Thread Tools | |
![]() |
||||
Thread | Thread Starter | Forum | Replies | Last Post |
Beal's conjecture ..........not | Awojobi | Miscellaneous Math | 14 | 2022-04-12 04:56 |
Can we prove Beal conjecture assuming ABC conjecture? | didgogns | Miscellaneous Math | 1 | 2020-08-05 06:51 |
The Beal Conjecture Proof | Arxenar | Miscellaneous Math | 1 | 2013-09-07 09:59 |
Distributed Beal Conjecture Problem | Joshua2 | Math | 54 | 2009-10-19 02:21 |
New Beal Conjecture Search | Joshua2 | Open Projects | 0 | 2009-04-20 06:58 |