Lecture

Counting Poker Dices: Combinatorial and Analytical Proofs

In course

Est Lorem amet nisi sit enim commodo veniam aliqua. Voluptate et esse est dolor nisi officia cupidatat non. Veniam ut exercitation ullamco laboris. Nostrud ullamco exercitation consectetur laborum ipsum do amet excepteur et excepteur irure dolore incididunt. Ullamco consequat irure in eiusmod dolore consectetur officia sint eu officia reprehenderit. Sunt nisi nulla tempor veniam Lorem pariatur. Dolore consectetur sint elit duis sit mollit amet sit eu qui ad.

Description

This lecture covers the counting of cables needed for connecting computers and printers, using combinatorial proofs to determine the number of possible rolls of poker dices, and analytical proofs to calculate the outcomes. The instructor explains the solutions step by step, providing insights into the mathematical reasoning behind each calculation.

Official source

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

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

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.