Question

НОД (17,28) НОД(6,8,3)

Answer 1

Ответ:

НОД (17,28). НОД (6,8,3)=1

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

17=17

28=2*2*7 общий множитель1

6=2*3

8=2*2*2

3=3 общий множитель1

Answer 2

To find the greatest common divisor (GCD) of two or more numbers, you can use the Euclidean algorithm. Let's calculate the requested GCDs:

1. GCD(17, 28): To find the GCD of 17 and 28, we apply the Euclidean algorithm:

scssCopy code
GCD(17, 28) = GCD(28, 17) = GCD(17, 11) = GCD(11, 6) = GCD(6, 5) = GCD(5, 1) = 1

So, the GCD of 17 and 28 is 1.

2. GCD(6, 8, 3): To find the GCD of 6, 8, and 3, we can first find the GCD of the first two numbers, and then take the GCD of the result with the third number:

scssCopy code
GCD(6, 8) = GCD(8, 6) = GCD(6, 2) = GCD(2, 0) = 2

Now, we find the GCD of 2 and 3:

scssCopy code
GCD(2, 3) = GCD(3, 2) = GCD(2, 1) = GCD(1, 0) = 1

The final GCD of 6, 8, and 3 is 1.

So, the results are:

• GCD(17, 28) = 1
• GCD(6, 8, 3) = 1