Math, asked by Aakash1000chauhan1, 1 year ago

what is Euclid division lemma ? can you define that

Answers

Answered by Anonymous
1
Euclid's Division Lemma: ... The basis of 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.

Aakash1000chauhan1: from where you cheated from internet
Anonymous: this answer i found in my brothers maths book
Anonymous: u have any problem
Aakash1000chauhan1: no but if you Know than you give answer get it
Anonymous: yes
Answered by Bitti13
0
Euclids division lemma states that : given a positive integer a and b there exists uniqie integer q and r such that a=bq+r where. 0 less thanx equal to r < b
It's used to find hcf

Bitti13: Thank you a lot
Anonymous: ur most welcome
Bitti13: Um I said to him who chose my answer as the brainliest
Bitti13: Anyways it's ok thank you for nothing O:-)
Anonymous: don't no but congrats that ur answer is selected as the brainlist
Similar questions