Question

135 ਅਤੇ 225 ਦਾ ਮ.ਸਵ. ਯੂਕਲਿਡ ਵੰਡ ਐਲਗੋਰਿਥਮ
ਰਾਹੀਂ ਪਤਾ ਕਰੋ।
Find H.C.F. of 135 and 225 by Euclid division
algorithm.​

Answer 1

Step-by-step explanation:

225 > 135. Applying Euclid's Division algorithm we get

since remainder

0 we again apply the algorithm

since remainder

0 we again apply the algorithm

since remainder = 0 we conclude the HCF of 135 and 225 is 45.