$t_1, t_2, t_3, \ldots, t_n$ are positive integers, $S_n=t_1+t_2+t_3+\ldots+t_n$, $S_1=1^2, S_2=3^2, S_3=6^2, S_4=10^2, S_5=15^2$ and similarly other terms are there. Following this pattern, if $S_{10}=k^2$ then $k=$

$K=\left|\begin{array}{cc}3 & 4 \\ 5 & 4\end{array}\right|+\left|\begin{array}{cc}1 & -1 \\ 5 & 4\end{array}\right|+\left|\begin{array}{cc}\frac{1}{3} & \frac{1}{4} \\ 5 & 4\end{array}\right|+\left|\begin{array}{cc}\frac{1}{9} & -\frac{1}{16} \\ 5 & 4\end{array}\right|+\ldots$ to $\infty$, then $K=$

The value of the greatest integer $k$ satisfying the inequation $2^{n+4}+12 \geq k(n+4)$ for all $n \in N$ is

If $\frac{1}{2 \cdot 7}+\frac{1}{7 \cdot 12}+\frac{1}{12 \cdot 17}+\frac{1}{17 \cdot 22}+\ldots$ to 10 terms $=k$, then $k=$