C(n-1,k-1) if balls are similar On Fri, Apr 30, 2010 at 4:34 PM, Ashish Mishra <amishra....@gmail.com>wrote:
> One of my friend ask me this n i am bad in P & C (will love if smone can > provide me a link to learn it though) > > nyways prob is: > there are infy color balls of k different color > you are allowed to pick n balls out of those infy(infinite) balls > > cond is : you must have all k color balls with u > obviously k<n > > Question is how many possibilities for selection you have ? > > Thanks > Ashish > > -- > You received this message because you are subscribed to the Google Groups > "Algorithm Geeks" group. > To post to this group, send email to algoge...@googlegroups.com. > To unsubscribe from this group, send email to > algogeeks+unsubscr...@googlegroups.com<algogeeks%2bunsubscr...@googlegroups.com> > . > For more options, visit this group at > http://groups.google.com/group/algogeeks?hl=en. > -- Man goes to doctor. Says he's depressed. Says life seems harsh and cruel. Says he feels all alone in a threatening world where what lies ahead is vague and uncertain. Doctor says "Treatment is simple. Great clown Pagliacci is in town tonight. Go and see him. That should pick you up." Man bursts into tears. Says "But, doctor...I am Pagliacci." -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to algoge...@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
