View Single Post
Old 2020-03-24, 20:53   #74
RedGolpe
 
RedGolpe's Avatar
 
Aug 2006
Monza, Italy

2·19 Posts
Default

I just discovered that factor(2^308+97) also fails but has no factors below 10000. However, it fails with
Code:
>> factor(2^308+97)
fac: factoring 521481209941628438084722096232800809229175908778479680162851955034721612739414196782949728353
fac: using pretesting plan: normal
fac: using specified qs/gnfs crossover of 93 digits
fac: using specified qs/snfs crossover of 75 digits
div: primes less than 10000
fmt: 1000000 iterations
rho: x^2 + 3, starting 200 iterations on C93
rho: found prp6 factor = 785033
rho: x^2 + 3, starting 200 iterations on C87
rho: x^2 + 2, starting 200 iterations on C87
rho: x^2 + 1, starting 200 iterations on C87
nfs: searching for brent special forms...
nfs: input divides 2^308 + 97
Segmentation fault (core dumped)
while factor(2) fails with
Code:
>> factor(2)
fac: factoring 2
fac: using pretesting plan: normal
fac: using specified qs/gnfs crossover of 93 digits
fac: using specified qs/snfs crossover of 75 digits
div: primes less than 10000
Segmentation fault (core dumped)
RedGolpe is offline   Reply With Quote