mersenneforum.org  

Go Back   mersenneforum.org > Factoring Projects > Aliquot Sequences

Reply
Thread Tools
Old 2009-11-12, 15:27   #518
Andi47
 
Andi47's Avatar
 
Oct 2004
Austria

2×17×73 Posts
Default

Quote:
Originally Posted by 10metreh View Post
A C161.
This seems to be near the crossover between the 14e and 15e sievers....
Andi47 is offline   Reply With Quote
Old 2009-11-13, 10:14   #519
Andi47
 
Andi47's Avatar
 
Oct 2004
Austria

2·17·73 Posts
Default pp41-factor of c161

Code:
GMP-ECM 6.2.3 [powered by GMP 4.3.0] [ECM]
Input number is 41989040709803320172325437685122012188238989866495646783169593798391300698922442158422655234035792573779700795308983586334745780088868313272292796749799498704069 (161 digits)

...

Run 3 out of 2000:
Using B1=43000000, B2=240490660426, polynomial Dickson(12), sigma=2746202462
Step 1 took 855859ms
Step 2 took 182687ms
********** Factor found in step 2: 17929080031745140528449157941308074577509
Found probable prime factor of 41 digits: 17929080031745140528449157941308074577509
Probable prime cofactor 2341951769720349963952569043284852276019038780750832785187060203064697177590116136874365861798306068919218595003497391841 has 121 digits

Last fiddled with by Andi47 on 2009-11-13 at 10:21 Reason: added [ code ] tags
Andi47 is offline   Reply With Quote
Old 2009-11-13, 11:45   #520
fivemack
(loop (#_fork))
 
fivemack's Avatar
 
Feb 2006
Cambridge, England

23·11·73 Posts
Default

I had completed 700@1e8 without finding that, which is actually quite unlucky (ecm -v says 644 curves at 1e8 for a p45)

Killed them and started again on the C145 from 2459.

Last fiddled with by fivemack on 2009-11-13 at 11:48
fivemack is offline   Reply With Quote
Old 2009-11-13, 15:16   #521
Greebley
 
Greebley's Avatar
 
May 2009
Dedham Massachusetts USA

84310 Posts
Default

Boy that factor of 3 just won't go away. I guess at this many digits the chance of at least one factor + 1 being divisible by 3 is high.
Greebley is offline   Reply With Quote
Old 2009-11-13, 16:07   #522
mdettweiler
A Sunny Moo
 
mdettweiler's Avatar
 
Aug 2007
USA (GMT-5)

186916 Posts
Default

Quote:
Originally Posted by Greebley View Post
Boy that factor of 3 just won't go away. I guess at this many digits the chance of at least one factor + 1 being divisible by 3 is high.
Hmm...if I understand this correctly, then it's going to lose the 3 on the next line! Here's the current partial factorization of line 2459:

1389005994...<168> = 24 · 3 · 11 · 593 · 811 · 81266036243201<14> · 6731092709...<145>

Notice the 11: 11+1=12, which is divisible by 3.
mdettweiler is offline   Reply With Quote
Old 2009-11-13, 16:35   #523
fivemack
(loop (#_fork))
 
fivemack's Avatar
 
Feb 2006
Cambridge, England

23·11·73 Posts
Default

(mdettweiler: you need to have *none* of the factors 2 mod 3 to lose the 3)

Code:
(job 5 out of 16) Run 12 out of 125:
Using B1=100000000, B2=776268975310, polynomial Dickson(30), sigma=1209849063
Step 1 took 1004841ms
Step 2 took 277472ms
********** Factor found in step 2: 1235256026055614152023140734345351300023869925971
Found probable prime factor of 49 digits: 1235256026055614152023140734345351300023869925971
Probable prime cofactor 5449147842682529938683571528241234609478304810765641311200653978116824057163714349422254281192109 has 97 digits
Next line has C145, will give it the same treatment

Edit: found a P30 (ten times) and P37 (once) in 16x125 @ 1e6

Last fiddled with by fivemack on 2009-11-13 at 17:12
fivemack is offline   Reply With Quote
Old 2009-11-13, 16:45   #524
axn
 
axn's Avatar
 
Jun 2003

5,087 Posts
Default

Quote:
Originally Posted by mdettweiler View Post
Hmm...if I understand this correctly, then it's going to lose the 3 on the next line! Here's the current partial factorization of line 2459:
<snip>
Notice the 11: 11+1=12, which is divisible by 3.
Which is why it can NOT lose the 3 on that iteration
axn is offline   Reply With Quote
Old 2009-11-13, 19:11   #525
bsquared
 
bsquared's Avatar
 
"Ben"
Feb 2007

2×3×587 Posts
Default

I see we've now hit 170 digits... what is the record and if not this one, what is the highest sequence?
bsquared is offline   Reply With Quote
Old 2009-11-13, 19:38   #526
mdettweiler
A Sunny Moo
 
mdettweiler's Avatar
 
Aug 2007
USA (GMT-5)

3·2,083 Posts
Default

Quote:
Originally Posted by fivemack View Post
(mdettweiler: you need to have *none* of the factors 2 mod 3 to lose the 3)
Quote:
Originally Posted by axn View Post
Which is why it can NOT lose the 3 on that iteration
Ah, I see. Thanks for the explanation.
mdettweiler is offline   Reply With Quote
Old 2009-11-13, 20:07   #527
10metreh
 
10metreh's Avatar
 
Nov 2008

2×33×43 Posts
Default

Quote:
Originally Posted by bsquared View Post
I see we've now hit 170 digits... what is the record and if not this one, what is the highest sequence?
162126 (171 digits)
10metreh is offline   Reply With Quote
Old 2009-11-13, 20:31   #528
henryzz
Just call me Henry
 
henryzz's Avatar
 
"David"
Sep 2007
Cambridge (GMT/BST)

7×292 Posts
Default

Quote:
Originally Posted by 10metreh View Post
162126 (171 digits)
looking at the database it looks like it is actually 173 digits
looking at the karsten's records page it looks like 175 digits
henryzz is offline   Reply With Quote
Reply

Thread Tools


Similar Threads
Thread Thread Starter Forum Replies Last Post
Reserved for MF - Sequence 3366 RichD Aliquot Sequences 470 2021-04-22 02:17
Reserved for MF - Sequence 3408 RichD Aliquot Sequences 474 2021-03-07 20:28
Reserved for MF - Sequence 276 kar_bon Aliquot Sequences 127 2020-12-17 10:05
Assignments are reserved but not showing up prism019 GPU to 72 6 2020-09-21 22:11
80M to 64 bits ... but not really reserved petrw1 Lone Mersenne Hunters 82 2010-01-11 01:57

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


Fri Aug 6 22:33:49 UTC 2021 up 14 days, 17:02, 1 user, load averages: 4.18, 3.77, 3.43

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.