Let $ S$ be a sequence that: \[ \left\{ \begin{array}{cc} S_0\equal{}0\hfill\\ S_1\equal{}1\hfill\\ S_n\equal{}S_{n\minus{}1}\plus{}S_{n\minus{}2}\plus{}F_n& (n>1) \end{array} \right.\] such that $ F_n$ is Fibonacci sequence such that $ F_1\equal{}F_2\equal{}1$. Find $ S_n$ in terms of Fibonacci numbers.

We have a closed path on a vertices of a $ n$×$ n$ square which pass from each vertice exactly once . prove that we have two adjacent vertices such that if we cut the path from these points then length of each pieces is not less than quarter of total path .

For a function $f(x)=\ln (1+\sqrt{1-x^2})-\sqrt{1-x^2}-\ln x\ (0<x<1)$, answer the following questions: (1) Find $f'(x)$. (2) Sketch the graph of $y=f(x)$. (3) Let $P$ be a mobile point on the curve $y=f(x)$ and $Q$ be a point which is on the tangent at $P$ on the curve $y=f(x)$ and such that $PQ=1$. Note that the $x$-coordinate of $Q$ is les than that of $P$. Find the locus of $Q$.

Let $n$ be a positive integer and define $A_n = \{1, 2, ..., n\}$. How many functions $f : A_n \to A_n$ are there such that for all $x, y \in A_n$, if $x < y$ then $f(x) \ge f(y)$?

The function f is defined on the set of integers and satisfies $\bullet$ $f(n) = n - 2$, if $n \ge 2005$ $\bullet$ $f(n) = f(f(n+7))$, if $n < 2005$. Find $f(3)$.

For $i=1,2,$ let $T_i$ be a triangle with side length $a_i,b_i,c_i,$ and area $A_i.$ Suppose that $a_1\le a_2, b_1\le b_2, c_1\le c_2,$ and that $T_2$ is an acute triangle. Does it follow that $A_1\le A_2$?

A set $M$ of positive integers is called [i]connected[/i] if for any element $x\in M$ at least one of the numbers $x-1,x+1$ is in $M$. Let $U_n$ be the number of the connected subsets of $\{1,2,\ldots,n\}$. a) Compute $U_7$; b) Find the smallest number $n$ such that $U_n \geq 2006$.

Prove or disprove the following statements: (a) There exists a monotone function $f : [0, 1] \rightarrow [0, 1]$ such that for each $y \in [0, 1]$ the equation $f(x) = y$ has uncountably many solutions $x$. (b) There exists a continuously differentiable function $f : [0, 1] \rightarrow [0, 1]$ such that for each $y \in [0, 1]$ the equation $f(x) = y$ has uncountably many solutions $x$.

A function \[\text{f:(0,}\infty \text{) }\to \text{(0,}\infty \text{)}\] is called contract if, for every numbers $x,y\in \text{(0,}\infty \text{)}$ we have, $\underset{n\to \infty }{\mathop{\lim }}\,\left( {{f}^{n}}\left( x \right)-{{f}^{n}}\left( y \right) \right)=0$ where ${{f}^{n}}=\underbrace{f\circ f\circ ...\circ f}_{n\ f\text{'s}}$ a) Consider \[f:\text{(0,}\infty \text{) }\to \text{(0,}\infty \text{)}\] a function contract, continue with the property that has a fixed point, that existing ${{x}_{0}}\in \text{(0,}\infty \text{) }$ there so that $f\left( {{x}_{0}} \right)={{x}_{0}}.$ Show that $f\left( x \right)>x,$ for every $x\in \text{(0,}{{x}_{0}}\text{)}\,$ and $f\left( x \right)<x$, for every $x\in \text{(}{{x}_{0}}\text{,}\infty \text{)}\,$. b) Show that the given function \[f\text{:(0,}\infty \text{) }\to \text{(0,}\infty \text{)}\] given by $f\left( x \right)=x+\frac{1}{x}$ is contracted but has no fix number.

$ k$ is a given natural number. Find all functions $ f: \mathbb{N}\rightarrow\mathbb{N}$ such that for each $ m,n\in\mathbb{N}$ the following holds: \[ f(m)\plus{}f(n)\mid (m\plus{}n)^k\]

Let $\rho:\mathbb{R}^n\to \mathbb{R}$, $\rho(\mathbf{x})=e^{-||\mathbf{x}||^2}$, and let $K\subset \mathbb{R}^n$ be a convex body, i.e., a compact convex set with nonempty interior. Define the barycenter $\mathbf{s}_K$ of the body $K$ with respect to the weight function $\rho$ by the usual formula \[\mathbf{s}_K=\frac{\int_K\rho(\mathbf{x})\mathbf{x}d\mathbf{x}}{\int_K\rho(\mathbf{x})d\mathbf{x}}.\] Prove that the translates of the body $K$ have pairwise distinct barycenters with respect to $\rho$.

The sequence \[\log_{12}{162},\, \log_{12}{x},\, \log_{12}{y},\, \log_{12}{z},\, \log_{12}{1250}\] is an arithmetic progression. What is $x$? $ \textbf{(A)} \ 125\sqrt{3} \qquad \textbf{(B)} \ 270 \qquad \textbf{(C)} \ 162\sqrt{5} \qquad \textbf{(D)} \ 434 \qquad \textbf{(E)} \ 225\sqrt{6}$

A function $f$ is defined on the positive integers by \[\left\{\begin{array}{rcl}f(1) &=& 1, \\ f(3) &=& 3, \\ f(2n) &=& f(n), \\ f(4n+1) &=& 2f(2n+1)-f(n), \\ f(4n+3) &=& 3f(2n+1)-2f(n), \end{array}\right.\] for all positive integers $n$. Determine the number of positive integers $n$, less than or equal to 1988, for which $f(n) = n$.

The graph of the equation $9x+223y=2007$ is drawn on graph paper with each square representing one unit in each direction. How many of the $1$ by $1$ graph paper squares have interiors lying entirely below the graph and entirely in the first quadrant?

Find all functions $f\colon R \to R$ such that \[f\left(x^{2}+yf(x)\right) = f(x)^{2}+xf(y)\] for all reals $x,y$.

Let $a,b,c,$ and $d$ be real numbers such that at least one of $c$ and $d$ is non-zero. Let $ f:\mathbb{R}\to\mathbb{R}$ be a function defined as $f(x)=\frac{ax+b}{cx+d}$. Suppose that for all $x\in\mathbb{R}$, we have $f(x) \neq x$. Prove that if there exists some real number $a$ for which $f^{1387}(a)=a$, then for all $x$ in the domain of $f^{1387}$, we have $f^{1387}(x)=x$. Notice that in this problem, \[f^{1387}(x)=\underbrace{f(f(\cdots(f(x)))\cdots)}_{\text{1387 times}}.\] [i]Hint[/i]. Prove that for every function $g(x)=\frac{sx+t}{ux+v}$, if the equation $g(x)=x$ has more than $2$ roots, then $g(x)=x$ for all $x\in\mathbb{R}-\left\{\frac{-v}{u}\right\}$.

Find, with proof, the number of positive integers whose base-$n$ representation consists of distinct digits with the property that, except for the leftmost digit, every digit differs by $\pm 1$ from some digit further to the left. (Your answer should be an explicit function of $n$ in simplest form.)

Suppose that $f: \mathbb{R}\rightarrow\mathbb{R}$ fulfils $\left|\sum^n_{k=1}3^k\left(f(x+ky)-f(x-ky)\right)\right|\le1$ for all $n\in\mathbb{N},x,y\in\mathbb{R}$. Prove that $f$ is a constant function.

Show that the system of equations \begin{align*} \lfloor x\rfloor^2+\lfloor y\rfloor &=0, \\ 3x+y &=2, \end{align*} has infinitely many solutions and all these solutions satisfy bounds \begin{align*} 0<\ &x <4, \\ -9\le\ &y\le 1. \end{align*}

Let $Q$ be a set of prime numbers, not necessarily finite. For a positive integer $n$ consider its prime factorization: define $p(n)$ to be the sum of all the exponents and $q(n)$ to be the sum of the exponents corresponding only to primes in $Q$. A positive integer $n$ is called [i]special[/i] if $p(n)+p(n+1)$ and $q(n)+q(n+1)$ are both even integers. Prove that there is a constant $c>0$ independent of the set $Q$ such that for any positive integer $N>100$, the number of special integers in $[1,N]$ is at least $cN$. (For example, if $Q=\{3,7\}$, then $p(42)=3$, $q(42)=2$, $p(63)=3$, $q(63)=3$, $p(2022)=3$, $q(2022)=1$.)

Find all triplets $(x,y,n)$ of positive integers which satisfy: \[ (x-y)^n=xy \]

Let $f_0(x)=x+|x-100|-|x+100|$, and for $n\geq 1$, let $f_n(x)=|f_{n-1}(x)|-1$. For how many values of $x$ is $f_{100}(x)=0$? $\textbf{(A) }299\qquad \textbf{(B) }300\qquad \textbf{(C) }301\qquad \textbf{(D) }302\qquad \textbf{(E) }303\qquad$

[color=darkred]Let $n$ and $m$ be two natural numbers, $m\ge n\ge 2$ . Find the number of injective functions \[f\colon\{1,2,\ldots,n\}\to\{1,2,\ldots,m\}\] such that there exists a unique number $i\in\{1,2,\ldots,n-1\}$ for which $f(i)>f(i+1)\, .$[/color]

Let $S$ be a finite set of nonzero real numbers, and let $f : S\to S$ be a function with the following property: for each $x \in S$, either $f ( f (x)) = x+ f (x)$ or $f ( f (x)) = \frac{x+ f (x)}{2}$. Prove that $f (x) = x$ for all $x \in S$.

Consider the set $\mathcal{F}$ of functions $f:\mathbb{N}\to\mathbb{N}$ (where $\mathbb{N}$ is the set of non-negative integers) having the property that \[f(a^2-b^2)=f(a)^2-f(b)^2,\ \text{for all }a,b\in\mathbb{N},\ a\ge b.\] a) Determine the set $\{f(1)\mid f\in\mathcal{F}\}$. b) Prove that $\mathcal{F}$ has exactly two elements. [i]Nelu Chichirim[/i]