Question

Пж решите НОД НОД(72,108)=

Answer 1

Ответ:

НОД(72,108)= 2×2×3×3=36

72|2. 108|2

36|2. 54|2

18|2. 27|3

9|3. 9|3

3|3. 3|3

1| 1|

Answer 2

To find the greatest common divisor (GCD) of two numbers, we can use the Euclidean algorithm. The Euclidean algorithm is an efficient method for finding the GCD of two numbers by repeatedly dividing the larger number by the smaller number and taking the remainder until the remainder is zero. The GCD is then the last non-zero remainder.

Let's use the Euclidean algorithm to find the GCD of 72 and 108:

1. Divide 108 by 72: 108 ÷ 72 = 1 with a remainder of 36. 2. Divide 72 by 36: 72 ÷ 36 = 2 with a remainder of 0.

Since the remainder is now zero, we stop. The GCD of 72 and 108 is the last non-zero remainder, which is 36.

Therefore, the GCD of 72 and 108 is 36.

Please let me know if there's anything else I can help you with!