Last visit was: 25 Apr 2024, 19:34 It is currently 25 Apr 2024, 19:34

Close
GMAT Club Daily Prep
Thank you for using the timer - this advanced tool can estimate your performance and suggest more practice questions. We have subscribed you to Daily Prep Questions via email.

Customized
for You

we will pick new questions that match your level based on your Timer History

Track
Your Progress

every week, we’ll send you an estimated GMAT score based on your performance

Practice
Pays

we will pick new questions that match your level based on your Timer History
Not interested in getting valuable practice questions and articles delivered to your email? No problem, unsubscribe here.
Close
Request Expert Reply
Confirm Cancel
SORT BY:
Date
Tags:
Show Tags
Hide Tags
Math Expert
Joined: 02 Sep 2009
Posts: 92915
Own Kudos [?]: 619039 [144]
Given Kudos: 81595
Send PM
Most Helpful Reply
User avatar
Senior Manager
Senior Manager
Joined: 07 Aug 2011
Posts: 425
Own Kudos [?]: 1751 [55]
Given Kudos: 75
Concentration: International Business, Technology
GMAT 1: 630 Q49 V27
Send PM
Math Expert
Joined: 02 Sep 2009
Posts: 92915
Own Kudos [?]: 619039 [11]
Given Kudos: 81595
Send PM
General Discussion
User avatar
Manager
Manager
Joined: 17 Mar 2015
Posts: 106
Own Kudos [?]: 211 [7]
Given Kudos: 4
Send PM
Re: How many different pairs of integers (a, b) exist such that 2 <= a <= [#permalink]
5
Kudos
2
Bookmarks
\(a + b > a^b\)
\(2 <= a <= 200\) which means a is positive
Easiest way is to try plug numbers
1)\(b = 0\)
a > 1 - good, so the amount of pairs we get from this is \(200 - 2 + 1 = 199\)
2)\(b = 1\)
\(a + 1 > a => 1 > 0\), good, 199 pairs again
3)\(b = 2\)
\(a + 2 > a^2\)
\(a^2 - a - 2 < 0\)
Since a is an integer and is between 2 and 200, and \(a^2 - a\) only grows when we increase a (coz \(a^2 > a\) if \(a > 1\)) we need to check what happens at the least possible value of a: when \(a = 2\) the result is \(4 - 2 - 2 = 0\) so when \(a > 2\), the result will be greater than 0 thus not be good for the inequality, this way we get 0 pairs.
4)\(b = 3\)
\(a^3 - a - 3 < 0\)
same story as above but in this case when we put 2, we are even further away from 0: 8 - 2 - 3 =5 < 0, at 3 and higher we will just increase the distance from 0, thus 0 pairs again
It is fairly obvious now that at higher values of b we get 0 pairs so I guess that its for positive values of b.
5)\(b = -1\)
\(a - 1 > \frac{1}{a}\)
multiply both sides by a (coz a is positive)
\(a^2 - a - 1 > 0\)
a = 2: \(4 - 2 - 1 = 1 > 0\), good
increasing a will give us even bigger results, so its safe to assume that this is 199 pairs again
6)\(b = -2\)
\(a - 2 > \frac{1}{a^2}\)
\(a^3 - 2*a^2 - 1 > 0\)
\(a^2*(a - 2) - 1 > 0\)
\(a^2*(a-2)\) becomes 0 when a = 2 and thus the whole experssion turns into -1 which is not bigger than 0 - fail, on the other hand if a > 2, the experssion becomes much bigger than 1 so our inequality holds, this way we can exclude just 1 value of a from our total, thus we get 198 pairs
7)\(b = -3\)
\(a - 3 > \frac{1}{a^3}\)
\(a^4 - 3*a^3 - 1 > 0\)
\(a^3*(a - 3) - 1 > 0\)
same story as above with only difference that a > 3, otherwise left side is definitely negative so we exclude 2 values of a this time (2 and 3), thus we are left with 197 pairs
Its safe to assume that going further we will just shrink our total available values of a by 1 each time we decrease our b, so at some point we will be left with 0 values of a available. Since we always change b, all these pairs count so the resulting summ will be as follows:
b = 1: 199
b = 0: 199
b = -1: 199
b = -2: 198
b = -3: 197
...
b = -199: 1
so the resulting summ is \((1 + 2 + ... 199) + 2*199 = 199*(1 + 199)/2 + 2*199 = 102*199 = 20298\)

E
Intern
Intern
Joined: 06 Oct 2013
Posts: 40
Own Kudos [?]: 142 [0]
Given Kudos: 34
Send PM
Re: How many different pairs of integers (a, b) exist such that 2 <= a <= [#permalink]
Bunuel wrote:
When a=2, b has 3 values: -3,-2,-1,0,1.


I think you mean a=4, b has 5 values:-3,-2,-1,0,1.
Intern
Intern
Joined: 19 Jun 2016
Posts: 32
Own Kudos [?]: 5 [1]
Given Kudos: 23
Location: India
GMAT 1: 710 Q50 V35
GPA: 3.85
Send PM
Re: How many different pairs of integers (a, b) exist such that 2 <= a <= [#permalink]
1
Kudos
Hi Bunuel,
How much time do you think one should spend on a question like this in the actual exam? It took me around 3 minutes before I could observe any pattern so I gave up because it wasn't worth then. I had solved for b=0,-1,1,2 till then. Should I have stretched some more?
Math Expert
Joined: 02 Sep 2009
Posts: 92915
Own Kudos [?]: 619039 [0]
Given Kudos: 81595
Send PM
Re: How many different pairs of integers (a, b) exist such that 2 <= a <= [#permalink]
Expert Reply
anupama000 wrote:
Hi Bunuel,
How much time do you think one should spend on a question like this in the actual exam? It took me around 3 minutes before I could observe any pattern so I gave up because it wasn't worth then. I had solved for b=0,-1,1,2 till then. Should I have stretched some more?


This is a Manhattan GMAT challenge problem. If you get something that hard on the exam it would probably mean that you are already doing very well, which would also mean that you are good at math and saved some time on easier questions. If all this is true, then at this stage you'd have several spare minutes accumulated and you'll be able to spend 1-2 minutes more on this question (again if you feel confident enough). You can see in the stats above that the average time of correct answer is 03:47 minutes, so I'd say that it's possible to solve it in 3 minutes.
Manager
Manager
Joined: 01 Sep 2016
Posts: 125
Own Kudos [?]: 1122 [0]
Given Kudos: 33
GMAT 1: 690 Q49 V35
Send PM
Re: How many different pairs of integers (a, b) exist such that 2 <= a <= [#permalink]
Here is my take.

I first started with non-negative integers. For example, I tried forming the inequality using the integer 2 first. I realized that there were 2 cases, when a=2 and b=0. The other case is when a=2 and b= 1. So we have two cases for the integer 2. Then I moved to the integer 3, here as well you will find two cases- one in which a=3 and b=0 and the other in which a-3 and b=1. On further speculation you will realize that there are 2 possible cases for each of the values of a from 2 to 100. How many cases are there? Lets calculate:
2 to 200= 199 integer values of a. For each of these, we have two possible cases. So total number of cases=398

NOW LETS SEE IF ANY NEGATIVE VALUES ARE POSSIBLE FOR B
Lets start with a =2, now you will realize that there is only one such possible case- One in which a=2 and b=-1.
Come to a=3, 2 possible cases- a=3, b=-1 and a=3 and b= -2
Come to a=4, 3 possible cases:-a=4, b=-1 | a=4, b=-2 and a=4 and b=-3

So there is a pattern. For every integral value of a from 2 to 200, there are (n-1) cases, when n refer to the integer being chosen.

So we have 1+2+3+4+......+199 = 199(100)=19,900

Now adding up the total cases: 19,900+ 398 = 20298

Answer is E
Manager
Manager
Joined: 11 Jul 2018
Posts: 69
Own Kudos [?]: 20 [0]
Given Kudos: 42
Send PM
Re: How many different pairs of integers (a, b) exist such that 2 <= a <= [#permalink]
I used table method to solve this Q(although was not easy at first). I believe when 2 variables are involved, a table works everytime- a table like the one which we make for finding X and Y by plugging values as we do for some Coordinate geometry Questions. In that way a pattern becomes quite clearer.

Now, we have 2 constraints - 1) 2<=a<=200 and 2) a+b > a^b
lets Take a = 2, then 2+b > 2^b ---> b > 2^b - 2 --> possible only when b = 0 or 1. and if we keep taking all values of a from 2 to 200, and we keep b first as 0 and then as 1, we get 199+199 pairs. no other positive value of b satisfies our constraint 2.

next, coming to negative values of b,we see that if b = -1, it is acceptable for all values of a from 2 to 200, thus again, 199 pairs are possible. so total will become 199+199+199 => UNIT DIGIT =7
But if we move a little more on negative side, eg b= -2, the values of a for which constraint 2 will hold will start from 3. thus the pairs that we will now have are b = -2 and a from 3 to 200. therefore 1 less pair, hence 198 pair.

Similarly as we keep moving 1 point towards negative for b, the acceptable values of a keep on decreasing. thus until b = -199, we have a = 200 that will be the last pair..
so in this way we will have a series of Numbers of pairs = 198, 197,196,195....1 and hence the sum via AP will be 199(99) => will have 1 as the UNIT DIGIT. and above we had a unit digit of 7. Thus 7 + 1 =>8 as the unit digit of sum.
Only B and E have those but B is quite small if you look at the sum of AP (199*99)...
Thus correct Ans. is E.

It looks like a complex process but is quite simple and useful when 2 variables are involved, and thus helps make it more clear and organized when it is done via a table. Hope it helps! :)
User avatar
Non-Human User
Joined: 09 Sep 2013
Posts: 32680
Own Kudos [?]: 822 [0]
Given Kudos: 0
Send PM
Re: How many different pairs of integers (a, b) exist such that 2 <= a <= [#permalink]
Hello from the GMAT Club BumpBot!

Thanks to another GMAT Club member, I have just discovered this valuable topic, yet it had no discussion for over a year. I am now bumping it up - doing my job. I think you may find it valuable (esp those replies with Kudos).

Want to see all other topics I dig out? Follow me (click follow button on profile). You will receive a summary of all topics I bump in your profile area as well as via email.
GMAT Club Bot
Re: How many different pairs of integers (a, b) exist such that 2 <= a <= [#permalink]
Moderators:
Math Expert
92915 posts
Senior Moderator - Masters Forum
3137 posts

Powered by phpBB © phpBB Group | Emoji artwork provided by EmojiOne