3-digit numbers have to be formed using the digits 1 to 9.
Here, the order of the digits matters.
Therefore, there will be as many 3-digit numbers as there are permutations of 9 different digits taken 3 at a time.
Therefore, required number of 3-digit numbers=\(^9P_3\)
\(=\frac{9!}{(9-3)!}\)
\(=\frac{9!}{6!}\)
\(=\frac{9\times8\times7\times6}{6!}\)
\(=9\times8\times7=504\)
\(f(x) = \begin{cases} x^2, & \quad 0≤x≤3\\ 3x, & \quad 3≤x≤10 \end{cases}\)
The relation g is defined by
\(g(x) = \begin{cases} x^2, & \quad 0≤x≤2\\ 3x, & \quad 2≤x≤10 \end{cases}\)
Show that f is a function and g is not a function.
Permutation is the method or the act of arranging members of a set into an order or a sequence.
Combination is the method of forming subsets by selecting data from a larger set in a way that the selection order does not matter.