what is euclids division lemma
Answers
Answered by
2
Euclids 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
TheRuhanikaDhawan:
thank you
welcome send me friend request
accepted also
Answered by
2
let 'a' and 'b' be any two positive integers
so , there exists unique integers 'q' and 'r'
a = bq + r, 0 ≤ r ≤ b.
if b | a , then r = 0
Otherwise, ‘r’ satisfies the stronger inequality 0 ≤ r ≤ b
so , there exists unique integers 'q' and 'r'
a = bq + r, 0 ≤ r ≤ b.
if b | a , then r = 0
Otherwise, ‘r’ satisfies the stronger inequality 0 ≤ r ≤ b
Similar questions