Remainder
GRE glossary · Quantitative Reasoning
Definition
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.
Remainder in plain English
When you divide one whole number by another and it doesn't come out even, the remainder is the little bit left over. Split 17 cookies among 5 friends: each gets 3 and 2 cookies are left, so the remainder is 2 — and it's always smaller than the number you divided by. The formula that captures this is dividend = divisor × quotient + remainder, with the remainder between 0 and one less than the divisor. On the GRE, remainders power questions about repeating patterns, like finding the last digit of a huge number.
Learn these first
Practice Remainder
Sign up free: all 170 GRE terms as flashcards, plus practice questions with full explanations →