Let $C_1$ and $C_2$ be two concentric circles in the plane with radii $R$ and $3R$ respectively. Show that the orthocenter of any triangle inscribed in circle $C_1$ lies in the interior of circle $C_2$. Conversely, show that every point in the interior of $C_2$ is the orthocenter of some triangle inscribed in $C_1$.

Find the smallest positive integer solution to $\tan 19x^\circ=\frac{\cos 96^\circ+\sin 96^\circ}{\cos 96^\circ-\sin 96^\circ}.$

Find all functions $ f,g: \mathbb Q \to \mathbb Q$ such that for all rational numbers $ x,y$ we have \[ f(f(x) \plus{} g(y) ) \equal{} g(f(x)) \plus{} y . \]

Let $n$ be a given integer with $n$ greater than $7$ , and let $\mathcal{P}$ be a convex polygon with $n$ sides. Any set of $n-3$ diagonals of $\mathcal{P}$ that do not intersect in the interior of the polygon determine a triangulation of $\mathcal{P}$ into $n-2$ triangles. A triangle in the triangulation of $\mathcal{P}$ is an interior triangle if all of its sides are diagonals of $\mathcal{P}$. Express, in terms of $n$, the number of triangulations of $\mathcal{P}$ with exactly two interior triangles, in closed form.

Determine all functions $ f: \mathbb{N}_0 \rightarrow \mathbb{N}_0$ such that $ f(f(n))\plus{}f(n)\equal{}2n\plus{}6$ for all $ n \in \mathbb{N}_0$.

Let $n$ be a positive integer. What is the largest $k$ for which there exist $n\times n$ matrices $M_1,\dots,M_k$ and $N_1,\dots,N_k$ with real entries such that for all $i$ and $j,$ the matrix product $M_iN_j$ has a zero entry somewhere on its diagonal if and only if $i\ne j?$

If $\min \left \{ \frac{ax^2+b}{\sqrt{x^2+1}} \mid x \in \mathbb{R}\right \} = 3$, then (1) Find the range of $b$; (2) for every given $b$, find $a$.

Find all triples $(f,g,h)$ of injective functions from the set of real numbers to itself satisfying \begin{align*} f(x+f(y)) &= g(x) + h(y) \\ g(x+g(y)) &= h(x) + f(y) \\ h(x+h(y)) &= f(x) + g(y) \end{align*} for all real numbers $x$ and $y$. (We say a function $F$ is [i]injective[/i] if $F(a)\neq F(b)$ for any distinct real numbers $a$ and $b$.) [i]Proposed by Evan Chen[/i]

Let $f : R^+ \to R$ be a strictly increasing function such that $f\left(\frac{x+y}{2}\right) < \frac{f(x)+ f(y)}{2}$ for all $x,y > 0$. Prove that the sequence $a_n = f(n)$ ($n \in N$) does not contain an infinite arithmetic progression.

A function $f$ is defined on the set of all real numbers except $0$ and takes all real values except $1$. It is also known that $\color{white}\ . \ \color{black}\ \quad f(xy)=f(x)f(-y)-f(x)+f(y)$ for any $x,y\not= 0$ and that $\color{white}\ . \ \color{black}\ \quad f(f(x))=\frac{1}{f(\frac{1}{x})}$ for any $x\not\in\{ 0,1\}$. Determine all such functions $f$.

Let \[f(x)=\int_0^1 |t-x|t \, dt\] for all real $x$. Sketch the graph of $f(x)$. What is the minimum value of $f(x)$?

Prove that there does not exist a function $f : \mathbb R^+\to\mathbb R^+$ such that \[f(f(x)+y)=f(x)+3x+yf(y)\] for all positive reals $x,y$.

Solve in $ \mathbb{R} $ the equation $ 4^{x^2-x}=\log_2 x+\sqrt{x-1} +14. $ [i]Marin Tolosi[/i]

Denote by $ S$ the set of all positive integers. Find all functions $ f: S \rightarrow S$ such that \[ f (f^2(m) \plus{} 2f^2(n)) \equal{} m^2 \plus{} 2 n^2\] for all $ m,n \in S$. [i]Bulgaria[/i]

Define a function $w:\mathbb{Z}\times\mathbb{Z}\to\mathbb{Z}$ as follows. For $|a|,|b|\le 2,$ let $w(a,b)$ be as in the table shown; otherwise, let $w(a,b)=0.$ \[\begin{array}{|lr|rrrrr|}\hline &&&&b&&\\ &w(a,b)&-2&-1&0&1&2\\ \hline &-2&-1&-2&2&-2&-1\\ &-1&-2&4&-4&4&-2\\ a&0&2&-4&12&-4&2\\ &1&-2&4&-4&4&-2\\ &2&-1&-2&2&-2&-1\\ \hline\end{array}\] For every finite subset $S$ of $\mathbb{Z}\times\mathbb{Z},$ define \[A(S)=\sum_{(\mathbf{s},\mathbf{s'})\in S\times S} w(\mathbf{s}-\mathbf{s'}).\] Prove that if $S$ is any finite nonempty subset of $\mathbb{Z}\times\mathbb{Z},$ then $A(S)>0.$ (For example, if $S=\{(0,1),(0,2),(2,0),(3,1)\},$ then the terms in $A(S)$ are $12,12,12,12,4,4,0,0,0,0,-1,-1,-2,-2,-4,-4.$)

[b]9.[/b] Let $X_0, X_1, \dots $ be independent, indentically distributed, nondegenerate random variables, and let $0<\alpha <1$ be a real number. Assume that the series $\sum_{k=1}^{\infty} \alpha^{k} X_k$ is convergent with probability one. Prove that the distribution function of the sum is continuous. ([b]P. 23[/b]) [T. F. Móri]

Find the mean value of the function $\ln r$ on the circle $(x - a)^2 + (y-b)^2 = R^2$ (of the function $1/r$ on the sphere).

For a function $f : [0,1] \to [0,1] $ we define $f^1 = f $ and $f^{n+1} (x) = f (f^n(x))$ for $0 \le x \le 1$ and $n \in N$. Given that there is a $n$ such that $|f^n(x) - f^n(y)| < |x - y| $ for all distinct $x, y \in [0,1]$, prove that there is a unique $x_0 \in [0,1]$ such that $f (x_0) = x_0$.

Let $\ell$ be a positive integer, and let $m,n$ be positive integers with $m\geq n$, such that $A_1,A_2,\cdots,A_m,B_1,\cdots,B_m$ are $m+n$ pairwise distinct subsets of the set $\{1,2,\cdots,\ell\}$. It is known that $A_i\Delta B_j$ are pairwise distinct, $1\leq i\leq m, 1\leq j\leq n$, and runs over all nonempty subsets of $\{1,2,\cdots,\ell\}$. Find all possible values of $m,n$.

For each $k$, $\mathcal{C}_k$ is biased so that, when tossed, it has probability $\tfrac{1}{(2k+1)}$ of falling heads. If the $n$ coins are tossed, what is the probability that the number of heads is odd? Express the answer as a rational function $n$.

Find all functions $f: \mathbb{N}_{0}\to \mathbb{N}_{0}$ such that for all $m,n\in \mathbb{N}_{0}$: \[mf(n)+nf(m)=(m+n)f(m^{2}+n^{2}).\]

Let $n$ and $k$ be positive integers. A function $f : \{1, 2, 3, 4, \dots , kn - 1, kn\} \to \{1, \cdots , 5\}$ is [i]good[/i] if $f(j + k) - f(j)$ is multiple of $k$ for every $j = 1, 2. \cdots , kn - k$. [b](a)[/b] Prove that, if $k = 2$, then the number of good functions is a perfect square for every positive integer $n$. [b](b)[/b] Prove that, if $k = 3$, then the number of good functions is a perfect cube for every positive integer $n$.

Let $\mathbb Z$ be the set of integers, and let $f\colon \mathbb Z \to \mathbb Z$ be a function. Prove that there are infinitely many integers $c$ such that the function $g\colon \mathbb Z \to \mathbb Z$ defined by $g(x) = f(x) + cx$ is not bijective. [i]Note: [/i] A function $g\colon \mathbb Z \to \mathbb Z$ is bijective if for every integer $b$, there exists exactly one integer $a$ such that $g(a) = b$.

Find all functions $g:\mathbb{N}\rightarrow\mathbb{N}$ such that \[\left(g(m)+n\right)\left(g(n)+m\right)\] is a perfect square for all $m,n\in\mathbb{N}.$ [i]Proposed by Gabriel Carroll, USA[/i]

Let $ f$ be a function satisfying $ f(xy) \equal{} f(x)/y$ for all positive real numbers $ x$ and $ y$. If $ f(500) \equal{} 3$, what is the value of $ f(600)$? $ \textbf{(A)} \ 1 \qquad \textbf{(B)} \ 2 \qquad \textbf{(C)} \ \displaystyle \frac {5}{2} \qquad \textbf{(D)} \ 3 \qquad \textbf{(E)} \ \displaystyle \frac {18}{5}$