Counting Problems - Combinations and Pascal's Triangle Identity C(n, k) = C(n − 1, k) + C(n − 1, k − 1)

Counting Problems - Combinations and Pascal's Triangle Identity C(n, k) = C(n − 1, k) + C(n − 1, k − 1)

Oxford Mathematics via YouTube Direct link

Counting problems C(n, k) = C(n − 1, k) + C(n − 1, k − 1)

1 of 1

1 of 1

Counting problems C(n, k) = C(n − 1, k) + C(n − 1, k − 1)

Class Central Classrooms beta

YouTube videos curated by Class Central.

Classroom Contents

Counting Problems - Combinations and Pascal's Triangle Identity C(n, k) = C(n − 1, k) + C(n − 1, k − 1)

Automatically move to the next video in the Classroom when playback concludes
  1. 1 Counting problems C(n, k) = C(n − 1, k) + C(n − 1, k − 1)

Never Stop Learning.

Get personalized course recommendations, track subjects and courses with reminders, and more.

Sign up for free
Someone learning on their laptop while sitting on the floor.