НОД(23, 58)

To find the greatest common divisor (НОД) of two numbers, such as 23 and 58, you can use the Euclidean algorithm.

First, divide 58 by 23. The remainder is 12.

Next, divide 23 by 12. The remainder is 11.

Then, divide 12 by 11. The remainder is 1.

Finally, divide 11 by 1. The remainder is 0.

Since we have reached a remainder of 0, the last non-zero remainder (in this case, 1) is the greatest common divisor (НОД) of 23 and 58.

Therefore, the НОД(23, 58) is 1.