A quadrilateral $ABCD$ is circumscribed about a circle with center $I$. A point $P \ne I$ is chosen inside $ABCD$ so that the triangles $PAB, PBC, PCD,$ and $PDA$ have equal perimeters. A circle $\Gamma$ centered at $P$ meets the rays $PA, PB, PC$, and $PD$ at $A_1, B_1, C_1$, and $D_1$, respectively. Prove that the lines $PI, A_1C_1$, and $B_1D_1$ are concurrent. Ankan Bhattacharya, USA

Let $O$ be the circumcenter of triangle $ABC$ with circumradius $15$. Let $G$ be the centroid of $ABC$ and let $M$ be the midpoint of $BC$. If $BC=18$ and $\angle MOA=150^\circ$, find the area of $OMG$.

There are $2009$ cities in country, and every two are connected by road. Businessman and Road Ministry play next game. Every morning Businessman buys one road and every evening Minisrty destroys 10 free roads. Can Business create cyclic route without self-intersections through exactly $75$ different cities?

Every cell of a $m \times n$ chess board, $m\ge 2,n\ge 2$, is colored with one of four possible colors, e.g white, green, red, blue. We call such coloring good if the four cells of any $2\times 2$ square of the chessboard are colored with pairwise different colors. Determine the number of all good colorings of the chess board. [i]Proposed by N. Beluhov[/i]

There are $n$ students standing in a circle, one behind the other. The students have heights $h_1<h_2<\dots <h_n$. If a student with height $h_k$ is standing directly behind a student with height $h_{k-2}$ or less, the two students are permitted to switch places. Prove that it is not possible to make more than $\binom{n}{3}$ such switches before reaching a position in which no further switches are possible.

Let $ABCD$ be a convex quadrilateral with $AB=BD=DC$ and $AB \perp BD \perp DC$. Let $M$ be the midpoint of segment $BC$. Show that $\angle BAM+\angle DCA=45^\circ$.

Let $N$ be the number of integral solutions of the equation \[x^2 - y^2 = z^3 - t^3\] satisfying the condition $0 \leq x, y, z, t \leq 10^6$, and let $M$ be the number of integral solutions of the equation \[x^2 - y^2 = z^3 - t^3 + 1\] satisfying the condition $0 \leq x, y, z, t \leq 10^6$. Prove that $N >M.$

Find all polynomials $f, g, h$ with real coefficients, such that $f(x)^2+(x+1)g(x)^2=(x^3+x)h(x)^2$

Define a [i]rooted tree[/i] to be a tree $T$ with a singular node designated as the [i]root[/i] of $T$. (Note that every node in the tree can have an arbitrary number of children.) Each vertex adjacent to the root node of $T$ is itself the root of some tree called a [i]maximal subtree[/i] of $T$. Say two rooted trees $T_1$ and $T_2$ are [i]similar[/i] if there exists some way to cycle the maximal subtrees of $T_1$ to get $T_2$. For example, the first pair of trees below are similar but the second pair are not. How many rooted trees with $2019$ nodes are there up to similarity? [center] [img=500x100]https://i.imgur.com/8axcDvz.png[/img] [/center]

The numbers $1, 2, \ldots 49$ are placed in a $7\times 7$ array, and the sum of the numbers in each row and in each column is computed. Some of these $14$ sums are odd while others are even. Let $A$ denote the sum of all the odd sums and $B$ the sum of all even sums. Is it possible that the numbers were placed in the array in such a way that $A = B$?

We call a coloring of an $8\times 8$ board in three colors good if in any corner of five cells contains cells of all three colors. (A five-square corner is a shape made from a $3 \times 3$ square by cutting square $ 2\times 2$.) Prove that the number of good colorings is not less than than $68$.

Here $G_{n}$ denotes a simple undirected graph with $n$ vertices, $K_{n}$ denotes the complete graph with $n$ vertices, $K_{n,m}$ the complete bipartite graph whose components have $m$ and $n$ vertices, and $C_{n}$ a circuit with $n$ vertices. The number of edges in the graph $G_{n}$ is denoted $e(G_{n})$. If $e(G_{n}) \geq\frac{n\sqrt{n}}{2}+\frac{n}{4}$ ,prove that $G_{n}$ contains $C_{4}$ .

For a positive integer \( n \geq 6 \), find the smallest integer \( S(n) \) such that any graph with \( n \) vertices and at least \( S(n) \) edges must contain at least two disjoint cycles (cycles with no common vertices).

Faith has four different integer length segments. It turned out that any three of them can form a triangle. What is the smallest total length of this set of segments?

We are given one red and $k>1$ blue cells, and a pack of $2n$ cards, enumerated by the numbers from $1$ to $2n$. Initially, the pack is situated on the red cell and arranged in an arbitrary order. In each move, we are allowed to take the top card from one of the cells and place it either onto the top of another cell on which the number on the top card is greater by $1$, or onto an empty cell. Given $k$, what is the maximal $n$ for which it is always possible to move all the cards onto a blue cell?

In rectangle $ ABCD$, points $ F$ and $ G$ lie on $ \overline{AB}$ so that $ AF \equal{} FG \equal{} GB$ and $ E$ is the midpoint of $ \overline{DC}$. Also, $ \overline{AC}$ intersects $ \overline{EF}$ at $ H$ and $ \overline{EG}$ at $ J$. The area of the rectangle $ ABCD$ is $ 70$. Find the area of triangle $ EHJ$. [asy] size(180); pair A, B, C, D, E, F, G, H, J; A = origin; real length = 6; real width = 3.5; B = length*dir(0); C = (length, width); D = width*dir(90); F = length/3*dir(0); G = 2*length/3*dir(0); E = (length/2, width); H = extension(A, C, E, F); J = extension(A, C, E, G); draw(A--B--C--D--cycle); draw(G--E--F); draw(A--C); label("$A$", A, dir(180)); label("$D$", D, dir(180)); label("$B$", B, dir(0)); label("$C$", C, dir(0)); label("$F$", F, dir(270)); label("$E$", E, dir(90)); label("$G$", G, dir(270)); label("$H$", H, dir(140)); label("$J$", J, dir(340)); [/asy] $ \displaystyle \textbf{(A)} \ \frac {5}{2} \qquad \textbf{(B)} \ \frac {35}{12} \qquad \textbf{(C)} \ 3 \qquad \textbf{(D)} \ \frac {7}{2} \qquad \textbf{(E)} \ \frac {35}{8}$

The roots of the polynomial $x^4 - 4ix^3 +3x^2 -14ix - 44$ form the vertices of a parallelogram in the complex plane. What is the area of the parallelogram?

Prove that there are infinitely many positive integers $a, b$ and $c$ such that their greatest common divisor is $1$ (ie: $gcd(a, b, c) = 1$) and satisfy that: $$a^2=b^2+c^2+bc$$

Show that for all real numbers $x$ and $y$ with $x > -1$ and $y > -1$ and $x + y = 1$ the inequality $$\frac{x}{y + 1} +\frac{y}{x + 1} \ge \frac23$$ holds. When does equality apply? [i](Walther Janous)[/i]

What is the volume of a cube whose surface area is twice that of a cube with volume $ 1$? $ \textbf{(A)}\ \sqrt{2} \qquad \textbf{(B)}\ 2 \qquad \textbf{(C)}\ 2\sqrt{2} \qquad \textbf{(D)}\ 4 \qquad \textbf{(E)}\ 8$

In a test, $3n$ students participate, who are located in three rows of $n$ students in each. The students leave the test room one by one. If $N_1(t), N_2(t), N_3(t)$ denote the numbers of students in the first, second, and third row respectively at time $t$, find the probability that for each t during the test, \[|N_i(t) - N_j(t)| < 2, i \neq j, i, j = 1, 2, \dots .\]

A museum wants to protect its most valuable piece by maintaining constant surveillance. To do this, he wants to place guards to watch the place, in shifts of $7$ consecutive hours. Each guard starts his shift at the same time every day. A guard is essential if there is any time during the day when you are alone to watch the item. Indicates all possibilities for the number of guards guarding the piece, so that everyone is indispensable.

Given a fixed integer $k>0,r=k+0.5$,define $f^1(r)=f(r)=r[r],f^l(r)=f(f^{l-1}(r))(l>1)$ where $[x]$ denotes the smallest integer not less than $x$. prove that there exists integer $m$ such that $f^m(r)$ is an integer.

A sequence starts with $2017$ as its first term and each subsequent term is the sum of cubes of the digits in the previous number. What is the $2017$th term of this sequence? [i]2017 CCA Math Bonanza Individual Round #3[/i]

From digits $0$, $1$, $3$, $4$, $7$ and $9$ were written $5$ digit numbers which all digits are different. How many numbers from them are divisible with $5$