Question

НОД (330;210)=? *1 балл​

Answer 1

Ответ:

330 = 2⋅3⋅5⋅11

210 = 2⋅3⋅5⋅7

НОК(330,210) = 2⋅3⋅5⋅11⋅7 = 2310

НОД(330,210) = 2⋅3⋅5 = 30

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

Answer 2

Ответ:

330 2  

165 3

55 5

11 11

5

330=11*5*3*2

210 2

105 3

35 5

7 7

5

210 = 7*5*3*2

Answer 3

To find the greatest common divisor (GCD) of two numbers, 330 and 210, you can use the Euclidean algorithm. Here's how you can calculate it:

1. Divide the larger number (in this case, 330) by the smaller number (210) and find the remainder. 330 ÷ 210 = 1 remainder 120

2. Now, divide the previous divisor (210) by the remainder (120) and find the new remainder. 210 ÷ 120 = 1 remainder 90

3. Repeat the previous step with the previous divisor (120) and the new remainder (90). 120 ÷ 90 = 1 remainder 30

4. Continue this process until the remainder becomes 0. 90 ÷ 30 = 3 remainder 0

Since the remainder has become 0, the last non-zero remainder (30) is the greatest common divisor (GCD) of 330 and 210.

Therefore, the GCD of 330 and 210 is 30.