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
Vote for Target Test Prep, Newsweek Readers’ Choice Awards 2026
NEWSWEEK READERS’ CHOICE 2026

BIG NEWS! Target Test Prep has been nominated, and they’d love your vote!

TTP has worked incredibly hard to build the best test prep experience possible, and winning Newsweek’s 2026 Readers’ Choice Award for Best Test Prep would mean a lot to them. If TTP has helped you, they’d be incredibly grateful for your vote. You can vote once each day through September 9.

Vote for TTP
GMATLiveTeach 7 seats left
Chris Peckover
NEXT LIVE COHORT

Oct 13 to Jan 7, 2027

with Chris Peckover

Schedule
Tue, Thu · 8:00 to 10:00 PM ET
Included
40 live hours + 6 months of GMAT OnDemand
  • Live instruction and real-time questions
  • Class recordings and assigned practice
View class & enroll
Limited cohort · enrollment openTarget Test Prep
EALiveTeach 5 seats left
Logan Thompson
EXECUTIVE ASSESSMENT

Sep 6 to Dec 6, 2026

with Logan Thompson

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
Limited cohort · enrollment openTarget 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.

Exponent factoring

Expert replies
Source: — Data Sufficiency |

by cramya » Wed Nov 05, 2008 2:38 pm
I am getting B) Whats the OA? If its right I will post the solution

Please post OA'S using spoiler function when posting the question if possible
Join the discussion

by logitech » Wed Nov 05, 2008 4:03 pm
cramya wrote:I am getting B) Whats the OA? If its right I will post the solution

Please post OA'S using spoiler function when posting the question if possible
if it is wrong, I will not post the solution :lol:
LGTCH
---------------------
"DON'T LET ANYONE STEAL YOUR DREAM!"
Join the discussion

Re: Exponent factoring

by logitech » Wed Nov 05, 2008 4:13 pm
ltg356 wrote:Is 3^(p-2) > 1000
1) 3^(p+1) < 54000
2) 3^p < 3^(p-1) + 2000


What's the most efficient way to approach this problem?
Thanks
ltg356,

Since you are asking the most efficient way, I assume that you already solved this question and you are trying to find a faster/better solution.

I really do not trade my solutions for official answers ( it is just funny ) , bit please keep in mind to put the OA with spoiler function in the future.

Going back to question:

Is 3^(p-2) > 1000 ?

You can rephrase this to : Is 3^p > 9000 ?

Here is the trick..do not carry on this calculation and try to find P , leave it as it is because both statement are using the same expression. Let's call 3^p = X and lets get rid of three zeros at the end

so Is X > 9

1) 3^(p+1) < 54000

means : X < 54/3

X<18 INSUF - something less than 18 does not need to be bigger than 9


2) 3^p < 3^(p-1) + 2000

X<X/3 + 2

2x/3 < 2

X < 3

Tatamm!! Sufficient!

Hence, B

I hope you find this method useful.


[/b]
LGTCH
---------------------
"DON'T LET ANYONE STEAL YOUR DREAM!"
Join the discussion

by cramya » Wed Nov 05, 2008 7:18 pm
Logitech,
If what you (speaking in general) have said is correct then there is a point explaining it. If you are wrong to begin with then its best to observe and make notes of other's solutions and make make sure u dont commit the same mistake again

:-)

By the way nice approach on making 3 ^ p =x. I did it just by using 3 ^ p ;like I said not all minds are alike.

Good luck!
Join the discussion

by logitech » Wed Nov 05, 2008 7:29 pm
cramya wrote:Logitech,
If what you (speaking in general) have said is correct then there is a point explaining it. If you are wrong to begin with then its best to observe and make notes of other's solutions and make make sure u dont commit the same mistake again

:-)

By the way nice approach on making 3 ^ p =x. I did it just by using 3 ^ p ;like I said not all minds are alike.

Good luck!
I am just teasing you Cramya, I really enjoy having you here and learning from you. But we have to make this place a little bit fun right ?

When are you taking the test by the way ?
LGTCH
---------------------
"DON'T LET ANYONE STEAL YOUR DREAM!"
Join the discussion

by cramya » Wed Nov 05, 2008 7:34 pm
Let's call 3^p = X and lets get rid of three zeros at the end
Lets say 9 billion,7 trillion and 25 gazillion was given how many zeros would u take off, seriously?

Jus kidding! :D

I am explaining my solution in detail since we have had one more vote for B.

To find 3 ^ p * 3 ^ -2 > 1000 i.e 3 ^ p / 9 > 1000 or 3 ^ p > 9000
( a ^ (b+c) = a ^ b * a ^ c where a=3 b=p c=-2 here AND a ^ -m = 1 /a ^ m 3 ^ -2 = 1 / 3 ^ 2 i.e 1/9)


Stmt I)

3^(p+1) < 54000
3 ^ p . 3 ^1 < 54000
3^p < 18000

Could be greater than 9000 or less dont know INSUFF

Stmt II)

3 ^ p < 3^(p-1) + 2000 ( a ^ (b+c) = a ^ b * a ^ c where a=3 b=p c=-1 here and a ^ -m = 1 /a ^ m 3 ^ -1 = 1 / 3 ^ 1 i.e 1/3)

3^p < 3 ^ p /3 + 2000
3 ^ p < 3 ^p + 6000 / 3
3 ^ (p+1) < 3^p + 6000
3 ^ (p+1) - 3 ^ p < 6000
3 ^P 3 ^ 1 - 3 6 P < 6000
3 ^ p * (3-1) < 6000
3 ^ p < 3000

SUFF

B)
Join the discussion

by ltg356 » Thu Nov 06, 2008 9:30 am
sorry mates, I meant to tell you it is B.
My inefficient method involves calculating the roots of 3... too much room for error
Join the discussion

by jaybrium » Thu Nov 06, 2008 10:54 am
My answer was B- I used Cramya's method. DEFINITELY more efficient than calculating roots of 3.

Horray consensus![/i]
- Jay
Join the discussion