Question

НОД 6 И 15 НОД 18 И 24 НОД 24 И 40 НОД 14 И 28 НОД 8 И 15 НОД 120 И 150

Answer 1

Ответ:

1)НОД ( 6;15)=3                                                                                                 2)НОД ( 18; 24)=6                                                                                              3)НОД (24;40)=8                                                                                                 4)НОД (14; 28)=14                                                                                           5)НОД ( 8;15)=1                                                                                                 6)НОД (120;150)=30

Answer 2

Ответ:

1)3

2)6

3)8

4)14

5)1

6)30

Answer 3

To find the greatest common divisor (GCD) of two numbers, you can use the Euclidean algorithm. Let's calculate the GCD for the pairs you provided:

1. GCD(6, 15): Using the Euclidean algorithm: 15 = 2 * 6 + 3 6 = 2 * 3 + 0

The remainder is 0, so the GCD of 6 and 15 is 3.

2. GCD(18, 24): Using the Euclidean algorithm: 24 = 1 * 18 + 6 18 = 3 * 6 + 0

The remainder is 0, so the GCD of 18 and 24 is 6.

3. GCD(24, 40): Using the Euclidean algorithm: 40 = 1 * 24 + 16 24 = 1 * 16 + 8 16 = 2 * 8 + 0

The remainder is 0, so the GCD of 24 and 40 is 8.

4. GCD(14, 28): Using the Euclidean algorithm: 28 = 2 * 14 + 0

The remainder is 0, so the GCD of 14 and 28 is 14.

5. GCD(8, 15): Using the Euclidean algorithm: 15 = 1 * 8 + 7 8 = 1 * 7 + 1 7 = 7 * 1 + 0

The remainder is 0, so the GCD of 8 and 15 is 1.

6. GCD(120, 150): Using the Euclidean algorithm: 150 = 1 * 120 + 30 120 = 4 * 30 + 0

The remainder is 0, so the GCD of 120 and 150 is 30.

So, the GCDs for the given pairs are: GCD(6, 15) = 3 GCD(18, 24) = 6 GCD(24, 40) = 8 GCD(14, 28) = 14 GCD(8, 15) = 1 GCD(120, 150) = 30