Question

НОД 96 и 120; НОД 133 и 221

Answer 1

НОД (96,120)=24
НОД(133,221)=1

Answer 2

To find the greatest common divisor (GCD) of two numbers, you can use the Euclidean algorithm. Here's how you can find the GCD of 96 and 120:

Step 1: Divide the larger number by the smaller number. Step 2: Take the remainder and divide the previous divisor by it. Step 3: Repeat step 2 until the remainder becomes zero. Step 4: The last nonzero remainder is the GCD.

Let's find the GCD of 96 and 120:

Step 1: 120 ÷ 96 = 1 with a remainder of 24 Step 2: 96 ÷ 24 = 4 with a remainder of 0

Since the remainder is now 0, the GCD of 96 and 120 is the last nonzero remainder, which is 24.

Now, let's find the GCD of 133 and 221:

Step 1: 221 ÷ 133 = 1 with a remainder of 88 Step 2: 133 ÷ 88 = 1 with a remainder of 45 Step 3: 88 ÷ 45 = 1 with a remainder of 43 Step 4: 45 ÷ 43 = 1 with a remainder of 2 Step 5: 43 ÷ 2 = 21 with a remainder of 1 Step 6: 2 ÷ 1 = 2 with a remainder of 0

The last nonzero remainder is 1. Therefore, the GCD of 133 and 221 is 1.