From 286d1b564b82930b86948120b471c68543908c45 Mon Sep 17 00:00:00 2001 From: daviddoji Date: Fri, 5 Aug 2022 21:58:00 +0200 Subject: [PATCH] Solution to problem 63 in Python --- src/Python/Problem063.py | 35 +++++++++++++++++++++++++++++++++++ 1 file changed, 35 insertions(+) create mode 100644 src/Python/Problem063.py diff --git a/src/Python/Problem063.py b/src/Python/Problem063.py new file mode 100644 index 0000000..9f9057a --- /dev/null +++ b/src/Python/Problem063.py @@ -0,0 +1,35 @@ +#!/usr/bin/env python3 +""" +Created on 05 Aug 2022 + +@author: David Doblas Jiménez +@email: daviddoji@pm.me + +Solution for problem 63 of Project Euler +https://projecteuler.net/problem=63 +""" + +from utils import timeit + + +@timeit("Problem 63") +def compute(): + """ + The 5-digit number, 16807=7^5, is also a fifth power. Similarly, the + 9-digit number, 134217728=8^9, is a ninth power. + + How many n-digit positive integers exist which are also an nth power? + """ + ans = 0 + # no need to go higher than 10, because 10**2 = 100 + for number in range(1, 10): + for pow in range(1, 30): + if len(str(number**pow)) == pow: + ans += 1 + + return ans + + +if __name__ == "__main__": + + print(f"Result for Problem 63: {compute()}")