-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathp021.jl
More file actions
38 lines (27 loc) · 827 Bytes
/
p021.jl
File metadata and controls
38 lines (27 loc) · 827 Bytes
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
#=
Amicable numbers
Problem 21
Let d(n) be defined as the sum of proper divisors of n (numbers less than n which divide evenly into n).
If d(a) = b and d(b) = a, where a ≠ b, then a and b are an amicable pair and each of a and b are called amicable numbers.
For example, the proper divisors of 220 are 1, 2, 4, 5, 10, 11, 20, 22, 44, 55 and 110; therefore d(220) = 284. The proper divisors of 284 are 1, 2, 4, 71 and 142; so d(284) = 220.
Evaluate the sum of all the amicable numbers under 10000.
=#
include("utils/divisors.jl")
function d(n)
if n == 1
return(0)
else
return sum(proper_divisors(n))
end
end
N = 10000
total = 0
for n=2:N-1
dn = d(n)
ddnn = d(dn)
if (n == ddnn) & (n != dn)
print("amicable! $n and $dn \n")
global total += n
end
end
print("sum of amicable numbers <$N is: $total \n")