fun with msieve

[masser]

We have a handful of unfactored candidates in our dat file that our perfect candidates for msieve's QS. I thought that as a fun side project we could individually reserve these candidates and factor them. I'm taking the smallest...

Riesel Candidates:
136804*5^137-1 = p39*p63 completed by masser
105782*5^138-1 = p45*p57 completed by CedricVonck
45742*5^143-1 = p36*p69 completed by Andi_HB
48394*5^143-1 = p48*p58 completed by fivemack
326834*5^146-1 = p34*p75 completed by jasonp
341552*5^146-1 = p45*p63 completed by michaf
151026*5^149-1 = p50*p61 completed by michaf
227968*5^149-1 = p29*p81 completed by michaf
52922*5^172-1 = p59*p67 completed by fivemack

Sierpinski Candidates:
139606*5^138+1 = p48*p54 completed by CedricVonck
36412*5^142+1 = p36*p69 completed by masser
7528*5^144+1 = p53*p53 completed by tnerual
7528*5^204+1 = p30*p38*p80 completed by michaf

[ValerieVonck]

105728*5^138-1

303424 479306 002962 994430 118670 492165 586943 046841 795091 489446 534183 
116455 096751 451492 309570 312499 999999 = 13 x 9253 236689 x 1266 808956 
953719 x 1578 130914 108251 x 1 261709 691985 837549 804394 020647 407782 
872228 080561 032039 040503 

Number of divisors:  32 

Sum of divisors:  326764 823903 317226 169656 635163 679627 792409 514426 
309646 211060 937156 072427 317138 002815 464891 295543 321600 

Euler's Totient:  280084 134713 733561 998143 409157 619978 601946 686908 
631323 121643 102329 614804 914354 548261 823484 464618 432000 

Moebius: -1

Sum of squares: a^2 + b^2 + c^2 + d^2
a = 509 578652 859514 110262 446571 387571 306621 285850 070151 
b = 179 963123 989921 587242 259236 911799 112024 688349 874834 
c = 106 352649 467370 338902 569982 215651 915717 946638 779769 
d = 7 514240 543430 570079 959183 214566 466391 344730 749659

[ValerieVonck]

I will try:

139606*5^138+1

[masser]

Thanks Cedric,

That should have been 105782, not 105728 - fixed it.

thanks again,
masser

[tnerual]

taking 7528*5^144+1

[R. Gerbicz]

Originally Posted by masser

We have a handful of unfactored candidates in our dat file that our perfect candidates for msieve's QS. I thought that as a fun side project we could individually reserve these candidates and factor them. I'm taking the smallest...

Riesel Candidates:
136804*5^137-1 reserved by masser
105782*5^138-1
45742*5^143-1
48394*5^143-1


Sierpinski Candidates:
139606*5^138+1 reserved by CedricVonck
36412*5^142+1
7528*5^144+1

Do you know that all of these numbers are SNFS type numbers?

[Xentar]

Originally Posted by R. Gerbicz

Do you know that all of these numbers are SNFS type numbers?

Eh, what does this mean?

[masser]

I did not know that, but I did a little reading. Thanks for the tip.

If anyone wants to factor any of the numbers listed above, don't feel that you have to use msieve. Use whatever working software that you feel is best. If you have a working implementation of ggnfs, snfs, etc - feel free to use it.

I only mentioned msieve because it is easy to get a working executable on most platforms and it is easy to use.

Originally Posted by R. Gerbicz

Do you know that all of these numbers are SNFS type numbers?

[ValerieVonck]

Ok I will do 105782*5^138-1 first.

[tnerual]

7528*5^144+1 has 2 factors ...

prp53 factor: 17625292660393933993715294243940883577607947975104903
prp53 factor: 19152430621509256665764579999340472696383438534215567
elapsed time 42:44:31

one core of a centrino duo 1600

it's submitted in the sieve import

[masser]

I was under the impression that all of these numbers had been heavily P-1, P+1, and ECMed. I guess not:

136804*5^137-1 = p39*p63


Taking 36412*5^142+1...