Given a prime number $p\ge 3,$ and an integer $d \ge 1$. Prove that there exists an integer $n\ge 1,$ such that $\gcd(n,d) = 1,$ and the product \[P=\prod\limits_{1 \le i < j < p} {({i^{n + j}} - {j^{n + i}})} \text{ is not divisible by } p^n.\]

The sum of the digits of a natural number $n$ is denoted by $S(n)$. Prove that $S(8n) \ge \frac{1}{8} S(n)$ for each $n$.

In whatever follows $f$ denotes a differentiable function from $\mathbb{R}$ to $\mathbb{R}$. $f \circ f$ denotes the composition of $f(x)$. $\textbf{(a)}$ If $f\circ f(x) = f(x) \forall x \in \mathbb{R}$ then for all $x$, $f'(x) =$ or $f'(f(x)) =$. Fill in the blank and justify. $\textbf{(b)}$Assume that the range of $f$ is of the form $ \left(-\infty , +\infty \right), [a, \infty ),(- \infty , b], [a, b] $. Show that if $f \circ f = f$, then the range of $f$ is $\mathbb{R}$. [hide=Hint](Hint: Consider a maximal element in the range of f)[/hide] $\textbf{(c)}$ If $g$ satisfies $g \circ g \circ g = g$, then $g$ is onto. Prove that $g$ is either strictly increasing or strictly decreasing. Furthermore show that if $g$ is strictly increasing, then $g$ is unique.

Find all ordered pairs of integers $(a,b)$ such that there exists a function $f\colon \mathbb{N} \to \mathbb{N}$ satisfying $$f^{f(n)}(n)=an+b$$ For all $n\in \mathbb{N}$.

Compute the smallest positive integer $n$ such that $\int_{0}^{n} \lfloor x\rfloor\,dx$ is at least $2021.$

Let be a continuous function $ f:\mathbb{R}\longrightarrow\mathbb{R} $ having the property that there exists a continuous and bounded function $ g:\mathbb{R}\longrightarrow\mathbb{R} $ that verifies the equality $$ f(x)=\int_0^x f(\xi )g(\xi )d\xi , $$ for any real number $ x. $ Prove that $ f=0. $ [i]Nelu Chichirim[/i]

Let $ S\subseteq\mathbb{R}$ be a set of real numbers. We say that a pair $ (f, g)$ of functions from $ S$ into $ S$ is a [i]Spanish Couple[/i] on $ S$, if they satisfy the following conditions: (i) Both functions are strictly increasing, i.e. $ f(x) < f(y)$ and $ g(x) < g(y)$ for all $ x$, $ y\in S$ with $ x < y$; (ii) The inequality $ f\left(g\left(g\left(x\right)\right)\right) < g\left(f\left(x\right)\right)$ holds for all $ x\in S$. Decide whether there exists a Spanish Couple [list][*] on the set $ S \equal{} \mathbb{N}$ of positive integers; [*] on the set $ S \equal{} \{a \minus{} \frac {1}{b}: a, b\in\mathbb{N}\}$[/list] [i]Proposed by Hans Zantema, Netherlands[/i]

Let $ S$ be the set of points in the Cartesian plane that satisfy \[ \Big|\big|{|x| \minus{} 2}\big| \minus{} 1\Big| \plus{} \Big|\big|{|y| \minus{} 2}\big| \minus{} 1\Big| \equal{} 1. \] If a model of $ S$ were built from wire of negligible thickness, then the total length of wire required would be $ a\sqrt {b},$ where $ a$ and $ b$ are positive integers and $ b$ is not divisible by the square of any prime number. Find $ a \plus{} b.$

In the plane there is a worm of length 1. Prove that it can be always covered by means of half of a circular disk of diameter 1. [i]Note.[/i] Under a "worm", we understand a continuous curve. The "half of a circular disk" is a semicircle including its boundary.

Determine all functions $f: \mathbb N\to \mathbb N$ such that for every positive integer $n$ we have: \[ 2n+2001\leq f(f(n))+f(n)\leq 2n+2002. \]

Let $n$ be a positive integer. Solve the system of equations \begin{align*}x_{1}+2x_{2}+\cdots+nx_{n}&= \frac{n(n+1)}{2}\\ x_{1}+x_{2}^{2}+\cdots+x_{n}^{n}&= n\end{align*} for $n$-tuples $(x_{1},x_{2},\ldots,x_{n})$ of nonnegative real numbers.

In set $S$, there is an operation $'' \circ ''$ such that $\forall a,b \in S$, a unique $a \circ b \in S$ exists. And (i) $\forall a,b,c \in S$, $(a \circ b) \circ c = a \circ (b \circ c)$. (ii) $a \circ b \neq b \circ a$ when $a \neq b$. Prove that: a.) $\forall a,b,c \in S$, $(a \circ b) \circ c = a \circ c$. b.) If $S = \{1,2, \ldots, 1990\}$, try to define an operation $'' \circ ''$ in $S$ with the above properties.

Find all functions $ f: \mathbb{R}\mapsto\mathbb{R}$ such that for all $ x$, $ y$ $ \in\mathbb{R}$, \[ f(f(x))\plus{}f(f(y))\equal{}2y\plus{}f(x\minus{}y)\] holds.

Let be a continuous function $ f:\mathbb{R}\longrightarrow\mathbb{R} $ that has the property that $$ xf(x)\ge \int_0^x f(t)dt , $$ for all real numbers $ x. $ Prove that [b]a)[/b] the mapping $ x\mapsto \frac{1}{x}\int_0^x f(t) dt $ is nondecreasing on the restrictions $ \mathbb{R}_{<0 } $ and $ \mathbb{R}_{>0 } . $ [b]b)[/b] if $ \int_x^{x+1} f(t)dt=\int_{x-1}^x f(t)dt , $ for any real number $ x, $ then $ f $ is constant. [i]Mihai Piticari[/i]

Let $f : \mathbb{Z} \rightarrow \mathbb{Z}^+$ be a function, and define $h : \mathbb{Z} \times \mathbb{Z} \rightarrow \mathbb{Z}^+$ by $h(x, y) = \gcd (f(x), f(y))$. If $h(x, y)$ is a two-variable polynomial in $x$ and $y$, prove that it must be constant.

We roll a regular 6-sided dice $n$ times. What is the probabilty that the total number of eyes rolled is a multiple of 5?

Let $a,b,c$ be positive real numbers such that \[ \cfrac{1}{1+a}+\cfrac{1}{1+b}+\cfrac{1}{1+c}\le 1. \] Prove that $(1+a^2)(1+b^2)(1+c^2)\ge 125$. When does equality hold?

Determine all functions $ f: \mathbb{R}^\plus{} \mapsto \mathbb{R}^\plus{}$ which satisfy \[ f \left(\frac {f(x)}{yf(x) \plus{} 1}\right) \equal{} \frac {x}{xf(y)\plus{}1} \quad \forall x,y > 0\]

Let $A = \{1,2,\ldots,2011\}$. Find the number of functions $f$ from $A$ to $A$ that satisfy $f(n) \le n$ for all $n$ in $A$ and attain exactly $2010$ distinct values.

Determine all functions $ f$ defined on the set of rational numbers that take rational values for which \[ f(2f(x) \plus{} f(y)) \equal{} 2x \plus{} y, \] for each $ x$ and $ y$.

Find all triples $ (x,y,z)$ of real numbers which satisfy the simultaneous equations \[ x \equal{} y^3 \plus{} y \minus{} 8\] \[y \equal{} z^3 \plus{} z \minus{} 8\] \[ z \equal{} x^3 \plus{} x \minus{} 8.\]

Find all functions $ f:\mathbb{Q}\longrightarrow\mathbb{Q} $ with the property that $$ f\left( p(x)\right) =p\left( f(x)\right) ,\quad\forall x\in\mathbb{Q} , $$ for all integer polynomials $ p. $

Does there exist a function $f:\mathbb{N}\rightarrow\mathbb{N}$ such that \[f(f(n-1)=f(n+1)-f(n)\quad\text{for all}\ n\ge 2\text{?} \]

Determine functions $f : \mathbb{R} \rightarrow \mathbb{R},$ with property that \[ f(f(x)) + y \cdot f(x) \le x + x \cdot f(f(y)), \] for every $x$ and $y$ are real numbers.

Let $f(x)$ be a real-valued function defined for $0<x<1.$ If $$ \lim_{x \to 0} f(x) =0 \;\; \text{and} \;\; f(x) - f \left( \frac{x}{2} \right) =o(x),$$ prove that $f(x) =o(x),$ where we use the O-notation.