blob: e938bafca926c5af495b9661b3674d469af94cdb (
plain)
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
|
###
# Smallest multiple
# Problem 5
#
# 2520 is the smallest number that can be divided by each of the numbers from 1 to 10
# without any remainder.
# What is the smallest positive number that is evenly divisible by all of the numbers from
# 1 to 20?
###
using Base.Iterators
for n in Iterators.countfrom(2, 2)
# any(d -> n % d != 0, reverse(2:20)) && continue
found = true
for d in reverse(2:20)
if n % d != 0
found = false
break
end
end
if found
println(n)
break
end
end
|
