From e19001e8dc04b71acbe6c2ee88010d753bea4cee 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:38:00 +0000
Subject: [PATCH] Optimize factor finding loop bound to O(sqrt(N))

Co-authored-by: ManupaKDU <95234271+ManupaKDU@users.noreply.github.com>
---
 .../Unfinished and on going/Solution.py          | 16 +++++++++++-----
 1 file changed, 11 insertions(+), 5 deletions(-)

diff --git a/Part-1/euler's project/Unfinished and on going/Solution.py b/Part-1/euler's project/Unfinished and on going/Solution.py
index 5eca594..436b5b9 100644
--- a/Part-1/euler's project/Unfinished and on going/Solution.py	
+++ b/Part-1/euler's project/Unfinished and on going/Solution.py	
@@ -1,8 +1,14 @@
 number = 1
-while number < 8462696833 :
-    if 8462696833  % number == 0:
+target = 8462696833
+large_factors = []
+while number * number <= target:
+    if target % number == 0:
         print(number)
-        number += 1
-    else:
-        number += 1
+        if number * number != target and number != 1:
+            large_factors.append(target // number)
+    number += 1
+
+for factor in reversed(large_factors):
+    print(factor)
+
 input("  ")
\ No newline at end of file