Project Euler Solutions Added.

Project Euler/Problem 05/sol1.py

@@ -0,0 +1,20 @@
+'''
+Problem:
+2520 is the smallest number that can be divided by each of the numbers from 1 to 10 without any remainder.
+What is the smallest positive number that is evenly divisible(divisible with no remainder) by all of the numbers from 1 to N?
+'''
+
+n = int(input())
+i = 0
+while 1:
+    i+=n*(n-1)
+    nfound=0
+    for j in range(2,n):
+        if (i%j != 0):
+            nfound=1
+            break
+    if(nfound==0):
+        if(i==0):
+            i=1
+        print i
+        break