Let f, g: N rightarrow N such that f(n+1)=f(n | vedclass

Name: Exam Paper Generator | JEE NEET Paper Generator | Vedclass
Brand: Vedclass
Rating: 5 (35 reviews)

Question

(D) Given $f(n+1) = f(n) + f(1)$. This is a linear recurrence relation.For $n=1$,$f(2) = f(1) + f(1) = 2f(1)$.For $n=2$,$f(3) = f(2) + f(1) = 3f(1)$.B

Vedclass · Accepted Answer

If $g$ is onto,then $fog$ is one-one

Vedclass · Answer

(D) Given $f(n+1) = f(n) + f(1)$. This is a linear recurrence relation.For $n=1$,$f(2) = f(1) + f(1) = 2f(1)$.For $n=2$,$f(3) = f(2) + f(1) = 3f(1)$.By induction,$f(n) = n f(1)$.Since $f: N \rightarrow N$,$f(1)$ must be a positive integer $k \in N$.Thus,$f(n) = kn$. Since $k \geq 1$,$f(n_1) = f(n_2) \Rightarrow kn_1 = kn_2 \Rightarrow n_1 = n_2$,so $f$ is one-one. Statement $C$ is true.If $fog$ is one-one,then $f(g(x_1)) = f(g(x_2)) \Rightarrow g(x_1) = g(x_2)$ because $f$ is one-one. Since $fog$ is one-one,$x_1 = x_2$. Thus $g$ is one-one. Statement $A$ is true.If $f$ is onto,then for any $y \in N$,there exists $n \in N$ such that $f(n) = y$,i.e.,$kn = y$. This is only possible for all $y$ if $k=1$,so $f(n) = n$. Statement $B$ is true.If $g$ is onto,$fog$ is not necessarily one-one. For example,if $g(n) = 1$ for all $n$ (not onto) or any non-injective function,$fog$ will not be one-one. Even if $g$ is onto,if $g$ is not one-one,$fog$ cannot be one-one. Thus,statement $D$ is $NOT$ true.

Let $f, g: N \rightarrow N$ such that $f(n+1)=f(n)+f(1)$ for all $n \in N$ and $g$ be any arbitrary function. Which of the following statements is $NOT$ true?

Similar Questions

Let $f: R \rightarrow R$ be defined by $f(x) = \left\{\begin{array}{cc} 2x, & x > 3 \\ x^2, & 1 < x \leq 3 \\ 3x, & x \leq 1 \end{array}\right.$. Then,the value of $f(-2) + f(3) + f(4)$ is:

Let $f: R \rightarrow R$ be defined by $f(x) = 5^{-|x|} + \operatorname{sgn}(5^{-x})$, where $\operatorname{sgn}(x)$ denotes the signum function of $x$. Then $f$ is

If $f: \{1, 2, 3, 4\} \to \{1, 2, 3, 4\}$ is a function such that $|f(\alpha) - \alpha| \leqslant 1$ for all $\alpha \in \{1, 2, 3, 4\}$,then the total number of such functions is:

Let $f:[0,1] \rightarrow [-1,1]$ and $g:[-1,1] \rightarrow [0,2]$ be two functions such that $g$ is injective and $g \circ f: [0,1] \rightarrow [0,2]$ is surjective. Then,

Which of the following statements is true?

Vedclass Test Series

Exam Paper Generator

Online Exam Module