log in |
Message boards : Number crunching : S1027 in TOP5000
Author | Message |
---|---|
Could you write, that primes in Sierpinski base 1027 from n≈129000 entering TOP5000? | |
ID: 4016 · Rating: 0 · rate: / Reply Quote | |
Could you write, that primes in Sierpinski base 1027 from n≈129000 entering TOP5000? They are too small to enter TOP5000. | |
ID: 4017 · Rating: 0 · rate: / Reply Quote | |
oh sorry take 1 "0" more, than real make the top 5000 today a prime must have 391556 digits or meet the size requirements for it's archivable form. ____________ | |
ID: 4018 · Rating: 0 · rate: / Reply Quote | |
oh sorry take 1 "0" more, than real Interesting link to calculate the digits. I have changed the info in the base loaded thread. | |
ID: 4020 · Rating: 0 · rate: / Reply Quote | |
You can also check this with PARI/GP gp > length(Str(75744*1027^137435+1)) | |
ID: 4022 · Rating: 0 · rate: / Reply Quote | |
I took this method of calculating number of digits from submission page of PRP Top by Lifchitz | |
ID: 4023 · Rating: 0 · rate: / Reply Quote | |
I took this method of calculating number of digits from submission page of PRP Top by Lifchitz It should be possible to write an script to check at which n-value Top5000 primes are "available" using the gp-code I noted. IF I have spare time, I´ll bring a list of it either in mersenneforum or here. | |
ID: 4024 · Rating: 0 · rate: / Reply Quote | |
Is it hard to calculate entrance number of digits to TOP5000/log10(base)? | |
ID: 4025 · Rating: 0 · rate: / Reply Quote | |
Message boards :
Number crunching :
S1027 in TOP5000