Let A be a set of 2019 distinct elements.
What proportion of functions from A to A are one-to-one?
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
Let's look at all the possible functions first. We know we have 2019 elements in A , meaning if we want to build a function from A to A, we have for each element a total of 2019 diffrent images, hence 2 0 1 9 2 0 1 9 . But we want to know how much of these functions are one-to-one. So again, for the first element in A , we have a toal of 2019 elements to map. Though, this time we have for a 2 , only 2018 because if we would map it the same image as of a 1 , our function wouldn't be one-to-one. Hence we would get that the amount of total one-to-one functions is 2 0 1 8 ! , writing it as fraction and reducing we get: 2 0 1 9 2 0 1 9 2 0 1 9 ! = 2 0 1 9 2 0 1 8 2 0 1 8 !
Problem Loading...
Note Loading...
Set Loading...
The number of ways we can assign a different element of F(A) to each number of A, is the same as the number of ways we can put 2019 distinct elements into order: 2019!
Since we can choose any of the 2019 elements of the range to any of the 2019 elements in the range, total number of A to A functions is: 2 0 1 9 2 0 1 9
Hence, the required proportion:
2 0 1 9 2 0 1 9 2 0 1 9 ! = 2 0 1 9 × 2 0 1 9 2 0 1 8 \require c a n c e l 2 0 1 9 × 2 0 1 8 ! = 2 0 1 9 2 0 1 8 2 0 1 8 !