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.

Thank you for using the timer!
We noticed you are actually not timing your practice. Click the START button first next time you use the timer.
There are many benefits to timing your practice, including:

IMO it is B
Consider this.
Using binominal formula we get (100+1)^100-1. now the first term is 100^100 and the last term is 1^100. the term before the last term is (100C99)*(100^1)*(1^99) and when 1 is substracted the number is divisible by 100*100

Sorry trivikram, three attempts were not sufficient!
Nice done BG.

Here is the OE and another way to solve it, even if I don't quite understand the 'you can safely conclude':

Quote:

The easiest way to solve such problems for CAT puposes is trial and error or by back substituting answers in the choices given.

1012 = 10201. 1012 - 1 = 10200. This is divisible by 100. Similarly try for 1013 - 1 = 1030301 - 1 = 1030300.

So you can safely conclude that (1011 - 1) to (1019 - 1) will be divisible by 100 & then (10110 - 1) to (10199 - 1) will be divisible by 1000 & therefore (101100 - 1) will be divisible by 10,000.

Perhaps I am mistaken [#permalink]
22 Nov 2006, 06:35

Binomial formula, logs, wtf!?

Are these methods not far too complex for the GMAT and this type of problem (i know you use binomial for probability).

When I look at this problem, I see that no matter what, the number will always have a hundred value or a thousand value. That means the largest number that will divide it evenly is 1000. And that is only 1 out of every 10 times you multiply the number by itself. The other 9 it will be 100. Since 1000 isn't an option, then the answer is 100. Think of it like this.
Every power of 101 will end with the number 1. Every time you multiply one of the numbers by 101, it will there for always have a hundreds value except once every 10 times. Look at the first two powers of 101:

Now start thinking, since we are always multiplying the total by 101, and there is always a 1 in the unit digit of the total, then there will always be a hundred in our new total, except when the two lines of our addition from the multiplication add up to an even 1000. Which will be the case at 101^10. In fact, now that I think about it, you can even take this logic up to 101^101.

Everytime you multiply 101 X 101, the value of the hundreds place moves up by 1. Meaning 101^2 = 10,201, 101^3 = 1030301 and so on. Until it reaches 10, then the hundreds value will be a zero. Meaning for every power of 101, the largest number it is divisible by is 100, except when the power is a multiple of 10. Then it is divisible by 1000 (after you subtract the 1 of course).

Since the problem is 101^101, then the answer is 100.

Had it been 101^100, then the answer would be 1000.

Phew! Man I really hope my logic is right or that was a long, pointless post .

Re: Perhaps I am mistaken [#permalink]
22 Nov 2006, 07:26

andrewnorway wrote:

Binomial formula, logs, wtf!?

Are these methods not far too complex for the GMAT and this type of problem (i know you use binomial for probability).

When I look at this problem, I see that no matter what, the number will always have a hundred value or a thousand value. That means the largest number that will divide it evenly is 1000. And that is only 1 out of every 10 times you multiply the number by itself. The other 9 it will be 100. Since 1000 isn't an option, then the answer is 100. Think of it like this. Every power of 101 will end with the number 1. Every time you multiply one of the numbers by 101, it will there for always have a hundreds value except once every 10 times. Look at the first two powers of 101:

Now start thinking, since we are always multiplying the total by 101, and there is always a 1 in the unit digit of the total, then there will always be a hundred in our new total, except when the two lines of our addition from the multiplication add up to an even 1000. Which will be the case at 101^10. In fact, now that I think about it, you can even take this logic up to 101^101.

Everytime you multiply 101 X 101, the value of the hundreds place moves up by 1. Meaning 101^2 = 10,201, 101^3 = 1030301 and so on. Until it reaches 10, then the hundreds value will be a zero. Meaning for every power of 101, the largest number it is divisible by is 100, except when the power is a multiple of 10. Then it is divisible by 1000 (after you subtract the 1 of course).

Since the problem is 101^101, then the answer is 100.

Had it been 101^100, then the answer would be 1000.

Phew! Man I really hope my logic is right or that was a long, pointless post .

What a long post! But I am sorry, I ve posted already the answer just above, and the answer is 10,000!

Yeah, I see that now, I thought it was 101^101 - 1, not 101^100 - 1. If it were 101^101 - 1, then it would be 100, since its 101^100 - 1, then its 10,000.

Just to make sure I understand this right though, if it were 101^90-1, then the answer would be 1000, correct? And 101^200 -1, the answer would be 100,000?

It’s been a long time, since I posted. A busy schedule at office and the GMAT preparation, fully tied up with all my free hours. Anyways, now I’m back...

Ah yes. Funemployment. The time between when you quit your job and when you start your MBA. The promised land that many MBA applicants seek. The break that every...

It is that time of year again – time for Clear Admit’s annual Best of Blogging voting. Dating way back to the 2004-2005 application season, the Best of Blogging...