Question

НОД(1320,930)Пж помогите

Answer 1

(1320,930)
Оба числа делятся на 10,
(они заканчиваются на 0)
разделим их на 10

(132, 93)

Эти оба числа делятся на 3 ( сумма цифр делится на 3)

Разделим оба числа на на 3
(44, 31)
Больше общих делителей нет,
тк 31 -простое число.

Поэтому НОД (1320, 930)=10*3=30

Answer 2

1320=2×2×2×3×5×11
930=2×3×5×31
НОД(1320;930)=2×3×5=30

Answer 3

Sure, I can help you find the greatest common divisor (GCD) of 1320 and 930, also known as the greatest common factor (GCF) or highest common divisor (HCD).

There are several methods to find the GCD of two numbers. One common approach is using the Euclidean algorithm. Here's how you can do it step by step:

Step 1: Find the remainder of the division of the larger number by the smaller number. Step 2: Replace the larger number with the smaller number, and the smaller number with the remainder obtained in step 1. Step 3: Repeat steps 1 and 2 until the remainder is zero. The last non-zero remainder is the GCD.

Let's apply the Euclidean algorithm:

Given numbers: 1320 and 930

Step 1: 1320 ÷ 930 = 1 with a remainder of 390 Step 2: Swap the numbers, so now we have 930 and 390 Step 3: 930 ÷ 390 = 2 with a remainder of 150 Step 4: Swap again, now we have 390 and 150 Step 5: 390 ÷ 150 = 2 with a remainder of 90 Step 6: Swap again, now we have 150 and 90 Step 7: 150 ÷ 90 = 1 with a remainder of 60 Step 8: Swap again, now we have 90 and 60 Step 9: 90 ÷ 60 = 1 with a remainder of 30 Step 10: Swap again, now we have 60 and 30 Step 11: 60 ÷ 30 = 2 with a remainder of 0

Since the remainder is now zero, we stop, and the last non-zero remainder we obtained is 30. Therefore, the GCD of 1320 and 930 is 30.

So, the answer is:

НОД(1320, 930) = 30