Let $\mathbb{R}$ be the set of real numbers. Let $f:\mathbb{R}\rightarrow\mathbb{R}$ be a function such that \[f(x+y)f(x-y)\geqslant f(x)^2-f(y)^2\] for every $x,y\in\mathbb{R}$. Assume that the inequality is strict for some $x_0,y_0\in\mathbb{R}$. Prove that either $f(x)\geqslant 0$ for every $x\in\mathbb{R}$ or $f(x)\leqslant 0$ for every $x\in\mathbb{R}$.

Let $n$ be a positive integer, and $x$ be a positive real number. Prove that $$\sum_{k=1}^{n} \left( x \left[\frac{k}{x}\right] - (x+1)\left[\frac{k}{x+1}\right]\right) \leq n,$$ where $[x]$ denotes the largest integer not exceeding $x$.

Let $\alpha$ be given positive real number, find all the functions $f: N^{+} \rightarrow R$ such that $f(k + m) = f(k) + f(m)$ holds for any positive integers $k$, $m$ satisfying $\alpha m \leq k \leq (\alpha + 1)m$.

Prove that: $\int_{-1}^1f^2(x)dx\ge \frac 1 2 (\int_{-1}^1f(x)dx)^2 +\frac 3 2(\int_{-1}^1xf(x)dx)^2$ Please give a proof without using even and odd functions. (the oficial proof uses those and seems to be un-natural) :D

Let $n\geq 2$ and $\mathcal{M}$ be a subset of $S_n$ with at least two elements, and which is closed under composition. Consider a function $f:\mathcal{M}\rightarrow\mathbb{R}$ which satisfies $$|f(\sigma\tau)-f(\sigma)-f(\tau)|\leq 1,$$ for all $\sigma,\tau\in\mathcal{M}$. Prove that $$\max_{\sigma,\tau\in\mathcal{M}}|f(\sigma)-f(\tau)|\leq 2-\frac{2}{|\mathcal{M}|}.$$

Let $X=\{1,2,\dots,n\},$ and let $k\in X.$ Show that there are exactly $k\cdot n^{n-1}$ functions $f:X\to X$ such that for every $x\in X$ there is a $j\ge 0$ such that $f^{(j)}(x)\le k.$ [Here $f^{(j)}$ denotes the $j$th iterate of $f,$ so that $f^{(0)}(x)=x$ and $f^{(j+1)}(x)=f\left(f^{(j)}(x)\right).$]

Let $ f: [0,1]\rightarrow \mathbb{R}$ a derivable function such that $ f(0)\equal{}f(1)$, $ \int_0^1f(x)dx\equal{}0$ and $ f^{\prime}(x) \neq 1\ ,\ (\forall)x\in [0,1]$. i)Prove that the function $ g: [0,1]\rightarrow \mathbb{R}\ ,\ g(x)\equal{}f(x)\minus{}x$ is strictly decreasing. ii)Prove that for each integer number $ n\ge 1$, we have: $ \left|\sum_{k\equal{}0}^{n\minus{}1}f\left(\frac{k}{n}\right)\right|<\frac{1}{2}$

Let $ a_1$, $ a_2$, ..., $ a_n$ and $ b_1$, $ b_2$, ..., $ b_n$ be $ 2 \cdot n$ real numbers. Prove that the following two statements are equivalent: [b]i)[/b] For any $ n$ real numbers $ x_1$, $ x_2$, ..., $ x_n$ satisfying $ x_1 \leq x_2 \leq \ldots \leq x_ n$, we have $ \sum^{n}_{k \equal{} 1} a_k \cdot x_k \leq \sum^{n}_{k \equal{} 1} b_k \cdot x_k,$ [b]ii)[/b] We have $ \sum^{s}_{k \equal{} 1} a_k \leq \sum^{s}_{k \equal{} 1} b_k$ for every $ s\in\left\{1,2,...,n\minus{}1\right\}$ and $ \sum^{n}_{k \equal{} 1} a_k \equal{} \sum^{n}_{k \equal{} 1} b_k$.

Find all the triangles such that its side lenghts, area and its angles' measures (in degrees) are rational.

Suppose that n numbers $x_1, x_2, . . . , x_n$ are chosen randomly from the set $\{1, 2, 3, 4, 5\}$. Prove that the probability that $x_1^2+ x_2^2 +\cdots+ x_n^2 \equiv 0 \pmod 5$ is at least $\frac 15.$

Prove that if $ E \subset \mathbb{R}$ is a bounded set of positive Lebesgue measure, then for every $ u < 1/2$, a point $ x\equal{}x(u)$ can be found so that \[ |(x\minus{}h,x\plus{}h) \cap E| \geq uh\] and \[ |(x\minus{}h,x\plus{}h) \cap (\mathbb{R} \setminus E)| \geq uh\] for all sufficiently small positive values of $ h$. [i]K. I. Koljada[/i]

Let $f:[0,\infty)\to\mathbb R$ be a continuous function s.t. $\lim_{x\to\infty}\frac {f(x)}x=0$. Let $(x_n)_n$ be a sequence of positive real numbers s.t. $\left(\frac{x_n}n\right)_n$ is bounded. Prove that $\lim_{n\to\infty}\frac{f(x_n)}n=0$. [i]Dorin Andrica, Eugen Paltanea[/i]

Let $ n$ be positive integer, $ A,B\subseteq[0,n]$ are sets of integers satisfying $ \mid A\mid \plus{} \mid B\mid\ge n \plus{} 2.$ Prove that there exist $ a\in A, b\in B$ such that $ a \plus{} b$ is a power of $ 2.$

Set $T$ consists of $66$ points in plane, and $P$ consists of $16$ lines in plane. Pair $(A,l)$ is [i]good[/i] if $A \in T$, $l \in P$ and $A \in l$. Prove that maximum number of good pairs is no greater than $159$, and prove that there exits configuration with exactly $159$ good pairs.

Find the functions $f: \mathbb{R} \to \mathbb{R}$ that satisfy $$(f(x)-y)f(x+f(y))=f(x^2)-yf(y),$$ for all real numbers $x$ and $y.$

Prove that there are no distinct positive integers $x$ and $y$ such that $x^{2007} + y! = y^{2007} + x! $

Let $n\geq 2$ be a given integer. Find all functions $f:\mathbb{R}\rightarrow \mathbb{R}$ such that \[f(x-f(y))=f(x+y^n)+f(f(y)+y^n), \qquad \forall x,y \in \mathbb R.\]

Let $ I $ be a nondegenerate interval, and let $ F $ be a primitive of a function $ f:I\longrightarrow\mathbb{R} . $ Show that for any distinct $ a,b\in I, $ the tangents to the graph of $ F $ at the points $ (a,F(a)) ,(b,F(b)) $ are concurrent at a point whose abscisa is situated in the interval $ (a,b). $ [i]Nicolae Bourbăcuț[/i]

Find all $a\in\mathbb{R}$ for which there exists a non-constant function $f: (0,1]\rightarrow\mathbb{R}$ such that \[a+f(x+y-xy)+f(x)f(y)\leq f(x)+f(y)\] for all $x,y\in(0,1].$

Compute the value of $$\sin^2\left(\frac{\pi}{7}\right) + \sin^2\left(\frac{3\pi}{7}\right) + \sin^2\left(\frac{5\pi}{7}\right).$$ Your answer should not involve any trigonometric functions. [i]Proposed by Howard Halim[/i]

Consider the sequence $(a_n)_{n\ge 1}$ defined by $a_n=n$ for $n\in \{1,2,3.4,5,6\}$, and for $n \ge 7$: $$a_n={\lfloor}\frac{a_1+a_2+...+a_{n-1}}{2}{\rfloor}$$ where ${\lfloor}x{\rfloor}$ is the greatest integer less than or equal to $x$. For example : ${\lfloor}2.4{\rfloor} = 2, {\lfloor}3{\rfloor} = 3$ and ${\lfloor}\pi {\rfloor}= 3$. For all integers $n \ge 2$, let $S_n = \{a_1,a_1,...,a_n\}- \{r_n\}$ where $r_n$ is the remainder when $a_1 + a_2 + ... + a_n$ is divided by $3$. The minus $-$ denotes the ''[i]remove it if it is there[/i]'' notation. For example : $S_4 = {2,3,4}$ because $r_4= 1$ so $1$ is removed from $\{1,2,3,4\}$. However $S_5= \{1,2,3,4,5\}$ betawe $r_5 = 0$ and $0$ is not in the set $\{1,2,3,4,5\}$. 1. Determine $S_7,S_8,S_9$ and $S_{10}$. 2. We say that a set $S_n$ for $n\ge 6$ is well-balanced if it can be partitioned into three pairwise disjoint subsets with equal sum. For example : $S_6 = \{1,2,3,4,5,6\} =\{1,6\}\cup \{2,5\}\cup \{3,4\}$ and $1 +6 = 2 + 5 = 3 + 4$. Prove that $S_7,S_8,S_9$ and $S_{10}$ are well-balanced . 3. Is the set $S_{2019}$ well-balanced? Justify your answer.

Function $f : \mathbb{R^+} \rightarrow \mathbb{R^+}$ satisfies the following condition. (Condition) For each positive real number $x$, there exists a positive real number $y$ such that $(x + f(y))(y + f(x)) \leq 4$, and the number of $y$ is finite. Prove $f(x) > f(y)$ for any positive real numbers $x < y$. ($\mathbb{R^+}$ is a set for all positive real numbers.)

$P$ is a monic polynomial of odd degree greater than one such that there exists a function $f : \mathbb{R} \rightarrow \mathbb{N}$ such that for each $x \in \mathbb{R}$ ,\[f(P(x))=P(f(x))\] (a) Prove that there are a finite number of natural numbers in range of $f$. (b) Prove that if $f$ is not constant then the equation $P(x)-x=0$ has at least two real solutions. (c) For each natural $n>1$ prove that there exists a function $f : \mathbb{R} \rightarrow \mathbb{N}$ and a monic polynomial of odd degree greater than one $P$ such that for each $x \in \mathbb{R}$ ,\[f(P(x))=P(f(x))\] and range of $f$ contains exactly $n$ different numbers. Time allowed for this problem was 105 minutes.

Let $S$ denote the set of words $W = w_1w_2\ldots w_n$ of any length $n\ge0$ (including the empty string $\lambda$), with each letter $w_i$ from the set $\{x,y,z\}$. Call two words $U,V$ [i]similar[/i] if we can insert a string $s\in\{xyz,yzx,zxy\}$ of three consecutive letters somewhere in $U$ (possibly at one of the ends) to obtain $V$ or somewhere in $V$ (again, possibly at one of the ends) to obtain $U$, and say a word $W$ is [i]trivial[/i] if for some nonnegative integer $m$, there exists a sequence $W_0,W_1,\ldots,W_m$ such that $W_0=\lambda$ is the empty string, $W_m=W$, and $W_i,W_{i+1}$ are similar for $i=0,1,\ldots,m-1$. Given that for two relatively prime positive integers $p,q$ we have \[\frac{p}{q} = \sum_{n\ge0} f(n)\left(\frac{225}{8192}\right)^n,\]where $f(n)$ denotes the number of trivial words in $S$ of length $3n$ (in particular, $f(0)=1$), find $p+q$. [i]Victor Wang[/i]

Denote the set of positive rational numbers by $\mathbb{Q}_{+}$. Find all functions $f: \mathbb{Q}_{+}\rightarrow \mathbb{Q}_{+}$ that satisfy $$\underbrace{f(f(f(\dots f(f}_{n}(q))\dots )))=f(nq)$$ for all integers $n\ge 1$ and rational numbers $q>0$.