Escolar Documentos
Profissional Documentos
Cultura Documentos
Topics
Remarks
Euclids division lemma and algorithm are
so closely interlinked that people often
call former as the division algorithm also.
Although Euclids Division Algorithm is
stated for only positive integers, it can be
extended for all integers except zero, i.e.,
b 0. However, we shall not discuss this
Contribution of mathematican
to real numbers
Applications
To find the lcm list all prime factors occurring in the prime
factorization of the numbers.
For each of these factors ,find the greatest exponent and
raise each prime to the greatest exponent and multiply
them to get the LCM.
Example
Find the HCF and lcm of 90 and 144 by prime factorization
method.
90=2X3X3X5 and 144=2X2X2X2X3X3
common prime factor
least exponent
2
1
3
2
HCF=2X3X3=2X9=18
Example
To find lcm
prime factors of 90 and 144 greatest
exponent
2
3
5
LCM =2X2X2X2X3X3X5=16X9X5=720
4
2
1
510 and 92
510 = 2X3X5X17
92 = 2X2X23
LCM 510,92=2X2X3X5X17
HCF = 510 = 2X3X5X17
HCF 510,92 = 2
LCMXHCF = 2X2X2X3X5X17 =
2040X23=46920
510X92 = 46920