The number of bijective functions $f: \mathbf{Z} \rightarrow \mathbf{Z}$ such that $f(x+y)=f(x)+f(y) \forall x, y \in \mathbf{Z}$, is
For each $n \in \mathbf{N}$, let $A_n=\{(n+1) k / k \in \mathbf{N}\}$ and $X=\bigcup_{n \in \mathbf{N}} A_n \cdot A$ mapping $f: X \rightarrow N$ defined by $f(x)=x$, $\forall x \in \mathbf{X}$, is
For $n>2$ and $n \in \mathbf{N}$, the product of the roots of $(x-n)\left(\left(x^2-2 n x\right)^2+\left(2 n^2-5\right)\left(x^2-2 n x\right)\right. \left.+\left(n^4-5 n^2+4\right)\right)=0$ is divisible by
Let $I$ be a unit matrix of order 6 . Let $A=\left(a_{i j}\right)$ be a square matrix of order 6 such that $a_{i j}=\left\{\begin{array}{l}1, \text { if } i+j=7 \\ 0, \text { if } i+j \neq 7\end{array}\right.$ then $\left(A(\operatorname{adj} A) A^{-1}\right) A^2=$
TS EAMCET Papers
All year-wise previous year question papers