Lecture

Counting: Combinations and Permutations

In course

Laboris magna ut qui enim sunt tempor ea dolore eiusmod elit dolore quis et. Lorem enim ut sit Lorem sint id esse. Enim consectetur ex sunt non ea non exercitation. Consectetur est esse non occaecat excepteur voluptate veniam ullamco culpa adipisicing. Consequat veniam amet mollit duis culpa ipsum. Eu veniam Lorem aliqua incididunt consectetur veniam tempor.

Description

This lecture covers the concepts of combinations and permutations, including counting r-combinations and r-permutations from a set with n elements, as well as examples involving poker hands and strings. It also delves into counting with repetitions and permutations of indistinguishable objects.

Official source

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

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

Mathematical logic: Set theory

Related lectures (21)

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.