We are given a set \( A = \{1, 2, 3, \ldots, n\} \) and asked to find the value of \( n \) for which the probability that a randomly selected mapping \( f: A \to A \) is injective is \( \frac{3}{32} \).
An injective function (also known as one-to-one) means that different elements in set \( A \) must map to different elements in set \( A \). Therefore, for the function to be injective, all elements must be mapped uniquely.
The total number of functions from \( A \to A \) is \( n^n \), because each of the \( n \) elements in the domain \( A \) has \( n \) choices in the codomain \( A \).
The number of injective mappings is the number of ways to arrange \( n \) distinct elements, which is \( n! \) (factorial of \( n \)).
The probability that a randomly chosen mapping is injective is given by:
\(\frac{n!}{n^n}\)
We are given that this probability is \( \frac{3}{32} \). Therefore, we have the equation:
\(\frac{n!}{n^n} = \frac{3}{32}\)
To solve for \( n \), we will compare the values of \(\frac{n!}{n^n}\) by testing successive integers.
Thus, the value of \( n = 4 \) satisfies the condition that the probability is \(\frac{3}{32}\).
Therefore, the correct answer is \( n = 4 \) and the correct option is \( \boxed{4} \).
A bag contains 19 unbiased coins and one coin with head on both sides. One coin drawn
at random is tossed and head turns up. If the probability that the drawn coin was unbiased,
is $\frac{m}{n}$, gcd (m, n) = 1, then $n^2 - m^2$ is equal to :
Given three indentical bags each containing 10 balls, whose colours are as follows :
| Red | Blue | Green | |
| Bag I | 3 | 2 | 5 |
| Bag II | 4 | 3 | 3 |
| Bag III | 5 | 1 | 4 |
A person chooses a bag at random and takes out a ball. If the ball is Red, the probability that it is from bag I is $p$ and if the ball is Green, the probability that it is from bag III is $q$, then the value of $\left( \frac{1}{p} + \frac{1}{q} \right)$ is:
| Class | 5-10 | 10-15 | 15-20 | 20-25 | 25-30 | 30-35 |
|---|---|---|---|---|---|---|
| Frequency | 2 | k | 28 | 54 | k+1 | 5 |