Square form factorization: Difference between revisions

m
no edit summary
mNo edit summary
Line 234:
if (h * h == N) return h;
 
while (1m[k]) {
if (m[k] < 1) break;
if (k && (N % m[k])==0) return m[k];
//check overflow m * N