The total number of functions,

$$ f:\{1,2,3,4\} \rightarrow\{1,2,3,4,5,6\} $$ such that $$f(1)+f(2)=f(3)$$, is equal to :

Let a function f : N $$\to$$ N be defined by

$$f(n) = \left[ {\matrix{ {2n,} & {n = 2,4,6,8,......} \cr {n - 1,} & {n = 3,7,11,15,......} \cr {{{n + 1} \over 2},} & {n = 1,5,9,13,......} \cr } } \right.$$

then, f is

Let f : R $$\to$$ R be defined as f (x) = x $$-$$ 1 and g : R $$-$$ {1, $$-$$1} $$\to$$ R be defined as $$g(x) = {{{x^2}} \over {{x^2} - 1}}$$.

Then the function fog is :

Let $$f(x) = {{x - 1} \over {x + 1}},\,x \in R - \{ 0, - 1,1\} $$. If $${f^{n + 1}}(x) = f({f^n}(x))$$ for all n $$\in$$ N, then $${f^6}(6) + {f^7}(7)$$ is equal to :