The largest number amongst the following that will perfectly

gmatnub, lets try ur mathod. I belive finding pattern is the best method on GMAT. lets see.
101^2= 10201 and 10201 - 1 = 10200. ( can't be divided by (E)100,000,00)
101^3= 1030301 and 1030301 - 1 = 1030300 ( again E is not the correct option )

there is a rule i.e. if (a-b) is divided by n then (a^k - b^k) too is divided by n. for all k>=1
However I am not sure if this rules holds true for finding the greatest divisor.
so lets try
if the highest divisor that will divide (101 - 1) is 100 then 100 will also be the highest divisor for (101^100 - 1).....Option A

even if we try the pattern mathod, as we tried above for 101^2 and 101^3 then too 100 will be the highest divisor.

So, answer IMO is A

(101)^100 - 1
= (100 + 1)^100 - 1
= 100^100 + 100C1 * 100^99 * 1^1 + 100C2 * 100^98 * 1^2 + ..................... + 100C98 * 100^2 * 1 + 100C99 * 100^1 * 1^99 + 1 -1

last two 1s will get cancelled...
second last term (bold) is 10000... and everry other term has a factor of 10000,
so 10000 should be the answer...
option B

You are the man.. I agree with you.

I will go for 100
IMO A
last two digits are 0 in the resulting number obtained from (101)^100 - 1

OA=?????