KomFi. Academy

Remainders and Modular Cycles

GRE glossary · Quantitative Reasoning

Definition

The repeating residue patterns produced by integer division and powers evaluated relative to a fixed modulus.

Remainders and Modular Cycles in plain English

Write n = dq + r with 0 ≤ r < d. Generate one full cycle for powers or repeating events, then reduce a large exponent by the cycle length; a remainder can equal the number itself when the divisor is larger.

Sign up free: all 170 GRE terms as flashcards, plus practice questions with full explanations →

Related GRE terms

GRE practice questions · GRE flashcards · GRE study guide