Study guide

2.2 Remainders, Even/Odd Parity, and Positive/Negative Sign Analysis

GMAT Exam Focus Edition

Track your progress as you read

Finished sections get a check mark.

1 Chapter 1: GMAT Exam Architecture & Strategic Foundations

1.1 GMAT Structure, Section Order, and the 205–805 Score Scale 1.2 Question Bookmarking and the Review & Edit Feature Mechanics 1.3 Test-Day Logistics, Pacing Architecture, and Score Reporting Policies

2 Chapter 2: Quantitative Reasoning — Arithmetic & Number Properties

2.1 Integers, Divisibility Rules, Prime Factorization, and LCM/GCD 2.2 Remainders, Even/Odd Parity, and Positive/Negative Sign Analysis 2.3 Exponents, Radicals, Roots, and Scientific Notation 2.4 Absolute Value, Number Line Properties, and Estimation Techniques

3 Chapter 3: Quantitative Reasoning — Fractions, Decimals, Ratios & Percentages

3.1 Fractions, Decimals, and Real-Number Operations 3.2 Ratios, Proportions, and Scaling Relationships 3.3 Percent Change, Successive Percent Changes, and Multipliers 3.4 Commercial Math: Profit/Loss, Markups, Discounts, and Simple/Compound Interest

4 Chapter 4: Quantitative Reasoning — Algebra, Equations & Inequalities

4.1 Linear Equations and Systems of Simultaneous Equations 4.2 Quadratic Equations, Factoring Patterns, and Roots 4.3 Linear Inequalities, Compound Inequalities, and Absolute Value Inequalities 4.4 Functions, Defined Operational Symbols, and Sequences

5 Chapter 5: Quantitative Reasoning — Word Problems & Modeling

5.1 Rate, Time, and Distance: Uniform Motion, Relative Speed, and Average Speed 5.2 Work Rates: Combined Rates, Sequential Tasks, and Opposing Rates 5.3 Mixture Problems and Weighted Averages 5.4 Overlapping Sets, Venn Diagrams, and the Double-Set Matrix Method

6 Chapter 6: Quantitative Reasoning — Counting, Probability & Statistics

6.1 Fundamental Counting Principle, Permutations, and Combinations 6.2 Probability Rules: Independent, Dependent, Mutually Exclusive, and Complementary Events 6.3 Descriptive Statistics: Mean, Median, Mode, Range, and Weighted Mean 6.4 Standard Deviation, Variance, and Data Dispersion

7 Chapter 7: Verbal Reasoning — Critical Reasoning: Argument Structure & Assumptions

7.1 Anatomy of an Argument: Conclusions, Premises, Assumptions, and Background Context 7.2 Assumption Questions: Necessary vs. Sufficient Assumptions and the Negation Test 7.3 Strengthen Questions: Supporting Premises, Causality, and New Evidence 7.4 Weaken Questions: Identifying Flaws, Alternate Causes, and Counter-Evidence

8 Chapter 8: Verbal Reasoning — Critical Reasoning: Advanced Arguments

8.1 Evaluate the Argument: The Variance Test and Decisive Information 8.2 Resolve the Paradox: Reconciling Conflicting Facts and Surprising Outcomes 8.3 Boldface and Method of Reasoning: Identifying the Role of Statements 8.4 Flaw in the Reasoning: Spotting Formal and Informal Logical Fallacies

9 Chapter 9: Verbal Reasoning — Reading Comprehension: Core Analysis

9.1 Passage Structures, Main Idea, and Author's Primary Purpose 9.2 Supporting Ideas, Explicit Details, and Targeted Information Retrieval 9.3 Inference Questions: Deriving Unstated Claims and Valid Deductions

10 Chapter 10: Verbal Reasoning — Reading Comprehension: Advanced Strategies

10.1 Author's Tone, Attitude, and Epistemic Stance 10.2 Logical Structure, Paragraph Function, and Rhetorical Organization 10.3 Application, Contextual Analogy, and Cross-Disciplinary Synthesis

11 Chapter 11: Data Insights — Data Sufficiency Foundations & Algebra

11.1 Data Sufficiency Architecture: The 5 Answer Choices (AD/BCE) and Yes/No vs. Value Logic 11.2 Golden Rules of DS: Preventing Statement 2 Contamination and Sufficiency Verification 11.3 DS Applied to Arithmetic, Number Properties, and Signs 11.4 DS Applied to Algebraic Equations, Systems, and Inequalities

12 Chapter 12: Data Insights — Data Sufficiency Applied Modeling

12.1 DS Applied to Rates, Ratios, and Work Problems 12.2 DS Applied to Statistics, Averages, and Data Sets 12.3 DS Applied to Overlapping Sets, Venn Diagrams, and Probability

13 Chapter 13: Data Insights — Multi-Source Reasoning & Table Analysis

13.1 Multi-Source Reasoning: Tab Navigation, Synthesizing Text, Data, and Emails 13.2 MSR Question Formats: Multiple Choice and Three-Part Dichotomous Questions 13.3 Table Analysis: Interactive Sorting, Filtering, and Trend Identification 13.4 Table Analysis: Evaluating Binary Statements (True/False, Yes/No)

14 Chapter 14: Data Insights — Graphics Interpretation & Two-Part Analysis

14.1 Graphics Interpretation: Bar Charts, Line Graphs, and Scatterplots 14.2 Graphics Interpretation: Bubble Charts, Dual-Axis Graphs, and Pie Charts 14.3 Two-Part Analysis: Quantitative and Mathematical Word Problems 14.4 Two-Part Analysis: Verbal, Logic-Based, and Strategic Decision Problems

2.2 Remainders, Even/Odd Parity, and Positive/Negative Sign Analysis

Key Takeaways Explain This Topic AI

The Division Algorithm establishes that N = d · q + r, where the integer remainder r must satisfy 0 ≤ r < d.

Modular remainder arithmetic allows calculating remainders of large sums and products by operating on individual term remainders.

Parity arithmetic dictates that like parities sum to even, unlike parities sum to odd, and any product containing at least one even factor is even.

Sign analysis relies on counting negative factors: an odd count yields a negative product, an even count yields a positive product, and zero is non-signed.

Last updated: September 2026

2.2 Remainders, Even/Odd Parity, and Positive/Negative Sign Analysis

Quick Summary: Remainder arithmetic, even/odd parity transformations, and positive/negative sign tracking form the structural bedrock of high-scoring GMAT number properties questions. Recognizing that remainder relationships follow linear algebraic models ( N = d q + r N = dq + r N = d q + r ) and that parity properties instantly constrain sums and products prevents tedious trial-and-error under time pressure.

Quantitative Reasoning on the GMAT Focus Edition repeatedly tests your ability to make logical deductions about expressions without calculating their numerical values. Remainder arithmetic, parity properties, and sign rules provide algebraic shortcuts that immediately eliminate impossible answer choices.

The Division Algorithm and Remainder Mechanics

The Division Algorithm is a foundational theorem of integer arithmetic. It states that for any integer N N N (the dividend) and positive integer divisor d d d , there exist unique integers q q q (the quotient) and r r r (the remainder) such that: N = d ⋅ q + r where 0 ≤ r < d N = d \cdot q + r \quad \text{where} \quad 0 \le r < d N = d ⋅ q + r where 0 ≤ r < d

Essential Remainder Principles on the GMAT

The Remainder is Strictly Bounded: The remainder r r r must be an integer satisfying 0 ≤ r < d 0 \le r < d 0 ≤ r < d . A remainder can never be negative, nor can it equal or exceed the divisor d d d . For example, when dividing by 7, the only possible remainders are { 0 , 1 , 2 , 3 , 4 , 5 , 6 } \{0, 1, 2, 3, 4, 5, 6\} { 0 , 1 , 2 , 3 , 4 , 5 , 6 } .

When the Dividend is Less than the Divisor: If 0 < N < d 0 < N < d 0 < N < d , then the quotient is 0 and the remainder is N N N itself. For example, when 5 is divided by 8: 5 = 8 ( 0 ) + 5 ⟹ remainder = 5 5 = 8(0) + 5 \implies \text{remainder} = 5 5 = 8 ( 0 ) + 5 ⟹ remainder = 5

Algebraic Form of Sets with a Fixed Remainder: An integer that leaves a remainder of 3 when divided by 5 can be represented as: N = 5 k + 3 ( k ∈ Z ) N = 5k + 3 \quad (k \in \mathbb{Z}) N = 5 k + 3 ( k ∈ Z ) For non-negative values of k k k , this yields the sequence { 3 , 8 , 13 , 18 , 23 , 28 , … } \{3, 8, 13, 18, 23, 28, \dots\} { 3 , 8 , 13 , 18 , 23 , 28 , … } .

Modular Remainder Arithmetic and Cyclicity

When evaluating remainders of large calculations, you can distribute the remainder operation across addition, subtraction, and multiplication:

Sum Rule: Rem ( A + B , d ) = Rem ( Rem ( A , d ) + Rem ( B , d ) , d ) \text{Rem}(A + B, d) = \text{Rem}(\text{Rem}(A, d) + \text{Rem}(B, d), d) Rem ( A + B , d ) = Rem ( Rem ( A , d ) + Rem ( B , d ) , d )

Product Rule: Rem ( A × B , d ) = Rem ( Rem ( A , d ) × Rem ( B , d ) , d ) \text{Rem}(A \times B, d) = \text{Rem}(\text{Rem}(A, d) \times \text{Rem}(B, d), d) Rem ( A × B , d ) = Rem ( Rem ( A , d ) × Rem ( B , d ) , d )

Power Rule: Rem ( A n , d ) = Rem ( ( Rem ( A , d ) ) n , d ) \text{Rem}(A^n, d) = \text{Rem}((\text{Rem}(A, d))^n, d) Rem ( A n , d ) = Rem (( Rem ( A , d ) ) n , d )

Units Digit Cyclicity (Remainders Modulo 10)

The units digit of any integer is mathematically identical to its remainder when divided by 10. The units digits of positive integer powers cycle in predictable patterns of length 1, 2, or 4:

Base Units Digit Cycle of Powers ( n = 1 , 2 , 3 , 4 , … n = 1, 2, 3, 4, \dots n = 1 , 2 , 3 , 4 , … ) Cycle Length

0, 1, 5, 6 0 → 0 0 \to 0 0 → 0 ; 1 → 1 1 \to 1 1 → 1 ; 5 → 5 5 \to 5 5 → 5 ; 6 → 6 6 \to 6 6 → 6 (Constant) 1

4 4 1 = 4 , 4 2 = 6 , 4 3 = 4 , 4 4 = 6 4^1 = 4, 4^2 = 6, 4^3 = 4, 4^4 = 6 4 1 = 4 , 4 2 = 6 , 4 3 = 4 , 4 4 = 6 2 (Odd power → 4 \to 4 → 4 ; Even power → 6 \to 6 → 6 )

9 9 1 = 9 , 9 2 = 1 , 9 3 = 9 , 9 4 = 1 9^1 = 9, 9^2 = 1, 9^3 = 9, 9^4 = 1 9 1 = 9 , 9 2 = 1 , 9 3 = 9 , 9 4 = 1 2 (Odd power → 9 \to 9 → 9 ; Even power → 1 \to 1 → 1 )

  • 2 2 , 4 , 8 , 6 , 2 , 4 , 8 , 6 , … 2, 4, 8, 6, 2, 4, 8, 6, \dots 2 , 4 , 8 , 6 , 2 , 4 , 8 , 6 , … 4
  • 3 3 , 9 , 7 , 1 , 3 , 9 , 7 , 1 , … 3, 9, 7, 1, 3, 9, 7, 1, \dots 3 , 9 , 7 , 1 , 3 , 9 , 7 , 1 , … 4
  • 7 7 , 9 , 3 , 1 , 7 , 9 , 3 , 1 , … 7, 9, 3, 1, 7, 9, 3, 1, \dots 7 , 9 , 3 , 1 , 7 , 9 , 3 , 1 , … 4
  • 8 8 , 4 , 2 , 6 , 8 , 4 , 2 , 6 , … 8, 4, 2, 6, 8, 4, 2, 6, \dots 8 , 4 , 2 , 6 , 8 , 4 , 2 , 6 , … 4

Shortcut to Find the Units Digit of b n b^n b n :

Divide the exponent n n n by the cycle length (4 for bases ending in 2, 3, 7, 8).

If the remainder is 1, take the 1st power in the cycle.

If the remainder is 2, take the 2nd power.

If the remainder is 3, take the 3rd power.

If the remainder is 0 (exponent is a multiple of 4), take the 4th power in the cycle.

Combined Remainder Systems

A classic GMAT question type specifies remainders across two different divisors: for example, N N N leaves remainder 2 when divided by 5, and remainder 3 when divided by 7.

Step-by-Step Resolution:

Express N N N algebraically under the larger divisor: N = 7 b + 3 N = 7b + 3 N = 7 b + 3 .

Generate values of N N N by incrementing b ≥ 0 b \ge 0 b ≥ 0 : b = 0 ⟹ 3 b = 0 \implies 3 b = 0 ⟹ 3 b = 1 ⟹ 10 b = 1 \implies 10 b = 1 ⟹ 10 b = 2 ⟹ 17 b = 2 \implies 17 b = 2 ⟹ 17

Test each value against the second condition (remainder 2 when divided by 5):

  • 3 / 5 ⟹ rem 3 3 / 5 \implies \text{rem } 3 3/5 ⟹ rem 3
  • 10 / 5 ⟹ rem 0 10 / 5 \implies \text{rem } 0 10/5 ⟹ rem 0
  • 17 / 5 ⟹ 3 with rem 2 17 / 5 \implies 3 \text{ with rem } 2 17/5 ⟹ 3 with rem 2 (Match found!)

The first common integer is 17. The pattern repeats every LCM ( 5 , 7 ) = 35 \text{LCM}(5, 7) = 35 LCM ( 5 , 7 ) = 35 : N = 35 k + 17 ( k ∈ Z ) N = 35k + 17 \quad (k \in \mathbb{Z}) N = 35 k + 17 ( k ∈ Z ) Possible positive values: { 17 , 52 , 87 , 122 , … } \{17, 52, 87, 122, \dots\} { 17 , 52 , 87 , 122 , … } .

Parity Algebra: Even and Odd Properties

Parity refers to the classification of an integer as either even ( 2 k 2k 2 k ) or odd ( 2 k + 1 2k + 1 2 k + 1 ).

Operation Rule Algebraic Verification Example

Addition / Subtraction Even ± Even = Even \text{Even} \pm \text{Even} = \text{Even} Even ± Even = Even 2 a ± 2 b = 2 ( a ± b ) 2a \pm 2b = 2(a \pm b) 2 a ± 2 b = 2 ( a ± b ) 6 + 4 = 10 6 + 4 = 10 6 + 4 = 10

Addition / Subtraction Odd ± Odd = Even \text{Odd} \pm \text{Odd} = \text{Even} Odd ± Odd = Even ( 2 a + 1 ) + ( 2 b + 1 ) = 2 ( a + b + 1 ) (2a + 1) + (2b + 1) = 2(a + b + 1) ( 2 a + 1 ) + ( 2 b + 1 ) = 2 ( a + b + 1 ) 5 + 7 = 12 5 + 7 = 12 5 + 7 = 12

Addition / Subtraction Even ± Odd = Odd \text{Even} \pm \text{Odd} = \text{Odd} Even ± Odd = Odd 2 a ± ( 2 b + 1 ) = 2 ( a ± b ) ± 1 2a \pm (2b + 1) = 2(a \pm b) \pm 1 2 a ± ( 2 b + 1 ) = 2 ( a ± b ) ± 1 4 + 7 = 11 4 + 7 = 11 4 + 7 = 11

Multiplication Even × Even = Even \text{Even} \times \text{Even} = \text{Even} Even × Even = Even 2 a × 2 b = 4 a b = 2 ( 2 a b ) 2a \times 2b = 4ab = 2(2ab) 2 a × 2 b = 4 ab = 2 ( 2 ab ) 4 × 6 = 24 4 \times 6 = 24 4 × 6 = 24

Multiplication Even × Odd = Even \text{Even} \times \text{Odd} = \text{Even} Even × Odd = Even 2 a × ( 2 b + 1 ) = 2 ( 2 a b + a ) 2a \times (2b + 1) = 2(2ab + a) 2 a × ( 2 b + 1 ) = 2 ( 2 ab + a ) 4 × 5 = 20 4 \times 5 = 20 4 × 5 = 20

Multiplication Odd × Odd = Odd \text{Odd} \times \text{Odd} = \text{Odd} Odd × Odd = Odd ( 2 a + 1 ) ( 2 b + 1 ) = 4 a b + 2 a + 2 b + 1 (2a + 1)(2b + 1) = 4ab + 2a + 2b + 1 ( 2 a + 1 ) ( 2 b + 1 ) = 4 ab + 2 a + 2 b + 1 3 × 7 = 21 3 \times 7 = 21 3 × 7 = 21

Exponentiation ( n ≥ 1 n \ge 1 n ≥ 1 ) Even n = Even \text{Even}^n = \text{Even} Even n = Even Product of even numbers 2 4 = 16 2^4 = 16 2 4 = 16

Exponentiation ( n ≥ 0 n \ge 0 n ≥ 0 ) Odd n = Odd \text{Odd}^n = \text{Odd} Odd n = Odd Product of odd numbers 3 3 = 27 3^3 = 27 3 3 = 27 ( 3 0 = 1 3^0 = 1 3 0 = 1 )

Strategic Parity Deductions

If x + y x + y x + y is odd , then one variable is even and the other is odd.

If x + y x + y x + y is even , then x x x and y y y share the same parity (both even or both odd).

If x y xy x y is odd , then x x x and y y y must both be odd .

If x y xy x y is even , then at least one variable must be even.

The sum of an odd count of odd numbers is always odd ( 1 + 3 + 5 = 9 1 + 3 + 5 = 9 1 + 3 + 5 = 9 ).

The sum of an even count of odd numbers is always even ( 1 + 3 + 5 + 7 = 16 1 + 3 + 5 + 7 = 16 1 + 3 + 5 + 7 = 16 ).

Positive and Negative Sign Analysis

Tracking signs through inequalities and products is essential for GMAT algebra.

Product and Quotient Rules

( + ) × ( + ) = ( + ) (+) \times (+) = (+) ( + ) × ( + ) = ( + ) and ( − ) × ( − ) = ( + ) (-) \times (-) = (+) ( − ) × ( − ) = ( + )

( + ) × ( − ) = ( − ) (+) \times (-) = (-) ( + ) × ( − ) = ( − )

( + ) ( + ) = ( + ) \frac{(+)}{(+)} = (+) ( + ) ( + ) ​ = ( + ) and ( − ) ( − ) = ( + ) \frac{(-)}{(-)} = (+) ( − ) ( − ) ​ = ( + )

( + ) ( − ) = ( − ) \frac{(+)}{(-)} = (-) ( − ) ( + ) ​ = ( − ) and ( − ) ( + ) = ( − ) \frac{(-)}{(+)} = (-) ( + ) ( − ) ​ = ( − )

General Multi-Term Product Rule

For any product of non-zero real numbers:

If the number of negative factors is even , the product is positive .

If the number of negative factors is odd , the product is negative .

Powers and Inequalities with Signs

For any real number x ≠ 0 x \neq 0 x  = 0 , x 2 > 0 x^2 > 0 x 2 > 0 , x 4 > 0 x^4 > 0 x 4 > 0 , and generally x even > 0 x^{\text{even}} > 0 x even > 0 .

An even power destroys sign information: if x 2 = 25 x^2 = 25 x 2 = 25 , x x x could be + 5 +5 + 5 or − 5 -5 − 5 .

An odd power preserves sign information: if x 3 = − 64 x^3 = -64 x 3 = − 64 , x x x must be − 4 -4 − 4 .

If a b > 0 a b > 0 ab > 0 , then a a a and b b b have the same sign (both positive or both negative).

If a b < 0 a b < 0 ab < 0 , then a a a and b b b have opposite signs .

  • Worked Problem Solving Examples
  • Example 1: Large Modular Exponent Remainder

Problem: What is the remainder when 13 45 + 17 45 13^{45} + 17^{45} 1 3 45 + 1 7 45 is divided by 15?

Solution:

Evaluate the base remainders modulo 15: 13 ≡ − 2 ( m o d 15 ) ( since 13 − 15 = − 2 ) 13 \equiv -2 \pmod{15} \quad (\text{since } 13 - 15 = -2) 13 ≡ − 2 ( mod 15 ) ( since 13 − 15 = − 2 ) 17 ≡ 2 ( m o d 15 ) ( since 17 − 15 = 2 ) 17 \equiv 2 \pmod{15} \quad (\text{since } 17 - 15 = 2) 17 ≡ 2 ( mod 15 ) ( since 17 − 15 = 2 )

Substitute the modular equivalents into the exponential expression: 13 45 + 17 45 ≡ ( − 2 ) 45 + 2 45 ( m o d 15 ) 13^{45} + 17^{45} \equiv (-2)^{45} + 2^{45} \pmod{15} 1 3 45 + 1 7 45 ≡ ( − 2 ) 45 + 2 45 ( mod 15 )

Because 45 is an odd exponent, ( − 2 ) 45 = − ( 2 45 ) (-2)^{45} = -(2^{45}) ( − 2 ) 45 = − ( 2 45 ) : − ( 2 45 ) + 2 45 = 0 -(2^{45}) + 2^{45} = 0 − ( 2 45 ) + 2 45 = 0

The sum is an exact multiple of 15, so the remainder is 0 .

Example 2: Parity and Prime Equation

Problem: If p , q , p, q, p , q , and r r r are prime numbers such that p + q + r = 40 p + q + r = 40 p + q + r = 40 and p < q < r p < q < r p < q < r , what is the value of p p p ?

Solution:

Analyze the parity of the equation: Prime 1 + Prime 2 + Prime 3 = 40 \text{Prime}_1 + \text{Prime}_2 + \text{Prime}_3 = 40 Prime 1 ​ + Prime 2 ​ + Prime 3 ​ = 40 (even).

If all three primes were odd, their sum would be Odd + Odd + Odd = Odd \text{Odd} + \text{Odd} + \text{Odd} = \text{Odd} Odd + Odd + Odd = Odd . But 40 is even, so this is impossible.

To obtain an even sum from three integers, either all three must be even, or exactly one must be even and two must be odd: Even + Odd + Odd = Even \text{Even} + \text{Odd} + \text{Odd} = \text{Even} Even + Odd + Odd = Even

There is only one even prime number in mathematics: 2. Therefore, exactly one of the primes must be 2.

Since p < q < r p < q < r p < q < r , the smallest prime p p p must be 2 . (Verification: If p = 2 p = 2 p = 2 , then q + r = 38 q + r = 38 q + r = 38 . Primes summing to 38 include q = 7 q = 7 q = 7 and r = 31 r = 31 r = 31 , satisfying 2 < 7 < 31 2 < 7 < 31 2 < 7 < 31 .)

High-Frequency GMAT Traps

Trap 1: The Zero Parity Blindspot: Neglecting that 0 is an even integer when evaluating algebraic constraints.

Trap 2: Assuming Remainders Can Be Negative: If an algebraic simplification yields − 3 -3 − 3 modulo 8, the true positive remainder is − 3 + 8 = 5 -3 + 8 = 5 − 3 + 8 = 5 .

Trap 3: Dividing an Inequality by a Variable with Unknown Sign: If you divide or multiply an inequality by x x x without knowing whether x x x is positive or negative, you do not know whether to flip the inequality sign. Always check signs or multiply by x 2 x^2 x 2 .

Loading diagram... Decision Flowchart for Parity and Remainder Analysis