Question

НСД(328;624)НСД(18;24)​

Answer 1

Ответ:

НСД(18,24)=6

18=6×3

24=6×4

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

Answer 2

To find the greatest common divisor (GCD) of two numbers, you can use the Euclidean algorithm. Let's calculate the GCD of 328 and 624, and then the GCD of 18 and 24.

1. GCD(328, 624):

Divide 624 by 328: 624 ÷ 328 = 1 remainder 296

Now, divide the divisor (328) by the remainder (296): 328 ÷ 296 = 1 remainder 32

Continue dividing the previous remainder (296) by the latest remainder (32): 296 ÷ 32 = 9 remainder 8

Repeat the process: 32 ÷ 8 = 4 remainder 0

Since the remainder is now 0, we stop. The last non-zero remainder obtained is 8.

Therefore, GCD(328, 624) = 8.

2. GCD(18, 24):

Divide 24 by 18: 24 ÷ 18 = 1 remainder 6

Now, divide the divisor (18) by the remainder (6): 18 ÷ 6 = 3 remainder 0

Since the remainder is now 0, we stop. The last non-zero remainder obtained is 6.

Therefore, GCD(18, 24) = 6.

So, the GCD(328, 624) = 8 and the GCD(18, 24) = 6.