Revision as of 11:17, 16 November 2021 (view source) Eliasen (talk \| contribs) (→‎{{header\|Frink}}) ← Older edit		Revision as of 11:17, 16 November 2021 (view source) Eliasen (talk \| contribs) (→‎{{header\|Frink}}) Newer edit →
Line 2,775: =={{header\|Frink}}== <lang frink>isAbundantOdd[n] := sum[allFactors[n, true, false]] > n▼ ~~<lang frink>~~ ~~/** This is a solver for the Rosetta Code problem "Abundant odd numbers"~~ ~~https://rosettacode.org/wiki/Abundant_odd_numbers~~ */ ▲isAbundantOdd[n] := sum[allFactors[n, true, false]] > n n = 3

Abundant odd numbers: Difference between revisions

Abundant odd numbers (view source)