euler codes

Author: DebjitHore

euler_3.py

@@ -1,11 +1,20 @@
-num= 50
+num= 60085147514
+
 term=0
-i=2
-j=2
+counter=0
+counter2=0
 for i in range (2, num):
-    if(num%i==0):
-        for j in range (2, i):
-            if(i%j != 0):
-                term=i
-        
-print(term)
+    if (num% i == 0):
+        counter2=1
+        for j in range(2, i):
+            if(i%j == 0 ):
+                counter=1
+        if (counter == 0):
+            term= i
+        else: 
+            continue
+    if (counter2==0):
+        term= num
+print(term)
+         
+  

euler_3v2.0.py

@@ -0,0 +1,17 @@
+def Largest_Prime_Factor(n):
+    prime_factor = 1
+    i = 2
+
+    while i <= n / i:
+        if n % i == 0:
+            prime_factor = i
+            n /= i
+        else:
+            i += 1
+
+    if prime_factor < n:
+        prime_factor = n
+
+    return prime_factor
+ 
+print(Largest_Prime_Factor(600851475143))

euler_4.py

@@ -0,0 +1,21 @@
+import math
+n2=0
+num_list=[]
+for j in range(100, 999):
+    for k in range(100,999):
+        num=j*k
+        n= j*k
+        i= int(math.log10(num))  #gives no of digits in current num
+        while (num>0):
+            t= num%10
+            n2=n2+t*(10**i)
+            i-=1
+            num= num/10
+        if(n2==n):
+            num_list.append(n2)
+        n2=0
+answer= max(num_list)
+print(answer)
+
+
+