Python/project_euler/problem_052/sol1.py
Caeden a652905b60
Add Flake8 comprehensions to pre-commit ()
* ci(pre-commit): Add ``flake8-comprehensions`` to ``pre-commit`` ()

* refactor: Fix ``flake8-comprehensions`` errors

* fix: Replace `map` with generator ()

* fix: Cast `range` objects to `list`
2022-10-15 19:29:42 +02:00

38 lines
766 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(str(i))
== sorted(str(2 * i))
== sorted(str(3 * i))
== sorted(str(4 * i))
== sorted(str(5 * i))
== sorted(str(6 * i))
):
return i
i += 1
if __name__ == "__main__":
print(solution())