ss18
diff --git a/‎Project Euler/Problem 52/sol1.py‎
Lines changed: 23 additions & 0 deletions b/‎Project Euler/Problem 52/sol1.py‎
Lines changed: 23 additions & 0 deletions
@@ -0,0 +1,23 @@
+from __future__ import print_function
+'''
+Permuted multiples
+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.
+'''
+i = 1
+
+while True:
+	if sorted(list(str(i))) == \
+       sorted(list(str(2*i))) == \
+       sorted(list(str(3*i))) == \
+       sorted(list(str(4*i))) == \
+       sorted(list(str(5*i))) == \
+       sorted(list(str(6*i))):
+		break
+
+	i += 1
+
+print(i)