Location of Repository

DOI: 10.2478/v10037-010-0023-9 Counting Derangements, Non Bijective Functions and the Birthday Problem 1

By Cezary Kaliszyk and Techische Universität München

Abstract

Summary. 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]

Topics: 3. Counting Derangements
Year: 2010
OAI identifier: oai:CiteSeerX.psu:10.1.1.178.4599
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://citeseerx.ist.psu.edu/v... (external link)
  • http://mizar.org/fm/fm18-2/car... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.