We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
1 parent 27f3ab4 commit bba93dbCopy full SHA for bba93db
lcm.py
@@ -3,16 +3,18 @@
3
#Calculates Lowest Common Multiple
4
def compute_lcm(x, y):
5
6
- # Select larger number
7
- if x > y:
8
- larger = x
9
- else:
10
- larger = y
+ # Select larger number
+ if x > y:
+ larger = x
+ else:
+ larger = y
11
12
- while((larger % x != 0) or (larger % y != 0)):
13
- larger += 1
+ # Checks if the larger value is divisible by both numbers
+ while((larger % x != 0) or (larger % y != 0)):
14
+ # If not divisible by either number, the larger value is incremented by 1
15
+ larger += 1
16
- return larger
17
+ return larger
18
19
in1 = int(input("Insert 1st number: "))
20
in2 = int(input("Insert 2nd number: "))
0 commit comments