Let $p_1$ and $p_2$ be positive real numbers. Prove that there exist functions $f_i\colon \mathbb R \rightarrow \mathbb R$ such that the smallest positive period of $f_i$ is $p_i\, (i=1, 2)$, and $f_1-f_2$ is also periodic. [J. Riman]

In the tetrahedron $DABC$ : $\angle ACB = \angle ADB$, $(CD) \perp (ABC)$. In triangle $ABC$, the altitude $h$ drawn to the side $AB$ and the distance $d$ from the center of the circumscribed circle to this side are given. Find the length of the $CD$.

We choose a point on each side of a parallelogram $ABCD$, let these four points be $P, Q, R$ and $S$. Then we divide the parallelogram into several regions using line segments as shown in the figure. The areas of the grey regions are given, except for one (see the figure). Find the area of the region marked with a question mark. [img]https://cdn.artofproblemsolving.com/attachments/4/7/dbd009042dabdb2eafc8fc74960e9011038dae.png[/img]

Using each of the digits $1,2,3,\ldots ,8,9$ exactly once,we form nine,not necassarily distinct,nine-digit numbers.Their sum ends in $n$ zeroes,where $n$ is a non-negative integer.Determine the maximum possible value of $n$.

For a finite set $A$ of positive integers, a partition of $A$ into two disjoint nonempty subsets $A_1$ and $A_2$ is $\textit{good}$ if the least common multiple of the elements in $A_1$ is equal to the greatest common divisor of the elements in $A_2$. Determine the minimum value of $n$ such that there exists a set of $n$ positive integers with exactly $2015$ good partitions.

Let $ABC$ be a triangle with $AB = AC \neq BC$ and let $I$ be its incentre. The line $BI$ meets $AC$ at $D$, and the line through $D$ perpendicular to $AC$ meets $AI$ at $E$. Prove that the reflection of $I$ in $AC$ lies on the circumcircle of triangle $BDE$.

Two players in turns color the sides of an $n$-gon. The first player colors any side that has $0$ or $2$ common vertices with already colored sides. The second player colors any side that has exactly $1$ common vertex with already colored sides. The player who cannot move, loses. For which $n$ the second player has a winning strategy?

Let \[S = 1 + \frac 18 + \frac{1\cdot 5}{8\cdot 16} + \frac{1\cdot 5\cdot 9}{8\cdot 16\cdot 24} + \cdots + \frac{1\cdot 5\cdot 9\cdots (4k+1)}{8\cdot 16\cdot 24\cdots(8k+8)} + \cdots.\] Find the positive integer $n$ such that $2^n < S^{2007} < 2^{n+1}$.

John defines the function $f(x) = (x-3)(x-9) + 8$. What is the value of $f(3)$? $\textbf{(A) }0\qquad\textbf{(B) }3\qquad\textbf{(C) }8\qquad\textbf{(D) }9\qquad\textbf{(E) }12$

Let $a,b,c,d \in \mathbb{R}^+$ and suppose that all roots of the equation \begin{align*} x^5-ax^4+bx^3-cx^2+dx=1 \end{align*} are real. Prove \begin{align*} \frac{1}{a} + \frac{1}{b} + \frac{1}{c} + \frac{1}{d} \le \frac{3}{5} \end{align*}

A sequence of real numbers is called a [i]Fibonacci [/i] sequence if $$t_{n+2} = t_{n+1} + t_n$$ for $n= 1,2,3,. .$ . Two Fibonacci sequences are said to be [i]essentially different[/i] if the terms of one sequence cannot be obtained by multiplying the terms of the other by a constant. For example, the Fibonacci sequences $1,2,3,5,8,...$ and $1,3,4,7,11,...$ are essentially different, but the sequences $1,2,3,5,8,...$ and $2,4,6,10,16,...$ are not. (a) Prove that there exist real numbers $p$ and $q$ such that the sequences $1,p,p^2,p^3,...$ and $1,q,q^2,q^3,...$ are essentially different Fibonacci sequences. (b) Let $a_1,a_2,a_3,...$ and $b_1,b_2,b_3,...$ be essentially different Fibonacci sequences. Prove that for every Fibonacci sequence $t_1,t_2,t_3,...$, there exists exactly one number $\alpha$ and exactly one number $\beta$, such that: $$t_n = \alpha a_n + \beta b_n$$ for $n = 1,2,3,...$ (c) $t_1,t_2,t_3,...$, is the Fibonacci sequence with $t_1 = 1$ and $t_2= 2$. Express $t_n$ in terms of $n$.

There are $100$ people standing in a line from left to right. Half of them are randomly chosen to face right (with all ${100 \choose 50}$ possible choices being equally likely), and the others face left. Then, while there is a pair of people who are facing each other and have no one between them, the leftmost such pair leaves the line. Compute the expected number of people remaining once this process terminates.

Let $a$ and $b$ be positive real numbers that satisfy \begin{align*} \sqrt{a-ab}+\sqrt{b-ab}=\frac{\sqrt{6}+\sqrt{2}}{4} \,\,\, \text{and}\,\,\, \sqrt{a-a^2}+\sqrt{b-b^2}=\left(\frac{\sqrt{6}+\sqrt{2}}{4}\right)^2. \end{align*} Find the ordered pair $(a, b)$ such that $a>b$ and $a+b$ is maximal.

Under what conditions is $\sqrt{a^2+b^2}=a+b$ true, where $a$ and $b$ are real numbers? $\textbf{(A) }$ It is never true. $\textbf{(B) }$ It is true if and only if $ab=0$. $\textbf{(C) }$ It is true if and only if $a+b\ge 0$. $\textbf{(D) }$ It is true if and only if $ab=0$ and $a+b\ge 0$. $\textbf{(E) }$ It is always true.

A kingdom consists of $12$ cities located on a one-way circular road. A magician comes on the $13$th of every month to cast spells. He starts at the city which was the 5th down the road from the one that he started at during the last month (for example, if the cities are numbered $1–12$ clockwise, and the direction of travel is clockwise, and he started at city #$9$ last month, he will start at city #$2$ this month). At each city that he visits, the magician casts a spell if the city is not already under the spell, and then moves on to the next city. If he arrives at a city which is already under the spell, then he removes the spell from this city, and leaves the kingdom until the next month. Last Thanksgiving the capital city was free of the spell. Prove that it will be free of the spell this Thanksgiving as well.

Let $M$ be the midpoint of side $BC$ of triangle $ABC$ ($AB>AC$), and let $AL$ be the bisector of the angle $A$. The line passing through $M$ perpendicular to $AL$ intersects the side $AB$ at the point $D$. Prove that $AD+MC$ is equal to half the perimeter of triangle $ABC$.

Let $P$ and $Q$ be on segment $BC$ of an acute triangle $ABC$ such that $\angle PAB=\angle BCA$ and $\angle CAQ=\angle ABC$. Let $M$ and $N$ be the points on $AP$ and $AQ$, respectively, such that $P$ is the midpoint of $AM$ and $Q$ is the midpoint of $AN$. Prove that the intersection of $BM$ and $CN$ is on the circumference of triangle $ABC$. [i]Proposed by Giorgi Arabidze, Georgia.[/i]

In a qualification group with $15$ volleyball teams, each team plays with all the other teams exactly once. Since there is no tie in volleyball, there is a winner in every match. After all matches played, a team would be qualified if its total number of losses is not exceeding $N$. If there are at least $7$ teams qualified, find the possible least value of $N$.

A student wrote down the following sequence of numbers : the first number is 1, the second number is 2, and after that, each number is obtained by adding together all the previous numbers. Determine the 12th number in the sequence.

Is the number \[\sqrt[3]{\sqrt 5 + 2} + \sqrt[3]{\sqrt 5 - 2}\] rational or irrational?

A three-digit $\overline{abc}$ number is called [i]Ecuadorian [/i] if it meets the following conditions: $\bullet$ $\overline{abc}$ does not end in $0$. $\bullet$ $\overline{abc}$ is a multiple of $36$. $\bullet$ $\overline{abc} - \overline{cba}$ is positive and a multiple of $36$. Determine all the Ecuadorian numbers.

Let $Z=\{ z_1,\ldots, z_{n-1}\}$, $n\ge 2$, be a set of different complex numbers such that $Z$ contains the conjugate of any its element. a) Show that there exists a constant $C$, depending on $Z$, such that for any $\varepsilon\in (0,1)$ there exists an algebraic integer $x_0$ of degree $n$, whose algebraic conjugates $x_1, x_2, \ldots, x_{n-1}$ satisfy $|x_1-z_1|\le \varepsilon, \ldots, |x_{n-1}-z_{n-1}|\le \varepsilon$ and $|x_0|\le \frac{C}{\varepsilon}$. b) Show that there exists a set $Z=\{ z_1, \ldots, z_{n-1}\}$ and a positive number $c_n$ such that for any algebraic integer $x_0$ of degree $n$, whose algebraic conjugates satisfy $|x_1-z_1|\le \varepsilon,\ldots, |x_{n-1}-z_{n-1}|\le \varepsilon$, it also holds that $|x_0|>\frac{c_n}{\varepsilon}$. (translated by L. Erdős)

The point $M$ is the center of a regular pentagon $ABCDE$. The point $P$ is an inner point of the line segment $[DM]$. The circumscribed circle of triangle $\vartriangle ABP$ intersects the side $[AE]$ at point $Q$ (different from $A$). The perpendicular from $P$ on $CD$ intersects the side $[AE] $ at point $S$. Prove that $PS$ is the bisector of $\angle APQ$.

Let $P$ be a regular $99$-gon. Assign integers between $1$ and $99$ to the vertices of $P$ such that each integer appears exactly once. (If two assignments coincide under rotation, treat them as the same. ) An [i]operation[/i] is a swap of the integers assigned to a pair of adjacent vertices of $P$. Find the smallest integer $n$ such that one can achieve every other assignment from a given one with no more than $n$ operations. [i]Proposed by Zhenhua Qu[/i]

Given is a set of $2n$ cards numbered $1,2, \cdots, n$, each number appears twice. The cards are put on a table with the face down. A set of cards is called good if no card appears twice. Baron Munchausen claims that he can specify $80$ sets of $n$ cards, of which at least one is sure to be good. What is the maximal $n$ for which the Baron's words could be true?