Anonymous user
Square form factorization: Difference between revisions
m
→{{header|REXX}}: shortened the program.
mNo edit summary |
m (→{{header|REXX}}: shortened the program.) |
||
Line 1,219:
do #=1 for @.0; k= @.# /*get a # from the list of low factors*/
if n>big/k then do; say er 'number is too large: ' commas(k); exit 8; end
d= n
▲ p= b * QQ - p; q= QQ
if i//2==0 then if r*r==QQ then leave
qprev= q; pprev= p
end /*i*/
if i>=BB then iterate
b= (po
end /*until*/
r= gcd(n, qprev)
| |||