Counting Derangements, Non Bijective Functions and the Birthday Problem
By: Cezary Kaliszyk
Open Access
|Jan 2011Abstract
The article provides counting derangements of finite sets and counting non bijective functions. We provide a recursive formula for the number of derangements of a finite set, together with an explicit formula involving the number e. We count the number of non-one-to-one functions between to finite sets and perform a computation to give explicitely a formalization of the birthday problem. The article is an extension of [10].
Language: English
Page range: 197 - 200
Published on: Jan 5, 2011
Published by: University of Białystok
In partnership with: Paradigm Publishing Services
Publication frequency: 1 issue per year
Related subjects:
© 2011 Cezary Kaliszyk, published by University of Białystok
This work is licensed under the Creative Commons License.