RU
EN
The greatest common divisor
Writing functions:
nod(a, b)
Finds the greatest common divisor of two numbers a and b is the Number on which we can divide both these numbers without a modulo.
All software is distributed without restrictions
In case of purchase of the application, you can return the funds within 14 days from the date of purchase
The software is developed by the developer himself. The software belongs to the author himself.
Information support is provided (help and questions about software products)