Please read it ,sir.
Can you try and prove that logically instead?
Prove that no of ways in which n identical objects can be dived in r different groups is: n+r-1 C r-1
(I did'nt get the prove of this in any of the books.)
-
UP 0 DOWN 0 0 9
9 Answers
Try induction.. (The simplest solution :D)
take r=0 then start induction :P
I havent even read the question properly :D
oh yeah now i can read it too :)
see you have n 1's
now you have to put some r-1 + signs in between these 1's
so you have the proof?
Yes sankara. you have recognised that well :)
except that you have replaced r and n?
msp do you not recognize the proof bhaiyya has in mind ..
or was it simply that you are giving another method ..
dude dat was by induction,i am searching for a combinatorial proof.Also i donno abt induction,
nishant sir,plz give d induction proof....m not getting it....