GMAT® Prime Numbers: A Complete Guide

Primes show up early in most math educations, and the definition hasn't changed since you first met it: exactly two distinct factors, 1 and the number itself. So it makes sense to file them under "already know that" and spend prep time on material that feels more GMAT®-specific, like Data Insights or word problems.

The catch is that the exam rarely asks a bare definition question. Primes sit inside other questions instead, where a small detail in the stem (the word "different," the phrase "greater than 2," or the demand for the least possible value) decides the answer. The edges of the definition do the work: one isn't prime, two is the only even prime, and every prime past two is odd. This guide covers the exact definition, the memorization question, and the places where primes do their work inside other questions.

What a prime number is

A prime number has exactly two distinct factors: 1 and itself. That's the definition the GMAT® uses, and the phrase "exactly two" is where the precision lives, because it settles two boundary cases the exam likes to build on.

The first boundary is the number 1, which has only one factor and therefore isn't prime. That isn't a technicality invented to trip anyone up; it's part of what keeps prime factorization consistent, which we'll get to below. The second boundary is 2, the smallest prime and the only even one. Every other even number carries at least three factors (1, 2, and itself), so nothing even past 2 can qualify. Parity questions on the exam lean on that fact quietly, rarely needing to say "prime" out loud to test whether you have it available under pressure.

The primes up to 100, for reference: 2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61, 67, 71, 73, 79, 83, 89, 97.

Memorize them or derive them?

Whether to bank that list is a target-score question, and it's worth deciding on purpose rather than by feel. If you're aiming above the 90th percentile, a 655 or higher on the Focus Edition, we recommend memorizing every prime up to 100. Past 100, direct computation with primes is uncommon in the questions we see, and when large primes do show up, the question usually carries some structure that saves you the testing. If your target is a 505, 555, or 605 that clears the bar for your programs, memorizing the whole list is probably overkill, and deriving primes one at a time as a question demands is a few seconds of work with the method below.

The payback for memorizing shows up as speed: recognizing 23, 29, and 31 on sight means those seconds go to the question wrapped around them instead of to testing candidate divisors. Confidence is part of it too, and under time pressure that can matter as much as the seconds.

Deriving primes on the fly

Say a question sends you into the range just past 20 and you need the primes there. The evens drop out, since nothing even past 2 is prime. The odds come down to times tables: 21 is $3 \times 7$, 25 is $5^2$, and 27 is $3 \times 9$, which leaves 23 and 29 standing.

That walk is where times tables pay off. We recommend knowing them up to $20 \times 20$; stopping at $10 \times 10$ leaves you reaching for products like $13 \times 17$, and prime questions lean on exactly those products.

How to test one number

To check whether a specific number is prime, try dividing it by each prime up to its square root. If none divide it evenly, the number is prime. The square root is the boundary because any factor bigger than the root would need a partner smaller than the root to complete the pair, so the small primes cover every possibility.

Take 91. Its square root sits a bit past 9, so the candidate divisors are 2, 3, 5, and 7. It's odd, the digit sum is 10 so 3 doesn't divide it, and it doesn't end in 0 or 5. Then 7 divides it evenly: 91 is $7 \times 13$. A number that looks prime at a glance isn't, and the test catches it in four moves.

Why primes matter: they're the building blocks

Every whole number greater than 1 is either prime or a product of primes, and that product is unique. The number 60, for example, factors as:

$60 = 2^2 \times 3 \times 5$

There's no other way to build 60 from primes, which makes the factorization a kind of fingerprint for the number. A factor tree gets you there in two branches, and our number properties guide walks one through step by step.

That fingerprint is what divisibility questions read: a question asking what a number must be divisible by is really asking which primes it must contain. The least common multiple takes the highest power of each shared prime, and the greatest common factor takes the lowest. Our divisibility rules guide and LCM guide both run on this engine, and the exponents guide extends it into powers.

Where primes hide

The definition also does quiet work inside questions that don't use the word "prime."

Parity past two

Every prime past 2 is odd, so the sum or difference of two primes past 2 is always even. A retired Official Guide problem turns on exactly this: for different primes x and y, each greater than 2, the claim that $x + y$ can't equal 91 looks like it needs big-number checking. It doesn't. Both primes are odd, odd plus odd is even, and 91 is odd, so the claim holds without testing a single pair.

The tempting exception is $2 + 89 = 91$, and it fails because 2 isn't greater than 2. Constraint language decides the question, which is part of why we recommend writing constraints down before solving.

Quotients of different primes

A prime has no divisors other than 1 and itself, so dividing one prime by a different prime never produces an integer. $\frac{7}{3}$ is a quick example. In Data Sufficiency, recognizing that structure can let you settle a statement without calculating anything, and our DS guide covers how to pressure-test statements like it.

Divisibility built from primes

When a Data Sufficiency statement says a number is divisible by 9 and by 10, the prime factorizations ($3^2$ and $2 \times 5$) tell you what the number must contain: two 3s, one 2, and one 5. Those two numbers share no primes, so the least such number is their product, 90. When the numbers do share primes, the least such number comes down to the highest-power rule, and the LCM machinery in our LCM guide runs that play in full.

Try this one

Try this one before reading on.

The three smallest primes greater than 20 are 23, 29, and 31, and their sum is the least integer the question can ask for:

$23 + 29 + 31 = 83$

The answer is (E).

If you didn't have those primes memorized, the derivation walk from earlier does the job: the evens drop out, the times tables clear the odd composites, and 23, 29, and 31 are what's left by the time you reach 30.

Choice (A) draws a notable share of wrong answers because $23 \times 3 = 69$ comes from adding 23 to itself three times, which misses the word "different" in the question stem. It's correct arithmetic pointed at an answer the question didn't request. In the answer distribution for this retired Official Guide question, about 14% of test takers miss it, and 6% land on (A). Rereading the stem before locking in an answer catches this kind of miss, and it takes less time than it feels like it does.

FAQ

What is a prime number on the GMAT®?

A number with exactly two distinct factors: 1 and itself. One doesn't qualify because it has only a single factor, and 2 is the smallest prime and the only even one.

Is 1 a prime number?

No. It has exactly one factor, and a prime needs exactly two distinct factors.

Is 2 a prime number?

Yes. It's the smallest prime and the only even prime, since every even number past 2 has at least the three factors 1, 2, and itself.

Do you need to memorize prime numbers for the GMAT®?

If your target is a 655 or higher, we recommend memorizing the primes up to 100. For lower target scores, you can derive primes one at a time using times tables and the square-root test.

How do you check whether a number is prime?

Try dividing it by each prime up to its square root. For 91, you'd test 2, 3, 5, and 7, and 7 divides it, since 91 is $7 \times 13$. If no prime up to the square root divides the number evenly, it's prime.

How do primes show up in GMAT® questions?

Inside other topics: divisibility and LCM/GCF questions run on prime factorization, and Data Sufficiency statements use primes to build parity conditions and quotient claims.

Want to learn even more?

Related reading:

• GMAT® Number Properties: A Complete Guide
• GMAT® Divisibility Rules: A Complete Guide
• GMAT® Least Common Multiples: A Complete Guide
• GMAT® Data Sufficiency: How to Approach DS Questions
• How Writing Down More Improves Your GMAT® Score

The sum-of-primes problem above comes from Episode 33 of our Real GMAT® Problems series, "Primes, Algebra, and Arithmetic", which also covers when memorizing primes pays off, and the 91 parity question comes from Episode 27, "Exponents, Primes, and Percent Change". The Math Basics series covers these definitions from the ground up. You can hear everything on Spotify, Apple Podcasts, or YouTube.