Practice QuestionsOctober 13, 2026·3 min read

"If a Positive Integer n Is Divisible by Both 5 and 7..." — GMAT® Worked Solution

A GMAT® divisibility question with Roman numerals, solved by writing divisibility as a fraction and separating what must cancel from what only might.

Isaac Puglia
Isaac Puglia
Founder, The GMAT® Strategy · 99th percentile scorer

"If a Positive Integer n Is Divisible by Both 5 and 7..." — GMAT® Worked Solution

Source: Official Guide for GMAT® Review, 11th Edition

If a positive integer nn is divisible by both 5 and 7, then nn must also be divisible by which of the following?

I. 12

II. 35

III. 70

(A) None

(B) I only

(C) II only

(D) I and II

(E) II and III

Try it before reading on.


Step 1: Write Divisibility as a Fraction

Divisible means the division produces an integer, with nothing left over. "nn is divisible by 5 and 7" becomes a fraction with nn in the numerator (what's being divided) and the divisors in the denominator (what we're dividing by):

n5×7=integer\frac{n}{5 \times 7} = \text{integer}

Writing "= integer" to the right of the fraction is part of the setup. It names the requirement the fraction has to meet, which keeps the analysis anchored to the definition of divisibility instead of to a shelf of memorized rules.

Step 2: Establish What Has to Cancel

For the fraction to produce an integer, every prime in the denominator needs a matching prime in the numerator to cancel it. The problem guarantees two matches: a 5 and a 7 somewhere in the prime factorization of nn. Anything else the factorization might contain is unknown, which means anything else is a maybe.

Step 3: Check Each Roman Numeral

Roman numeralPrime factorizationMust it divide nn?
I. 122×2×32 \times 2 \times 3No, it needs 2s and a 3 the problem never promised
II. 355×75 \times 7Yes, both primes cancel with what nn is guaranteed to have
III. 702×5×72 \times 5 \times 7No, the 2 is a maybe

Each row follows from the same test. Roman numeral I might divide nn: if nn happens to be 2×2×3×5×72 \times 2 \times 3 \times 5 \times 7, then 12 divides it evenly, and if nn is exactly 5×75 \times 7, it doesn't. Roman numeral III runs the same way, one 2 short of a guarantee. Roman numeral II is the exact pair the problem handed over, so it divides nn no matter what else is in there.

The answer is (C).

The Same Answer by Testing a Number

A single well-chosen value settles this question: n=35n = 35. It isn't divisible by 12, it is divisible by 35, and it isn't divisible by 70, so Roman numerals I and III both fail the "must" test. One counterexample is enough to kill a "must" claim.

Testing numbers is a reasonable front-line approach when the values stay small, and it's a quick route for plenty of test takers. Its weakness shows up as numbers grow: a question built on larger divisors makes trial values harder to pick and to check, while the fraction setup barely changes. Knowing both routes means a number-tester who gets stuck has somewhere to fall back.

Why This Problem Matters

The scoring happens on the question word. "Must" selects only what's guaranteed, and "might" doesn't get selected, even when it's likely. Choice (E), II and III, is stocked for reading "70 contains a 35" as a guarantee: containing a guaranteed factor doesn't make 70 guaranteed, because nn could be exactly 35, and 35 doesn't divide by 70.


Ready for the next one? "If 4 Is One of the Solutions to x² + 3x + k = 10..." — GMAT® Worked Solution.


Want the full strategy? Read: GMAT® Percents, Divisibility, and Quadratics: Translate First, Solve Second

From Episode 11 of Real GMAT® Problems (The GMAT® Strategy Podcast).

Want to learn even more?

Hear the full breakdown in the podcast episode — including walk-throughs, examples, and strategy you can use this week.

Or grab the free e-book — 3 keys to reaching your dream GMAT® score faster.