Lecture

Counting: Permutations and Combinations

In course

Fugiat duis aliquip id magna et adipisicing minim nostrud proident cupidatat officia. Adipisicing amet dolor quis do. Ea exercitation cillum anim dolor eu.

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 (36)

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.