BREAKING: Target Test Prep releases Brand New 2026 On Demand GMAT prep course

Redeem

Target Test Prep · GMAT

Choose how you want to prepare

Learn live with an expert or move at your own pace. Every option includes the complete TTP study system.

★★★★★5.0559 reviews
GMATLiveTeach Starts Oct 17
Chris Peckover, Target Test Prep GMAT expert
LIVE ONLINE CLASSES

Get Ready for GMAT Test Day Faster with Live Online Classes

with Chris Peckover, 100th-Percentile GMAT Scorer

Oct 17 · Chris Peckover
Sat · 11:00 AM to 2:00 PM ET
Oct 20 · Chris Peckover
Tue, Thu · 8:00 to 10:00 PM ET
Oct 25 · Josh Braslow
Sun · 1:00 to 4:00 PM ET
Included
40 hours of live online classes + 6 months of TTP OnDemand
  • Attend the first class for free
  • Every class is recorded, so you never fall behind
View classes & enroll
Limited seats availableTarget Test Prep
EALiveTeachOnDemand 5 seats left Start anytime
EXECUTIVE ASSESSMENT

Target Test Prep EA OnDemand

Self-paced EA prep. Study on your schedule.

Logan Thompson
EXECUTIVE ASSESSMENT

Sep 6 to Dec 6, 2026

with Logan Thompson

165+ EA score guarantee
$05-day trial no automatic billing
Schedule
Sun · 9:30 AM to 12:30 PM ET
Included
40 hours of live online classes plus six months of access to the complete TTP EA OnDemand course.
  • 165+ EA Score Guarantee
  • 4,100+ Quant, Verbal, and Integrated Reasoning practice questions
  • 400+ hours of in-depth video lessons
  • 3,000+ step-by-step video solutions
View EA class & enroll Start free 5-day trial
Limited cohort · enrollment openTrial includes full course accessTarget Test Prep
GMATOnDemand Start anytime
SELF-PACED MASTERCLASS

Target Test Prep GMAT OnDemand

Complete access from day one. Study on your schedule.

715+ score guarantee
$0to start then $127/mo
  • Personalized study plan and analytics
  • Thousands of lessons and practice questions

Compare the format, schedule, and included access before enrolling. Prices and seat counts shown reflect the supplied offer details.

Is 12,500,000 a factor of positive integer n?

Expert replies
by gmattesttaker2 » Sun Mar 30, 2014 9:22 pm
Hello,

Can you please tell me if my approach is correct here:

Is 12,500,000 a factor of positive integer N ?

(1) 5^8 is a factor of N
(2) 20^5 is a factor of N

OA: C

12,500,000 = 5^8 x 2^5. So is N/(5^8 x 2^5) an integer?

1) N/5^8 is an integer. I was wondering if this is sufficient since it means that N does not have 2^5.

2) 2^10 x 5^5 is a factor of N. I was wondering if this is sufficient as well since it means that N does not have 3 more 5's.

Can you please assist with this?

Thanks,
Sri
Join the discussion
Source: — Data Sufficiency |

by [email protected] » Sun Mar 30, 2014 10:28 pm
Hi Sri,

You've prime-factored 12,500,000 correctly. Now you have to be clear on what the question asks for.

For 12,500,000 to be a factor of N, N MUST contain 5^8 AND 2^5 (it can include other primes as well, but must have the aforementioned primes to be divisible by 12,500,000). This is a YES/NO question.

Fact 1: 5^8 is a factor of N.

This doesn't give us the necessary information to answer the question.
IF N = 5^8, then the answer to the question is NO
IF N = 5^8(2^5), then the answer to the question is YES.
Fact 1 is INSUFFICIENT

Fact 2: 20^5 is a factor of N.

This breaks down into (2^10)(5^5)

IF N = (2^10)(5^5) then the answer to the question is NO (in basic terms, there are not "enough 5s")
IF N = (2^10)(5^5)(5^3) then the answer to the question is YES
Fact 2 is INSUFFICIENT

Combined, we know that the following numbers are factors of N:
5^8
(2^10)(5^5)

This means that N MUST consist of at least (5^8) and (2^10). This information is enough to confirm that the answer is YES.
Combined, SUFFICIENT

Final Answer: C

GMAT assassins aren't born, they're made,
Rich
Contact Rich at [email protected]
Image
Join the discussion

by Brent@GMATPrepNow » Mon Mar 31, 2014 9:49 am
gmattesttaker2 wrote:Is 12,500,000 a factor of positive integer N ?

(1) 5^8 is a factor of N
(2) 20^5 is a factor of N
I'd like to elaborate a little on Rich's excellent post.

For questions involving factors (aka "divisors"), we can say:
If k is a divisor of N, then k is "hiding" within the prime factorization of N
Consider these examples:
3 is a divisor of 24 because 24 = (2)(2)(2)(3), and we can clearly see the 3 hiding in the prime factorization.
Likewise, 5 is a divisor of 70 because 70 = (2)(5)(7)
And 8 is a divisor of 112 because 112 = (2)(2)(2)(2)(7)
And 15 is a divisor of 630 because 630 = (2)(3)(3)(5)(7)

So...

Target question: Is 12,500,000 a factor of positive integer N ?

12,500,000 = (2)(2)(2)(2)(2)(5)(5)(5)(5)(5)(5)(5)(5)
Or we can write: 12,500,000 = (2^5)(5^8)

Let's rephrase the target question as...
REPHRASED target question: Are there five 2's and eight 5's hiding in the prime factorization of N?

Statement 1: 5^8 is a factor of N
This tells us that there are eight 5's hiding in the prime factorization of N.
What about the five 2's?
We can't say whether or not the five 2's are also hiding in the prime factorization of N.
As such, statement 1 is NOT SUFFICIENT

Statement 2: 20^5 is a factor of N
Notice that 20 = (2)(2)(5) = (2^2)(5)
So, 20^5 = (2^10)(5^5)
In other words, (2^10)(5^5) is a factor of N.
In other words, there are ten 2's and five 5's hiding in the prime factorization of N.
So, we can't say whether or not there are five 2's and eight 5's hiding in the prime factorization of N.
Since we cannot answer the target question with certainty, statement 2 is NOT SUFFICIENT

Statements 1 and 2 combined
Statement 1 guarantees that we have eight 5's hiding in the prime factorization of N.
Statement 2 guarantees that we have five 2's hiding in the prime factorization of N.
So, the statements combined guarantee that there are five 2's and eight 5's hiding in the prime factorization of N
Since we can answer the target question with certainty, the combined statements are SUFFICIENT

Answer = C

Cheers,
Brent
Brent Hanneson - Creator of GMATPrepNow.com
Image
Join the discussion

by gmattesttaker2 » Wed Apr 02, 2014 5:26 pm
[email protected] wrote:Hi Sri,

You've prime-factored 12,500,000 correctly. Now you have to be clear on what the question asks for.

For 12,500,000 to be a factor of N, N MUST contain 5^8 AND 2^5 (it can include other primes as well, but must have the aforementioned primes to be divisible by 12,500,000). This is a YES/NO question.

Fact 1: 5^8 is a factor of N.

This doesn't give us the necessary information to answer the question.
IF N = 5^8, then the answer to the question is NO
IF N = 5^8(2^5), then the answer to the question is YES.
Fact 1 is INSUFFICIENT

Fact 2: 20^5 is a factor of N.

This breaks down into (2^10)(5^5)

IF N = (2^10)(5^5) then the answer to the question is NO (in basic terms, there are not "enough 5s")
IF N = (2^10)(5^5)(5^3) then the answer to the question is YES
Fact 2 is INSUFFICIENT

Combined, we know that the following numbers are factors of N:
5^8
(2^10)(5^5)

This means that N MUST consist of at least (5^8) and (2^10). This information is enough to confirm that the answer is YES.
Combined, SUFFICIENT

Final Answer: C

GMAT assassins aren't born, they're made,
Rich
Hello Rich,

Thank you very much for your excellent and detailed explanation.

Best Regards,
Sri
Join the discussion

by gmattesttaker2 » Wed Apr 02, 2014 5:27 pm
Brent@GMATPrepNow wrote:
gmattesttaker2 wrote:Is 12,500,000 a factor of positive integer N ?

(1) 5^8 is a factor of N
(2) 20^5 is a factor of N
I'd like to elaborate a little on Rich's excellent post.

For questions involving factors (aka "divisors"), we can say:
If k is a divisor of N, then k is "hiding" within the prime factorization of N
Consider these examples:
3 is a divisor of 24 because 24 = (2)(2)(2)(3), and we can clearly see the 3 hiding in the prime factorization.
Likewise, 5 is a divisor of 70 because 70 = (2)(5)(7)
And 8 is a divisor of 112 because 112 = (2)(2)(2)(2)(7)
And 15 is a divisor of 630 because 630 = (2)(3)(3)(5)(7)

So...

Target question: Is 12,500,000 a factor of positive integer N ?

12,500,000 = (2)(2)(2)(2)(2)(5)(5)(5)(5)(5)(5)(5)(5)
Or we can write: 12,500,000 = (2^5)(5^8)

Let's rephrase the target question as...
REPHRASED target question: Are there five 2's and eight 5's hiding in the prime factorization of N?

Statement 1: 5^8 is a factor of N
This tells us that there are eight 5's hiding in the prime factorization of N.
What about the five 2's?
We can't say whether or not the five 2's are also hiding in the prime factorization of N.
As such, statement 1 is NOT SUFFICIENT

Statement 2: 20^5 is a factor of N
Notice that 20 = (2)(2)(5) = (2^2)(5)
So, 20^5 = (2^10)(5^5)
In other words, (2^10)(5^5) is a factor of N.
In other words, there are ten 2's and five 5's hiding in the prime factorization of N.
So, we can't say whether or not there are five 2's and eight 5's hiding in the prime factorization of N.
Since we cannot answer the target question with certainty, statement 2 is NOT SUFFICIENT

Statements 1 and 2 combined
Statement 1 guarantees that we have eight 5's hiding in the prime factorization of N.
Statement 2 guarantees that we have five 2's hiding in the prime factorization of N.
So, the statements combined guarantee that there are five 2's and eight 5's hiding in the prime factorization of N
Since we can answer the target question with certainty, the combined statements are SUFFICIENT

Answer = C

Cheers,
Brent
Hello Brent,

Thank you very much for your detailed and excellent explanation with the examples.

Best Regards,
Sri
Join the discussion