7 { "3", "5", "17", "257", "641", "65537", "274177", "2424833", "6700417", "45592577",
8 "6487031809", "67280421310721", "1238926361552897", "59649589127497217",
9 "5704689200685129054721", "4659775785220018543264560743076778192897",
10 "7455602825647884208337395736200454918783366342657",
11 "93461639715357977769163558199606896584051237541638188580280321",
13 "741640062627530801524787141901937474059940781097519023905821316144415759504705008092818711693940737",
15 "130439874405488189727484768796509903946608530841611892186895295776832416251471863574140227977573104895898783928842923844831149032913798729088601617946094119449010595906710130531906171018354491609619193912488538116080712299672322806217820753127014424577"
21 printmp(mpint *b, char *tag)
26 print("%s (%d) ", tag, b->top);
27 p = mptoa(b, 10, nil, 0);
28 write(1, p, strlen(p));
49 main(int argc, char **argv)
51 mpint *p, *k, *d, *b, *e, *x, *r;
55 fmtinstall('B', mpconv);
56 mpsetminbits(2*Dbits);
73 // k = 2^29440 - 2^27392
75 // p = 2^29440 - 2^27392 + 1
78 // if(!probably_prime(p, 18)){
79 // print("not a prime\n");
82 // print("probably prime\n");
90 print("timing %d\n", timing());
92 for(i = 0; i < nelem(sfactors); i++){
93 d = strtomp(sfactors[i], nil, 10, nil);
101 print("timing %d\n", timing());