НОД(49,42)

To find the greatest common divisor (НОД) of 49 and 42, we can use the Euclidean algorithm.

Step 1: Divide 49 by 42, which gives a quotient of 1 and a remainder of 7.

Step 2: Now, divide 42 by 7, which gives a quotient of 6 and a remainder of 0.

Since the remainder is 0, the last non-zero remainder we obtained in step 1 (which is 7) is the greatest common divisor (НОД) of 49 and 42.

Therefore, НОД(49,42) = 7.