5*(10^n) + m

eg. of this expression will be
50 + m
500 + m
5000 + m
etc

When you divide 50 or 500 or 5000 etc by 3, the remainder will always be 2 (the remainder will be the same as that obtained when you divide the sum of the digits by the numbers by 3 i.e. Sum of digits of 5000 = 5+0+0+0 = 5. When you divide 5 by 3, the remainder is 2. When you divide 5000 by 3, the remainder will be 2 only)

So the remainder when 5*(10^n) + m is divided by is dependent on the value of m.

Statement 2 tells us that m = 1.
So when 5*(10^n) + m is divided by 3, the remainder will be 0 (Remainder when 51 or 501 or 5001 is divided by 3 will be 0).

Answer (B)
_________________

I agree with Karishma,
50+m
500+m
.
.
500000+m , when divided by 3 will give remainder 2 +m so, the value of r will depend upon m.
_________________

we know that 5X10^N +m gives remainder 0 when sum of digits divisible by 3 else some value
now
statement 1 : N has some value positive but we know nothing about M so sum of digits = 5+N number of zeros+m :M unknown so insufficient
statement 2: M is 1 and N has some value positive so sum of digits = 5+N number of zeros+1=6 always therefore divisible and sufficient

B
please tell if my approach is correct

Can anyone solve this using the EVI approach? Equation > Variable.