The nonnegative integer left over when one integer is divided by another, satisfying dividend = divisor × quotient + remainder with 0 ≤ remainder < divisor. On the GRE it drives cyclic-pattern (units-digit) and modular problems.