a) Show that there are no functions $f, g: \mathbb R \to \mathbb R$ such that $g(f(x)) = x^3$ and $f(g(x)) = x^2$ for all $x \in \mathbb R$. b) Let $S$ be the set of all real numbers greater than 1. Show that there are functions $f, g : S \to S$ satsfying the condition above.

We say a finite set $S$ of points in the plane is [i]very[/i] if for every point $X$ in $S$, there exists an inversion with center $X$ mapping every point in $S$ other than $X$ to another point in $S$ (possibly the same point). (a) Fix an integer $n$. Prove that if $n \ge 2$, then any line segment $\overline{AB}$ contains a unique very set $S$ of size $n$ such that $A, B \in S$. (b) Find the largest possible size of a very set not contained in any line. (Here, an [i]inversion[/i] with center $O$ and radius $r$ sends every point $P$ other than $O$ to the point $P'$ along ray $OP$ such that $OP\cdot OP' = r^2$.) [i]Proposed by Sammy Luo[/i]

Let $c_1,c_2 \in \mathbb{R^+}$. Find all $f : \mathbb{R^+} \rightarrow \mathbb{R^+}$ such that for all $x,y \in \mathbb{R^+}$ $$f(x+c_1f(y))=f(x)+c_2f(y)$$

Consider polynomial functions $ax^2 -bx +c$ with integer coefficients which have two distinct zeros in the open interval $(0,1).$ Exhibit with proof the least positive integer value of $a$ for which such a polynomial exists.

Let \[T=\{(tq,1-t) \in\mathbb R^{2}| t \in [0,1],q\in\mathbb Q\}\]Prove that each continuous function $f: T\longrightarrow T$ has a fixed point.

The function $f$ is given by the table \[\begin{array}{|c||c|c|c|c|c|}\hline x & 1 & 2 & 3 & 4 & 5 \\ \hline f(x) & 4 & 1 & 3 & 5 & 2 \\ \hline \end{array}\] If $u_0=4$ and $u_{n+1}=f(u_n)$ for $n\geq 0$, find $u_{2002}$. $\textbf{(A) }1\qquad\textbf{(B) }2\qquad\textbf{(C) }3\qquad\textbf{(D) }4\qquad\textbf{(E) }5$

Let $f:\mathbb{R}\rightarrow\mathbb{R}$ be a function that has limits at any point and has no local extrema. Show that: $a)$ $f$ is continuous; $b)$ $f$ is strictly monotone.

Let be a parametric set: $$ \mathcal{F}_{\lambda } =\left\{ f:[1,\infty)\longrightarrow\mathbb{R}\bigg| x\in(1,\infty )\implies \int_{x}^{x^2+\lambda^2 x} f\left( \xi\right) d\xi =1\right\} . $$ [b]a)[/b] Show that $ \mathcal{F}_0 =\emptyset . $ [b]b)[/b] Prove that $ \lambda\neq 0 $ implies $ \mathcal{F}_{\lambda }\neq\emptyset . $

Let $\mathbb N$ denote the set of positive integers, and for a function $f$, let $f^k(n)$ denote the function $f$ applied $k$ times. Call a function $f : \mathbb N \to \mathbb N$ [i]saturated[/i] if \[ f^{f^{f(n)}(n)}(n) = n \] for every positive integer $n$. Find all positive integers $m$ for which the following holds: every saturated function $f$ satisfies $f^{2014}(m) = m$. [i]Proposed by Evan Chen[/i]

A ship travels from point A to point B along a semicircular path, centered at Island X. Then it travels along a straight path from B to C. Which of these graphs best shows the ship's distance from Island X as it moves along its course? [asy]size(150); pair X=origin, A=(-5,0), B=(5,0), C=(0,5); draw(Arc(X, 5, 180, 360)^^B--C); dot(X); label("$X$", X, NE); label("$C$", C, N); label("$B$", B, E); label("$A$", A, W);[/asy] $\textbf{(A)}$ [asy] defaultpen(fontsize(7)); size(80); draw((0,16)--origin--(16,0), linewidth(0.9)); label("distance traveled", (8,0), S); label(rotate(90)*"distance to X", (0,8), W); draw(Arc((4,10), 4, 0, 180)^^(8,10)--(16,12)); [/asy] $\textbf{(B)}$ [asy] defaultpen(fontsize(7)); size(80); draw((0,16)--origin--(16,0), linewidth(0.9)); label("distance traveled", (8,0), S); label(rotate(90)*"distance to X", (0,8), W); draw(Arc((12,10), 4, 180, 360)^^(0,10)--(8,10)); [/asy] $\textbf{(C)}$ [asy] defaultpen(fontsize(7)); size(80); draw((0,16)--origin--(16,0), linewidth(0.9)); label("distance traveled", (8,0), S); label(rotate(90)*"distance to X", (0,8), W); draw((0,8)--(10,10)--(16,8)); [/asy] $\textbf{(D)}$ [asy] defaultpen(fontsize(7)); size(80); draw((0,16)--origin--(16,0), linewidth(0.9)); label("distance traveled", (8,0), S); label(rotate(90)*"distance to X", (0,8), W); draw(Arc((12,10), 4, 0, 180)^^(0,10)--(8,10)); [/asy] $\textbf{(E)}$ [asy] defaultpen(fontsize(7)); size(80); draw((0,16)--origin--(16,0), linewidth(0.9)); label("distance traveled", (8,0), S); label(rotate(90)*"distance to X", (0,8), W); draw((0,6)--(6,6)--(16,10)); [/asy]

A magician has one hundred cards numbered 1 to 100. He puts them into three boxes, a red one, a white one and a blue one, so that each box contains at least one card. A member of the audience draws two cards from two different boxes and announces the sum of numbers on those cards. Given this information, the magician locates the box from which no card has been drawn. How many ways are there to put the cards in the three boxes so that the trick works?

Determine the (real) domain of a function $$y=\sqrt{1-\frac{x}{4}|x|+\sqrt{1-\frac{x}{2}|x|\,}\,}-\sqrt{1-\frac{x}{4}|x|-\sqrt{1-\frac{x}{2}|x|\,}\,}$$ and draw its graph.

Let $T$ be a period of a function $f(x)=|\cos x|\sin x\ (-\infty,\ \infty).$ Find $\lim_{n\to\infty} \int_0^{nT} e^{-x}f(x)\ dx.$

Find all the continuous functions $f : \mathbb{R} \mapsto\mathbb{R}$ such that $\forall x,y \in \mathbb{R}$, $(1+f(x)f(y))f(x+y)=f(x)+f(y)$.

Let $S = \{1, 2, \dots , 2021\}$, and let $\mathcal{F}$ denote the set of functions $f : S \rightarrow S$. For a function $f \in \mathcal{F},$ let \[T_f =\{f^{2021}(s) : s \in S\},\] where $f^{2021}(s)$ denotes $f(f(\cdots(f(s))\cdots))$ with $2021$ copies of $f$. Compute the remainder when \[\sum_{f \in \mathcal{F}} |T_f|\] is divided by the prime $2017$, where the sum is over all functions $f$ in $\mathcal{F}$.