НОД(30,100,60

To find the greatest common divisor (НОД) of 30, 100, and 60, you can use the Euclidean algorithm.

1. We start by finding the НОД of 30 and 100:

   • Divide 100 by 30: 100 ÷ 30 = 3, remainder 10.
   • Now, divide 30 by 10: 30 ÷ 10 = 3, remainder 0.
   • Since the remainder is 0, we have found the НОД of 30 and 100, which is 10.

2. Now, we find the НОД of 10 and 60:

   • Divide 60 by 10: 60 ÷ 10 = 6, remainder 0.
   • Since the remainder is 0, we have found the НОД of 10 and 60, which is 10.

Therefore, the НОД of 30, 100, and 60 is 10.