Lecture

Counting: Bit Strings and Committees

In course

Ut elit aute est commodo. Occaecat commodo aute non do mollit anim qui reprehenderit ipsum voluptate dolore exercitation dolore. Cillum ad non adipisicing consequat ea occaecat. Proident veniam adipisicing aliqua id minim in labore eu qui aliquip irure laborum non labore. Tempor qui ea excepteur nisi id sit enim voluptate consectetur veniam commodo Lorem non.

Description

This lecture covers the counting of bit strings with specific patterns, forming committees with equal numbers of men and women, distributing distinguishable balls into boxes, poker hands with aces and kings, and coefficients in expansions. It also includes examples of the Pigeonhole Principle and selecting cards from a deck.

Official source

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

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.

Related lectures (4)

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.