Relvora Prep

GMAT Data Insights lesson · DS: number properties

GMAT Data Sufficiency: number properties

How to judge GMAT Data Sufficiency questions on parity, divisibility, remainders and signs: the five answers, the AD/BCE method and the classic traps.

The core idea

Data Sufficiency asks whether the statements are enough to answer, not what the answer is. Judge statement (1) alone, then (2) alone, then both together. A statement is sufficient only if every case that fits it gives the same answer, and a definite 'no' counts.

Core ideas

Every Data Sufficiency question has a question and two statements. You decide whether the statements give enough information to answer, and you don't have to find the answer itself. The five answers never change:

Answer Meaning
A Statement (1) alone is sufficient, but statement (2) alone is not.
B Statement (2) alone is sufficient, but statement (1) alone is not.
C Both statements together are sufficient, but neither one alone is.
D Each statement alone is sufficient.
E The two statements together are not sufficient.

Why it works. "Sufficient" means one answer, whatever the numbers are: every case that fits the statement must give the same answer. So to show a statement is not sufficient, you only need two cases that fit it and answer differently.

The AD/BCE method. Judge (1) alone first. That splits the five answers in two:

Is (1) alone sufficient?yesYes: A or Dthen(2) alone? D if yes, else A
If (1) alone works, the answer is A or D; only (2) alone decides which
Is (1) alone sufficient?noNo: B, C or Ethen(2) alone? B if yesthenElse both: C or E
If (1) alone fails, check (2) alone, and combine only if both fail alone

Rules the GMAT keeps. The statements are always true, and they never contradict each other. When you judge (2) alone, forget what (1) said.

Parity

Rewrite each statement as a fact about n. For example, n + 7 is odd means n is even.

Example. If n is a positive integer, is n even? (1) n + 7 is odd. (2) n² + n is even.

  1. (1): an odd number minus 7 is even, so n is even. The answer is always yes: sufficient.
  2. (2): n² + n = n(n + 1), a product of two consecutive integers, is always even. n = 1 (no) and n = 2 (yes) both fit: not sufficient.
  3. Answer A.

Trap: answering D because (2) "looks like" a parity fact. A statement that is true for every n tells you nothing.

Divisibility

To be divisible by 12, n needs every prime factor of 12: 2 × 2 × 3.

Example. If n is a positive integer, is n divisible by 12? (1) n is divisible by 6. (2) n is divisible by 4.

124223
12 = 2 × 2 × 3: divisible by 4 gives both 2s, divisible by 6 gives the 3
  1. (1): n = 6 (no) and n = 12 (yes) both fit: not sufficient.
  2. (2): n = 4 (no) and n = 12 (yes) both fit: not sufficient.
  3. Together: n is divisible by both 6 and 4, so by their least common multiple, 12. Always yes: sufficient.
  4. Answer C.

Trap: multiplying 6 × 4 = 24 and thinking you need 24. You need the least common multiple, 12.

Remainders

A remainder by m settles the remainder by k when k divides m.

Example. If n is a positive integer, what is the remainder when n is divided by 4? (1) The remainder when n is divided by 12 is 7. (2) The remainder when n is divided by 3 is 2.

  1. (1): n = 12q + 7. 12q is a multiple of 4, and 7 leaves 3, so the remainder is always 3: sufficient.
  2. (2): n = 2 (remainder 2) and n = 5 (remainder 1) both fit: not sufficient.
  3. Answer A.
048121620719
Numbers with remainder 7 when divided by 12 (7, 19, …) all leave remainder 3 when divided by 4

Two integers

Track the parity of each integer separately.

Example. If m and n are positive integers, is mn even? (1) m − n is even. (2) m + n is even.

  1. (1): m and n are both even or both odd. m = 2, n = 2 gives yes; m = 1, n = 1 gives no: not sufficient.
  2. (2): it says the same thing (both even or both odd), with the same two cases: not sufficient.
  3. Together: still both even or both odd. Not sufficient.
  4. Answer E.

Trap: answering C because two statements "should" be enough. Here they say the same thing.

Signs

Turn each statement into the signs it forces. Squares are positive, so they never change a sign.

Example. If x and y are nonzero integers, is xy > 0? (1) xy² > 0. (2) x²y < 0.

  1. (1): y² is positive, so x > 0, but y could be either sign: not sufficient.
  2. (2): x² is positive, so y < 0, but x could be either sign: not sufficient.
  3. Together: x > 0 and y < 0, so xy < 0. The answer is a definite no: sufficient.
  4. Answer C.

Trap: answering E because the answer is "no". A definite no answers a yes/no question.

Practice

Work through Data Sufficiency questions on number properties on the practice page.

Common traps

  • Trusting a statement that fits two different answers

    Before you call a statement sufficient, try to break it: find two numbers that fit it and give different answers. n = 1 and n = 2 both fit 'n² + n is even', so it settles nothing.

  • Stopping after the first sufficient statement

    Judge each statement on its own, every time. If (1) alone works, (2) alone might work too (answer D), and you never need both (C is out).

  • Treating a definite 'no' as not enough

    A yes/no question is answered by a definite no as well as a definite yes. If every case that fits gives 'no', the statement is sufficient.