For integers a and positive d, there exist unique q (quotient) and r (remainder) with a = dq + r and 0 ≤ r < d. Foundation for Euclidean Algorithm and modular arithmetic.. The key formula is a = dq + r, 0 ≤ r < d. This concept is typically introduced in College. Division is the process of splitting a number into equal parts or groups.