Let \( R = \{a, b, c, d, e\} \) and \( S = \{1, 2, 3, 4\} \). Total number of onto functions \( f: R \to S \) such that \( f(a) \neq 1 \), is equal to:
When counting onto functions with restrictions, calculate the total onto functions first and subtract the restricted cases using inclusion-exclusion principles.
The correct answer is (B) : 180
Total no. of onto functions
\(=\frac{5!}{3!2!}\times4!\)
So , when f(a) = 1
\(\frac{4!}{2!2!}\times3!+4!\)
\(\therefore\) Required functions :
= 240 -36 -24
=180
The total number of onto functions from \( R \) to \( S \) is calculated as:
\[ \text{Total onto functions} = \binom{5}{3} \cdot 4! = \frac{5 \cdot 4}{2} \cdot 24 = 240. \]
Now, consider the case where \( f(a) = 1 \).
If \( f(a) = 1 \), the remaining 4 elements \( b, c, d, e \) must map onto \( S \setminus \{1\} \), which has 3 elements. The number of onto functions for these remaining 4 elements is:
\[ \text{Functions with \( f(a) = 1 \)} = \binom{4}{2} \cdot 3! \cdot 3. \]
Compute this step by step:
\[ \binom{4}{2} \cdot 3! = \frac{4 \cdot 3}{2} \cdot 6 +14= 60. \]
Finally, subtract this from the total:
\[ \text{Required functions} = 240 - 60 = 180. \]
Thus, the total number of onto functions \( f \) such that \( f(a) \neq 1 \) is \( \boxed{180} \).
Let $ P_n = \alpha^n + \beta^n $, $ n \in \mathbb{N} $. If $ P_{10} = 123,\ P_9 = 76,\ P_8 = 47 $ and $ P_1 = 1 $, then the quadratic equation having roots $ \alpha $ and $ \frac{1}{\beta} $ is:
A relation R from a non-empty set B is a subset of the cartesian product A × B. The subset is derived by describing a relationship between the first element and the second element of the ordered pairs in A × B.
A relation f from a set A to a set B is said to be a function if every element of set A has one and only one image in set B. In other words, no two distinct elements of B have the same pre-image.
Relations and functions can be represented in different forms such as arrow representation, algebraic form, set-builder form, graphically, roster form, and tabular form. Define a function f: A = {1, 2, 3} → B = {1, 4, 9} such that f(1) = 1, f(2) = 4, f(3) = 9. Now, represent this function in different forms.