| Author |
Message |
![[Post New]](/templates/default/images/icon_minipost_new.gif) 24 Jun 2008 10:30:28 IST
|
|
|
Prove that a whole number is divisible by 9 if and only if sum of digits is divisible by 9.
|
|
|
|
![[Post New]](/templates/default/images/icon_minipost_new.gif) 24 Jun 2008 10:53:04 IST
|
|
|
Come on somebody ! I dont claim that the answer is easy, but u can atleast try.
Surely thr must be some1 who can do this easily.....
|
this reply: 0 points
(with 0 
in 0 votes ) [?]
|
|
You have to be logged on to rate
|
|
|
![[Post New]](/templates/default/images/icon_minipost_new.gif) 24 Jun 2008 10:54:49 IST
|
|
|
CALL ALLAMRAJU PLEEEEEEZ
|
i am well....and hope u r in the same well.... |
this reply: 0 points
(with 0 
in 0 votes ) [?]
|
|
You have to be logged on to rate
|
|
|
![[Post New]](/templates/default/images/icon_minipost_new.gif) 24 Jun 2008 10:55:53 IST
|
|
|
I THINK HE CAN DO IT......LIKE OTHER goiitians...but i have more faith in him.....sry..
|
i am well....and hope u r in the same well.... |
this reply: 0 points
(with 0 
in 0 votes ) [?]
|
|
You have to be logged on to rate
|
|
|
![[Post New]](/templates/default/images/icon_minipost_new.gif) 24 Jun 2008 11:08:41 IST
|
|
|


|
this reply: 20 points
(with 4 
in 4 votes ) [?]
|
|
You have to be logged on to rate
|
|
|
![[Post New]](/templates/default/images/icon_minipost_new.gif) 24 Jun 2008 11:19:10 IST
|
|
|
it can be proved in not a very convincing way: Statement 1: The sum of digits of every number which is divisible by 9 comes out to be a multiple of 9. As this statement is true, so it's converse is also true: Statement 2: (converse of 1) Every number whose sum of digits is a multiple of 9, must be divisible by 9,.
|
signature |
this reply: 2 points
(with 0 
in 1 votes ) [?]
|
|
You have to be logged on to rate
|
|
|
![[Post New]](/templates/default/images/icon_minipost_new.gif) 24 Jun 2008 12:20:28 IST
|
|
|
nice methods...abv..
here i go with a general proof..( very unorthodox..bas aise hi aa gaya)..
let f(x) = ax^n + bx^n-1 .....+.z...(n be any natural no.)
now we know tht... f(10) mod 9 = 0...
=> f(9+1) mod 9 = 0...
now by binomial expansion ....
we get f(10) = a(9 + 1)^n. + b (9+1)^n-1...+..z ...
=>> 9m + a + b + c + d.....+z...
since l.hs is a multiple of 9...
so( a + b + c + ...+z) is also divisible by 9...
hence sum of digits or f(1) is also divisible by 9...
|
Diamonds r formed under greatest pressures..
so r the champs.
Kriteesh..
|
this reply: 5 points
(with 1 
in 1 votes ) [?]
|
|
You have to be logged on to rate
|
|
|
![[Post New]](/templates/default/images/icon_minipost_new.gif) 25 Jun 2008 21:54:04 IST
|
|
|
A comparatively more difficult problem, but easy on the whole.
Prove that a whole number is divisible by 11 if difference of sum of alternate digits is a multiple of 11.
You can try proving the rest of the divisibility tests. They r very easy to do.
|
this reply: 0 points
(with 0 
in 0 votes ) [?]
|
|
You have to be logged on to rate
|
|
|
![[Post New]](/templates/default/images/icon_minipost_new.gif) 25 Jun 2008 22:13:46 IST
|
|
|
Its a direct consequence of modulos! We all know that a number can be represented by the form where say
Ofc 
Hence the result 
|
this reply: 10 points
(with 2 
in 2 votes ) [?]
|
|
You have to be logged on to rate
|
|
|
![[Post New]](/templates/default/images/icon_minipost_new.gif) 26 Jun 2008 17:30:04 IST
|
|
|
let n= ....abcd = (.....+ 1000a+ 100b+10c + d )/9= Q + (a+b+ c+d)/9.... hence for it to b divisible by 9 the sum of digits shud b divisible by 9..
shortest way:))
|
[url=http://www.signaturebar.com/][img]
|
this reply: 0 points
(with 0 
in 0 votes ) [?]
|
|
You have to be logged on to rate
|
|
|
![[Post New]](/templates/default/images/icon_minipost_new.gif) 27 Jun 2008 13:16:20 IST
|
|
|
So many posts on this topic is overkill in my opinion
|
Time wounds all heels |
this reply: 0 points
(with 0 
in 0 votes ) [?]
|
|
You have to be logged on to rate
|
|
|
|
|