![]() |
[QUOTE=Jwb52z;303763]How do you know how many bits a factor you find is equivalent? I haven't seen that printed on the results anywhere.[/QUOTE]
If you follow the link in my post to James' site you'll see that it displays all the info you're looking for there. |
That's an awesome find. The k of the first individual factor is nice and smooth. Good work!
|
[QUOTE=Jwb52z;303763]How do you know how many bits a factor you find is equivalent? I haven't seen that printed on the results anywhere.[/QUOTE]As [i]flashjh[/i] said any of the factor/exponent detail pages will have that info; the right-side menu of any page on my site has a box where you can put any number in to get the number of bits.
More generically: log(factor)/log(2) will give you the number of bits. |
Where log() is the natural logarithm, base e. You could alternately just do log2(factor), the logarithm base 2 :razz:
|
[QUOTE=Dubslow;303771]Where log() is the natural logarithm, base e. You could alternately just do log2(factor), the logarithm base 2 :razz:[/QUOTE]
Does it matter? How about if log() is base 10? or 59? :razz: :razz: |
[QUOTE=flashjh;303765]If you follow the link in my post to James' site you'll see that it displays all the info you're looking for there.[/QUOTE]Thank you for pointing that out to me. I found out my largest factor is just over 100 bits so far.
|
[url]http://mersenne-aries.sili.net/exponent.php?exponentdetails=1131113[/url] for my latest factor- one bit from TF finding instead of P-1
[QUOTE=LaurV;303782]Does it matter? How about if log() is base 10? or 59? :razz: :razz:[/QUOTE] Yes, LaurV, it must be base 2. Base 10 would tell you how many digits it is, and base 59 would...just be stupid. Base 2 tells you how many bits. Also log2(factor) = x where 2^x=(factor) |
How long does it take a factor to be listed on the page I was suggested to go to about seeing the bit length? I just found a factor and it's not there yet, so I assume it's not directly linked or instant.
|
[QUOTE=Jwb52z;303811]How long does it take a factor to be listed on the page I was suggested to go to about seeing the bit length? I just found a factor and it's not there yet, so I assume it's not directly linked or instant.[/QUOTE]PrimeNet posts the recent data every hour, which I grab at roughly half past each hour. So worst case about 90 minutes. Unless, of course, lots of other data was submitted that hour and more than 1000 results were recorded that hour, in which case it may fall off the PrimeNet report.
Manually submitting results.txt to [url]http://mersenne-aries.sili.net[/url] as often as you like is the best way to ensure you're seeing accurate data. That's reflected instantly, and also contains useful data that's impossible to get from PrimeNet, so manual submission is always welcome and encouraged. |
[QUOTE=c10ck3r;303806]
Yes, LaurV, it must be base 2. Base 10 would tell you how many digits it is, and base 59 would...just be stupid. Base 2 tells you how many bits. Also log2(factor) = x where 2^x=(factor)[/QUOTE] You can do it with any base b: log2(x) = logb(x)/logb(2). It's called the change of base formula, it's what James used with base e, and it shows that loga(x)/logb(x) is a ratio that is independent of x (it only depends on a and b). |
This seems like a fairly low bit length factor I found, but what do I know?, so finding any others might be interesting:
P-1 found a factor in stage #2, B1=565000, B2=11158750. UID: Jwb52z/Clay, M56995177 has a factor: 11399497561966901971601 73.271 bits. |
| All times are UTC. The time now is 21:55. |
Powered by vBulletin® Version 3.8.11
Copyright ©2000 - 2021, Jelsoft Enterprises Ltd.