You could try this function to compute the sum of divisors faster, and
using very little memory:
~~~
function sumFactors(n)
f = 1
for (p,e) in factor(n)
f *= div(p^(e+1)-1,p-1)
end
return f
end
~~~
- Re: [julia-users] performance ... Stefan Schwarz
- [julia-users] Re: performance compared to mathematica Johan Sigfrids
- [julia-users] Re: performance compared to mathemati... Jason Merrill
- [julia-users] Re: performance compared to mathe... Jason Merrill
- [julia-users] Re: performance compared to m... Stefan Schwarz
- [julia-users] Re: performance compared ... Jason Merrill
- [julia-users] Re: performance comp... Stefan Schwarz
- Re: [julia-users] Re: performa... Tim Holy
- Re: [julia-users] Re: performa... Stefan Schwarz
- Re: [julia-users] Re: performa... Tim Holy
- Re: [julia-users] Re: performa... Laszlo Hars
- Re: [julia-users] Re: performa... Jason Merrill
- Re: [julia-users] Re: performa... Laszlo Hars
- Re: [julia-users] Re: performa... Stefan Schwarz
- Re: [julia-users] Re: performa... Mike Innes
- Re: [julia-users] Re: performa... Stefan Schwarz
- Re: [julia-users] Re: performa... Stefan Karpinski
- Re: [julia-users] Re: performa... Stefan Schwarz
- Re: [julia-users] Re: performa... Laszlo Hars
- [julia-users] Re: performance ... Steven G. Johnson
- [julia-users] Re: performance compared to mathe... Jason Merrill
