Time remaining:
Counting in 2 ways Proof

Mathematics
Tutor: None Selected Time limit: 0 Hours

Apr 21st, 2015

left side = take k object from n objects, but 2 particular objects can't be both left out. It is (n.k)-(n-2,k-2), where (n-2,k-2) is number of ways that both of the particular 2 object are left out.  

the right hand side we can pick up k-2 object from n-2 object then add those 2 objects to make k objects,  or we can pick up k-1 objects from n-2 objects and pick up 1 object from the 2 particular object.   It is (n-2, k-2) +2*(n-2,k-1).  

Apr 21st, 2015

Studypool's Notebank makes it easy to buy and sell old notes, study guides, reviews, etc.
Click to visit
The Notebank
...
Apr 21st, 2015
...
Apr 21st, 2015
Dec 10th, 2016
check_circle
Mark as Final Answer
check_circle
Unmark as Final Answer
check_circle
Final Answer

Secure Information

Content will be erased after question is completed.

check_circle
Final Answer