FilesExpand file tree

 master

/

gcd.py

Copy path

Blame

More file actions

Blame

More file actions

Latest commit

 

History

History

History

13 lines (11 loc) · 310 Bytes

 master

/

gcd.py

Copy path

Top

File metadata and controls

• Code
• Blame

13 lines (11 loc) · 310 Bytes

Raw

Copy raw file

Download raw file

Open symbols panel

Edit and raw actions

1

2

3

4

5

6

7

8

9

10

11

12

13

def gcd(a, b):

"""Computes the greatest common divisor of integers a and b using

Euclid's Algorithm.

"""

while True:

if b == 0:

return a

a, b = b, a % b

def lcm(a, b):

"""Computes the lowest common multiple of integers a and b."""

return a * b / gcd(a, b)