![]() |
![]() |
#100 |
Dec 2003
Hopefully Near M48
2×3×293 Posts |
![]()
What happened to M3321928171?
|
![]() |
![]() |
![]() |
#101 | |
Banned
"Luigi"
Aug 2002
Team Italia
480310 Posts |
![]() Quote:
Luigi |
|
![]() |
![]() |
![]() |
#102 |
Banned
"Luigi"
Aug 2002
Team Italia
113038 Posts |
![]()
M3321928483 no factor from 2^2 to 2^60.
M3321928501 has a factor: 391987563119 M3321928513 has a factor: 14749362597721 M3321928531 has a factor: 437571069960383 M3321928567 has a factor: 6378501480068041 M3321928601 no factor from 2^2 to 2^60. M3321928607 has a factor: 59794714927 M3321928619 has a factor: 797262868561 M3321928619 has a factor: 48684837137044687 M3321928619 has a factor: 59077344656726951 M3321928661 has a factor: 19931571967 M3321928679 has a factor: 325549010543 M3321928697 no factor from 2^2 to 2^60. M3321928699 no factor from 2^2 to 2^60. Luigi |
![]() |
![]() |
![]() |
#103 |
Feb 2003
2×3×13 Posts |
![]()
M33219283319 no factor from 2^62 to 2^63.
M33219283319 no factor from 2^63 to 2^64. M33219283319 no factor from 2^64 to 2^65. M33219283319 no factor from 2^65 to 2^66. M33219283319 no factor from 2^66 to 2^67. M33219283319 no factor from 2^67 to 2^69. |
![]() |
![]() |
![]() |
#104 |
Aug 2003
3016 Posts |
![]()
What exactly are you all trying to accomplish? (I'm curious)
|
![]() |
![]() |
![]() |
#105 |
Feb 2003
4E16 Posts |
![]()
is on it's way to 69 bits
|
![]() |
![]() |
![]() |
#106 | |||
"William"
May 2003
New Haven
3×787 Posts |
![]() Quote:
Quote:
Quote:
In the spirit of John Belushi from the movie Animal House, it's time for someone to make a futile gesture, and we're just the people to do it. The first step of a prime search is to trial factor candidates to remove those easily shown as prime (all the prime search projects - GIMPS, 17orBust, RieselSieve, 15k, 321, etc start with this). Prime95 couldn't handle billion digit numbers, so Luigi created a program that can. Don't understand? Think of this as Spring Silliness in the distributed computing prime search community. It's better than swallowing goldfish. And even though it's essentially pointless today, Will Edgington's archive of Mersenne Factors means that when the day comes that somebody actually has a use for these factors, the factors we find will be available. William |
|||
![]() |
![]() |
![]() |
#107 |
Jun 2003
Russia, Novosibirsk
2·107 Posts |
![]()
3321928241 no factor to 67 bit. Going futher to 69!
|
![]() |
![]() |
![]() |
#108 |
6809 > 6502
"""""""""""""""""""
Aug 2003
101×103 Posts
11×853 Posts |
![]()
M3321928307 no factor from 2^68 to 2^69.
I am stopping here on this expo. I may grab some lower level ones and run them up a bit. |
![]() |
![]() |
![]() |
#109 |
6809 > 6502
"""""""""""""""""""
Aug 2003
101×103 Posts
11·853 Posts |
![]()
M3321928483 no factor from 2^60 to 2^62.
Taking 3321928601, 3321928697, & 3321928699 to 2^62 |
![]() |
![]() |
![]() |
#110 | |
Feb 2003
2×3×13 Posts |
![]() Quote:
3321928319 instead I tested 33219283319 bit of a difference! When I get 3321928373 to 69 bits I'll go back and do the one I ought to have done in the first place! |
|
![]() |
![]() |
![]() |
Thread Tools | |
![]() |
||||
Thread | Thread Starter | Forum | Replies | Last Post |
Ten Billion Digits Mersenne Numbers | aketilander | Operation Billion Digits | 14 | 2021-02-27 07:14 |
The "one billion minus 999,994,000" digits prime number | a1call | Miscellaneous Math | 179 | 2015-11-12 14:59 |
Operation Megabit Twin | Oddball | Twin Prime Search | 370 | 2013-01-03 21:26 |
modulo operation for polynomials? | smslca | Math | 3 | 2011-04-18 17:18 |
question range 1 billion to 2 billion? | Unregistered | Information & Answers | 7 | 2010-08-12 06:25 |