Elitmus
Exam
Numerical Ability
Data Sufficiency
Q. A number is like aabbc, where a>b>c eg 88331. If number is divided by 101, find the smallest remainder
Read Solution (Total 12)
-
- i think the answer will be 29..if the number is 99110
- 11 years agoHelpfull: Yes(11) No(2)
- according to the question take d largest 5 digit number i.e. 99887 and divide it by 101.. u get remainder 0
if its not in option den subtract the number wid 101 and u'll get the smallest remainder. - 11 years agoHelpfull: Yes(3) No(25)
- rem of(221100/101)=11
- 10 years agoHelpfull: Yes(3) No(6)
- since smallest remdr is asked ..so it is posaible wen given number is div by 101 ..hence 0 ...
@ravi options u rember ? - 11 years agoHelpfull: Yes(1) No(3)
- 99110 divided by 101 gives 29 remainder.. anyone calculated less than this remainder.. plz post.. i think this should be the ans.
- 10 years agoHelpfull: Yes(1) No(0)
- observing the given example i took 99887.when this is divided by 101 ,the remainder is 19.
- 10 years agoHelpfull: Yes(1) No(4)
- 29 is the correct answer
- 9 years agoHelpfull: Yes(1) No(0)
- 10,21,39 dnt knw exactly
- 11 years agoHelpfull: Yes(0) No(0)
- i got 39 by takin values .number is 99221 div 101
- 11 years agoHelpfull: Yes(0) No(2)
- @naveen y r u considering whole numbers ..we generally take natural numbers ?...as it is not mentioned to tkae asvwhile numbers
- 11 years agoHelpfull: Yes(0) No(0)
- we are considering the case when c is assigned lowest value i.e 0 and b=1 and c=2
we get remainder 1 as we change the value of a=1 till the a get highest value i.e 7 we don't get any remainder higher then 1 - 11 years agoHelpfull: Yes(0) No(1)
- Answer is 0, as if
a=11
b=10
c=0;
then it satisfies the equation a>b>c
and the number is 11 11 10 10 0 ( 111110100 )
i.e. divisible by 101.
only if the value of a, b and c can be of more than one digit, which isn't mentioned i think. - 9 years agoHelpfull: Yes(0) No(3)
Elitmus Other Question