Gerry Snyder wrote:
M2161 was number 10 on the list of smallest Mersenne numbers with no
known factor.
Number 14 actually, you forgot the four numbers below 1200.
Sander
_
Unsubscribe list info --
M(31) is also the first Mersenne prime not to be tested
as an exponent in a Mersenne prime as it is 10 digits
or over 2 billion, well beyond the current 16mil or
even 33mil exponents being tested.
Take a look at Tony Forbes page
http://www.ltkz.demon.co.uk/ar2/mm61.htm
MM31 has 3 known
If trial-factoring has been done up to 2^68... is it
possible to skip testing ECM curves for factors up to 15
and/or 20 digits... and go straight to testing ECM curves
for digits up to 25 digits???
Personally, I would go straight in at the 25+ digits level.
OTOH, if trial factoring has
Jud McCranie wrote:
On Windows XP ctrl-alt-del shows that information (maybe on Win 2000
too).
On both W2K and XP you also have to press the Task Manager Button, or
press ctrl-shift-esc to go there right away
Sander
_
I think it is more the following situatiuon:
95+% done, connecting to prime.net - GET NEW WORK !! - start with
new work !
After 5-7% the old workfile gets it's active flag back and will be
completed.
The work done on the new exponent is either trail factoring or P-1
factoring. Trail
Andy Hedges wrote:
Anyone have any idea why for k = 659 there are very little primes? In
fact for k up to 20 there are none (I haven't found any in this
range yet!).
This number has bees searched till at least 27
Take a look at http://www.prothsearch.net/rieselsearch.html
Brian J. Beesley Wrote:
My strategy is:
(1) run Proth at medium priority in factoring only mode to eliminate
candidates with small factors;
For step 1 i use Newpgen. I think this is better configurable then proth in
how far or long you want to factor. Don't know which is the fastest of the
Hello,
1) When testing a new Pc, I obtain two different results from the old and
the new one
M9357637 is not prime. Res64: BCB1164E6826255E. WW1:
C4F561C3,5448242,
M9357637 is not prime. Res64: BCB1164E6826255E. WW1:
C4F261C3,5448242,0003
Are this results compatible ?
The 64 bits
Henk Stokhorst wrote:
I wrote a small program in Delphi that uses the 'nofactor'
files produced by 'decomp' as input to create a graphical
image of the work that has been performed on factoring.
Thanks, this is something i've been looking for, much easier
then importing the file into Excel
But what if the mod M comes out to 1 on one of
the intermediate steps? Then 1^2 - 2 = -1
Then what? spike
Then you will be stuck in a loop, same thing happens when the outcome is
-2, -1, 0 and 2
_
Unsubscribe list
I personally don't mind a P100 running full LL tests; they are a small,
but
usefull contribution to our effort.
I still use an old p100 and p166 to do a full LL test in the 9M range, but i
do check in regularly and make sure that i won't hold up a new milestone.
But i got another question,
Hi,
Today we reached 100.000 cleared exponents since last synchronization on
primenet.
When will the next synchronization be?
The list with cleard exponents is getting a bit to long to download that
often.
_
Unsubscribe
A bit Off Topic, but i finaly had time to put some data i have of Home
Primes
(I.E. repeated factorizations of concatenated prime factors) online.
In case you're interested http://www.geocities.com/home_primes
_
Unsubscribe
Whenever I have a large file (about 3.000 lines) with
exponents to test
(extracted from the nofactor.cmp file) and replace all the
'Test=' with
'Factor=' using wordpad (part of windows accesoires) one line gets to
read 'Factorst='.
You can extract with the -w option to get Factor=
George Woltman wrote:
If the first and second tests were done by the same user, then my program
prompts me as to whether I really want to accept this result. I usually
accept the double-check for the following reasons:
1) It is not uncommon for top producers to get assigned a
I noticed a while ago that the Primenet server started reporting "v19/v20"
in
the "Ver" column. When this showed only one version, it was useful to help
determine which machines needed to be upgraded. Now it makes it impossible
to
distinguish between v19 and v20, which I'd like to do to make
Well, actually i use the banners from http://www.mersenne.org/ips/banners/
I hope these will also be updated, but it looks like i have to change the
script
when i have time.
That's cool! Right after I send this E-mail I'm going to update my web
site
and remove the old banners directory. This
All was well until Prime95 needed to contact the server.
Then I got the message
Dial-up connection not active.
Will try contacting server again in 2 minutes.
When I reported this to [EMAIL PROTECTED], several people responded with
the suggestion that I deselect the 'Use a dial-up connection
4) Is this too slow to download? Would you rather not have the
mouse rollover feature (it adds to the .gif files downloaded).
No, not for mee (64k isdn)
5) Would you rather I use frames so the menu does not scroll?
yes, it would be better, also the menu should fit on one screen, so no
I worked that excel sheet up using the information available at
http://www.mersenne.org/bench.htm;
Goerge,
There still isn't a link to this page from youre pages.
The current link still points to the old benchmark page
_
The folowing exponents where factored by P-1, but why are the bounds so
different?
The first had a chance of 1.77% and the other two about 3.7% to find a
factor .
UID: sanderh/PC, M5542549 completed P-1, B1=7, B2=7, WW1: 8F7EF481
UID: sanderh/PC, M5542723 completed P-1, B1=6,
Dave has at least 80 exponents reserved between 2.4M and
3.99M. Eighty. Almost all are less than suspected M37. It is a
certainty that without poaching, we will have to wait until late 2000 or
later to prove M37, because Dave is trying to do all the double-checking
singlehandedly.
Not
Maybe a bigger/better cooler helps
-Original Message-
From: Paul Cuni [mailto:[EMAIL PROTECTED]]
Sent: zondag 16 januari 2000 21:53
To: [EMAIL PROTECTED]
Subject: Mersenne: cpu problem
As to those errors I reported earlier it appears my cpu couldn't handle its
450mhz rated speed. Or
Hi,
I've been reading through the archives the last days but the last one is
from mid 1998.
I found a online archive but dowbloading every single message
takes to much time.
Is there a place where i can download the more recent archives (in one or
two zip files)
or can some one send
Read the archives, this has been discussed 2 or 3 times before
-Original Message-
From: burlington john [mailto:[EMAIL PROTECTED]]
Sent: Wednesday, July 21, 1999 19:47
To: [EMAIL PROTECTED]
Subject: Mersenne: The sound of number searching
Hello Mersenne,
Sorry for bad english its
Took me a bit longer but has M38 has 2098960 digits ;-)
At 02:21 01.07.99 -0400, Lucas Wiman wrote:
The page belongs to a previous record holder...
Took me about 30 seconds to find it.
It's nice to see a thirty-eighth line in /root/math/ref/mers...
I didn't! Am I _that_ bad at searching the
26 matches
Mail list logo
