НОД(23, 58)

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

First, we divide 58 by 23 to get the quotient and remainder:

58 ÷ 23 = 2 remainder 12

Next, we divide the previous divisor (23) by the remainder (12):

23 ÷ 12 = 1 remainder 11

We repeat this process until the remainder is 0:

12 ÷ 11 = 1 remainder 1

11 ÷ 1 = 11 remainder 0

Since the remainder is now 0, we stop. The greatest common divisor of 23 and 58 is the last non-zero remainder, which is 1. Therefore, НОД(23, 58) = 1.