Largest proper divisor of n: Difference between revisions
→{{header|Frink}}
(Frink) |
|||
Line 809:
=={{header|Frink}}==
Frink contains efficient routines for factoring numbers. It uses trial division, wheel factoring, and Pollard rho factoring.
<lang frink>for n = 1 to 100
println[last[allFactors[n,true,false]]]</lang>
| |||