Let . Then the probability that a randomly chosen onto function from to satisfies is:
We have the finite set as both domain and co-domain. An “onto” function from a finite set to itself must be bijective, so every such function is simply a permutation of the six elements. The total number of permutations of six distinct objects is given by the factorial formula ; putting we obtain the total number of onto functions
Now we impose the condition Because the image of must lie in , and because doubling that image must also lie in , we list the possibilities one by one.
If , then , so we must have
If , then , so we must have
If , then , so we must have
For the number would be outside , so no further choices are admissible. Thus there are exactly three admissible ordered pairs :
Fix any one of these three pairs. Two images have now been used up, leaving four distinct images in and four remaining domain elements, namely To keep the function bijective we must match these four elements with the four unused images in a one-to-one fashion. The number of ways to arrange a bijection between two four-element sets is given by , and we compute
Hence, for each of the three admissible choices for there are complete bijections. Multiplying, the total number of favorable functions is
The required probability is therefore the ratio of favorable cases to total cases:
Hence, the correct answer is Option D.
Tagged Probability using permutations and combinations. Machine-assigned, so read it as a strong shortlist rather than a verdict.