Question

НОД(55 и 45)НОК(44 и 33)НОК (63 и 18)НОД (115 и 92)​

Answer 1

Ответ:

5;

132;

126;

23;

Answer 2

Ответ:

Пошаговое объяснение:

1)

55:5=11

45:5=9

2)

44*3=132

33*4=132

3)

63*2=126

18*7=126

4)

-------

Answer 3

To find the greatest common divisor (GCD) and the least common multiple (LCM) of the given numbers, we can use the following formulas:

1. GCD(a, b): This function calculates the greatest common divisor of numbers a and b.
2. LCM(a, b): This function calculates the least common multiple of numbers a and b.

Let's calculate the requested values:

GCD(55, 45): To find the GCD of 55 and 45, we can use the Euclidean algorithm. 55 = 1 * 45 + 10 45 = 4 * 10 + 5 10 = 2 * 5 + 0

The remainder becomes 0, so the GCD(55, 45) is the last non-zero remainder, which is 5.

LCM(44, 33): To find the LCM of 44 and 33, we can use the formula: LCM(a, b) = (|a * b|) / GCD(a, b)

GCD(44, 33) = 11 LCM(44, 33) = (|44 * 33|) / GCD(44, 33) = (1452) / 11 = 132

LCM(63, 18): To find the LCM of 63 and 18, we can again use the formula: LCM(a, b) = (|a * b|) / GCD(a, b)

GCD(63, 18) = 9 LCM(63, 18) = (|63 * 18|) / GCD(63, 18) = (1134) / 9 = 126

GCD(115, 92): To find the GCD of 115 and 92, we can use the Euclidean algorithm. 115 = 1 * 92 + 23 92 = 4 * 23 + 0

The remainder becomes 0, so the GCD(115, 92) is the last non-zero remainder, which is 23.

Therefore, the requested values are: GCD(55, 45) = 5 LCM(44, 33) = 132 LCM(63, 18) = 126 GCD(115, 92) = 23