Suppose nCp represents n!(n-p)!/p!
The product of the following should be the answer,
nC2 x (n-1)C2 x (n-2) x ... x 2C2
The above assumes that merger of company K1 with K2, gives rise to a new
company K12, and merger of K12 with K3, and K13 with K2 is different.
How does it sound?
________________________________
From: ankur aggarwal <ankur.mast....@gmail.com>
To: algogeeks@googlegroups.com; "i...@mca_2007"
<iit_rmca_2...@googlegroups.com>; lets-talk-g...@googlegroups.com
Sent: Tuesday, 25 August, 2009 12:28:48 AM,
Subject: [algogeeks] Merging companies
Merging companies
Suppose we have N companies, and we want to eventually merge them into
one big company. How many ways are there to merge?
Love Cricket? Check out live scores, photos, video highlights and more.
Click here http://cricket.yahoo.com
--~--~---------~--~----~------------~-------~--~----~
You received this message because you are subscribed to the Google Groups
"Algorithm Geeks" group.
To post to this group, send email to algogeeks@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
-~----------~----~----~----~------~----~------~--~---
