Revision as of 10:21, 19 May 2019 (view source) Wherrera (talk \| contribs) (→‎{{header\|J}}) ← Older edit		Revision as of 10:23, 19 May 2019 (view source) Wherrera (talk \| contribs) m (→‎{{header\|Julia}}) Newer edit →
Line 174: <lang julia>using Primes function ~~factorsof~~propfact(n) f = [one(n)] for (p, x) in factor(n) Line 183: end isabundant(n) = sum(~~factorsof~~propfact(n)) > n prettyprintfactors(n) = (a = ~~factorsof~~propfact(n); println("$n has proper divisors $a, these sum to $(sum(a)).")) function oddabundantsfrom(startingint, needed, nprint=0, targetf=(x -> false))

Abundant odd numbers: Difference between revisions

Abundant odd numbers (view source)