reaction to another mail about this
This happens all the time in different shapes so I would expect some
happy day we found a crosslinked factor.
we will never find a factor who is a factor of Mx and also of My
simply because every factor give only one count with my algoritm and is
factor
of
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 primes less
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 count++
}
v = count
I'm not sure I understand that code
Will Edgington wrote:
Is it worthwhile mounting a formal attack on the Mersenne numbers
between 20 million say 40 million using this technique? We're
getting quite close to this I think Chris would not have bothered
with these, since they were so far ahead of LL testing at
-Oprindelig meddelelse-
Fra: Torben Schlüntz
Sendt: lø 23-03-2002 02:54
Til: Bruce Leenstra
Cc:
Emne: SV: Mersenne: Factors aren't just factors
Bruce Leenstra wrote:
You'll notice that 'tempvalue
Message-
From: Torben Schlüntz [EMAIL PROTECTED]
To: Phil Moore [EMAIL PROTECTED]; [EMAIL PROTECTED] [EMAIL PROTECTED]
Date: Wednesday, March 20, 2002 4:41 PM
Subject: SV: Mersenne: Factors aren't just factors
Actually I should have let Steve answer this, but I can't ignore to say
that I already
Hi,
I seem to remember about 3.5 years ago someone (I think it was Chris Nash)
had done something similar eliminated a lot of Mersenne numbers.
Is it worthwhile mounting a formal attack on the Mersenne numbers between 20
million say 40 million using this technique? We're getting quite close
]
To: [EMAIL PROTECTED] [EMAIL PROTECTED]
Date: Tuesday, March 19, 2002 8:12 PM
Subject: Re: Mersenne: Factors aren't just factors
to find the value v where prime p is a factor of 2^v-1
tempvalue = p
count = 0
while tempvalue != 0
{
if tempvalue is odd
{
shiftright tempvalue
count
M89 is prime! M89 = 618.970.019.642.690.137.449.562.111 with no known
factors.
So it would be lovely if we could rule out any possible Mx if x had
earlier been a factor for any other My. :-) But no.
M11 proves this so nicely: M23 has factors, M89 none.
I've started looking for some factors,
Steve Harris claimed that M89 is not prime, but it is! So his
conjecture about being able to eliminate a few Mersenne candidates
because the exponent is a factor of a non-prime Mersenne number won't
work.
Phil Moore
_
Jeroen wrote:
to find the value v where prime p is a factor of 2^v-1
tempvalue = p
count = 0
while tempvalue != 0
{
if tempvalue is odd
{
shiftright tempvalue
count++
}
else
{
tempvalue+=p
}
} ...
(Uh, did you swap your 'if' and 'else' clauses? if temp is
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
count++
}
v = count
I'm not sure I understand that code yet, but
I've
to find the value v where prime p is a factor of 2^v-1
tempvalue = p
count = 0
while tempvalue != 0
{
if tempvalue is odd
{
shiftright tempvalue
count++
}
else
{
tempvalue+=p
}
}
if the count is a primenumber then p is thus a factor of a mersenne prime
if the
13 matches
Mail list logo
