Find a function $f(n)$ on the positive integers with positive integer values such that $f( f(n) ) = 1993 n^{1945}$ for all $n$.

Prove that there exists a sequence $a(1),a(2),\dots,a(n),\dots$ of real numbers such that \[ a(n+m)\le a(n)+a(m)+\frac{n+m}{\log (n+m)} \] for all integers $m,n\ge 1$, and such that the set $\{a(n)/n:n\ge 1\}$ is everywhere dense on the real line. [i]Remark.[/i] A theorem of de Bruijn and Erdős states that if the inequality above holds with $f(n + m)$ in place of the last term on the right-hand side, where $f(n)\ge 0$ is nondecreasing and $\sum_{n=2}^\infty f(n)/n^2<\infty$, then $a(n)/n$ converges or tends to $(-\infty)$.

Assume that positive numbers $a, b, c, x, y, z$ satisfy $cy + bz = a$, $az + cx = b$, and $bx + ay = c$. Find the minimum value of the function \[ f(x, y, z) = \frac{x^2}{x+1} + \frac {y^2}{y+1} + \frac{z^2}{z+1}. \]

For each positive integer, define a function \[ f(n)=\begin{cases}0, &\text{if n is the square of an integer}\\ \\ \left\lfloor\frac{1}{\{\sqrt{n}\}}\right\rfloor, &\text{if n is not the square of an integer}\end{cases}. \] Find the value of $\sum_{k=1}^{200} f(k)$.

Given a real number $\alpha$, find all pairs $(f,g)$ of functions $f,g :\mathbb{R} \to \mathbb{R}$ such that $$xf(x+y)+\alpha \cdot yf(x-y)=g(x)+g(y) \;\;\;\;\;\;\;\;\;\;\; ,\forall x,y \in \mathbb{R}.$$

Given that, a function $f(n)$, defined on the natural numbers, satisfies the following conditions: (i)$f(n)=n-12$ if $n>2000$; (ii)$f(n)=f(f(n+16))$ if $n \leq 2000$. (a) Find $f(n)$. (b) Find all solutions to $f(n)=n$.

Let $x_1,x_2,\ldots ,x_{1997}$ be real numbers satisfying the following conditions: i) $-\dfrac{1}{\sqrt{3}}\le x_i\le \sqrt{3}$ for $i=1,2,\ldots ,1997$; ii) $x_1+x_2+\cdots +x_{1997}=-318 \sqrt{3}$ . Determine (with proof) the maximum value of $x^{12}_1+x^{12}_2+\ldots +x^{12}_{1997}$ .

Does the Cauchy problem $u|_{y=x^2}=1$, $(\nabla u)^2=1$ have a smooth solution in the domain $y\ge x^2$? In the domain $y\le x^2$?

Let $P$ be the quadratic function such that $P(0) = 7$, $P(1) = 10$, and $P(2) = 25$. If $a$, $b$, and $c$ are integers such that every positive number $x$ less than 1 satisfies \[ \sum_{n = 0}^\infty P(n) x^n = \frac{ax^2 + bx + c}{{(1 - x)}^3}, \] compute the ordered triple $(a, b, c)$.

$(FRA 5)$ Let $\alpha(n)$ be the number of pairs $(x, y)$ of integers such that $x+y = n, 0 \le y \le x$, and let $\beta(n)$ be the number of triples $(x, y, z)$ such that$ x + y + z = n$ and $0 \le z \le y \le x.$ Find a simple relation between $\alpha(n)$ and the integer part of the number $\frac{n+2}{2}$ and the relation among $\beta(n), \beta(n -3)$ and $\alpha(n).$ Then evaluate $\beta(n)$ as a function of the residue of $n$ modulo $6$. What can be said about $\beta(n)$ and $1+\frac{n(n+6)}{12}$? And what about $\frac{(n+3)^2}{6}$? Find the number of triples $(x, y, z)$ with the property $x+ y+ z \le n, 0 \le z \le y \le x$ as a function of the residue of $n$ modulo $6.$What can be said about the relation between this number and the number $\frac{(n+6)(2n^2+9n+12)}{72}$?

Let $f$ be a function defined on the set of positive rational numbers with the property that $f(a\cdot b)=f(a)+f(b)$ for all positive rational numbers $a$ and $b$. Suppose that $f$ also has the property that $f(p)=p$ for every prime number $p$. For which of the following numbers $x$ is $f(x)<0?$ $\textbf{(A) } \frac{17}{32} \qquad \textbf{(B) } \frac{11}{16} \qquad \textbf{(C) } \frac{7}{9} \qquad \textbf{(D) } \frac{7}{6} \qquad \textbf{(E) } \frac{25}{11}$

Let $\mathbb{Z}^{+}$ be the set of positive integers. [b]a)[/b] Prove that there is only one function $f:\mathbb{Z}^{+} \rightarrow \mathbb{Z}^{+}$, strictly increasing, such that $f(f(n))=2n+1$ for every $n\in \mathbb{Z}^{+}$. [b]b)[/b] For the function in [b]a[/b]. Prove that for every $n\in \mathbb{Z}^{+}$ $\frac{4n+1}{3}\leq f(n)\leq \frac{3n+1}{2}$ [b]c) [/b] Prove that in each inequality side of [b]b[/b] the equality can reach by infinite positive integers $n$.

The sequence $ (x_n)_{n \geq 1}$ is defined by: $ x_1\equal{}1$ $ x_{n\plus{}1}\equal{}\frac{x_n}{n}\plus{}\frac{n}{x_n}$ Prove that $ (x_n)$ increases and $ [x_n^2]\equal{}n$.

Alice and Bob play a game in which they take turns removing stones from a heap that initially has $n$ stones. The number of stones removed at each turn must be one less than a prime number. The winner is the player who takes the last stone. Alice plays first. Prove that there are infinitely many such $n$ such that Bob has a winning strategy. (For example, if $n=17,$ then Alice might take $6$ leaving $11;$ then Bob might take $1$ leaving $10;$ then Alice can take the remaining stones to win.)

Let $\,{\mathbb{R}}\,$ denote the set of all real numbers. Find all functions $\,f: {\mathbb{R}}\rightarrow {\mathbb{R}}\,$ such that \[ f\left( x^{2}+f(y)\right) =y+\left( f(x)\right) ^{2}\hspace{0.2in}\text{for all}\,x,y\in \mathbb{R}. \]