From 262400c3b5fb989af9674c65d6d7364484293683 Mon Sep 17 00:00:00 2001
From: "google-labs-jules[bot]"
 <161369871+google-labs-jules[bot]@users.noreply.github.com>
Date: Sat, 13 Jun 2026 12:36:38 +0000
Subject: [PATCH] perf: optimize loop bounds for finding factors in Problem 3

Change the upper bound of the `while` loop finding factors of `600851475143`
from `N` to `int(N**0.5)`. This reduces the number of loop iterations from
600+ billion to ~775,000, significantly improving execution time from timing
out (>5 seconds) to under 1 second.

Co-authored-by: ManupaKDU <95234271+ManupaKDU@users.noreply.github.com>
---
 Part-1/euler's project/Projects done/Problem 3.py | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/Part-1/euler's project/Projects done/Problem 3.py b/Part-1/euler's project/Projects done/Problem 3.py
index 66ce6dd..e351901 100644
--- a/Part-1/euler's project/Projects done/Problem 3.py	
+++ b/Part-1/euler's project/Projects done/Problem 3.py	
@@ -1,5 +1,5 @@
 number = 1
-while number < 600851475143 :
+while number <= int(600851475143**0.5):
     if 600851475143 % number == 0:
         num = number