An  36046algorithmEuclid’s divisionFundamental Theoremirrationalpositiveprimeprimes is a series of well defined steps which gives a procedure for solving a type of problem.

 36046algorithmEuclid’s divisionFundamental Theoremirrationalpositiveprimeprimes algorithm is a technique to compute the Highest Common Factor(HCF) of two given positive integers.

Euclid’s Division Algorithm is stated for only  36046algorithmEuclid’s divisionFundamental Theoremirrationalpositiveprimeprimes integers.

Every composite number can be expressed ( factorised) as a product of  36046algorithmEuclid’s divisionFundamental Theoremirrationalpositiveprimeprimes, and this factorisation is unique, apart from the order in which the  36046algorithmEuclid’s divisionFundamental Theoremirrationalpositiveprimeprimes factors occur.

The  36046algorithmEuclid’s divisionFundamental Theoremirrationalpositiveprimeprimes of Arithmetic says that every composite number
can be factorised as a product of primes.

The sum or difference of a rational and an irrational number is  36046algorithmEuclid’s divisionFundamental Theoremirrationalpositiveprimeprimes.

The product and quotient of a non-zero rational and irrational number is  36046algorithmEuclid’s divisionFundamental Theoremirrationalpositiveprimeprimes.

HCF of 6 and 24 is  36046algorithmEuclid’s divisionFundamental Theoremirrationalpositiveprimeprimes.

HCF of 96 and 404 is  36046algorithmEuclid’s divisionFundamental Theoremirrationalpositiveprimeprimes.

LCM of 6, 72 and 120 is  36046algorithmEuclid’s divisionFundamental Theoremirrationalpositiveprimeprimes.