|
#1 |
"99(4^34019)99 palind"
Nov 2016
(P^81993)SZ base 36
25·5·23 Posts |
Does anyone successfully include M82589933 in factordb?
Last fiddled with by sweety439 on 2020-12-30 at 01:25 |
|
|
|
#2 |
"Daniel Jackson"
May 2011
14285714285714285714
2×373 Posts |
That would be difficult, as the DB won't directly accept Mersenne numbers >M62000000.
EDIT: It's already there: http://www.factordb.com/index.php?id...00001257221107 Last fiddled with by Stargate38 on 2020-12-30 at 22:46 |
|
|
|
#3 | |
6809 > 6502
"""""""""""""""""""
Aug 2003
101×103 Posts
10,837 Posts |
Quote:
factordb does not take numbers that big, it is more that 10,000,000 digits. |
|
|
|
|
#4 |
"Serge"
Mar 2008
Phi(4,2^7658614+1)/2
2·5,011 Posts |
There is a certain breed of people who will take a good thing and go out of their way to break it or make it worse.
Give them a glass and they will throw it against the wall. (To test if it is strong enough.) Give them a coffee machine and they will keep pressing all buttons until the buttons break. What kind of an alternatively gifted person could have submitted the following pearls to the factorDB: (8^27529977*4-1)*(10^1933-1)/9 <24863980> (8^27529977*4-1)*(10^4597-1)/9 <24866644> (8^27529977*4-1)*(10^4283-1)/9 <24866330> (2^57885161-1)*(8^27529978-2)/2 <42287217> (8^27529978-2)*(8^27529978+2)/4 <49724095> (8^27529978-2)*(10^1031-1)/18 <24863078> (8^27529978-2)*(10^4201-1)/18 <24866248> ... to which "8^27529977*4-1" is now listed as a factor. (What a great finding! ...but there are trillions of other even larger numbers of which it is a factor. What about them?) What could have been a point of that? These huge useless database entries make it slow for the other users. For no benefit to that single malicious user, whatsoever. These entries were submitted some time in 2019. For any of these entries, the database runs some calculations (they are likely not cached, e.g. the "ddddddddd..dd <dddddd>" representation). For seconds! (so some other processes on the server will have to wait). For sure, in the ideal world, Markus (if he had no better things to do) could write special treatment for entries of >N million digits. But does he? Does he not have any better things to do? The limit of 10M digits is there for a technological reason. |
|
|
|
#5 |
"99(4^34019)99 palind"
Nov 2016
(P^81993)SZ base 36
71408 Posts |
Wow!!
Besides, does anyone successfully include the Fermat number F27? (There are two ID's for the Fermat number F26: 1100000000785073549 1100000001405019228 Last fiddled with by sweety439 on 2020-12-31 at 00:29 |
|
|
|
#6 |
"Daniel Jackson"
May 2011
14285714285714285714
13528 Posts |
@Uncwilly: That's M82589933. It just isn't expressed in the normal way. Proof from PARI/gp:
Code:
(17:22) gp > (8^27529977*4-1)-(2^82589933-1) *** _^s: Warning: increasing stack size to 16000000. *** _^s: Warning: increasing stack size to 32000000. *** _^s: Warning: increasing stack size to 64000000. %2 = 0 (17:24) gp > |
|
|
|
||||
Thread | Thread Starter | Forum | Replies | Last Post |
request: always include "from" in trial-factoring results | James Heinrich | Software | 1 | 2005-04-10 02:44 |