375ml/2000ml=375/2000 Then, find their GCD (or HCF), which is 125. 375/2000=375/125 and 2000/125 = 3/16
75, 150, 225, 300, 375
75, 150, 225, 300, 375
Euclid's algorithm is a popular algorithm to compute the GCD of two numbers. Algorithm: Gcd(a,b) = Gcd(b, a mod b), where a>=b and Gcd(a,0) = a Say we want to find the GCD of 72 and 105. 105 mod 72 = 33, so GCD(72,105) = GCD(33,72) 72 mod 33 = 6, so GCD(33,72) = GCD(6,33) 33 mod 6 = 3 so GCD(6,33) = GCD(3,6) 6 mod 3 = 0 so GCD(3,6) = GCD(0,3) = 3. So the GCD of 72 and 105 is 3.
75, 150, 225, 300, 375, 450, 525, 600, 675, 750, 825, 900, 975, . . .
GCD(125, 225) = 25 GCD(125, 225) = 25 GCD(125, 225) = 25 GCD(125, 225) = 25
Greatest Common Divisor (GCD) for 135 225 is 45.
Euclid's Algorithm (http://www.cs.berkeley.edu/~vazirani/s99cs170/notes/lec3.pdf). the mod function (or %, as used here) is equal to the remainder of x/y. In this first case, 375 mod 275 = the remainder of 375/275, 375/275 is 1 r100 thus 375%275=100. gcd(375,275) => gcd(275,375%275) = gcd(275,100) =>gcd(100,275%100) = gcd(100,75) => gcd(75,100%75) = gcd(75,25) => gcd(25,75%25) = gcd(25,0) ===> gcd is 25.
Greatest Common Divisor (GCD) for 180 225 is 45.
The least common multiple of the numbers 375 and 225 is 1,125.
The Least Common Multiple (LCM) for 375 225 is 1,125
The Greatest Common Divisor (GCD) for 120 375 is 15.
The least common multiple of 150, 225, and 375 is 2,250.
The Greatest Common Divisor (GCD) for 180 225 is 45.
375ml/2000ml=375/2000 Then, find their GCD (or HCF), which is 125. 375/2000=375/125 and 2000/125 = 3/16
1125
375