\(∵\)\(f(n) = \begin{cases} 2n, & \text{if } n \in \{1,2,3,4,5\} \\ 2n-11, & \text{if } n \in \{6,7,8,9,10\} \end{cases}\)
\(∴ f(1) = 2, f(2) = 4, … , f(5) = 10\)
and \(f(6) = 1, f(7) = 3, f(8) = 5, … , f(10) = 9\)
Now,
\(f(g(n)) = \begin{cases} n + 1, & \text{if } n \text{ is odd} \\ n - 1, & \text{if } n \text{ is even} \end{cases}\)
\(∴ f(g(10)) = 9 \implies g(10) = 10\)
\(f(g(1)) = 2 \implies g(1) = 1\)
\(f(g(2)) = 1 \implies g(2) = 6\)
\(f(g(3)) = 4 \implies g(3) = 2\)
\(f(g(4)) = 3 \implies g(4) = 7\)
\(f(g(5)) = 6 \implies g(5) = 3\)
\(∴\) \(g(10) \cdot (g(1) + g(2) + g(3) + g(4) + g(5)) = 190\)
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.