Project Euler Solutions Added.

Project Euler/Problem 03/sol1.py

@@ -0,0 +1,38 @@
+'''
+Problem:
+The prime factors of 13195 are 5,7,13 and 29. What is the largest prime factor of a given number N?
+e.g. for 10, largest prime factor = 5. For 17, largest prime factor = 17.
+'''
+
+import math
+
+def isprime(no):
+    if(no==2):
+        return True
+    elif (no%2==0):
+        return False
+    sq = int(math.sqrt(no))+1
+    for i in range(3,sq,2):
+        if(no%i==0):
+            return False
+    return True
+
+max=0
+n=int(input())
+if(isprime(n)):
+    print n
+else:
+    while (n%2==0):
+        n=n/2
+    if(isprime(n)):
+        print n
+    else:
+        n1 = int(math.sqrt(n))+1
+        for i in range(3,n1,2):
+            if(n%i==0):
+                if(isprime(n/i)):
+                    max=n/i
+                    break
+                elif(isprime(i)):
+                    max=i
+        print max