Permuted Multiples

The solution is well-known; it is the repeating sequence in the decimal expansions of the multiples of one-seventh between 0 and 1.

Here's my source code in python,

foo = []
for i in xrange(1,1000000):
    if len(str(i*2)) == len(str(i*7)):
        pass
    else:
        continue

    foo = [str(j * i) for j in xrange(2,7)]

    set0 = list(set(foo[0]))
    sets = True
    for j in xrange(1, len(foo)):
        sets = set0 == list(set(foo[j]))
        if sets == False:
            break
    if sets == False:
        continue

    print i
    break

Have seen this problem somewhere else, can't remember where. This code displays an easy way of comparing sets of digits.

def isPermutedString(a, b): if len(a) != len(b): return False for i in a: if i not in b: return False return True

def isTrue(n): array = [n 2, n 3, n 4, n 5, n*6] for i in array: if isPermutedString(str(n), str(i))!=True: return return n

for i in range(1,10000000): isTrue(i):

http://ideone.com/Ymn0kU the program gives output 142857