The notation $\phi (n)$ is the number of positive integers smaller than $n$ and coprime with $n$, $\pi (n)$ is the number of primes that do not exceed $n$. Prove that for any natural number $n > 1$, we have $$\phi (n) \ge \frac{\pi (n)}{2}$$

Let $a$ and $b$ be real numbers such that $a \ne 0$. Prove that not all the roots of $ax^4 + bx^3 + x^2 + x + 1 = 0$ can be real.

Determine all pairs of natural numbers $(m, r)$ with $2014 \ge m \ge r \ge 1$ that fulfill $\binom{2014}{m}+\binom{m}{r}=\binom{2014}{r}+\binom{2014-r}{m-r} $

Triangle $ABC$ is such that $AB < AC$. The perpendicular bisector of side $BC$ intersects lines $AB$ and $AC$ at points $P$ and $Q$, respectively. Let $H$ be the orthocentre of triangle $ABC$, and let $M$ and $N$ be the midpoints of segments $BC$ and $PQ$, respectively. Prove that lines $HM$ and $AN$ meet on the circumcircle of $ABC$.

Let $\sigma : \{1, 2, . . . , n\} \to \{1, 2, . . . , n\}$ be a bijective mapping. Let $S_n$ be the set of all such mappings and let $d_k(\sigma) = |\sigma(k) - \sigma(k + 1)|$, for all $k \in \{1, 2, ..., n\}$, where $\sigma (n + 1) = \sigma (1)$. Also let $d(\sigma) = \min \{d_k(\sigma) | 1 \le k \le n\}$. Find $\max_{\sigma \in S_n} d(\sigma)$.

A function $g \colon \mathbb{R} \to \mathbb{R}$ is given such that its range is a finite set. Find all functions $f \colon \mathbb{R} \to \mathbb{R}$ that satisfies $$2f(x+g(y))=f(2g(x)+y)+f(x+3g(y))$$ for all $x, y \in \mathbb{R}$.

If $a$ and $b$ are positive integers such that $3\sqrt{2+\sqrt{2+\sqrt{3}}}=a\cos\frac{\pi}{b}$, find $a+b$.

Let $n \geq 3$ and $a_1,a_2,...,a_n$ be complex numbers different from $0$ with $|a_i| < 1$ for all $i \in \{1,2,...,n-1 \}.$ If the coefficients of $f = \prod_{i=1}^n (X-a_i)$ are integers, prove that $\textbf{a)}$ The numbers $a_1,a_2,...,a_n$ are distinct. $\textbf{b)}$ If $a_j^2 = a_ia_k,$ then $i=j=k.$

An infinite sequence of integers, $a_0,a_1,a_2,\dots,$ with $a_0>0$, has the property that for $n\ge 0$, $a_{n+1}=a_n-b_n$, where $b_n$ is the number having the same sign as $a_n$, but having the digits written in the reverse order. For example if $a_0=1210,a_1=1089$ and $a_2=-8712$, etc. Find the smallest value of $a_0$ so that $a_n\neq 0$ for all $n\ge 1$.

Real numbers $ a_{1}$, $ a_{2}$, $ \ldots$, $ a_{n}$ are given. For each $ i$, $ (1 \leq i \leq n )$, define \[ d_{i} \equal{} \max \{ a_{j}\mid 1 \leq j \leq i \} \minus{} \min \{ a_{j}\mid i \leq j \leq n \} \] and let $ d \equal{} \max \{d_{i}\mid 1 \leq i \leq n \}$. (a) Prove that, for any real numbers $ x_{1}\leq x_{2}\leq \cdots \leq x_{n}$, \[ \max \{ |x_{i} \minus{} a_{i}| \mid 1 \leq i \leq n \}\geq \frac {d}{2}. \quad \quad (*) \] (b) Show that there are real numbers $ x_{1}\leq x_{2}\leq \cdots \leq x_{n}$ such that the equality holds in (*). [i]Author: Michael Albert, New Zealand[/i]

Some manors of Lipshire county are connected by roads. The inhabitants of manors connected by a road are called neighbours. Is it always possible to settle in each manor a knight (who always tells truth) or a liar (who always lies) so that every inhabitant can say ”The number of liars among my neighbours is at least twice the number of knights”?

Let $f : \mathbb{N} \to \mathbb{N}$ be a function such that the following conditions hold: $\qquad\ (1) \; f(1) = 1.$ $\qquad\ (2) \; \dfrac{(x + y)}{2} < f(x + y) \le f(x) + f(y) \; \forall \; x, y \in \mathbb{N}.$ $\qquad\ (3) \; f(4n + 1) < 2f(2n + 1) \; \forall \; n \ge 0.$ $\qquad\ (4) \; f(4n + 3) \le 2f(2n + 1) \; \forall \; n \ge 0.$ Find the sum of all possible values of $f(2023)$.

Let $n$ be a fixed positive integer. Ben is playing a computer game. The computer picks a tree $T$ such that no vertex of $T$ has degree $2$ and such that $T$ has exactly $n$ leaves, labeled $v_1,\ldots, v_n$. The computer then puts an integer weight on each edge of $T$, and shows Ben neither the tree $T$ nor the weights. Ben can ask queries by specifying two integers $1\leq i < j \leq n$, and the computer will return the sum of the weights on the path from $v_i$ to $v_j$. At any point, Ben can guess whether the tree's weights are all zero. He wins the game if he is correct, and loses if he is incorrect. (a) Show that if Ben asks all $\binom n2$ possible queries, then he can guarantee victory. (b) Does Ben have a strategy to guarantee victory in less than $\binom n2$ queries? [i]Brandon Wang[/i]

Suppose $ f(x)$ is defined for all real numbers $ x$; $ f(x)>0$ for all $ x$, and $ f(a)f(b)\equal{}f(a\plus{}b)$ for all $ a$ and $ b$. Which of the following statements is true? $ \text{I. } f(0)\equal{}1$ $ \text{II. } f(\minus{}a)\equal{}1/f(a) \text{ for all } a$ $ \text{III. } f(a) \equal{} \sqrt[3]{f(3a)} \text{ for all } a$ $ \text{IV. } f(b)>f(a) \text{ if } b>a$ $ \textbf{(A)}\ \text{III and IV only} \qquad$ $ \textbf{(B)}\ \text{I, III, and IV only} \qquad$ $ \textbf{(C)}\ \text{I, II, and IV only} \qquad$ $ \textbf{(D)}\ \text{I, II, and III only} \qquad$ $ \textbf{(E)}\ \text{All are true.}$

All of the numbers $1, 2,3,...,1000000$ are initially colored black. On each move it is possible to choose the number $x$ (among the colored numbers) and change the color of $x$ and of all of the numbers that are not co-prime with $x$ (black into white, white into black). Is it possible to color all of the numbers white?

Aidan, Boyan, Calvin, Derek, Ephram, and Fanalex are all chamber musicians at a concert. In each performance, any combination of musicians of them can perform for all the others to watch. What is the minimum number of performances necessary to ensure that each musician watches every other musician play?

There are two round tables with $n{}$ dwarves sitting at each table. Each dwarf has only two friends: his neighbours to the left and to the right. A good wizard wants to seat the dwarves at one round table so that each two neighbours are friends. His magic allows him to make any $2n$ pairs of dwarves into pairs of friends (the dwarves in a pair may be from the same or from different tables). However, he knows that an evil sorcerer will break $n{}$ of those new friendships. For which $n{}$ is the good wizard able to achieve his goal no matter what the evil sorcerer does? [i]Mikhail Svyatlovskiy[/i]

When the World Wide Web first became popular in the $1990$s, download speeds reached a maximum of about $56$ kilobits per second. Approximately how many minutes would the download of a $4.2$-megabyte song have taken at that speed? (Note that there are $8000$ kilobits in a megabyte.) $\textbf{(A)} ~0.6\qquad\textbf{(B)} ~10\qquad\textbf{(C)} ~1800\qquad\textbf{(D)} ~7200\qquad\textbf{(E)} ~36000\qquad$

In a trapezoid $ABCD$ whose parallel sides $AB$ and $CD$ are in ratio $\frac{AB}{CD}=\frac32$, the points $ N$ and $M$ are marked on the sides $BC$ and $AB$ respectively, in such a way that $BN = 3NC$ and $AM = 2MB$ and segments $AN$ and $DM$ are drawn that intersect at point $P$, find the ratio between the areas of triangle $APM$ and trapezoid $ABCD$. [img]https://cdn.artofproblemsolving.com/attachments/7/8/21d59ca995d638dfcb76f9508e439fd93a5468.png[/img]

Let $(m,n)$ be a pair of positive integers. (a) Prove that the set of all positive integers can be partitioned into four pairwise disjoint nonempty subsets such that none of them has two numbers with absolute value of their difference equal to either $m$, $n$, or $m+n$. (b) Find all pairs $(m,n)$ such that the set of all positive integers can not be partitioned into three pairwise disjoint nonempty subsets satisfying the above condition.

Let $ C$ be a nonempty closed bounded subset of the real line and $ f: C\to C$ be a nondecreasing continuous function. Show that there exists a point $ p\in C$ such that $ f(p) \equal{} p$. (A set is closed if its complement is a union of open intervals. A function $ g$ is nondecreasing if $ g(x)\le g(y)$ for all $ x\le y$.)

Let $a_1,a_2,\cdots, a_n$ and $b_1,b_2,\cdots, b_n$ be two permutations of the numbers $1,2,\cdots, n$. Show that \[\sum_{i=1}^n i(n+1-i) \le \sum_{i=1}^n a_ib_i \le \sum_{i=1}^n i^2\]

Determine whether or not the length of symmedian is not greater than the length of the angle bisector drawn from the same vertex?

James has a red jar, a blue jar and a pile of $100$ pebbles. Initially both jars are empty. A move consists of moving a pebble from the pile into one of the jars or returning a pebble from one of the jars to the pile. The numbers of pebbles in the red and blue jars determine the state of the game. The followwing conditions must be satisfied: (a) The red jar may never contain fewer pebbles than the blue jar; (b) The game may never be returned to a previous state. What is the maximum number of moves that James can make?

Let $p = 2^{16}+1$ be an odd prime. Define $H_n = 1+ \frac{1}{2} + \frac{1}{3} + ... + \frac{1}{n}$. Compute the remainder when \[ (p-1)! \sum_{n = 1}^{p-1} H_n \cdot 4^n \cdot \binom{2p-2n}{p-n} \] is divided by $p$. [i]Proposed by Yang Liu[/i]