Quant

Data Sufficiency questions don't ask you to solve — they ask whether you *could* solve, given each statement. That distinction is the entire game: test-takers who instinctively start calculating usually do unnecessary work and run out of time.

A reliable four-step approach: (1) simplify the question stem into its simplest logical form before looking at the statements, (2) evaluate Statement (1) alone, (3) evaluate Statement (2) alone — forgetting everything you learned from Statement (1), and (4) only if needed, combine them.

The most common error is 'statement carryover' — letting information from Statement (1) leak into your evaluation of Statement (2). Cover Statement (1) with your hand (physically, if it helps) while judging Statement (2) in isolation.

Practice recognizing sufficiency without fully solving: if a statement pins a variable to exactly one value (even if you don't compute it), that's sufficient. You rarely need the actual number — you need to know a unique answer exists.

Most Quant word problems are not hard once translated correctly — they're hard because the translation step is rushed. Read the entire problem once before writing anything, identifying what is being asked before you define variables.

Assign variables to the actual unknowns the question asks about, not to intermediate quantities mentioned in the setup. This keeps your final equation directly answerable instead of requiring an extra conversion step at the end.

Watch for 'of' (multiplication), 'is'/'was' (equals), and ratio language ('for every,' 'per') — these are the highest-value words to translate literally and immediately, since misreading them is the single most common source of algebra errors on this test.

When a problem feels unsolvable algebraically under time pressure, backsolving from the answer choices is a legitimate, fast strategy — start from the middle answer choice and adjust up or down based on whether it's too large or too small.

A large share of quant questions test number properties indirectly, inside a word problem or DS statement. Knowing a handful of rules cold — even × even = even, odd × odd = odd, the sum of two odds is even, and so on — turns a multi-step algebra problem into a 10-second logic check.

Divisibility and remainders show up constantly in 'what is the smallest/largest value of...' questions. If a number is divisible by both 4 and 6, it must be divisible by their least common multiple (12) — not merely their product (24).

Prime factorization is the single highest-leverage tool for LCM/GCD, divisor-counting, and 'is this a perfect square' questions. Practice breaking numbers into primes quickly rather than relying on trial and error.