Number Properties — Analyze parity, consecutive integers,...

SECTION 1

Historical Context & Motivation

The study of integer properties — parity, divisibility, and remainders — constitutes one of the oldest branches of mathematics, predating algebra and calculus by millennia. Ancient civilizations needed to partition goods, design calendars, and distribute resources, all of which required a deep understanding of how integers behave under addition, multiplication, and division. The formal treatment of these concepts, now consolidated under number theory, has evolved from pragmatic arithmetic into an elegant theoretical framework that underpins modern cryptography, computer science, and — more immediately for your purposes — standardized test design.

~300 BCE

Euclid's Elements

Euclid formalized the Division Algorithm and proved the infinitude of primes, establishing the logical foundation for remainder arithmetic and divisibility theory.

~250 CE

Diophantus & Parity Arguments

Diophantus of Alexandria used even-odd reasoning to determine whether certain algebraic equations have integer solutions, pioneering parity analysis as a proof technique.

1801

Gauss's Disquisitiones Arithmeticae

Carl Friedrich Gauss published his landmark treatise, formally introducing modular arithmetic (congruences), which unified remainder analysis into a coherent algebraic system.

2005–Present

GMAT Number Properties Focus

The GMAT consistently tests parity, consecutive-integer patterns, and remainder problems as high-frequency question types, rewarding conceptual fluency over brute-force computation.

Why does the GMAT emphasize these properties so heavily? Because they test structural reasoning — the ability to deduce results from the inherent characteristics of numbers rather than performing lengthy calculations. A question about the remainder when 7¹⁰⁰ is divided by 5 is not asking you to compute 7¹⁰⁰; it is asking whether you recognize cyclical remainder patterns. This lesson equips you with the conceptual tools and tactical shortcuts to handle such questions with confidence and speed.

SECTION 2

Core Principles & Definitions

Three interlocking concepts form the backbone of GMAT number-property questions. Mastering them requires understanding not merely the definitions but also the algebraic implications each definition carries — implications that GMAT problem writers deliberately exploit to create answer-choice traps.

Parity (Even vs. Odd)

An integer is even if it can be expressed as 2k for some integer k, and odd if it equals 2k + 1. Parity is preserved or flipped predictably under addition and multiplication, making it a powerful shortcut for eliminating answer choices.

Consecutive Integers

A set of consecutive integers is any sequence n, n+1, n+2, … . Consecutive even integers (2k, 2k+2, …) and consecutive odd integers (2k+1, 2k+3, …) follow analogous patterns. These sequences encode guaranteed divisibility and parity-alternation properties.

Remainders & Modular Arithmetic

For positive integers a and d, the remainder r satisfies a = dq + r where 0 ≤ r < d. Remainders cycle predictably, enabling pattern-based reasoning for large exponents and divisibility tests.

Zero as a Special Case

Zero is even (since 0 = 2 × 0), is a multiple of every integer, and is neither positive nor negative. Forgetting zero's properties is a common GMAT trap.

✦ KEY TAKEAWAY

Think of parity like a toggle switch on a circuit: every addition of an odd number flips the switch (even ↔ odd), while adding an even number leaves the switch in its current position. Multiplication, by contrast, acts like an AND gate — the result is even if any input is even. This 'switch-and-gate' mental model lets you trace parity through complex expressions without ever computing actual values.

SECTION 3

Visual Explanation — Parity Arithmetic Rules

The diagram below provides a comprehensive map of how parity flows through addition and multiplication. On the left side, the addition rules are shown: combining two inputs of the same parity yields an even output, while mixing parities yields odd. On the right, the multiplication rules demonstrate that an even factor in any position forces the product to be even — the only way to obtain an odd product is to multiply exclusively odd factors.

Parity arithmetic at a glance. Left panel: addition rules — same parity yields even, mixed parity yields odd. Right panel: multiplication rules — any even factor produces an even product; only all-odd inputs yield an odd product.

Notice the asymmetry between the two operations. Addition toggles parity when inputs differ, while multiplication is biased toward evenness — a single even factor in any product guarantees an even result. This asymmetry is the basis for a powerful GMAT strategy: when a question asks whether a product is even or odd, you need only determine whether at least one factor is even. If so, the product is even — no further analysis is necessary.

SECTION 4

Mathematical Framework

The formal algebraic representations below translate the visual rules from Section 3 into equations that can be applied directly during problem solving. These representations also introduce the Division Algorithm — the foundational theorem underlying all remainder problems.

PARITY — ALGEBRAIC REPRESENTATION

Even: n = 2k Odd: n = 2k + 1 (k ∈ ℤ)

Any integer n is fully classified by its remainder when divided by 2. If r = 0, n is even; if r = 1, n is odd. This is parity expressed via the Division Algorithm with divisor d = 2.

DIVISION ALGORITHM

a = dq + r where 0 ≤ r < d

For any integer a (dividend) and positive integer d (divisor), there exist unique integers q (quotient) and r (remainder). This theorem is the engine behind every remainder question on the GMAT.

CONSECUTIVE INTEGER SUM

Sum of n consecutive integers starting at a: S = n × a + n(n − 1)/2

Equivalently, S = n × (average of the sequence). For any set of n consecutive integers, the product of any n consecutive integers is divisible by n! (n factorial), a property that generates many GMAT problems.

REMAINDER ARITHMETIC RULES

If a ≡ r₁ (mod d) and b ≡ r₂ (mod d), then a + b ≡ r₁ + r₂ (mod d) and a × b ≡ r₁ × r₂ (mod d)

Remainders are additive and multiplicative: you can compute the remainder of a sum or product by working exclusively with the individual remainders, then reducing modulo d. This principle is essential for large-exponent remainder problems.

💡 GMAT Tip

On data-sufficiency questions involving parity, remember that knowing whether a single variable is even or odd often cascades through an entire expression. Before combining statements, test each statement independently using 2k / (2k+1) substitution — this systematic approach prevents logical errors under time pressure.

SECTION 5

Detailed Breakdown — Remainder Cycles & Consecutive-Integer Patterns

One of the most powerful techniques for GMAT remainder problems is recognizing that when you raise a number to successive powers and track its remainder with respect to a fixed divisor, the remainders cycle with a fixed period. This periodicity means you never need to compute large powers directly; instead, you identify the cycle length, divide the exponent by that cycle length, and use the remainder of that division to pinpoint the answer.

Powers of 7 modulo 5 form a repeating cycle of length 4: {2, 4, 3, 1}. To find the remainder for 7¹⁰⁰ ÷ 5, compute 100 mod 4 = 0, which maps to the last element of the cycle (1). Therefore 7¹⁰⁰ mod 5 = 1.

Consecutive Integer Properties

Key properties of consecutive integers and their GMAT applications

Property	Explanation	GMAT Application
Alternating parity	In any set of consecutive integers, even and odd values alternate: n, n+1, n+2 guarantees at least one even.	The product of any 2+ consecutive integers is always even. Use to shortcut parity questions.
Divisibility by n!	The product of n consecutive integers is always divisible by n! (n factorial). For example, any 3 consecutive integers' product is divisible by 6.	Determines divisibility without factoring. The product of 4 consecutive integers is divisible by 24.
Sum formula	Sum of n consecutive integers = n × median. For an odd count, the median is an integer; for an even count, it is a half-integer.	Sum of 5 consecutive integers centered at k is 5k — always divisible by 5. Sum of 4 consecutive integers is never divisible by 4.
Exactly one multiple of k	Among any k consecutive integers, exactly one is divisible by k. This follows from the Pigeonhole Principle applied to remainders mod k.	Among any 7 consecutive integers, exactly one is divisible by 7. Useful for must-be-true questions.

SECTION 6

Worked Example — Multi-Concept Problem

The following problem integrates parity reasoning, consecutive-integer properties, and remainder analysis — the three core skills of this lesson. Work through it carefully, as GMAT problems frequently combine these concepts in a single question.

📝 Problem Statement

If n is a positive integer such that n divided by 7 leaves a remainder of 3, what is the remainder when n² + 2n is divided by 7?

Solution: Remainder of n² + 2n (mod 7)

Step 1 — Translate the given information into modular formWe are told n ÷ 7 leaves remainder 3. In modular arithmetic, this means n ≡ 3 (mod 7). Equivalently, n can be written as 7k + 3 for some non-negative integer k.

n ≡ 3 (mod 7)

Step 2 — Express the target in terms of n's remainderWe need the remainder of n² + 2n when divided by 7. By the multiplicative and additive properties of modular arithmetic, we can substitute n ≡ 3 directly: n² + 2n ≡ 3² + 2(3) (mod 7).

n² + 2n ≡ 9 + 6 (mod 7)

Step 3 — Compute and reduceCompute the arithmetic: 9 + 6 = 15. Now reduce 15 modulo 7: 15 = 7 × 2 + 1. Therefore 15 ≡ 1 (mod 7).

n² + 2n ≡ 1 (mod 7)

Step 4 — Verify with a concrete exampleChoose n = 10 (since 10 = 7 × 1 + 3, satisfying the condition). Then n² + 2n = 100 + 20 = 120. Check: 120 ÷ 7 = 17 remainder 1. ✓ The answer is confirmed.

The remainder is 1.

🎯 STRATEGIC INSIGHT

Notice that the factored form n² + 2n = n(n + 2) also reveals a parity insight: if n is odd, then n + 2 is also odd, so the product is odd; if n is even, then n + 2 is also even, so the product is even. This parity check can serve as an answer-choice eliminator on multiple-choice questions, even before you compute the exact remainder.

SECTION 7

Strategies, Strengths, and Common Pitfalls

Understanding the theoretical framework is necessary but not sufficient for GMAT success. You must also recognize which strategy to deploy for each question type and know the traps that test writers design into answer choices. The table below catalogs common pitfalls alongside the correct strategic response.

Common GMAT number-property pitfalls and corrective strategies

Pitfall	Why It Traps You	Correct Strategy
Forgetting zero is even	Many test-takers instinctively exclude 0 from even integers or forget it is a valid value for a variable described as a 'non-negative even integer.'	Always test n = 0 as a boundary case. Zero is even, is a multiple of every integer, and is neither positive nor negative.
Assuming 'integer' means 'positive'	Questions that say 'integer' without specifying sign include negatives. Parity rules apply equally to negative integers, but remainder conventions can differ.	Check negative cases explicitly. GMAT remainder questions typically restrict to positive integers, but parity questions may not.
Computing large powers directly	Spending 90+ seconds on arithmetic when the cycle length is 2 or 4 wastes precious time.	Identify the remainder cycle first. Compute only 3–5 terms to establish the pattern, then use the exponent modulo the cycle length.
Confusing 'divisible by' with 'divides into'	Reversing the direction of divisibility leads to logically inverted conclusions.	'a is divisible by b' means b \| a, i.e., a/b is an integer. Restate in a = bk form if confused.
Over-relying on one test case	Data sufficiency questions often require proving a statement for all valid cases, not just a single example.	Test at least two cases with different parities or different remainder classes. If both produce the same answer, the statement is likely sufficient.

✦ KEY TAKEAWAY

Think of these integer-property strategies like safety checks in an engineering workflow: the Division Algorithm is your specification sheet, parity analysis is your quality-control filter, and testing boundary cases (0, negatives, large values) is your stress test. Skipping any one of these 'checks' under time pressure is exactly how the GMAT induces errors — the same way skipping a safety protocol can cause a system failure.

SECTION 8

Connection to Advanced Theory & Beyond the GMAT

The parity, consecutive-integer, and remainder concepts tested on the GMAT are entry points to richer mathematical structures. Understanding where these ideas lead can deepen your intuition even if the advanced material itself is not directly tested. The table below maps each GMAT-level concept to its formal generalization.

GMAT concepts mapped to their advanced generalizations

GMAT Concept	Advanced Generalization	Why It Matters
Parity (mod 2)	Residue classes mod n — integers partitioned into n equivalence classes based on their remainder when divided by n.	Parity is the simplest case (n = 2). Modular arithmetic for any n follows identical rules, so your parity intuition scales directly.
Consecutive integer divisibility	Combinatorial identities — C(n, k) = n! / [k!(n−k)!] is always an integer because it counts combinations, which links to the divisibility of products of consecutive integers by factorials.	This explains why the GMAT can always construct 'must be an integer' problems from consecutive-integer products.
Remainder cycles	Fermat's Little Theorem — If p is prime and gcd(a, p) = 1, then a^(p−1) ≡ 1 (mod p). This guarantees the cycle length divides p − 1.	Provides a theoretical upper bound on cycle length, confirming that the brute-force approach of testing a few terms will always find the pattern.
Sum of consecutive integers	Arithmetic series & generating functions — the general formula S = n(a₁ + aₙ)/2 extends to weighted sums and analytic number theory.	Reinforces the median-based shortcut: the sum is always the count times the average, a principle that recurs throughout statistics and probability.

While Fermat's Little Theorem and group-theoretic residue classes are beyond the GMAT's scope, the mental models they reinforce — cyclicity, classification by equivalence, and structural invariance — are precisely the mental models the GMAT rewards. Cultivating these habits of thought will serve you not only on the test but throughout quantitative coursework in any graduate program.

SECTION 9

Practice Problems

PROBLEM 1 — CONCEPTUAL

If a and b are both odd integers, which of the following must be even? (A) a + b (B) a − b (C) a × b (D) Both A and B (E) All of the above

PROBLEM 2 — BASIC CALCULATION

What is the remainder when 2⁵⁰ is divided by 7?

PROBLEM 3 — INTERMEDIATE

The product of four consecutive positive integers is always divisible by which of the following? (I) 4 (II) 12 (III) 24 (A) I only (B) I and II only (C) I, II, and III

PROBLEM 4 — APPLIED

A company assigns employee ID codes using a system where each code, when divided by 6, leaves a remainder of 1, and when divided by 8, leaves a remainder of 3. What is the smallest positive ID code number?

PROBLEM 5 — CRITICAL THINKING

Let S = n + (n+1) + (n+2) + … + (n+k−1) be the sum of k consecutive integers starting at n, where k and n are positive integers. Prove that S is divisible by k if and only if k is odd. Then determine: is the sum of 14 consecutive integers ever divisible by 14?

SUMMARY

Lesson Summary

This lesson established the three pillars of GMAT number-property reasoning. Parity analysis classifies every integer as even (2k) or odd (2k + 1) and traces how that classification propagates through addition (same parity → even; mixed → odd) and multiplication (any even factor → even product). Consecutive-integer properties guarantee that the product of n consecutive integers is always divisible by n!, that parity alternates within the sequence, and that the sum equals the count times the median — divisible by the count when the count is odd. Remainder arithmetic rests on the Division Algorithm (a = dq + r, 0 ≤ r < d) and the principle that remainders of sums and products equal the sum and product of the individual remainders, reduced modulo d.

The strategic takeaways are equally important: always test boundary cases (especially zero and negative integers), identify remainder cycles by computing only 3–5 terms, and use 2k / (2k+1) substitution to systematically evaluate parity in data-sufficiency questions. These techniques transform number-property questions from time-consuming puzzles into efficient, pattern-driven exercises — exactly the kind of structured reasoning that earns high quantitative scores on the GMAT.