S Media Relations Coordinator" in
charge of the Media Relations Webpage?
YotN, Bruce Leenstra
_
Unsubscribe & list info -- http://www.ndatech.com/mersenne/signup.htm
Mersenne Prime FAQ -- http://www.tasam.com/~lrwiman/FAQ-mers
Gordon writes:
> Now where on Earth does the figure of 210,000 computers come from??
This is the same mistake made on a previous news item: Both of them are misquoting an
earlier study that determined a *Total* of 210,000 computers worldwide were
participating in a distributed computing proj
Will Edgington writes:
> [...]
> But, for those who are interested, here's the current data on how
> far my runs of the program have gotten so far:
>
> M( 32768 )X: 13952750007
> M( 1073741824 )X: 810019
> M( 18446744073709551615 )X: 2224500019
>
> [...,] the last line implies that all prim
Alex Kruppa wrote:
> Bruce Leenstra wrote:
>> As luck would have it, this is nearly what I am doing right now:
>> tempvalue = (q+1)/2
>> count = 1
>> while tempvalue != 1 {
>>if tempvalue is odd tempvalue += q
>>shiftright tempvalue > c
d in those where v
is prime. My program will abort the loop and prompt me if count > (q-1)/2, indicating
q isn't a factor of any M(v). It hasn't happened yet.
Regards,
Bruce Leenstra
_
Unsubscribe & list info -- http://www.ndatech.com/mersenne/signup.htm
Mersenne Prime FAQ -- http://www.tasam.com/~lrwiman/FAQ-mers
Just an observation,
If you are talking about putting less than half of the candidate factors
into the modular product, i.e. stopping when you reach the square root of
Mp, then most of the time you will need to do the gcd. But if you put all
filtered factors into the modular product, at some poin
Bruce Leenstra wrote:
> What this list needs right now is a nice juicy math debate, so here goes:
> I was reading the faq about P-1 factoring, and it talks about constructing
a
> 'q' that is the product of all primes less than B1 (with some multiples?)
> ...
>
> Ri
? The description in the faq kind of sounds like a
little of each. If there's already somewhere to find this info, please tell
me where to go. ;^}
Regards
Bruce Leenstra
_
Unsubscribe & list info -- http://www.ndatech.com
that expensive
- in fact it may reduce the number of mods.
I realise this won't qualify as an 'algorithmic breakthrough', even if it
did double throughput (NOT likely!),
but it's been bothering me for a while.
Bruce Leenstra mailto:[EMAIL PROTECTED]
_
gested changes would take away their incentive, and encourage
*careful poachers* to wait until an exponent expires.
( Well, I feel much better now ;+)
Bruce Leenstra mailto:[EMAIL PROTECTED]
_
Unsubscribe & list info
resents all the CPU time, that means that 2/3's of the time Prime95
has lost control of the cpu. Maybe Prime95 is too polite, it shouldn't defer
to all those silly business apps.
Bruce
Bruce Leenstra
11 matches
Mail list logo
