According to euclid's division algorithm, using euclid's division lemma for any two positive integers a and b with a > b enables us to find the
Answers
Answered by
0
Answer:
HCF
Step-by-step explanation:
According to euclid's division algorithm, using euclid's division lemma for any two positive integers a and b with a > b enables us to find the HCF of the two given positive integers
Attachments:
Answered by
0
Answer:
HCF
Step-by-step explanation:
Similar questions