11.3 DS Applied to Arithmetic, Number Properties, and Signs

11.3 DS Applied to Arithmetic, Number Properties, and Signs

Quick Summary: Applying Data Sufficiency to number properties demands an adversarial testing mindset. Candidates must replace naive positive integer testing with the structured ZONEF framework (Zero, One, Negatives, Extremes, Fractions) to expose hidden boundary conditions. Watch for unstated integer assumptions, understand parity mechanics, factorize for divisibility, and master sign rules where even powers and absolute values obscure polarity.

---

The Adversarial Mindset in DS Number Properties

In standard Quantitative Problem Solving, testing numbers is a constructive technique: you substitute convenient numbers (such as $2, 3,$ or $10$) to find the correct answer among five options. In Data Sufficiency, however, testing numbers is an adversarial weapon. Your goal when testing numbers in DS is not to prove that a statement works; your goal is to try to break the statement.

The "Nice Integer Fallacy"

Untrained candidates almost exclusively test small, positive integers: $2, 3, 4,$ and $5$. Because mathematical statements frequently hold true across small positive integers, these candidates obtain false positives for sufficiency. Consider this statement: $\text{Question: Is } x^3 > x? \quad \text{Statement (1): } x > 0$

• Naive Test: Pick $x = 2 \implies 2^3 = 8 > 2$ (YES). Pick $x = 3 \implies 3^3 = 27 > 3$ (YES). The rookie concludes Statement (1) is sufficient.
• Adversarial Test: The GMAT master tests a proper fraction: Pick $x = \frac{1}{2} \implies (\frac{1}{2})^3 = \frac{1}{8}$, which is less than $\frac{1}{2}$ (NO!). Because Statement (1) yields both YES and NO, it is insufficient. Picking numbers without a systematic framework is testing suicide on the GMAT Focus Edition.

---

The ZONEF Strategic Number-Testing Framework

To ensure complete coverage of mathematical boundary conditions, deploy the ZONEF taxonomy. Whenever a question stem does not restrict variables to positive whole numbers, your scratchpad tests must cycle through these categories:

┌────────────────────────────────────────────────────────────────────────┐
│                     THE ZONEF TESTING TAXONOMY                         │
├──────────────┬─────────────────────────┬───────────────────────────────┤
│ Letter       │ Number Category         │ Crucial Mathematical Property │
├──────────────┼─────────────────────────┼───────────────────────────────┤
│ Z — Zero     │ 0                       │ Even; neither + nor -;        │
│              │                         │ absorbs multiplication (0)    │
├──────────────┼─────────────────────────┼───────────────────────────────┤
│ O — One      │ 1 and -1                │ Multiplicative identity;      │
│              │                         │ invariant powers; not prime   │
├──────────────┼─────────────────────────┼───────────────────────────────┤
│ N — Negative │ -2, -5, -10             │ Flips inequalities; negative  │
│              │                         │ bases with even/odd exponents │
├──────────────┼─────────────────────────┼───────────────────────────────┤
│ E — Extremes │ 100, 1000, 0.001        │ Tests asymptotic dominance,   │
│              │                         │ exponential divergence        │
├──────────────┼─────────────────────────┼───────────────────────────────┤
│ F — Fraction │ 1/2, 1/10, -1/2         │ Squaring makes them smaller;  │
│              │                         │ reciprocals make them larger  │
└──────────────┴─────────────────────────┴───────────────────────────────┘

Detailed Breakdown of ZONEF Categories:

1. Z (Zero): Zero is the most lethal number on the GMAT. It is an even integer ($0 = 2 \times 0$). It is neither positive nor negative. It annihilates products ($0 \cdot x = 0$). Any integer divides 0 (except 0 itself), so 0 is a multiple of every integer.
2. O (One and Negative One): $1$ is an odd positive integer, but it is neither prime nor composite. Raising 1 to any power yields 1. Raising $-1$ to an even power yields $1$, while raising $-1$ to an odd power yields $-1$.
3. N (Negatives): Negative numbers reverse inequality signs when multiplied or divided ($x > y \implies -x < -y$). Negative integers possess parity ($-2$ is even, $-3$ is odd).
4. E (Extremes): Testing large numbers (such as $100$ or $1000$) reveals whether an expression is bounded or diverges to infinity. Testing tiny positive decimals ($0.01$) tests behaviour near zero.
5. F (Fractions): For any positive proper fraction ($0 < x < 1$): $x^2 < x < \sqrt{x} \quad \text{and} \quad \frac{1}{x} > x$ This completely inverts the behavior of integers greater than 1, where squaring produces larger values and square roots produce smaller values.

---

Parity (Even / Odd) Mechanics and Constraints

Parity questions are governed by strict algebraic identities that you must know cold:

The "Unstated Integer" Trap in Parity

Parity (evenness and oddness) is defined exclusively for integers. A fraction or decimal such as $2.4$ or $\frac{7}{2}$ is neither even nor odd.

Critical Trap: If the question stem states: "Is $a + b$ an even integer?", your first action is to verify whether $a$ and $b$ are defined as integers! If the stem merely states that $a$ and $b$ are real numbers, a statement such as $a \times b = 6$ does not prove that $a$ and $b$ are even or odd integers—$a$ could be $1.5$ and $b$ could be $4$.

Prime Factorization and Divisibility Logic

Divisibility questions on the GMAT are prime factor accounting problems. A number $N$ is divisible by an integer $K$ if and only if the prime factorization of $N$ contains every prime factor of $K$ with at least equal exponent multiplicity.

Expressing Divisibility Structurally

• Question: "Is $n$ divisible by 72?"
• Prime factorize 72: $72 = 2^3 \times 3^2$.
• The question rephrases to: "Does the prime factorization of $n$ contain at least three 2s and at least two 3s?"

When evaluating statements, avoid listing multiples. Break every given statement down into its prime constituent building blocks. If Statement (1) provides that $n$ is divisible by 24 ($2^3 \times 3$) and Statement (2) provides that $n$ is divisible by 18 ($2 \times 3^2$), neither statement alone guarantees three 2s AND two 3s. But combined, the Least Common Multiple (LCM) of 24 and 18 is $\text{LCM}(2^3 \cdot 3, 2 \cdot 3^2) = 2^3 \times 3^2 = 72$, making the statements together sufficient!

---

Sign Analysis: Inequalities, Powers, and Absolute Values

Sign questions typically revolve around determining whether an expression is strictly positive ($> 0$), strictly negative ($< 0$), or zero ($= 0$).

1. Product vs. Quotient Sign Equivalence

In real numbers, multiplication and division obey identical sign rules: $\frac{x}{y} > 0 \iff xy > 0 \quad (\text{provided } y \neq 0)$ $\frac{x}{y} < 0 \iff xy < 0 \quad (\text{provided } y \neq 0)$ If a GMAT problem gives $\frac{x}{y} > 0$, immediately rewrite it on your scratchpad as $xy > 0$ (both variables have the same non-zero sign).

2. The Even Exponent Trap

Any real number raised to an even power is non-negative: $x^2 \ge 0 \quad \text{for all real } x$ If $x \neq 0$, then $x^2 > 0$. However, $x^2 > 0$ gives zero information about the sign of $x$ itself! $x$ could be positive or negative.

• Consider: $x^2 y > 0$. Because $x^2$ must be positive ($x \neq 0$), you can safely divide both sides by $x^2$ to conclude that $y > 0$.
• However, you know nothing about the sign of $x$. It is a major trap to assume $x > 0$.

3. Absolute Value Polarity

Similarly, $|x| \ge 0$ for all real numbers. If $|x| = y$, this implies two distinct truths:

1. $y \ge 0$ (an absolute value cannot equal a negative number).
2. $x = y$ OR $x = -y$.

---

Step-by-Step Worked DS Examples

Worked Example 1: Parity and Unstated Constraints

Problem: If $x$ and $y$ are integers, is $x + y$ an even integer?

• Statement (1): $xy$ is an odd integer.
• Statement (2): $x - y$ is an even integer.

Step-by-Step Solution:

1. Analyze Question & Constraints: $x$ and $y$ are explicitly given as integers. The question is: "Is $x + y$ even?"
   • From parity rules: $\text{even} + \text{even} = \text{even}$, and $\text{odd} + \text{odd} = \text{even}$.
   • Therefore, $x + y$ is even if and only if $x$ and $y$ have the same parity (both even or both odd).
2. Evaluate Statement (1) Alone: $xy$ is an odd integer. The product of two integers is odd if and only if both integers are odd ($x$ is odd and $y$ is odd). Since both $x$ and $y$ are odd, their sum must be even: $\text{odd} + \text{odd} = \text{even}$. The answer is a definitive, universal YES. Statement (1) ALONE is sufficient.
   • Scratchpad: Retain AD. Eliminate BCE.
3. Evaluate Statement (2) Alone (Sterile Isolation): Wipe Statement 1 completely. Statement (2) states: $x - y$ is an even integer. The difference between two integers is even if and only if they share the same parity:
   • If both are even: $\text{even} - \text{even} = \text{even}$. Then $x + y = \text{even} + \text{even} = \text{even}$ (YES).
   • If both are odd: $\text{odd} - \text{odd} = \text{even}$. Then $x + y = \text{odd} + \text{odd} = \text{even}$ (YES). In all valid integer cases, $x$ and $y$ have identical parity, guaranteeing that $x + y$ is always even. Statement (2) ALONE is sufficient.
4. Final Verdict: Each statement alone is sufficient. The correct answer is Choice D.

---

Worked Example 2: Sign Analysis with Exponents

Problem: If $a$ and $b$ are non-zero real numbers, is $a > 0$?

• Statement (1): $a b^2 > 0$
• Statement (2): $a + b > 0$

Step-by-Step Solution:

1. Analyze Question & Givens: $a \neq 0$ and $b \neq 0$. We need to determine whether $a$ is strictly positive.
2. Evaluate Statement (1) Alone: $a b^2 > 0$. Because $b$ is a non-zero real number, $b^2$ is strictly positive ($b^2 > 0$). Dividing both sides of the inequality by the strictly positive term $b^2$ preserves the inequality direction: $\frac{a b^2}{b^2} > \frac{0}{b^2} \implies a > 0$ This establishes with 100% certainty that $a$ is positive. The answer is a definitive YES. Statement (1) ALONE is sufficient.
   • Scratchpad: Retain AD. Eliminate BCE.
3. Evaluate Statement (2) Alone: Wipe Statement 1 completely. Statement (2) states: $a + b > 0$. Test cases using ZONEF:
   • Case 2A: Let $a = 5$ and $b = 2$. Then $5 + 2 = 7 > 0$. Here $a > 0$ (YES).
   • Case 2B: Let $a = -2$ and $b = 5$. Then $-2 + 5 = 3 > 0$. Here $a < 0$ (NO). Statement (2) yields both YES and NO. Thus, Statement (2) is insufficient.
4. Final Verdict: Statement (1) alone is sufficient, but Statement (2) alone is not sufficient. The correct answer is Choice A.