НОД чисел 40 и 32

To find the Greatest Common Divisor (GCD) of two numbers, such as 40 and 32, you can use the Euclidean algorithm. Here's how you can do it:

Step 1: Divide the larger number (40) by the smaller number (32) and find the remainder. 40 divided by 32 equals 1 with a remainder of 8.

Step 2: Now, divide the smaller number (32) by the remainder (8) and find the new remainder. 32 divided by 8 equals 4 with no remainder.

Step 3: Continue this process by dividing the previous remainder (8) by the new remainder (4). 8 divided by 4 equals 2 with no remainder.

Step 4: Repeat step 3 until you reach a remainder of 0. 4 divided by 2 equals 2 with no remainder.

Step 5: The last non-zero remainder obtained is the GCD. Therefore, the GCD of 40 and 32 is 2.

So, the GCD of 40 and 32 is 2.