"""
Euler Problem: 52

It can be seen that the number, 125874, and its double, 251748, 
contain exactly the same digits, but in a different order.

Find the smallest positive integer, x, such that 
2x, 3x, 4x, 5x, and 6x, contain the same digits.

"""

def permutedMutables(num):
	dig_set = set(str(num))

	for i in range(2, 7):
		val = num * i
		val_set = set(str(val))

		if not dig_set == val_set:
			return False

	return True

def euler52():

	num = 2

	result = False

	while not result:

		result = permutedMutables(num)
		
		if not result:
			num += 1

	return num

print(euler52())

@@ -298,18 +298,18 @@
 r(num))%0A
-%0A%09
+  
 for i in
@@ -364,17 +364,16 @@
 r(val))%0A
-%0A
 %09%09if not
@@ -409,17 +409,16 @@
 n False%0A
-%0A
 %09return 
@@ -438,17 +438,16 @@
 er52():%0A
-%0A
 %09num = 2
@@ -447,17 +447,16 @@
 num = 2%0A
-%0A
 %09result 
@@ -463,17 +463,16 @@
 = False%0A
-%0A
 %09while n
@@ -482,17 +482,16 @@
 result:%0A
-%0A
 %09%09result
@@ -519,11 +519,8 @@
 um)%0A
-%09%09%0A
 %09%09if
@@ -532,16 +532,16 @@
 result:%0A
+
 %09%09%09num +
@@ -544,17 +544,16 @@
 um += 1%0A
-%0A
 %09return 

Remove empty lines