Counting: Permutations and Combinations

In course

Dolor dolore minim sint qui ad consequat irure enim aliquip deserunt minim. Ad esse ex dolor amet minim. Magna qui cupidatat incididunt excepteur exercitation. Irure id consequat aute eiusmod sit quis est occaecat. Lorem Lorem veniam do esse id commodo. Occaecat irure officia velit elit nisi esse proident pariatur voluptate enim reprehenderit amet incididunt cupidatat.

Description

This lecture covers the concepts of permutation and combination, including permutation with repetition and indistinguishable objects, as well as the pigeonhole principle. Through examples and exercises, students learn how to apply these principles to solve counting problems.

Official source

https://mediaspace.epfl.ch/media/0_s2f6meql

About this result

This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.

Ontological neighbourhood

Mathematics

Algebra: Linear algebra

Mathematical logic: Set theory

Probability theory: Topics in probability theory

Politics

Political science: Comparative politics

Related lectures (46)