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.

integer

Expert replies
Source: — Data Sufficiency |

by PAB2706 » Tue May 19, 2009 5:12 am
i am getting D

If state 1 is true then why isnt statement 2 also true. for both case a becomes a fractions and K>m so a^k<a^m

m i missing something? :roll:
Join the discussion

by ketkoag » Wed May 20, 2009 1:37 am
PAB2706 wrote:i am getting D

If state 1 is true then why isnt statement 2 also true. for both case a becomes a fractions and K>m so a^k<a^m

m i missing something? :roll:
IMO yes, take the positive and negative possibilities of k and m, u'll get 4 combinations. by statement 1 only one combination is satisfying it and with statement 2, 2 combinations are satisfying. hence IMO A..
Join the discussion

by bluementor » Wed May 20, 2009 3:36 am
I might be wrong here, but I'm getting D.

-------------------------------------------------

since a is a positive integer, a^k and a^m will be positive regardless of what k and m are. so, the question stem can be manupulated without worrying about the inequality sign.

is a^k > a^m ?
is (a^k)/(a^m) > 1?
is a^(k-m) > 1?

since a is a positive integer, we can have the following outcome:

(i) if a = 1, then regardless of k and m, a^(k-m) = 1. Answer to question stem is NO.

(ii) if a > 1, then the question stem reduces to: is k-m > 0?. we already know from the question that k>m, so this will give the answer YES.

so we really only need to know whether a=1 or a>1 from the statements.

statement 1: a^k < 1

so a must not be 1, because 1 to the power of anything will always give you 1. therefore a must be greater than 1. sufficient.

statement 2: a^m < 1

similar reasoning to statement 1, a must be greater than 1. sufficient.

choose D.

-BM-
Join the discussion

by m&m » Wed May 20, 2009 11:10 am
a is positive, so no need to worry about negative numbers
k>m so a^k > a^m as long as k,m > 1 otherwise false... but we can say k will deffinitely be >1 if m>1

conversly if k<1 then m must be <1

so if we can answer is m>1 then the answer is deffinitively yes
or if we can answer is k<1 then the answer is deffinitively no
both however are sufficient


so in a)
a^k < 1 therefore k<1 which means m<1 so suff

in b)
a^m < 1 therefore m<1 which doesn't meet either conditions above so insuff

ans (IMO) should be A
Join the discussion

by hk » Wed May 20, 2009 11:34 am
m&m wrote:a is positive, so no need to worry about negative numbers
k>m so a^k > a^m as long as k,m > 1 otherwise false...
How did you conclude that a^k>a^m only if k,m>1 ?????

Lets assume a=2
If k=-1 and m=-2 ,

2^-1 = 1/2
2^-2 = 1/4

since 1/2>1/4 even if k,m<1 the equation holds true!!!

If k=1 and m=-1

2^1 = 2
2^-1 = 1/2

since 2>1/2 the original equation holds true!!!

I go with D.
Wanna know what I'm upto? Follow me on twitter: https://twitter.com/harikrish
Join the discussion

by cubicle_bound_misfit » Wed May 20, 2009 11:38 am
m&M ,

The problem is that

in b,


a^m < 1 hence m<0 as a is +ve int

we already know ,

k>m

so whaever the value of k (positive or negative) a^k is always > than a^m

hence choose D.

what is OA?
Cubicle Bound Misfit
Join the discussion

by ketkoag » Sat May 30, 2009 1:15 am
thanks for ur replies..
OA is D. I got it when i solved it twice....
:) thanks
Join the discussion