Abundant odd numbers: Difference between revisions
→{{header|Frink}}
Line 2,775:
=={{header|Frink}}==
Frink contains efficient functions for finding the factors of a number. It uses trial division, wheel factorization, and Pollard rho factorization.
<lang frink>isAbundantOdd[n] := sum[allFactors[n, true, false]] > n
| |||