Question

НОД 132 и 165 помогите найти

Answer 1

нод(132)                         нод равен 3 умножить на 11 равно 33

132  2

66  2

33  3

11  11

1

нод(165)

165  5

33   3

11     11

1  

Answer 2

To find the greatest common divisor (GCD) of two numbers, 132 and 165, you can use the Euclidean algorithm. Here's the step-by-step process:

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 becomes 0.
4. The last non-zero remainder is the greatest common divisor (GCD) of the original two numbers.

Let's go through the calculations:

Step 1: 165 ÷ 132 = 1 with a remainder of 33

Step 2: Replace 165 with 132 and 132 with 33.

Step 3: 132 ÷ 33 = 4 with a remainder of 0

Step 4: Since the remainder is 0, we stop here.

The last non-zero remainder is 33, so the GCD of 132 and 165 is 33.