let a number be 'a'.
let its sum of the digits be 'x'.
Condition: Now if I add up 'x' and 'a' and subtract twice the last digit of 'a' from it, then i get a number divisible by 11.
For example: a=132, then x=3+2+1=6
Now a+x-2(2)=138-4=134
and 134 is not divisible by 11.
Find the sum of all the numbers satisfying the above condition.
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
Simply, as you all leart in earlier classes, we just have to represent nos. in ones, tens, hundreds........
So, for a one digit number:-
a
For two digits:-
10a+b
for three digits:-
100a+10b+c
and so on........
we'll now apply the condition what i've said on one digit numbers-
a(the number itself)+a(sum of digits)-2a(twice the last digit)
=0
now apply the condition what i've said on two digit numbers:-
10a+b(the number itself)+a+b(sum of digits)-2b(twice the last digit)
=11a+2b-2b=11a
and we'll keep going on and observe that this condition is satisfied only by two digit numbers, hence their sum can be easily finded by S n = 2 n [ 2 a + ( n − 1 ) d ] where n=99-10+1=90 and d=1 and a=10
So the sum is:- S n = 2 9 0 [ 2 ( 1 0 ) + ( 9 0 − 1 ) 1 ] = 4 9 0 5