Search 7,000+ topics

Set-Theoretic Concepts: Finite-Domain Functions

Read this topic

Explanations 1

The simplest possible functions are those with finite domains—in other words, the functions that only accept one of finitely many inputs. We can completely specify these functio…
By Brian Chen, Victor Wang, Victor Wang

Problems 1

Let p,qp,qp,q be positive integers such t hat q≥pq\ge pq≥p. How many one-to-one functions are possible from a set AAA containing ppp elements to a set BBB containing qqq elements?