A number is divisible by 10 if its units digits is 0.
Therefore, 0 is fixed at the units place.
Therefore, there will be as many ways as there are ways of filling 5 vacant places
in succession by the remaining 5 digits (i.e., 1, 3, 5, 7 and 9).
The 5 vacant places can be filled in \(5!\) ways.
Hence, required number of 6-digit numbers = \(5!\) = 120
\(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.