IMind soft

Author's software

Development

Design

Designing

Being tested

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.

 

 

Top.Mail.Ru