algorithm in integers theorem
Answers
Answered by
1
hello dude
The division algorithm for integers states that given any two integers a and b, with b > 0, we can find integers q and r such that 0 < r < b and a = bq + r. Thenumbers q and r should be thought of as the quotient and remainder that result when b is divided into a.
The division algorithm for integers states that given any two integers a and b, with b > 0, we can find integers q and r such that 0 < r < b and a = bq + r. Thenumbers q and r should be thought of as the quotient and remainder that result when b is divided into a.
varunmishra9838:
pls proof it
Similar questions