a very simple proof of the formula is using generating function for counting
On Sat, Oct 10, 2009 at 3:08 PM, Prunthaban Kanthakumar < [email protected]> wrote: > I just noticed that in your problem the balls are 'similar'. > Then the solution is a simple composition and the answer is {n-1, k-1} > where {n,k} stands for binomial coefficient. > I will give a proof sometime later if needed. > > On Sat, Oct 10, 2009 at 11:22 AM, vicky <[email protected]> wrote: > >> >> i didn't get anything plz elaborate >> >> On Oct 10, 10:44 am, Prunthaban Kanthakumar <[email protected]> >> wrote: >> > Sterling numbers of second kind. >> > >> > >> > >> > On Sat, Oct 10, 2009 at 10:41 AM, vicky <[email protected]> wrote: >> > >> > > example: >> > > n=10,k=10 >> > > ans:1 >> > > n=30,k=7 >> > > ans: >> > > 475020 >> > > On Oct 10, 9:51 am, vicky <[email protected]> wrote: >> > > > u have to color n similar balls with k diff. colors , such that >> every >> > > > color must be used atleast once find the no. of ways >> >> >> > > > > -- nikhil- --~--~---------~--~----~------------~-------~--~----~ You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to [email protected] To unsubscribe from this group, send email to [email protected] For more options, visit this group at http://groups.google.com/group/algogeeks -~----------~----~----~----~------~----~------~--~---
