Equation Here is a combinatorial proof that C(n;r) = C(n;n r) Proof We can partition an nset into two subsets, with respective cardinalities rand n r, in two ways we can rst select an rcombination, leaving behind its complement, which has cardinality n rand this can be done in C(n;r) ways (the left hand side of the equation)Mar 01, 13 · P = rc/n (This is kinda unclear is the divided sign under the c or under the rc, if so write as (rc)/n, but in this problem I will assume it is P = r (c/n)) Anyways, we minus the r from both sides to get Pr = c/n Then, we multiply both sides by n to get n (Pr) = c We multiply both sides by 1 to get rid of the negative sign of the cAbout us Opening Up the world of Technical Education PTLee Chengalvaraya Naicker Polytechnic Trust was established in the year 1996 The nobel philanthropist Shri PTLee Chengalvaraya Naicker Who lived from 19 to 1874 had bequeathed his entire properties for the welfare of the downtrodden and poor people irrespective of caste cr...
