Just for fun, I had MuPAD (of 2004) running for 120h on one 2.4GHz kernel on your d:
Am 19.10.2016 um 12:42 schrieb Stefan Kohl: >> d:=208792137511016848023422421216659133913113038868420856362546192700228823547384086468768314408434778574357732094492450898877804848025959323284721735578041792204431293469827064868376517438126765900138542676486099702859181721290457656418761796076484288301990972494617227238953673093108532474354655441019362615154103484247530007425892848695540897;; and it produced no answer. That system only implements elliptic curve factoring, but it would probably have finished if all but one prime factors have at most 60-80 bit... Well, still, the runtime of even the best known factoring algorithms (ECM, GNFS) is exponential. Enjoy, |\ /| Michael Nüsken, b-it cryptography, | \/ | Room 1.22, Dahlmannstr. 2, 53113 Bonn, | \ | ++49/228/2699-214, ++49/228/2619334, | \| <http://cosec.bit.uni-bonn.de/~nuesken/>.
_______________________________________________ Forum mailing list Forum@mail.gap-system.org http://mail.gap-system.org/mailman/listinfo/forum
