mersenneforum.org Search Results
 User Name Remember Me? Password
 Register FAQ Search Today's Posts Mark Forums Read

 Showing results 1 to 5 of 5 Search took 0.00 seconds. Search: Posts Made By: R. Gerbicz
 Forum: YAFU 2021-06-02, 21:12 Replies: 15 Views: 1,686 Posted By R. Gerbicz A small bug, on line=76 we need: ... A small bug, on line=76 we need: while(mpz_sgn(S)!=0){ since in the next line we'll divide by S [in most cases we won't reach S=0 so the full continued fraction expansion because we exit much...
 Forum: YAFU 2021-06-02, 20:59 Replies: 15 Views: 1,686 Posted By R. Gerbicz Yes, you can use/modify etc. the code. Yes, you can use/modify etc. the code.
 Forum: YAFU 2021-06-02, 02:07 Replies: 15 Views: 1,686 Posted By R. Gerbicz OK, here it is a solution, thought that it is a... OK, here it is a solution, thought that it is a much easier code. In a few seconds: gerbicz@gerbicz-MS-7972:~/gmp-6.1.2\$ ./f...
 Forum: YAFU 2021-06-01, 21:41 Replies: 15 Views: 1,686 Posted By R. Gerbicz Right, that divisor doesn't speed up the... Right, that divisor doesn't speed up the factorisation, but here the problem is how to find that polynom if the user gives N=n/d and not the better form n. Let me work out, but it is possible to...
 Forum: YAFU 2021-06-01, 20:27 Replies: 15 Views: 1,686 Posted By R. Gerbicz What about the N=n/d numbers? For example: ... What about the N=n/d numbers? For example: b=4241; x=b^15; N=(902367*x^5-2361274*x^4+32179627*x^3-45454704*x^2+545121457701*x+16647954129297)/36417887568782; here:...
 Showing results 1 to 5 of 5

All times are UTC. The time now is 01:59.

Sun Nov 28 01:59:53 UTC 2021 up 127 days, 20:28, 0 users, load averages: 1.17, 1.22, 1.25