It should be read as What is the remainder when {10^49} +2 is divided by 11 ?

Can it be solved?

I think the exponent rule will have a role here.
10^1+2-Remainder is 1
10^2+2-Remainder is 3
10^3+2-Remainder is 1
10^4+2-Remainder is 3
.
.
.
So on.
SO 10^49+2 will have remainder of 1.Ans-A

That's what I thought. You divide any 1000 or 10000, if unit digit ends in zero, then the maximum way the quotient can be is 9 and then you add 2 which becomes 3.

If u have noticed :Here every Odd power of 10 would produce remainder of 1 and Even power 3.This is the pattern.

The pattern is like that here.

Two approaches:

1:: Divisibility by 11

A number is divisible by 11 if the difference between the alternating sums of its digits = a multiple of 11. (For instance, 1243 divides by 11, because (2 + 3) - (4 + 1) = 0. 9273 is also divisible by 11, because (9 + 7) - (2 + 3) = 11, etc.)

10�� + 2 is a 50 digit number that starts with a 1, ends with a 2, is otherwise all 0s. So its alternating sum difference is 2 - 1 = 1. This means it has a remainder of 11, and we're done.


2:: Modular arithmetic

10 has a remainder of -1 when divided by 11, so 10�� has a remainder of (-1)��, or -1, when divided by 11. Since 10�� has a remainder of -1, 10�� + 2 has a remainder of -1 + 2, or 1.