mirror of
https://github.com/TheAlgorithms/Python.git
synced 2024-11-24 05:21:09 +00:00
583a614fef
* Deleted greatest_common_divisor def from many files and instead imported the method from Maths folder * Deleted greatest_common_divisor def from many files and instead imported the method from Maths folder, also fixed comments * [pre-commit.ci] auto fixes from pre-commit.com hooks for more information, see https://pre-commit.ci * Deleted greatest_common_divisor def from many files and instead imported the method from Maths folder, also fixed comments * Imports organized * recursive gcd function implementation rolledback * more gcd duplicates removed * more gcd duplicates removed * Update maths/carmichael_number.py * updated files * moved a file to another location --------- Co-authored-by: pre-commit-ci[bot] <66853113+pre-commit-ci[bot]@users.noreply.github.com> Co-authored-by: Tianyi Zheng <tianyizheng02@gmail.com>
61 lines
1.3 KiB
Python
61 lines
1.3 KiB
Python
from maths.greatest_common_divisor import greatest_common_divisor
|
|
|
|
"""
|
|
Project Euler Problem 5: https://projecteuler.net/problem=5
|
|
|
|
Smallest multiple
|
|
|
|
2520 is the smallest number that can be divided by each of the numbers
|
|
from 1 to 10 without any remainder.
|
|
|
|
What is the smallest positive number that is _evenly divisible_ by all
|
|
of the numbers from 1 to 20?
|
|
|
|
References:
|
|
- https://en.wiktionary.org/wiki/evenly_divisible
|
|
- https://en.wikipedia.org/wiki/Euclidean_algorithm
|
|
- https://en.wikipedia.org/wiki/Least_common_multiple
|
|
"""
|
|
|
|
|
|
def lcm(x: int, y: int) -> int:
|
|
"""
|
|
Least Common Multiple.
|
|
|
|
Using the property that lcm(a, b) * greatest_common_divisor(a, b) = a*b
|
|
|
|
>>> lcm(3, 15)
|
|
15
|
|
>>> lcm(1, 27)
|
|
27
|
|
>>> lcm(13, 27)
|
|
351
|
|
>>> lcm(64, 48)
|
|
192
|
|
"""
|
|
|
|
return (x * y) // greatest_common_divisor(x, y)
|
|
|
|
|
|
def solution(n: int = 20) -> int:
|
|
"""
|
|
Returns the smallest positive number that is evenly divisible (divisible
|
|
with no remainder) by all of the numbers from 1 to n.
|
|
|
|
>>> solution(10)
|
|
2520
|
|
>>> solution(15)
|
|
360360
|
|
>>> solution(22)
|
|
232792560
|
|
"""
|
|
|
|
g = 1
|
|
for i in range(1, n + 1):
|
|
g = lcm(g, i)
|
|
return g
|
|
|
|
|
|
if __name__ == "__main__":
|
|
print(f"{solution() = }")
|