Question

НОД(345,115) НОК ( 33,144)

Answer 1

...................................

Answer 2

To find the greatest common divisor (GCD) of 345 and 115, we can use the Euclidean algorithm.

Step 1: Divide 345 by 115. 345 ÷ 115 = 3 remainder 0

Step 2: Since the remainder is 0, the GCD is 115.

Therefore, the GCD of 345 and 115 is 115.

To find the least common multiple (LCM) of 33 and 144, we can use the formula:

LCM(a, b) = (|a * b|) / GCD(a, b)

Step 1: Calculate the GCD of 33 and 144. Using the Euclidean algorithm:

144 ÷ 33 = 4 remainder 12 33 ÷ 12 = 2 remainder 9 12 ÷ 9 = 1 remainder 3 9 ÷ 3 = 3 remainder 0

The GCD of 33 and 144 is 3.

Step 2: Calculate the LCM using the formula: LCM(33, 144) = (|33 * 144|) / GCD(33, 144) LCM(33, 144) = (33 * 144) / 3 LCM(33, 144) = 4752

Therefore, the LCM of 33 and 144 is 4752.