Euclids division Lemma states that for two positive integers a and b, there exists unique integer p and r such that a=bq + r where r must satisfy
Answers
Answered by
0
Answer:
where r is equal to or greater than 0 and less than q
Answered by
0
Answer:
euclid division lemma example....
Step by step explanation:
Step 1
a=bq+r
Using euclid division method
so
Hcf=45
Similar questions