Question

state and prove division algorithm for integers.

​

Answer 1

Answer:

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. The numbers q and r should be thought of as the quotient and remainder that result when b is divided into a. ... If a = 18 and b = 6, then q = 3 and r = 0.

Step-by-step explanation:

Please don't forget to mark me as brainlist