![]() |
|
|
#45 | |
|
(loop (#_fork))
Feb 2006
Cambridge, England
191316 Posts |
Quote:
polcyclo(38,2^31-1)%C142 should give 0 polcyclo(19,2^31-1)%C142 won't |
|
|
|
|
|
|
#46 |
|
Jun 2012
22×13×59 Posts |
Thanks for clarifying. Think I’ve got it now.
|
|
|
|
|
|
#47 |
|
Jan 2013
3816 Posts |
@Dr Sardonicus:
For us here, Arifeullians are not a thing, + is interesting only to the extent that it is a factor of some -, and as Robert Silverman reminded me just the other day, we should not call these numbers "Cunnigham" even though Cunnigham himself did consider b=2^7-1... @swellman two c's, one capital and one lowercase are going to confuse people. To illustrate what I was trying to say, this cofactor, lets call it C142_M31_k38, first appears in k=38, then reappears at k=76 (thats what fivemack was checking, the C142 is not a factor of the polcyclo(19) or of k=19). So, looking at the tables is enough to know that it is coming from the 38th cyclotomic polynomial, but its nice to check with pari/gp. So, I agree with fivemack, but let's use letter "k" instead of "c", haha ;-) Note added: cyclotomic comes from greek "kyklos" which is circle and "tome" which a cut or division, so letter k is appropriate. Last fiddled with by kosta on 2018-04-29 at 02:09 |
|
|
|
|
|
#48 |
|
Romulan Interpreter
Jun 2011
Thailand
22·33·89 Posts |
Wow! It looks like you found a mersenne prime which is also the exponent of another mersenne prime...
|
|
|
|
|
|
#49 |
|
Jun 2012
1011111111002 Posts |
C156_M31_k25 is factored by SNFS. Reported to factordb.
Code:
p60=656850278015660339603725017552344842197915229736126332594501 p96=190674419612794339208450258722749530575116801131660918678504876289052717128834680829986573454701 |
|
|
|
|
|
#50 |
|
(loop (#_fork))
Feb 2006
Cambridge, England
641910 Posts |
OK, I went to SNFS much too early. C187_M31_k23 is done
Code:
p22 factor: 2476363315760296607893 p33 factor: 525435349751786867693675066811697 p42 factor: 981837273061848593364978172320737104860391 p91 factor: 3440781771197002299203508060084665118254362958353613892296460316185452235397587206400281609 |
|
|
|
|
|
#51 |
|
Jun 2012
22·13·59 Posts |
If anyone is interested, there’s always C177_M31_k44 available for G/SNFS. Yoyo@Home seems to have mined out all the easy factors for M31 long ago.
I’m finishing up C142_M31_c38 now. @kosta - Are there other Mersenne bases to be considered other than M31, M61 and M127? |
|
|
|
|
|
#52 |
|
Jan 2013
23·7 Posts |
@swellman
M7 is of some interest, but this one has been done to very high powers. I am trying yet other strategies to obtain full factorizations for M127: running ecm on k>100 hoping to get a lucky hit on a big prime cofactor. There is less than a one in a thousand chance of success :-( I've also written a libpari C program to search for primes of the same form, with all prime k. Sadly, no luck here either, all the way up to k <= 10,000 |
|
|
|
|
|
#53 |
|
(loop (#_fork))
Feb 2006
Cambridge, England
72·131 Posts |
I'm confused as to why you say that, when I've just found some annoyingly trivial factors for M31_k23 ... I have set a fair amount of ECM going on M31_k29, that and M31_k31 would be heavy SNFS jobs but just about practical for nfs@home.
Last fiddled with by fivemack on 2018-05-04 at 14:50 |
|
|
|
|
|
#54 |
|
(loop (#_fork))
Feb 2006
Cambridge, England
72×131 Posts |
I found a P30 ( 281801749001573550949215731459 ) in M31_k29 within three minutes of starting to look; it looks as if yoyo@home only looked at k not coprime to 240.
Last fiddled with by fivemack on 2018-05-04 at 13:54 |
|
|
|
|
|
#55 | |
|
Jun 2012
22×13×59 Posts |
Quote:
C177_M31_k44 Is still an interesting target, though some ECM to t55 might be prudent! |
|
|
|
|
![]() |
Similar Threads
|
||||
| Thread | Thread Starter | Forum | Replies | Last Post |
| Stop Reporting M127 | jinydu | Information & Answers | 7 | 2008-09-07 06:45 |