From c793c7e9dd524e78d0530cd5da9827ffa497de79 Mon Sep 17 00:00:00 2001 From: daviddoji Date: Sat, 5 Jun 2021 14:42:04 +0200 Subject: [PATCH] Solution for problem 3 --- src/Python/Problem003.py | 34 ++++++++++++++++++++++++++++++++++ 1 file changed, 34 insertions(+) create mode 100644 src/Python/Problem003.py diff --git a/src/Python/Problem003.py b/src/Python/Problem003.py new file mode 100644 index 0000000..e28df20 --- /dev/null +++ b/src/Python/Problem003.py @@ -0,0 +1,34 @@ +#!/usr/bin/env python3 +""" +Created on 18 Mar 2017 + +@author: David Doblas Jiménez +@email: daviddoji@pm.me + +Solution for problem 3 of Project Euler +https://projecteuler.net/problem=3 +""" + +from utils import timeit + + +@timeit("Problem 3") +def compute(): + """ + The prime factors of 13195 are 5, 7, 13 and 29. + + What is the largest prime factor of the number 600851475143 ? + """ + target = 600851475143 + ans = 2 + while ans * ans < target: + while target % ans == 0: + target = target // ans + ans += 1 + + return target + + +if __name__ == "__main__": + + print(f"Result for problem 3: {compute()}")