![]() |
[QUOTE=chris2be8;284363]I've got 8 cores in total, 1 6 core box and 1 2 core box. I'm getting about 2M relations in 14 hours so it may finish sieving in late January (it depends if the rate slows down later in the range and how many relations I need). Then add a few days for LA etc.
Chris K[/QUOTE]OK, finally got there. I've got 118M+ unique relations and 126M+ unique ideals. I've got some relations on the other sieving machine that I'm going to toss in the mix in hopes of a little better matrix. I'll give you an ETA later on today.... |
False alarm! :cry:[quote=msieve]
commencing 2-way merge reduce to 16890789 relation sets and 16635945 unique ideals ignored 25 oversize relation sets commencing full merge memory use: 1909.9 MB found 8544888 cycles, need 8524145 weight of 8524145 cycles is about 681972507 (80.00/cycle) ..... commencing linear algebra read 8524145 cycles cycles contain 30396095 unique relations read 30396095 relations using 20 quadratic characters above 2147483270 building initial matrix memory use: 4037.7 MB read 8524145 cycles matrix is 8523965 x 8524145 (2924.2 MB) with weight 907100851 (106.42/col) sparse part has weight 664259727 (77.93/col) filtering completed in 2 passes matrix is 8515163 x 8511169 (2923.2 MB) with weight 906745720 (106.54/col) sparse part has weight 664174894 (78.04/col) matrix starts at (0, 0) matrix is 8515163 x 8511169 (2923.2 MB) with weight 906745720 (106.54/col) sparse part has weight 664174894 (78.04/col) matrix needs more columns than rows; try adding 2-3% more relations[/quote]:max: :max: :max: |
You are right on the edge of having enough relations. There's a small region where filtering will succeed but a little extra filtering inside the linear algebra will cause the job to fail. Add some more relations and you'll get past the danger zone. Add a few more relations after that and you can knock 10-15% off the size of the matrix, though whether that will reduce the total time to completion depends on how fast you can sieve.
|
Do you have an ETA? This number is #5 among the 10 smallest composites in the Repunit Factorizations:
[URL]http://homepage2.nifty.com/m_kamada/math/11111.htm[/URL] I love to see the new factors. It makes me happy. :smile: |
Man is the artificer of his own happiness. Artifice something, dude, and be happy!
Why doesn't complete factorization of 10^397-1 make you happy instead? That is a sizeable achievement!* __________ [SIZE=1]* [URL="http://en.wikipedia.org/wiki/Littlewood%27s_law"]John Littlewood[/URL] while proof-reading a passage in a draft of a book noted once: "I wish I had said that". To his surprise, the final print said: "John Littlewood said:..." The printer's apprentice took his remark for the face value. :-) /a.f.a.i.r. from M.Gardner's book/[/SIZE] |
I like factorizations of any number, especially repunits and large numbers of the form k*2^n+x, such as 8675309*2^2154+2 which is 2*(8675309*2^2153+1) (Link for the second factor: [URL]http://www.factordb.com/index.php?id=1100000000486883929[/URL]). Also I like finding Generalized Fermat primes, such as 1494^256+1 (Link: [URL]http://www.factordb.com/index.php?id=1100000000475946832[/URL]).
|
[QUOTE=Stargate38;287374]Also I like finding Generalized Fermat primes, such as 1494^256+1 (Link: [URL]http://www.factordb.com/index.php?id=1100000000475946832[/URL]).[/QUOTE]
Before spending much time in finding GF primes, have a look at [url=http://yves.gallot.pagesperso-orange.fr/primes/results.html]here[/url]. |
1 Attachment(s)
Are there any primes of the form 626[sup]2[sup]n[/sup][/sup]+1? I used Proth and didn't find any up to n=16. Also, Why does NewPGen crash when I try to sieve b^n+k with k=1 and b=8675310? See attatched image.
|
[QUOTE=Stargate38;287363]Do you have an ETA?[/QUOTE]
Linear algebra should finish in about 28 hours.So I should be able to post the factors on Sunday. Chris K PS. Is anyone working on R870? I could take that as my next challenge. |
You may want to email M.Kamada - he doesn't read these forums, but he is in contact with half a dozen active repunit factorers. He would know. There are no reservations for these though.
[URL]http://homepage2.nifty.com/m_kamada/math/11111.htm[/URL] See 'Sources' and 'Recent Changes' sections. |
Also, if you do want to take on a c162, then why not on a Wanted Cunningham c163? It was deliberately left for enthusiasts.
|
| All times are UTC. The time now is 16:30. |
Powered by vBulletin® Version 3.8.11
Copyright ©2000 - 2021, Jelsoft Enterprises Ltd.