Check whether one integer evenly divides another and show the quotient and remainder.
An integer d divides n (written d | n) if there exists an integer q such that n = d × q, i.e. the remainder is zero. Divisibility is a fundamental concept in number theory underlying primes, factors, and modular arithmetic.
Divisibility
d | n ⟺ n mod d = 0 ⟺ n = d × q for some integer q
A number n is divisible by d if dividing n by d leaves zero remainder — the division is exact.
Yes. For any non-zero d, 0 ÷ d = 0 with remainder 0, so d | 0.