$f$ is a function defined on integers and satisfies $f(x)+f(x+3)=x^2$ for every integer $x$. If $f(19)=94$, then calculate $f(94)$.

Prove that there exist two functions $f,g \colon \mathbb{R} \to \mathbb{R}$, such that $f\circ g$ is strictly decreasing and $g\circ f$ is strictly increasing. [i](Poland) Andrzej Komisarski and Marcin Kuczma[/i]

Let be a finite group $ G $ having an endomorphism $ \eta $ that has exactly one fixed point. [b]a)[/b] Demonstrate that the function $ f:G\longrightarrow G $ defined as $ f(x)=x^{-1}\cdot\eta (x) $ is bijective. [b]b)[/b] Show that $ G $ is commutative if the composition of the function $ f $ from [b]a)[/b] with itself is the identity function.

By a partition $\pi$ of an integer $n\ge 1$, we mean here a representation of $n$ as a sum of one or more positive integers where the summands must be put in nondecreasing order. (E.g., if $n=4$, then the partitions $\pi$ are $1+1+1+1$, $1+1+2$, $1+3, 2+2$, and $4$). For any partition $\pi$, define $A(\pi)$ to be the number of $1$'s which appear in $\pi$, and define $B(\pi)$ to be the number of distinct integers which appear in $\pi$. (E.g., if $n=13$ and $\pi$ is the partition $1+1+2+2+2+5$, then $A(\pi)=2$ and $B(\pi) = 3$). Prove that, for any fixed $n$, the sum of $A(\pi)$ over all partitions of $\pi$ of $n$ is equal to the sum of $B(\pi)$ over all partitions of $\pi$ of $n$.

Find all functions $f:\mathbb{R}\to \mathbb{R}$ such that for all $x, y\in \mathbb{R}$ the following holds: \[f(x)+f(y)=f(xy)+f(f(x)+f(y))\]

The function $f(x)$ has the property that, for some real positive constant $C$, the expression \[\frac{f^{(n)}(x)}{n+x+C}\] is independent of $n$ for all nonnegative integers $n$, provided that $n+x+C\neq 0$. Given that $f'(0)=1$ and $\int_{0}^{1}f(x) \, dx = C+(e-2)$, determine the value of $C$. Note: $f^{(n)}(x)$ is the $n$-th derivative of $f(x)$, and $f^{(0)}(x)$ is defined to be $f(x)$.

Prove that a harmonic function that is not identically zero in the plane cannot vanish on a two-dimensional positive-measure set.

A cat is trying to catch a mouse in the non-negative quadrant \[N=\{(x_1,x_2)\in \mathbb{R}^2: x_1,x_2\geq 0\}.\] At time $t=0$ the cat is at $(1,1)$ and the mouse is at $(0,0)$. The cat moves with speed $\sqrt{2}$ such that the position $c(t)=(c_1(t),c_2(t))$ is continuous, and differentiable except at finitely many points; while the mouse moves with speed $1$ such that its position $m(t)=(m_1(t),m_2(t))$ is also continuous, and differentiable except at finitely many points. Thus $c(0)=(1,1)$ and $m(0)=(0,0)$; $c(t)$ and $m(t)$ are continuous functions of $t$ such that $c(t),m(t)\in N$ for all $t\geq 0$; the derivatives $c'(t)=(c'_1(t),c'_2(t))$ and $m'(t)=(m'_1(t),m'_2(t))$ each exist for all but finitely many $t$ and \[(c'_1(t)^2+(c'_2(t))^2=2 \qquad (m'_1(t)^2+(m'_2(t))^2=1,\] whenever the respective derivative exists. At each time $t$ the cat knows both the mouse's position $m(t)$ and velocity $m'(t)$. Show that, no matter how the mouse moves, the cat can catch it by time $t=1$; that is, show that the cat can move such that $c(\tau)=m(\tau)$ for some $\tau\in[0,1]$.

Let be two nonzero real numbers $ a,b $ such that $ |a|\neq |b| $ and let $ f:\mathbb{R}\longrightarrow\mathbb{R} $ be a function satisfying the functional relation $$ af(x)+bf(-x)=(x^3+x)^5+\sin^5 x . $$ Calculate $ \int_{-2019}^{2019}f(x)dx . $ [i]Constantin Rusu[/i]

Let be three positive integers $ a,b,c $ and a function $ f:\mathbb{N}\longrightarrow\mathbb{N} $ defined as $$ f(n)=\left\{ \begin{matrix} n-a, & n>c\\ f\left( f(n+b) \right) ,& n\le c \end{matrix} \right. . $$ Determine the number of fixed points this function has.

If $T$ and $T_1$ are two triangles with angles $x, y, z$ and $x_1, y_1, z_1$, respectively, prove the inequality \[\frac{\cos x_1}{\sin x}+\frac{\cos y_1}{\sin y}+\frac{\cos z_1}{\sin z} \leq \cot x+\cot y+\cot z.\]

Given a set $ \mathcal{H}$ of points in the plane, $ P$ is called an "intersection point of $ \mathcal{H}$" if distinct points $ A,B,C,D$ exist in $ \mathcal{H}$ such that lines $ AB$ and $ CD$ are distinct and intersect in $ P$. Given a finite set $ \mathcal{A}_{0}$ of points in the plane, a sequence of sets is defined as follows: for any $ j\geq0$, $ \mathcal{A}_{j+1}$ is the union of $ \mathcal{A}_{j}$ and the intersection points of $ \mathcal{A}_{j}$. Prove that, if the union of all the sets in the sequence is finite, then $ \mathcal{A}_{i}=\mathcal{A}_{1}$ for any $ i\geq1$.

Let $ S$ be the set of all real numbers strictly greater than −1. Find all functions $ f: S \to S$ satisfying the two conditions: (a) $ f(x \plus{} f(y) \plus{} xf(y)) \equal{} y \plus{} f(x) \plus{} yf(x)$ for all $ x, y$ in $ S$; (b) $ \frac {f(x)}{x}$ is strictly increasing on each of the two intervals $ \minus{} 1 < x < 0$ and $ 0 < x$.

Let $S$ be the Sierpiński triangle. What can we say about the Hausdorff dimension of the elevation sets $f^{-1}(y)$ for typical continuous real functions defined on $S$? (A property is satisfied for typical continuous real functions on $S$ if the set of functions not having this property is of the first Baire category in the metric space of continuous $S\rightarrow\mathbb{R}$ functions with the supremum norm.) (translated by Miklós Maróti)

Let's call a function $f : R \to R$ [i]cool[/i] if there are real numbers $a$ and $b$ such that $f(x + a)$ is an even function and $f(x + b)$ is an odd function. (a) Prove that every cool function is periodic. (b) Give an example of a periodic function that is not cool.

Let $u(t)$ be a continuous function in the system of differential equations $$\frac{dx}{dt} =-2y +u(t),\;\;\; \frac{dy}{dt}=-2x+ u(t).$$ Show that, regardless of the choice of $u(t)$, the solution of the system which satisfies $x=x_0 , y=y_0$ at $t=0$ will never pass through $(0, 0)$ unless $x_0 =y_0.$ When $x_0 =y_0 $, show that, for any positive value $t_0$ of $t$, it is possible to choose $u(t)$ so the solution is equal to $(0,0)$ when $t=t_0 .$

Let be a twice-differentiable function $ f:\mathbb{R}\longrightarrow\mathbb{R} $ that has the properties that: $ \text{(i) supp} f''=f\left(\mathbb{R}\right) $ $ \text{(ii)}\exists g:\mathbb{R}\longrightarrow\mathbb{R}\quad\forall x\in\mathbb{R}\quad f(x+1)=f(x)+f'\left( g(x)\right)\text{ and } f'(x+1)=f'(x)+f''\left( g(x)\right) $ Prove that: [b]a)[/b] any such $ g $ is injective. [b]b)[/b] $ f $ is of class $ C^{\infty } , $ and for any natural number $ n, $ any real number $ x $ and any such $ g, $ $$f^{(n)}(x+1)=f^{(n)}(x)+f^{(n+1)}\left( g(x)\right) . $$ [i]Laurențiu Panaitopol[/i]

Let $ A = \{ 1, 2, 3, \cdots , 12 \} $. Find the number of one-to-one function $ f :A \to A $ satisfying following condition: for all $ i \in A $, $ f(i)-i $ is not a multiple of $ 3 $.

Let $ p$ be a positive integer. Define the function $ f: \mathbb{N}\to\mathbb{N}$ by $ f(n)\equal{}a_1^p\plus{}a_2^p\plus{}\cdots\plus{}a_m^p$, where $ a_1, a_2,\ldots, a_m$ are the decimal digits of $ n$ ($ n\equal{}\overline{a_1a_2\ldots a_m}$). Prove that every sequence $ (b_k)^\infty_{k\equal{}0}$ of positive integer that satisfy $ b_{k\plus{}1}\equal{}f(b_k)$ for all $ k\in\mathbb{N}$, has a finite number of distinct terms. $ \mathbb{N}\equal{}\{1,2,3\ldots\}$

For every natural $n$ let $\phi (n)$ be the number of coprime numbers $k \in \{1,2,...,n\}$. (Example: $\phi (12) = 4$, because among the numbers $1, 2, ..., 12$ there are only the$ 4$ numbers, $1, 5, 7$ and $11$ coprime to$12.$) If $k$ is a natural number, then one defines $\phi^k (n)=\underbrace{\strut \phi (\phi ...(\phi (n)) ...)}_{(k \, times \phi)}$ (Example: $\phi^3 (n)=\phi (\phi (\phi (n))) $) For every whole $n> 2$ let $c(n)$ be the smallest natural number $k$ with $\phi^k (n)= 2$. Prove that $c (ab) = c (a) + c (b)$ for odd integers $a$ and $b$, both of which are greater than $2$, .

The ratio of the length to the width of a rectangle is $4:3$. If the rectangle has diagonal of length $d$, then the area may be expressed as $kd^2$ for some constant $k$. What is $k$? $\textbf{(A) }\dfrac27\qquad\textbf{(B) }\dfrac37\qquad\textbf{(C) }\dfrac{12}{25}\qquad\textbf{(D) }\dfrac{16}{25}\qquad\textbf{(E) }\dfrac34$

Let $ \mathbb{N}$ denote the set of all positive integers. Prove that there exists a unique function $ f: \mathbb{N} \mapsto \mathbb{N}$ satisfying \[ f(m \plus{} f(n)) \equal{} n \plus{} f(m \plus{} 95) \] for all $ m$ and $ n$ in $ \mathbb{N}.$ What is the value of $ \sum^{19}_{k \equal{} 1} f(k)?$

Let $ n$ be a positive integer, $ X \equal{} \{1, 2, \ldots , n\},$ and $ k$ a positive integer such that $ \frac{n}{2} \leq k \leq n.$ Determine, with proof, the number of all functions $ f : X \mapsto X$ that satisfy the following conditions: [b](i)[/b] $ f^2 \equal{} f;$ [b](ii)[/b] the number of elements in the image of $ f$ is $ k;$ [b](iii)[/b] for each $ y$ in the image of $ f,$ the number of all points $ x \in X$ such that $ f(x)\equal{}y$ is at most $ 2.$

For any positive integer $n$, define $f(n)$ to be the smallest positive integer that does not divide $n$. For example, $f(1)=2$, $f(6)=4$. Prove that for any positive integer $n$, either $f(f(n))$ or $f(f(f(n)))$ must be equal to $2$.

Show that there is no infinite sequence an of natural numbers such that \[a_{a_n}=a_{n+1}a_{n-1}-a_{n}^2\] for all $n\geq 2$