Source: 2017 Canadian Open Math Challenge, Problem B4 ----- Numbers $a$, $b$ and $c$ form an arithmetic sequence if $b - a = c - b$. Let $a$, $b$, $c$ be positive integers forming an arithmetic sequence with $a < b < c$. Let $f(x) = ax2 + bx + c$. Two distinct real numbers $r$ and $s$ satisfy $f(r) = s$ and $f(s) = r$. If $rs = 2017$, determine the smallest possible value of $a$.

We say that a prime $p$ is $\textit{philé}$ if there is a polynomial $P$ of non-negative integer coefficients smaller than $p$ and with degree $3$, that is, $P(x) = ax^3 + bx^2 + cx + d$ where $a, b, c, d < p$, such that $$\{P(n) | 1 \leq n \leq p\}$$ is a complete residue system modulo $p$. Find all $\textit{philé}$ primes. Note: A set $A$ is a complete residue system modulo $p$ if for every integer $k$, with $0 \leq k \leq p - 1$, there exists an element $a \in A$ such that $$p | a-k.$$

Which of the following is closest to $\sqrt{65}-\sqrt{63}$? $ \textbf{(A)}\ .12 \qquad\textbf{(B)}\ .13 \qquad\textbf{(C)}\ .14 \qquad\textbf{(D)}\ .15 \qquad\textbf{(E)}\ .16 $

You have an equilateral paper triangle of area $9$ and fold it in two, following a straight line that passes through the center of the triangle and does not contain any vertex of the triangle. Thus there remains a quadrilateral in which the two pieces overlap, and three triangles without overlaps. Determine the smallest possible value of the quadrilateral area of the overlay.

A restaurant offers three desserts, and exactly twice as many appetizers as main courses. A dinner consists of an appetizer, a main course, and a dessert. What is the least number of main courses that the restaurant should offer so that a customer could have a different dinner each night in the year $ 2003$? $ \textbf{(A)}\ 4 \qquad \textbf{(B)}\ 5 \qquad \textbf{(C)}\ 6 \qquad \textbf{(D)}\ 7 \qquad \textbf{(E)}\ 8$

There are 20 blue points on the circle and some red inside so no three are collinear. It turned out that there exists $1123$ triangles with blue vertices having 10 red points inside. Prove that all triangles have 10 red points inside

For each positive integer $n$, let $rad(n)$ denote the product of the distinct prime factors of $n$. Show that there exists integers $a,b > 1$ such that $gcd(a,b)=1$ and $$rad(ab(a+b)) < \frac{a+b}{2024^{2024}}$$. For example, $rad(20)=rad(2^2\cdot 5)=2\cdot 5=10$.

Compute all real solutions $(x,y)$ with $x\geq y$ that satisfy the pair of equations \begin{align*} xy&=5\\ \frac{x^2+y^2}{x+y}&=3. \end{align*}

The following sets of points are considered in the plane: $A=\{$ affixes of complexes $z$ such that arg $(z - (2 + 3i))=\pi /4\}$, $B =\{$ affixes of complexes $z$ such that mod $( z- (2 + i)<2\}$. Determine the orthogonal projection on the $X$ axis of $A \cap B$.

Given an acute triangle $ ABC$. The incircle of triangle $ ABC$ touches $ BC,CA,AB$ respectively at $ D,E,F$. The angle bisector of $ \angle A$ cuts $ DE$ and $ DF$ respectively at $ K$ and $ L$. Suppose $ AA_1$ is one of the altitudes of triangle $ ABC$, and $ M$ be the midpoint of $ BC$. (a) Prove that $ BK$ and $ CL$ are perpendicular with the angle bisector of $ \angle BAC$. (b) Show that $ A_1KML$ is a cyclic quadrilateral.

Let $1<k\leq n$ be positive integers and $x_1 , x_2 , \ldots , x_k$ be positive real numbers such that $x_1 \cdot x_2 \cdot \ldots \cdot x_k = x_1 + x_2 + \ldots +x_k.$ a) Show that $x_{1}^{n-1} +x_{2}^{n-1} + \ldots +x_{k}^{n-1} \geq kn.$ b) Find all numbers $k,n$ and $x_1, x_2 ,\ldots , x_k$ for which equality holds.

We say that a positive integer $n$ is [i]divable [/i] if there exist positive integers $1 < a < b < n$ such that, if the base-$a$ representation of $n$ is $\sum_{i=0}^{k_1} a_ia^i$ , and the base-$b$ representation of $n$ is $\sum_{i=0}^{k_2} b_ib^i$ , then for all positive integers $c > b$, we have that $\sum_{i=0}^{k_2} b_ic^i$ divides $\sum_{i=0}^{k_1} a_ic^i$. Find the number of non-divable $n$ such that $1 \le n \le 100$.

A $3\times 6$ grid is filled with the numbers in the list $\{1,1,2,2,3,3,4,4,5,5,6,6,7,7,8,8,9,9\}$ according to the following rules: (1) Both the first three columns and the last three columns contain the integers 1 through 9. (2) No numbers appear more than once in a given row. Let $N$ be the number of ways to fill the grid and let $k$ be the largest positive integer such that $2^k$ divides $N$. What is k?

Alicia had two containers. The first was $\tfrac{5}{6}$ full of water and the second was empty. She poured all the water from the first container into the second container, at which point the second container was $\tfrac{3}{4}$ full of water. What is the ratio of the volume of the first container to the volume of the second container? $\textbf{(A) } \frac{5}{8} \qquad \textbf{(B) } \frac{4}{5} \qquad \textbf{(C) } \frac{7}{8} \qquad \textbf{(D) } \frac{9}{10} \qquad \textbf{(E) } \frac{11}{12}$

All integers from $1$ to one million are written on a tape in some arbitrary order. Then the tape is cut into pieces containing two consecutive digits each. Prove that these pieces contain all two-digit integers for sure, regardless of the initial order of integers.[i](4 points)[/i] [i]Alexey Tolpygo[/i]

Let $ABC$ be a triangle and $AD,BE,CF$ be cevians concurrent at a point $P$. Suppose each of the quadrilaterals $PDCE,PEAF$ and $PFBD$ has both circumcircle and incircle. Prove that $ABC$ is equilateral and $P$ coincides with the center of the triangle.

There is a row that consists of digits from $ 0$ to $ 9$ and Ukrainian letters (there are $ 33$ of them) with following properties: there aren’t two distinct digits or letters $ a_i$, $ a_j$ such that $ a_i > a_j$ and $ i < j$ (if $ a_i$, $ a_j$ are letters $ a_i > a_j$ means that $ a_i$ has greater then $ a_j$ position in alphabet) and there aren’t two equal consecutive symbols or two equal symbols having exactly one symbol between them. Find the greatest possible number of symbols in such row.

Let $M$ be a point which has coordinates $(p\times 1994,7p\times 1994)$ in the Cartesian plane ($p$ is a prime). Find the number of right-triangles satisfying the following conditions: (1) all vertexes of the triangle are lattice points, moreover $M$ is on the right-angled corner of the triangle; (2) the origin ($0,0$) is the incenter of the triangle.

Find all triples $(a, b, n)$ of positive integers such that $a$ and $b$ are both divisors of $n$, and $a+b = \frac{n}{2}$ .

The vault of a bank has $N$ locks. To open it, they must be operated simultaneously. Five executives have some of the keys, so any trio can open the vault, but no pair can do it. Determine $N$.

On the plane are given $ k\plus{}n$ distinct lines , where $ k>1$ is integer and $ n$ is integer as well.Any three of these lines do not pass through the same point . Among these lines exactly $ k$ are parallel and all the other $ n$ lines intersect each other.All $ k\plus{}n$ lines define on the plane a partition of triangular , polygonic or not bounded regions. Two regions are colled different, if the have not common points or if they have common points only on their boundary.A regions is called ''good'' if it contained in a zone between two parallel lines . If in a such given configuration the minimum number of ''good'' regionrs is $ 176$ and the maximum number of these regions is $ 221$, find $ k$ and $ n$. Babis

Two ants crawl along the perimeter of a polygonal table, so that the distance between them is always $10$ cm. Each side of the table is more than $1$ meter long. At the initial moment both ants are on the same side of the table. (a) [i](2 points)[/i] Suppose that the table is a convex polygon. Is it always true that both ants can visit each point on the perimeter? (b) [i](4 points)[/i] Is it always true (this time without assumption of convexity) that each point on the perimeter can be visited by at least one ant?

Let $ ABCD$ be a convex quadrilateral with $ BA\neq BC$. Denote the incircles of triangles $ ABC$ and $ ADC$ by $ \omega_{1}$ and $ \omega_{2}$ respectively. Suppose that there exists a circle $ \omega$ tangent to ray $ BA$ beyond $ A$ and to the ray $ BC$ beyond $ C$, which is also tangent to the lines $ AD$ and $ CD$. Prove that the common external tangents to $ \omega_{1}$ and $\omega_{2}$ intersect on $ \omega$. [i]Author: Vladimir Shmarov, Russia[/i]

Find all natural numbers $n\geq 3$ satisfying one can cut a convex $n$-gon into different triangles along some of the diagonals (None of these diagonals intersects others at any point other than vertices) and the number of diagonals are used at each vertex is even.

A triangle with vertices $A(0, 2)$, $B(-3, 2)$, and $C(-3, 0)$ is reflected about the $x$-axis, then the image $\triangle A'B'C'$ is rotated counterclockwise about the origin by $90^{\circ}$ to produce $\triangle A''B''C''$. Which of the following transformations will return $\triangle A''B''C''$ to $\triangle ABC$? $\textbf{(A)}$ counterclockwise rotation about the origin by $90^{\circ}$. $\textbf{(B)}$ clockwise rotation about the origin by $90^{\circ}$. $\textbf{(C)}$ reflection about the $x$-axis $\textbf{(D)}$ reflection about the line $y = x$ $\textbf{(E)}$ reflection about the $y$-axis.