OPRIME NUMBERS


Two natural numbers are called COPRIME, or relatively prime, if and only if they have no common divisor other than 1, or, equivalently, if their greatest common divisor is 1.

For example:
6 and 35 are coprime, but 6 and 27 are not because both are divisible by 3.

A good way to determine if two numbers are coprime is given by the Euclidean algorithm.


PROPERTIES

The natural numbers a and b are coprime if and only if x e y integers exist so that ax+by=1.

If a and b are coprime and a divides a product bc, then a divides c.

Two numbers a and b are coprime if and only if the point with coordinates (a,b) in a Cartesian coordinate system is "visible" from the origin (0,0), in the sense that there is no point with integer coordinates between the origin and the point (a,b).

OUR JOBS


Euclidean algorithm

flow chartapri in formato xls (Excel) in xls format
flow chartapri in formato pdf in pdf format
 program in exe format

 

listen translate

il tuo pc è sprovvisto del plugin per ascolto o della dotazione hardware
voice of Alessio Mazzanti

 

the project

abundant numbers
coprime numbers
cousin primes
deficient numbers
factorial numbers
happy numbers
palindromic numbers
perfect numbers
prime numbers


quinary numbers

sexy primes


triangular numbers