|
-
Jan 27th, 2003, 11:16 AM
#1
Thread Starter
Fanatic Member
2 combinatorics questions
Could someone find a proof other than induction for these two equations?
1) nC1+2(n-1)*(nC2)+3(n-1)^2*(nC3)+...+n(n-1)^(n-1)*(nCn) = n^n
where n in N and n >= 2
2) Sum (from 3 to n) [3Pk*nCk] =(3Pn)*2^(n-3)
by the way, 3Pk is k!/(k-3)! some ppl like to write kP3
Last edited by bugzpodder; Jan 27th, 2003 at 11:21 AM.
Massey RuleZ! ^-^__  Cheers!  __^-^ Massey RuleZ!
Did you know that...
The probability that a random rational number has an even denominator is 1/3 (Salamin and Gosper 1972)? This result is independently verified by me (2002)!
Posting Permissions
- You may not post new threads
- You may not post replies
- You may not post attachments
- You may not edit your posts
-
Forum Rules
|
Click Here to Expand Forum to Full Width
|