Math, asked by sachin1685, 1 year ago

Define EDL-Euclid’s division lemma ???

sachin1685: Any one answer plsss

VijayaLaxmiMehra1: It states that for any two positive integers a and b, there exit integers q and r , such that a = bq + r where 0 < r < b

VijayaLaxmiMehra1: where 0 < r < b

Answers

Answered by PrayagKumar

hey mate here is ur answer.....
⤵️⤵️⤵️⤵️⤵️⤵️⤵️
Euclid's Division Lemma: An Introduction. ... The basis of the Euclidean division algorithm is Euclid's division lemma. To calculate the Highest Common Factor (HCF) of two positive integers a and b we useEuclid's division algorithm. HCF is the largest number which exactly divides two or more positive integers.
plz mark as brainliest to my answer.✌️✌️

Answered by VijayaLaxmiMehra1

$\textbf{Solution}$

$\textbf{Refer to the attachment above for your solution}$

Hope it helps!!!

Attachments:

Previous Question

Next Question