Question

НОД(12;18) НОД(18;60

Answer 1

НОД 12 и 18 = 6
НОК 12 и 18 = 36

Answer 2

To find the greatest common divisor (GCD) or highest common factor (HCF) of two numbers, you can use the Euclidean algorithm. Here's how it works:

1. Find the remainder of dividing the larger number by the smaller number.
2. Replace the larger number with the smaller number and the smaller number with the remainder.
3. Repeat steps 1 and 2 until the remainder is 0.
4. The GCD is the last non-zero remainder.

Let's find the GCD of 12 and 18:

Step 1: 18 ÷ 12 = 1 with a remainder of 6. Step 2: Replace 18 with 12, and 12 with 6. Step 3: 12 ÷ 6 = 2 with a remainder of 0.

The GCD of 12 and 18 is 6.

Now, let's find the GCD of 18 and 60:

Step 1: 60 ÷ 18 = 3 with a remainder of 6. Step 2: Replace 60 with 18, and 18 with 6. Step 3: 18 ÷ 6 = 3 with a remainder of 0.

The GCD of 18 and 60 is 6.

So, the final result is: GCD(12, 18) = 6 GCD(18, 60) = 6