Comb 01-03 Spotlight on Derangements
Автор: Andrew Beveridge
Загружено: 2021-08-16
Просмотров: 411
Описание:
A derangement is a permutation with no fixed points. We give (but do not derive) a complicated formula for the number of derangements of the set [n] = {1, 2, . . . , n}. We then use Taylor series to find a very simple approximation for the number of derangements.
The goal of this video is to give you a taste of enumerative combinatorics. These topics will be covered more thoroughly in future videos.
Повторяем попытку...
Доступные форматы для скачивания:
Скачать видео
-
Информация по загрузке: