State Euclid's Division Algorithm :
Answers
Answered by
19
Step-by-step explanation:
Euclid's division lemma,
states that for any two positive integers 'a' and 'b' we can find two whole numbers 'q' and 'r' such that a = b × q + r where 0 ≤ r < b. Euclid's division lemma can be used to find the highest common factor of any two positive integers and to show the common properties of numbers.
Answered by
1
Step-by-step explanation:
Hope it's useful to you and helps
Attachments:
Similar questions
Math,
3 hours ago
Math,
3 hours ago
Social Sciences,
3 hours ago
Math,
7 months ago
English,
7 months ago