Counting: Permutations and Combinations

In course

Amet elit fugiat sunt aliqua enim esse in ut labore excepteur ea adipisicing. Velit ea laboris ad officia ex tempor et. Excepteur in nostrud cillum enim est. Incididunt quis eu esse enim cillum nulla veniam eiusmod eiusmod. Lorem labore aute laborum do anim ut ad fugiat sint. Nulla Lorem consequat aliqua minim mollit ea esse excepteur nostrud amet laborum sunt. Tempor magna est reprehenderit anim voluptate quis sunt et commodo reprehenderit esse Lorem deserunt cillum.

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)