mersenneforum.org  

Go Back   mersenneforum.org > Great Internet Mersenne Prime Search > Data > Marin's Mersenne-aries

Reply
 
Thread Tools
Old 2004-06-08, 01:42   #12
dave_0273
 
dave_0273's Avatar
 
Oct 2003
Australia, Brisbane

1110101102 Posts
Default

The way mersenne-aries works is I get hrf3.txt (a list of exponents that have at least one LL test but not a matching LL test) and compare it to pminus1.txt (which shows the amount of p-1 factoring that has been done on an exponent). Any exponent that appears in hrf3 but not in pminus1 is a candidate for mersenne-aries.

However, mersenne-aries only works on certain ranges. We only work on ranges that are not yet on primenet. For example, double checks up to 12.5M are all on primenet, so we wouldn't work on any exponent less than 12.5M.

There are however people who use the semi-automated way of p-1 testing that will pick up any exponents that we weren't able to complete before it goes to primenet. The way the semi-automated way works is that you reserve a large number of double checks, any that finish with ,1 (for example DoubleCheck=12000000,64,1) are unreserved again straight away as these have already been p-1 tested. The user would have also set up sequentialworktodo=0 which means that all the p-1 tests are done before any of of the LL tests are done. When all the p-1 tests are done, and prime95 is about to start on the first doublecheck, all the exponents are unreserved.

The only thing wrong with the semi-automated method is that it is hard to get enough work to do. Thats why I choose to do it manually and I also post ranges for other people to do if they are interested in doing p-1 tests.
dave_0273 is offline   Reply With Quote
Old 2004-06-08, 02:20   #13
delta_t
 
delta_t's Avatar
 
Nov 2002
Anchorage, AK

35710 Posts
Default

Quote:
Originally Posted by dave_0273
The only thing wrong with the semi-automated method is that it is hard to get enough work to do. Thats why I choose to do it manually and I also post ranges for other people to do if they are interested in doing p-1 tests.
This is so true for the semi-automated method. I had to get about 1000 exponents before I got to a point where I was getting a lot of exponents that had one LL-test but had no P-1 done. This is why when I finally started getting these I just reserved a lot of them (525). I'll finish in about a month, then I'll have to do it all over again. Getting these from the forum is definitely easier.
delta_t is offline   Reply With Quote
Old 2004-09-24, 23:25   #14
James Heinrich
 
James Heinrich's Avatar
 
"James Heinrich"
May 2004
ex-Northern Ontario

2×17×103 Posts
Default

I just found a 43-digit factor that beats your 43-digit ones (but not your 45-digit one, naturally.)
Quote:
[Thu Sep 23 09:41:22 2004]
P-1 found a factor in stage #2, B1=90000, B2=1732500.
UID: S130260/C13C71069, M15910439 has a factor: 4323110550526375709294437681284209923347881
That factor should be 3rd overall, if I'm not mistaken?
James Heinrich is offline   Reply With Quote
Old 2004-09-25, 11:17   #15
smh
 
smh's Avatar
 
"Sander"
Oct 2002
52.345322,5.52471

29×41 Posts
Default

Quote:
Originally Posted by James Heinrich
I just found a 43-digit factor that beats your 43-digit ones (but not your 45-digit one, naturally.)That factor should be 3rd overall, if I'm not mistaken?
Sorry, It's a composite:

PRIME FACTOR 471463684608646013689
PRIME FACTOR 9169551529965486638129
smh is offline   Reply With Quote
Old 2004-09-25, 12:23   #16
dave_0273
 
dave_0273's Avatar
 
Oct 2003
Australia, Brisbane

2·5·47 Posts
Default

My site doesn't care if it is composite or not.

I think that all the biggest factors on my website are composite. I know that all of mine are.
dave_0273 is offline   Reply With Quote
Old 2004-09-25, 12:34   #17
dave_0273
 
dave_0273's Avatar
 
Oct 2003
Australia, Brisbane

2·5·47 Posts
Default

I just checked the biggest 10 factors found on my website (I don't have the time right now to do all 20) and found that the first 6 were composite and 7-10 are prime.

Here are the results....

Code:
1. 3514233865018526446562065785595542962972195753 = 18154642898050009861369 x 193572183421795109797937

2. 264230314763760208834215981504580626343342447 = 46673864303955381847 x 5661205017073505552389801

3. 2975472867644373392513490171544511832022967 = 26296325190058952183 x 113151660779173033002049 

4. 2855451057157704997579326497626590663028969 = 896774094182730749591 x 3184136423744490284159 

5. 539258302657028676888051495655820038433881 = 714126009831643980041 x 755130460496963884241 

6. 4371171811087722702718399628583483010153 = 21095721627240372769 x 207206555354017323337

7. 1352314223931668429560551466249 is prime

8. 1108632484832796568785498537761 is prime

9. 1055342220095616061072926313001 is prime

10. 374624776575285733098513989353 is prime
So it looks as though the largest prime factor is 1352314223931668429560551466249 found by dave_0273 and weighing in at 30 digits.
dave_0273 is offline   Reply With Quote
Old 2007-09-03, 20:15   #18
Mr. P-1
 
Mr. P-1's Avatar
 
Jun 2003

7×167 Posts
Default

Quote:
Originally Posted by dave_0273 View Post
ISo it looks as though the largest prime factor is 1352314223931668429560551466249 found by dave_0273 and weighing in at 30 digits.
31 digits:

Code:
[Fri May 23 14:34:48 2003]
P-1 found a factor in stage #2, B1=50000, B2=887500.
UID: daran/1, M8680409 has a factor: 4516743717642484934632779029209
However as George pointed out, there were several 35-or-more digit factors even back in 2003. Now there are over 100 of this size or greater listed, though not all will have been found using Prime95 or using the P-1 method.

Last fiddled with by Mr. P-1 on 2007-09-03 at 20:16
Mr. P-1 is offline   Reply With Quote
Old 2008-01-28, 21:43   #19
Mr. P-1
 
Mr. P-1's Avatar
 
Jun 2003

7·167 Posts
Default

M25223287 has a 32 digit factor: 14737136146082922801302859492631
Mr. P-1 is offline   Reply With Quote
Old 2008-01-29, 10:47   #20
James Heinrich
 
James Heinrich's Avatar
 
"James Heinrich"
May 2004
ex-Northern Ontario

2×17×103 Posts
Default

Quote:
Originally Posted by Mr. P-1 View Post
M25223287 has a 32 digit factor: 14737136146082922801302859492631
~103.54 bits, and it's prime too
Well done.
James Heinrich is offline   Reply With Quote
Old 2008-01-30, 16:40   #21
Mr. P-1
 
Mr. P-1's Avatar
 
Jun 2003

7·167 Posts
Default

Quote:
Originally Posted by James Heinrich View Post
~103.54 bits, and it's prime too
Well done.
I've had a couple of 140+ bit composite factors, which are nice to find, but the underlying primes aren't so impressive. This is my second 100+ bit prime factor.

They're still pretty meager compared to these monsters.
Mr. P-1 is offline   Reply With Quote
Old 2008-02-01, 21:43   #22
xilman
Bamboozled!
 
xilman's Avatar
 
"π’‰Ίπ’ŒŒπ’‡·π’†·π’€­"
May 2003
Down not across

253128 Posts
Default

Quote:
Originally Posted by Mr. P-1 View Post
They're still pretty meager compared to these monsters.
I'm disappointed that my p50 by P-1 has dropped off that list.

However, I'm trying again on generalized Cullen and Woodall numbers and have managed a p46 so far this run. Still almost 10,000 composites to go before the entire collection is swept to B1=1e9 so there's plenty of opportunities yet.


Paul
xilman is offline   Reply With Quote
Reply

Thread Tools


Similar Threads
Thread Thread Starter Forum Replies Last Post
P-1 Stage 1 factor Mr. P-1 Software 25 2009-03-09 18:08
Stage 1 with mprime/prime95, stage 2 with GMP-ECM D. B. Staple Factoring 2 2007-12-14 00:21
Need help to run stage 1 and stage 2 separately jasong GMP-ECM 9 2007-10-25 22:32
Stage 1 and stage 2 tests missing Matthias C. Noc PrimeNet 5 2004-08-25 15:42
amount of memory needed for Stage 2 (factor) pin Software 13 2003-03-18 19:54

All times are UTC. The time now is 23:33.


Wed Oct 20 23:33:08 UTC 2021 up 89 days, 18:02, 1 user, load averages: 1.65, 1.31, 1.24

Powered by vBulletin® Version 3.8.11
Copyright ©2000 - 2021, Jelsoft Enterprises Ltd.

This forum has received and complied with 0 (zero) government requests for information.

Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.2 or any later version published by the Free Software Foundation.
A copy of the license is included in the FAQ.