def smallest_multiple(n):
    """
    Find the smallest number that is divisible by number 2 to n
    """
    i = 2
    for k in xrange(2, n + 1):
        if i % k > 0:
            for j in xrange(2, n + 1):
                if i * j % k == 0:
                    i *= j
                    break
    return i

if __name__ == '__main__':
    print smallest_multiple(30)

@@ -95,24 +95,41 @@
 o n%0A    %22%22%22%0A
+    l = %5B(2, 2)%5D%0A
     i = 2%0A  
@@ -304,13 +304,62 @@
     
-break
+l.append((k, j))%0A                    break%0A    print l
 %0A   
@@ -428,8 +428,8 @@
 ple(
-3
+1
 0)%0A

add a helper for problem 5 for next time I look at it