For two given positive integers $ m,n > 1$, let $ a_{ij} (i = 1,2,\cdots,n, \; j = 1,2,\cdots,m)$ be nonnegative real numbers, not all zero, find the maximum and the minimum values of $ f$, where \[ f = \frac {n\sum_{i = 1}^{n}(\sum_{j = 1}^{m}a_{ij})^2 + m\sum_{j = 1}^{m}(\sum_{i= 1}^{n}a_{ij})^2}{(\sum_{i = 1}^{n}\sum_{j = 1}^{m}a_{ij})^2 + mn\sum_{i = 1}^{n}\sum_{j=1}^{m}a_{ij}^2}. \]

A bug starts at a vertex of an equilateral triangle. On each move, it randomly selects one of the two vertices where it is not currently located, and crawls along a side of the triangle to that vertex. Given that the probability that the bug moves to its starting vertex on its tenth move is $m/n,$ where $m$ and $n$ are relatively prime positive integers, find $m+n.$

Determine all functions $f : \mathbb{R} \to \mathbb{R}$ satisfying \[ f(a^2) - f(b^2) \leq (f(a)+b)(a-f(b)) \] for all $a,b \in \mathbb{R}$.

Let $ G$ be a finite group. For arbitrary sets $ U, V, W \subset G$, denote by $ N_{UVW}$ the number of triples $ (x, y, z) \in U \times V \times W$ for which $ xyz$ is the unity . Suppose that $ G$ is partitioned into three sets $ A, B$ and $ C$ (i.e. sets $ A, B, C$ are pairwise disjoint and $ G = A \cup B \cup C$). Prove that $ N_{ABC}= N_{CBA}.$

Determine all functions $f: \mathbb{Z}\to\mathbb{Z}$ satisfying the following property: For each pair of integers $m$ and $n$ (not necessarily distinct), $\mathrm{gcd}(m, n)$ divides $f(m) + f(n)$. Note: If $n\in\mathbb{Z}$, $\mathrm{gcd}(m, n)=\mathrm{gcd}(|m|, |n|)$ and $\mathrm{gcd}(n, 0)=n$.

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}$

Prove that for any real numbers $ a,b,c, $ the function $ f:\mathbb{R}\longrightarrow\mathbb{R} $ defined as $$ f(x)=\sqrt{(x-c)^2+b^2} +\sqrt{(x+c)^2+b^2} $$ is decreasing on $ (-\infty ,0] $ and increasing on $ [0,\infty ) . $

Thirty people sit at a round table. Each of them is either smart or dumb. Each of them is asked: "Is your neighbor to the right smart or dumb?" A smart person always answers correctly, while a dumb person can answer both correctly and incorrectly. It is known that the number of dumb people does not exceed $F$. What is the largest possible value of $F$ such that knowing what the answers of the people are, you can point at at least one person, knowing he is smart?

The polynomial $f(z)=az^{2018}+bz^{2017}+cz^{2016}$ has real coefficients not exceeding $2019$, and $f(\tfrac{1+\sqrt{3}i}{2})=2015+2019\sqrt{3}i$. Find the remainder when $f(1)$ is divided by $1000$.

At a competition with $N$ players, the number of players given elite status is equal to \[2^{1+\lfloor\log_2{(N-1)}\rfloor} - N. \] Suppose that $19$ players are given elite status. What is the sum of the two smallest possible values of $N$? $ \textbf{(A)}\ 38\qquad \textbf{(B)}\ 90 \qquad \textbf{(C)}\ 154 \qquad \textbf{(D)}\ 406 \qquad \textbf{(E)}\ 1024$

Find the positive integer $ n$ such that \[\arctan\frac{1}{3}\plus{}\arctan\frac{1}{4}\plus{}\arctan\frac{1}{5}\plus{}\arctan\frac{1}{n}\equal{}\frac{\pi}{4}.\]

Let $ n$ be an even positive integer. Prove that there exists a positive inter $ k$ such that \[ k \equal{} f(x) \cdot (x\plus{}1)^n \plus{} g(x) \cdot (x^n \plus{} 1)\] for some polynomials $ f(x), g(x)$ having integer coefficients. If $ k_0$ denotes the least such $ k,$ determine $ k_0$ as a function of $ n,$ i.e. show that $ k_0 \equal{} 2^q$ where $ q$ is the odd integer determined by $ n \equal{} q \cdot 2^r, r \in \mathbb{N}.$ Note: This is variant A6' of the three variants given for this problem.

Let $ \mathbb{R}$ be the set of real numbers. Does there exist a function $ f: \mathbb{R} \mapsto \mathbb{R}$ which simultaneously satisfies the following three conditions? [b](a)[/b] There is a positive number $ M$ such that $ \forall x:$ $ \minus{} M \leq f(x) \leq M.$ [b](b)[/b] The value of $f(1)$ is $1$. [b](c)[/b] If $ x \neq 0,$ then \[ f \left(x \plus{} \frac {1}{x^2} \right) \equal{} f(x) \plus{} \left[ f \left(\frac {1}{x} \right) \right]^2 \]

Find all functions $f: \mathbb{Q}^+ \to \mathbb{R}^+ $ with the property: \[f(xy)=f(x+y)(f(x)+f(y)) \,,\, \forall x,y \in \mathbb{Q}^+\] [i]Proposed by Nikolay Nikolov[/i]

Find all functions $ f: \mathbb{N} \to \mathbb{N} $ such that $$ f\left(x+yf\left(x\right)\right) = x+f\left(y\right)f\left(x\right) $$ holds for all $ x,y \in \mathbb{N} $

Find the index of the singular point $0$ of the vector field \[(xy+yz+xz)\]

Find the sum of all real numbers $x$ such that $5x^4-10x^3+10x^2-5x-11=0$.

How many ways are there to divide a $2\times n$ rectangle into rectangles having integral sides, where $n$ is a positive integer?

A bus that moves along a 100 km route is equipped with a computer, which predicts how much more time is needed to arrive at its final destination. This prediction is made on the assumption that the average speed of the bus in the remaining part of the route is the same as that in the part already covered. Forty minutes after the departure of the bus, the computer predicts that the remaining travelling time will be 1 hour. And this predicted time remains the same for the next 5 hours. Could this possibly occur? If so, how many kilometers did the bus cover when these 5 hours passed? (Average speed is the number of kilometers covered divided by the time it took to cover them.)

Prove that any function that maps the integers to themselves is a sum of any finite number of injective functions that map the integers to themselves. [i]Sorin Rădulescu[/i] and [i]Ion Savu[/i]

In the accompanying figure , $y=f(x)$ is the graph of a one-to-one continuous function $f$ . At each point $P$ on the graph of $y=2x^2$ , assume that the areas $OAP$ and $OBP$ are equal . Here $PA,PB$ are the horizontal and vertical segments . Determine the function $f$. [asy] Label f; xaxis(0,60,blue); yaxis(0,60,blue); real f(real x) { return (x^2)/60; } draw(graph(f,0,53),red); label("$y=x^2$",(30,15),E); real f(real x) { return (x^2)/25; } draw(graph(f,0,38),red); label("$y=2x^2$",(37,37^2/25),E); real f(real x) { return (x^2)/10; } draw(graph(f,0,25),red); label("$y=f(x)$",(24,576/10),W); label("$O(0,0)$",(0,0),S); dot((20,400/25)); dot((20,400/60)); label("$P$",(20,400/25),E); label("$B$",(20,400/60),SE); dot(((4000/25)^(0.5),400/25)); label("$A$",((4000/25)^(0.5),400/25),W); draw((20,400/25)..((4000/25)^(0.5),400/25)); draw((20,400/25)..(20,400/60)); [/asy]

Let $a,b,c,$ and $d$ be real numbers such that at least one of $c$ and $d$ is non-zero. Let $ f:\mathbb{R}\to\mathbb{R}$ be a function defined as $f(x)=\frac{ax+b}{cx+d}$. Suppose that for all $x\in\mathbb{R}$, we have $f(x) \neq x$. Prove that if there exists some real number $a$ for which $f^{1387}(a)=a$, then for all $x$ in the domain of $f^{1387}$, we have $f^{1387}(x)=x$. Notice that in this problem, \[f^{1387}(x)=\underbrace{f(f(\cdots(f(x)))\cdots)}_{\text{1387 times}}.\] [i]Hint[/i]. Prove that for every function $g(x)=\frac{sx+t}{ux+v}$, if the equation $g(x)=x$ has more than $2$ roots, then $g(x)=x$ for all $x\in\mathbb{R}-\left\{\frac{-v}{u}\right\}$.

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))\]

Suppose that the real numbers $a_i\in [-2,17],\ i=1,2,\ldots,59,$ satisfy $a_1+a_2+\ldots+a_{59}=0.$ Prove that \[a_1^2+a_2^2+\ldots+a_{59}^2\le 2006\]

Given function $f(x) = \sin x + \sin \pi x$ and positive number $d$. Prove that there exists real number $p$ such that $|f(x + p) - f(x)| < d$ holds for all real numbers $x$, and the value of $p$ can be arbitrarily large.