Square form factorization: Difference between revisions

 

Even so, there are two examples which fail (1000000000000000127 and 1537228672809128917) because the code is unable to process enough 'multipliers' before an overflow situation is encountered. To deal with this, the program automatically switches to BigInt to process such cases.

<lang ecmascript>import "/long" for ULong

import "/big" for BigInt

import "/fmt" for Fmt

 

1, 3, 5, 7, 11, 3*5, 3*7, 3*11, 5*7, 5*11, 7*11, 3*5*7, 3*5*11, 3*7*11, 5*7*11, 3*5*7*11

]

 

var squfof = Fn.new { |N|

if (s*s == N) return s

var T = ULong

var n = N

T = BigInt

n = BigInt.new(n.toString)

}

var P = D.isqrt

var Pprev = P

var Qprev = T.one

var Q = D - Po*Po

var B = 3 * L

var i = 2

q = Q

Q = Qprev + b * (Pprev - P)

if ((i & 1) == 0 && r*r == Q) break

Qprev = q