mirror of
https://github.com/TheAlgorithms/Python.git
synced 2024-10-07 14:19:31 +00:00
44254cf112
* Rename all Project Euler directories: Reason: The change was done to maintain consistency throughout the directory and to keep all directories in sorted order. Due to the above change, some config files had to be modified: 'problem_22` -> `problem_022` * Update scripts to pad zeroes in PE directories
38 lines
802 B
Python
38 lines
802 B
Python
"""
|
|
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.
|
|
"""
|
|
|
|
|
|
def solution():
|
|
"""Returns the smallest positive integer, x, such that 2x, 3x, 4x, 5x, and
|
|
6x, contain the same digits.
|
|
|
|
>>> solution()
|
|
142857
|
|
"""
|
|
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)))
|
|
):
|
|
return i
|
|
|
|
i += 1
|
|
|
|
|
|
if __name__ == "__main__":
|
|
print(solution())
|