Math, asked by deepsinghkalyana, 7 months ago

Lisa tries to find the highest common
factor of a and b using Euclid's division
algorithm (EDA).
In one of her steps, she divides 9648 by
135
Find the highest common factor of a and
b.
HCF(a, b) =​

Answers

Answered by irukulanikhilsai31
2

Given positive integers 'a' and 'b' , there exists unique pair of integers 'q' and 'r' satisfying

a = bq + r , 0 ≤ r < b

Therefore.,

•••♪

Similar questions