aboutsummaryrefslogtreecommitdiff
path: root/julia/005-smallest_multiple.jl
diff options
context:
space:
mode:
authorCharles Cabergs <me@cacharle.xyz>2021-06-18 21:50:31 +0200
committerCharles Cabergs <me@cacharle.xyz>2021-06-18 21:50:31 +0200
commit93b4c2a215556153ed948260678cd8e840493b39 (patch)
tree393edc821a5cd00db7971b4612c98855ff762945 /julia/005-smallest_multiple.jl
parentc0aeed4578bdaea39ddbed1b55896948f56b23f3 (diff)
downloadproject_euler-93b4c2a215556153ed948260678cd8e840493b39.tar.gz
project_euler-93b4c2a215556153ed948260678cd8e840493b39.tar.bz2
project_euler-93b4c2a215556153ed948260678cd8e840493b39.zip
problem 3 4 5 6 6 in julia
Diffstat (limited to 'julia/005-smallest_multiple.jl')
-rw-r--r--julia/005-smallest_multiple.jl26
1 files changed, 26 insertions, 0 deletions
diff --git a/julia/005-smallest_multiple.jl b/julia/005-smallest_multiple.jl
new file mode 100644
index 0000000..e938baf
--- /dev/null
+++ b/julia/005-smallest_multiple.jl
@@ -0,0 +1,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