Sum of a Row of Pascal's Triangle: A Combinatorial Identity
3.7 هزار بار بازدید -
3 سال پیش
-
If one takes the sum
If one takes the sum of a row of entries in Pascal's triangle, one finds that the answer is 2 to the power of the row number. In this video, we prove this remarkable combinatorial identity in two ways: by forming a committee and substituting numbers into the binomial theorem. An induction proof also exists, but we have avoided it because it is mechanical.
Like, subscribe, and share! To find out more about us:
- Visit https://existsforall.com to check out our services
- Reach out on Twitter at @ExistsforallA
Copyright © Existsforall Academy Inc. All rights reserved.
Like, subscribe, and share! To find out more about us:
- Visit https://existsforall.com to check out our services
- Reach out on Twitter at @ExistsforallA
Copyright © Existsforall Academy Inc. All rights reserved.
3 سال پیش
در تاریخ 1400/04/23 منتشر شده
است.
3,751
بـار بازدید شده