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.

value of n?value of n?

Expert replies
Source: — Data Sufficiency |

by kmittal82 » Thu Jul 28, 2011 6:41 am
Your question seems incomplete. Can you please double check it
Join the discussion

by Ahmed MS » Thu Jul 28, 2011 6:52 am
Well, the question is " if 63^n is divisible by 3^16 then

1. n > 7
2. n < 7

That is what I have found written.

Cheers.
Join the discussion

by beatthegmat.garry » Thu Jul 28, 2011 7:44 pm
If a number is divisible by 3^16 then the number should be able a multiple of 3^16.

63^n can be written as = (9*7)^n=(3^2 * 7)^n

if you have noticed above each power of 63 will contribute 2 powers of 3 (i.e. 3^2). And for 63^n to be a multiple of 3^16 it has to contribute in atleast 16 powers of 3 (i.e. 3^16).
If n>7 , let assume n=8 then 63^8=(3^16) *(7 ^16).

Hence n had to be greater than 7 for the given statement to be true.

statement 1: N>7 ==> Exactly what we looking for. It is sufficient

statement 2: N<7 ==> 63^n is not divisible by 3^16. It is sufficient.

Answer is D
Join the discussion

by edge » Sat Jul 30, 2011 5:44 pm
Isn't this an invalid question because the two statements lead to different solutions? Can the experts weigh in on this?
Join the discussion

by GmatKiss » Mon Aug 01, 2011 10:03 am
Is it not E, OA please!

n>7 means n can be 8,9.... any positive number > 7.
n<7 means n can be 6,5,4,3,2,1,0 and negative numbers as well.
Join the discussion

by Ahmed MS » Mon Aug 01, 2011 10:16 am
Answer is B.

= 63^n / 3^16
= (9*7)^n / 3^16
=3^2n*7^n/ 3^16
= (3^2n /3^16) * (7^n / 3^16)

So the value would be n=8, which is <7.


Cheers.
Join the discussion

by GmatKiss » Mon Aug 01, 2011 10:21 am
Does only 8 satisfy the condition!!?
Join the discussion

by Ahmed MS » Mon Aug 01, 2011 10:32 am
As (3^2n / 3^16) will give you the value 8, (3^2n*8= 3^16).

So answer would be B.

Cheers.
Join the discussion

by Frankenstein » Mon Aug 01, 2011 10:33 am
Hey,
Q. If 63^n is divisible 3^16, then what is the value of n?

1. n >7
2. n<7
Firstly, this question is badly framed. You cannot even consider statements(1) and (2) together.
Now, for 63^n to be divisible by 3^16, we know that n should be an integer greater than 7.
From(1):
n>7. So, every integer value of n >7 satisfies. How do we find the value of n from this? We cannot find a unique solution
Not sufficient
From(2):
n<7, then 63^n will not be divisible by 3^16. Nothing can be said about n.

If at all I have to give an answer, I would better choose E.
Cheers!

Things are not what they appear to be... nor are they otherwise
Join the discussion

by Ahmed MS » Mon Aug 01, 2011 11:26 am
Thanks for the clarification. At first my answer was also E. However, the source of the question said as n= 8, so answer would be B as it satisfy the condition n>7.

I hope in real GMAT exam, we will not face such an ambiguous problem.


Cheers.
Join the discussion

by Brian@VeritasPrep » Mon Aug 01, 2011 2:46 pm
Hey guys,

Please rest assured that this is not a valid GMAT question.

1) The statements will NEVER contradict each other, so this one is invalid. Statements 1 and 2 are direct contradictions, and that cannot happen on the GMAT.

2) The statements cannot contradict the given information either. The fact that 63^n is divisible by 3^16 means that, at minimum, n = 8. But Statement 2 contradicts that. It cannot - in a DS problem the given information, Statement 1, and Statement 2 are all facts. They must be true, and are indisputable. If you think you've found information that contradicts a fact, you're wrong and that's a clear indication that you need to re-check your work.

3) Statement 1, if it is indeed a DS statement, is not sufficient. We already know it has to be greater than 7; at minimum it's 8. But it could be a trillion...


My guess is that this originated as a true false question NOT in a DS context. Someone was asking what we knew about n given that 63^n was divisible by 3^16, and from there it became misconstrued as a Data Sufficiency question. It's not. All we know is that the first "choice", n>7 is true and that the second "choice" is not true.

So, in summary:

This is NOT a Data Sufficiency question.

and

In terms of learning about factors and multiples it's a decent exercise. 63^n can be phrased as 3^n * 3^n * 7^n, or 3^2n * 7^n. Breaking apart the exponent bases into prime factors is a very useful skill, so if that was your first step you've gotten 100% value out of this thread!
Brian Galvin
GMAT Instructor
Chief Academic Officer
Veritas Prep

Looking for GMAT practice questions? Try out the Veritas Prep Question Bank. Learn More.
Join the discussion

by sharmishtha_goel » Tue Aug 02, 2011 12:13 pm
Ahmed MS wrote:Answer is B.

= 63^n / 3^16
= (9*7)^n / 3^16
=3^2n*7^n/ 3^16
= (3^2n /3^16) * (7^n / 3^16)

So the value would be n=8, which is <7.


Cheers.

ahhhhhhhh............and how is n i.e 8 < 7??
Join the discussion