Anonymous user
Square form factorization: Difference between revisions
m
→{{header|REXX}}: added a comment to the REXX section header.
m (→{{header|REXX}}: optimized a compound IF statement in the 1st nested DO loop.) |
m (→{{header|REXX}}: added a comment to the REXX section header.) |
||
Line 691:
This REXX version is a modified version of the '''C''' code in the Wikipedia's article
at [https://en.wikipedia.org/wiki/Shanks%27s_square_forms_factorization Shanks' square forms factorization].
The only "failure" of this REXX version of Shanks' square forms factorization is because the number being tested is a prime
<br>(1,002,742,628,021).
<lang rexx>/*REXX pgm factors an integer using Daniel Shanks' (1917-1996) square form factorization*/
numeric digits 100 /*ensure enough decimal digits.*/
| |||