7 prime-and-divisor traps in GMAT Focus Number Properties

Number Properties is the unglamorous engine room of the GMAT Focus Quant section. It does not show up with algebra signage or word-problem scaffolding; it lands on the screen as a short stem, a single integer, and a five-choice list that looks arithmetic until you realise two of the choices are designed to reward a wrong mental shortcut. Most candidates preparing for the GMAT Focus underestimate the section because the question stems look deceptively short, often 1 to 3 lines, but the score impact of a streak of missed Number Properties items is severe on a computer-adaptive test where the adaptive algorithm treats each item as an information event. This article is a working solution method, not a vocabulary list: how to read a Number Properties stem, which factor patterns to test first, when to use LCM, when to use GCD, and how to keep a clean number line so that the trap answers lose their appeal.

What the GMAT Focus actually means by "Number Properties"

In the GMAT Focus Quant section, the umbrella term "Number Properties" covers a tightly defined cluster of item families: divisibility, prime factorisation, greatest common divisor, least common multiple, remainders, digit operations, units digit cycles, and parity. The shared DNA of all these items is that the stem is short, the numbers are typically small enough to factor by hand, and the wrong answers are designed to be reached by a half-right method. The candidate who knows the vocabulary but not the diagnostic order will lose 3 to 5 scaled points per cluster of errors. The candidate who knows the diagnostic order rarely loses any.

Look at the item family from the test-designer's perspective. A Number Properties item is a small, well-constrained arithmetic puzzle. Because the surface area is small, every word in the stem is load-bearing. The phrase "positive integer" rules out zero and negatives. The phrase "less than" reverses the inequality. The phrase "must be a factor of" or "must be divisible by" determines whether the answer is a divisor, a multiple, or simply a property holder. If a candidate is rewriting the stem in their head and dropping a single negative, the entire problem drifts. For most candidates reading this, the first habit to install is to read the stem twice: once for the question type, once for the exact binding words.

The computer-adaptive format changes the texture of Number Properties. Because the GMAT Focus is adaptive within each Quant module, an early missed Number Properties item tends to pull the module toward easier questions across all sub-topics, not only Number Properties. A clean streak of four to six Number Properties items in the early-to-middle stretch of a module tends to keep the difficulty dial stable and opens up the second module. In practice, candidates who can clear Number Properties at a high rate report a smoother module-to-module handoff than candidates who spike in algebra and stumble in factors.

The four diagnostic questions you should ask in the first 20 seconds

Before reaching for the calculator or rewriting the stem as an equation, run the four-diagnosis checklist. It costs about 20 seconds and saves the entire item.

What is the question actually asking: a specific integer, a count, a remainder, or a property classification?
What universe are we in: positive integers, non-negative integers, all integers, or real numbers?
Which divisibility tool is in play: factor, multiple, divisor, or remainder?
Is the answer constrained or unconstrained: must it be the smallest possible, the largest possible, or any value that fits?

Item 1 forces you to recognise the output type. A "must be a divisor of N" question and a "how many divisors does N have" question are different animals. Item 2 is the most common silent failure: candidates treat "integer" as "positive integer" and end up adding 1 or 0 to a count that did not include them. Item 3 routes you toward the right toolkit. Item 4 is the trick most candidates miss: an answer is rarely a single number in Number Properties; it is usually a constraint, a count, or a remainder, and the four distractors test different interpretations of that constraint.

Worked micro-example. Stem: "If n is a positive integer such that n is divisible by both 6 and 10, what is the smallest possible value of n that is greater than 100?" Diagnosis in 20 seconds: question is asking for a specific integer; universe is positive integers; divisibility tool is LCM of 6 and 10; constraint is smallest value above 100. LCM(6, 10) = 30. Multiples of 30 above 100 start at 120. Answer is 120. The trap answer 150 comes from candidates who add 50 to 100 by reflex. The trap 110 comes from candidates who take the sum of 6 and 10 and add 100. Both are the same mistake dressed differently: skipping the diagnosis.

LCM, GCD, and prime factorisation: the toolkit and when to deploy each

Three tools sit at the centre of Number Properties. Prime factorisation is the substrate; least common multiple (LCM) and greatest common divisor (GCD) are the two products of that substrate. The mistake most candidates make is reaching for LCM by default because it was taught first. In a "must be a divisor of both A and B" question, the answer is a divisor of the GCD, not a multiple of the LCM. The reverse is also true.

When LCM is the right tool

LCM is the right tool when the stem asks when two cycles align, what is the smallest number that is a multiple of two given numbers, or what is the next shared multiple above a threshold. The classical alignment story is a clock problem where a chime sounds every 12 minutes and a bell every 18 minutes: the next time they coincide, you compute LCM(12, 18) = 36 minutes. The GMAT Focus rarely frames it as a clock; it usually says "if event A repeats every m units and event B every n units, what is the smallest interval after time t at which both occur again?" In every variant, the engine is LCM.

When GCD is the right tool

GCD is the right tool when the stem asks what is the largest integer that divides both, how many equal groups can be formed, or how many items can be packed into the largest possible same-size batches without remainder. A stem such as "what is the largest number of objects that can be distributed equally among 24, 36, and 60 containers?" routes to GCD. The trap answer is the LCM, which would correspond to "smallest number divisible by all three"; the LCM would give 360, but the question asked for divisor behaviour, so the answer is 12. In my experience this single swap between LCM and GCD is responsible for more Number Properties errors than any other.

When prime factorisation is the right tool

Prime factorisation is the right tool when the question asks how many divisors, whether a number is a perfect square, or what the exponent pattern of a number looks like. A number written as 2^a × 3^b × 5^c has (a+1)(b+1)(c+1) divisors. A number is a perfect square if and only if every exponent in its prime factorisation is even. These two results are tested in roughly one in five Number Properties items on the GMAT Focus. The trap answer is usually obtained by treating the exponents themselves as the count of divisors, which under-counts by exactly one per prime factor.

Remainders: modular arithmetic dressed in plain English

Remainder questions are modular arithmetic wearing a business suit. The stem is often phrased in terms of a leftover, a position, a sequence cycle, or a last digit. The core skill is the same: when dividing by n, only the remainder matters, and any two numbers with the same remainder mod n are interchangeable in a problem that asks for the next value in a sequence.

The standard mod-n toolkit

Five identities cover about 90% of remainder items on the GMAT Focus. (a + b) mod n = ((a mod n) + (b mod n)) mod n. The same identity holds for subtraction and multiplication. If a ≡ b (mod n) and c ≡ d (mod n), then a + c ≡ b + d (mod n) and ac ≡ bd (mod n). Powers cycle: a^k mod n is found by repeated reduction, not by carrying the full power through. If a is divisible by n, then a ≡ 0 (mod n), and any multiple of a is also divisible by n. The negative remainder is normalised by adding n: a ≡ b (mod n) means a - b is a multiple of n, even if a < b.

Worked example. Stem: "When the positive integer n is divided by 7, the remainder is 5. What is the remainder when 3n is divided by 7?" Apply identity (a × b) mod n: 3 × 5 = 15, 15 mod 7 = 1. Answer is 1. The trap answer is 15, the trap answer 5 (forgetting the multiplier), and the trap answer 4 (15 - 11 by mistake). All three are common; the modular identity route eliminates them in 10 seconds.

Remainders in sequence problems

Sequence remainder problems are the most common source of mid-test panic. The pattern is straightforward: a sequence is defined by a recurrence, the question asks for a value at a particular term, and the answer must be found without computing the entire sequence. The trick is to compute the sequence mod n for one full cycle. Once the cycle repeats, the rest of the terms are free. For most candidates, the trap is that they compute the first 12 terms when they needed only 6, or they stop too early and report a remainder that has not yet stabilised.

Units digit cycles and the last-two-digits shortcut

Units digit problems are a quiet friend on the GMAT Focus. The cycles are short: the units digit of 2^k cycles every 4 (2, 4, 8, 6), 3^k cycles every 4 (3, 9, 7, 1), 4^k cycles every 2 (4, 6), 5^k cycles every 1 (always 5), 6^k cycles every 1 (always 6), 7^k cycles every 4 (7, 9, 3, 1), 8^k cycles every 4 (8, 4, 2, 6), 9^k cycles every 2 (9, 1), and 0^k cycles every 1. The exponent to test is the power mod cycle length. A stem such as "what is the units digit of 7^83?" reduces to 7^(83 mod 4) = 7^3, and the units digit of 7^3 is 3.

The two-digit shortcut extends the same idea. A stem such as "what is the last two digits of 7^83?" routes through the totient cycle of 100 when the base is coprime to 100. 7^83 mod 100 can be reduced to 7^(83 mod 20) mod 100 = 7^3 mod 100 = 343 mod 100 = 43. The GMAT Focus rarely asks for last-two-digits by accident; when it does, the candidate who knows the cycle method finishes in under a minute. The trap answer is the units digit reported as the two-digit answer, which loses one of the two required digits.

Common pitfalls and how to avoid them

Mixing LCM and GCD on a divisor-versus-multiple question. Re-read the binding verb: "is divisible by" pulls toward LCM; "divides" or "is a factor of" pulls toward GCD.
Computing a full sequence when only the mod-n cycle is needed. Reduce mod n, not the absolute value, and look for cycle length at most n.
Dropping the word "positive" in the universe. If the stem says "positive integer," zero is excluded from any count.
Using the wrong cycle length for units digits. The cycle is the smallest k such that a^k ≡ a (mod 10) only when a and 10 are coprime; for 2, 3, 7, 8 the cycle is 4; for 4 and 9 the cycle is 2.
Counting divisors as if each prime's exponent contributes one extra. The (e1 + 1)(e2 + 1) formula is the only correct one.

Divisibility shortcuts: the mental arithmetic stack that saves seconds

Most Number Properties items on the GMAT Focus are solvable without long division, and the items that look like they require long division usually have a divisibility shortcut hidden in plain sight. The set of divisibility rules worth memorising is small. A number is divisible by 2 if its units digit is even. By 3 if its digit sum is divisible by 3. By 4 if its last two digits form a number divisible by 4. By 5 if its units digit is 0 or 5. By 6 if it is divisible by both 2 and 3. By 8 if its last three digits form a number divisible by 8. By 9 if its digit sum is divisible by 9. By 10 if its units digit is 0. By 11 if the alternating sum of its digits is divisible by 11.

The rule that pays the highest dividend on a timed section is the digit-sum rule for 3 and 9. A stem such as "if n is a 4-digit number and the sum of its digits is 27, is n divisible by 9?" is a one-line problem: 27 is divisible by 9, so n is divisible by 9, so yes. The candidate who begins subtracting 9 from 27 to count something is reading past the question. The rule for 11 is rarer but valuable; the alternating sum is taken from the rightmost digit, and the sign alternates +, -, +, -, ... . For 187, alternating sum is 7 - 8 + 1 = 0, so 187 is divisible by 11.

The "last two digits" trick for 4 and the "last three digits" trick for 8

These two rules get the candidate out of 90% of long-division traps. A stem such as "which of the following could be the value of n if n is divisible by 4?" is answered by checking only the last two digits of each answer choice, not the entire number. If a choice ends in 24, 28, 32, 36, 40, 44, 48, 52, and so on, it is divisible by 4. If a choice ends in 23, 27, 31, 35, 39, 43, 47, and so on, it is not. The same idea for 8 takes the last three digits and applies the same modular check. The GMAT Focus answer choices are designed to look like they require full division, and the candidate who has the rule in muscle memory clears four to five items per module faster than peers who reach for paper long division.

Reading the stem for the negative word and the order of operations

Two sentence-level traps are responsible for a large share of avoidable Number Properties errors. The first is the negative word. "Which of the following must NOT be true?" and "Which of the following must be true?" are opposite questions, and a candidate who reads the stem for 5 seconds in a hurry will answer the wrong one about 20% of the time. The fix is a tiny mental highlight: underline the modal verb in your head. Must, could, must not, cannot. The second trap is the order of operations. Stems that say "n is divided by m" mean n / m, but stems that say "m divides n" mean m is a factor of n, and the arithmetic is inverted. "2 divides 6" is true; "6 is divided by 2" gives 3. The two phrases look identical in fast reading and they are not.

Below is a compact comparison of the most common Number Properties question shapes on the GMAT Focus, the binding phrase to highlight, and the typical trap answer to expect.

Question shape	Binding phrase	Tool to deploy	Common trap
Smallest common multiple above a threshold	"smallest n such that"	LCM, then walk up multiples	Adding the two numbers instead of LCM
Largest divisor shared by two values	"largest integer that divides both"	GCD	Computing LCM and reporting it
Remainder of a product	"remainder when ab is divided by n"	Modular multiplication	Multiplying remainders without reducing
Count of divisors	"how many positive divisors"	(e1+1)(e2+1)...	Reporting the exponent sum
Units digit of a power	"units digit of a^k"	Cycle of length 1, 2, or 4	Computing the full power
Even/odd classification	"must be even" / "must be odd"	Parity chain	Missing a sign flip from subtraction
Perfect square test	"is a perfect square"	All exponents even	Forgetting the empty factor of 1
Last two digits	"last two digits of a^k"	Mod 100 cycle	Reporting only the units digit

How Number Properties interacts with the rest of the Quant section

Number Properties is rarely siloed. A stem can present an inequality and ask for the count of integers satisfying it, which is half Number Properties and half algebra. A stem can present a rate-time-distance problem where the question of interest is whether a quantity is even, which is a parity check on the back of a word problem. The candidate who treats Number Properties as a stand-alone topic will miss these hybrids. The candidate who treats it as a layer that sits on top of every other Quant topic will read those hybrids correctly because the number-layer is a quick first pass before the algebra-layer is engaged.

The GMAT Focus scoring logic also rewards hybrid fluency. The Quant section is scored on a 60 to 90 scale, with most admitted MBA candidates clustered between 75 and 85. A single missed Number Properties item in a high-difficulty module is estimated to cost 2 to 4 scaled points depending on the position in the module and the difficulty of surrounding items, and the cost compounds when the adaptive engine pulls the rest of the module down. In contrast, a clean run of four to five Number Properties items in the early stretch of a module tends to keep the algorithm on its higher branch. The candidate who can switch between Number Properties and algebra within a single stem, without losing time, gains more than just the points of the question itself.

Working at the right pace: minute-per-question budgets for Number Properties

On the GMAT Focus, the Quant section gives roughly 45 minutes for 21 questions, which translates to an average of about 2 minutes and 9 seconds per item. Number Properties items are usually faster than the average, and most candidates should aim for 90 seconds or less on a clean item. The trade-off is that a hard Number Properties item can absorb 3 to 4 minutes if the cycle is unusual or the stem hides a divisibility rule that the candidate is reconstructing on the spot. The pacing rule that I teach is straightforward: spend 90 seconds on a Number Properties item, set a hard stop at 150 seconds, and mark the item for return. Do not break the pacing rule to finish an item that is already on the wrong branch; the adaptive module punishes slow wrong items more than fast marked items.

How to build a 14-day Number Properties sub-plan

For candidates whose practice test shows a leak in Number Properties but a clean run in algebra and word problems, a focused 14-day sub-plan works better than spreading the topic across a 12-week schedule. The structure is simple. Days 1 to 3 are diagnosis: take 30 Number Properties items in timed conditions, classify every miss by the four-diagnosis checklist, and produce a list of recurring error types. Days 4 to 6 are tool installation: re-learn prime factorisation, the divisor count formula, the units digit cycles, and the divisibility rules, and complete 20 untimed items to confirm tool fluency. Days 7 to 10 are mixed timed practice: 15 items per day, 90-second budget, with a hard stop at 150 seconds. Days 11 to 12 are hybrid drills: items that combine Number Properties with algebra and word problems. Days 13 to 14 are full timed review and reflection. In my experience, this sub-plan clears the topic-specific leak in two weeks for most candidates, after which a 12-week general plan can absorb the rest of the Quant syllabus.

Conclusion and next steps

Number Properties is the most teachable section of the GMAT Focus Quant, and that is precisely why it punishes the unprepared: the items reward diagnostic clarity and punish a default to LCM. The working method is short. Run the four-diagnosis checklist, deploy LCM only when the answer is a shared multiple, deploy GCD only when the answer is a shared divisor, route all divisor counts through the (e+1) formula, route all powers through modular cycles, and keep the binding verb in plain view. A 14-day focused sub-plan is usually enough to close the topic-specific leak, after which the candidate can re-enter the broader Quant schedule with a tighter pacing budget. TestPrep Europe's diagnostic assessment is a natural starting point for candidates building a sharper preparation plan around the Number Properties item families discussed above.

Frequently asked questions

How many Number Properties questions appear on the GMAT Focus Quant section?

The GMAT Focus does not label sub-topics, so the exact count varies by form. In practice, Number Properties and its hybrids (parity checks on word problems, divisibility constraints on algebra stems) account for roughly 25 to 35 per cent of a Quant module. Candidates should plan to see four to seven pure Number Properties items per module, plus several hybrids.

Is the divisor-count formula (e1 + 1)(e2 + 1)... worth memorising?

Yes. It is one of the highest-leverage facts on the Quant section. A number expressed as p1^e1 × p2^e2 × ... has (e1 + 1)(e2 + 1)... positive divisors. The most common error is reporting the sum of the exponents, which under-counts by a factor of roughly two. The formula is the only correct general form and is tested directly in about one in five pure Number Properties items.

Should I always use LCM for "smallest number divisible by both" questions?

Yes, provided the two numbers are positive integers. LCM gives the smallest positive integer divisible by both. The trap is using LCM on questions that ask for a shared divisor (GCD) or on questions where the answer is constrained to be above a threshold, in which case you must walk up the LCM multiples until the threshold is exceeded. Read the binding phrase: "smallest n that is a multiple of both" is LCM plus a walk; "largest n that divides both" is GCD.

How do I decide when a Number Properties item is worth a 90-second solve versus a mark-and-return?

If the binding verb is clear and the four-diagnosis checklist maps to a known tool, attempt the item in 90 seconds. If the stem hides an unusual cycle, a perfect-square test, or a hybrid with algebra, give yourself 150 seconds maximum. Beyond 150 seconds, mark the item and return later if time permits. Slow wrong items cost more scaled points than fast marked items on a computer-adaptive section.

Do I need a calculator for Number Properties on the GMAT Focus?

An on-screen calculator is available, but for most Number Properties items it slows you down. The items are designed so that prime factorisation, divisibility rules, and modular cycles reach the answer faster by hand. Use the calculator only for items that combine Number Properties with arithmetic in word problems, where intermediate products can grow past 100.

7 prime-and-divisor traps in GMAT Focus Number Properties and the