From 6297a364af515c3211266c429584ef0240a71bb5 Mon Sep 17 00:00:00 2001
From: daviddoji <daviddoji@pm.me>
Date: Wed, 25 Aug 2021 18:55:50 +0200
Subject: [PATCH] Solution to problem 30 in Julia

---
 src/Julia/Problem030.jl | 42 +++++++++++++++++++++++++++++++++++++++++
 1 file changed, 42 insertions(+)
 create mode 100644 src/Julia/Problem030.jl

diff --git a/src/Julia/Problem030.jl b/src/Julia/Problem030.jl
new file mode 100644
index 0000000..c806a4c
--- /dev/null
+++ b/src/Julia/Problem030.jl
@@ -0,0 +1,42 @@
+#=
+Created on 25 Aug 2021
+
+@author: David Doblas Jiménez
+@email: daviddoji@pm.me
+
+Solution for Problem 30 of Project Euler
+https://projecteuler.net/problem=30
+=#
+
+using BenchmarkTools
+
+function power_digit_sum(pow, n)
+    return sum(c^pow for c in reverse(digits(n)))
+end
+
+function Problem30()
+    #=
+    Surprisingly there are only three numbers that can be written as the sum
+    of fourth powers of their digits:
+
+        1634 = 1^4 + 6^4 + 3^4 + 4^4
+        8208 = 8^4 + 2^4 + 0^4 + 8^4
+        9474 = 9^4 + 4^4 + 7^4 + 4^4
+
+    As 1 = 14 is not a sum it is not included.
+
+    The sum of these numbers is 1634 + 8208 + 9474 = 19316.
+
+    Find the sum of all the numbers that can be written as the sum of fifth
+    powers of their digits.
+    =#
+    ans = sum(i for i in 2:1_000_000 if i == power_digit_sum(5, i))
+
+    return ans
+end
+
+
+println("Time to evaluate Problem 30:")
+@btime Problem30()
+println("")
+println("Result for Problem 30: ", Problem30())