Compute $1^4+2^4+3^4+4^4+5^4+6^4$. [i]2019 CCA Math Bonanza Tiebreaker Round #1[/i]

What is the maximum number of possible change of directions in a path traveling on the edges of a rectangular array of $2004 \times 2004$, if the path does not cross the same place twice?.

Given a prime $p$, let $d(a,b)$ be the number of integers $c$ such that $1 \leq c < p$, and the remainders when $ac$ and $bc$ are divided by $p$ are both at most $\frac{p}{3}$. Determine the maximum value of \[\sqrt{\sum_{a=1}^{p-1}\sum_{b=1}^{p-1}d(a,b)(x_a + 1)(x_b + 1)} - \sqrt{\sum_{a=1}^{p-1}\sum_{b=1}^{p-1}d(a,b)x_ax_b}\] over all $(p-1)$-tuples $(x_1,x_2,\ldots,x_{p-1})$ of real numbers. [i]Brian Hamrick.[/i]

A magician intends to perform the following trick. She announces a positive integer $n$, along with $2n$ real numbers $x_1 < \dots < x_{2n}$, to the audience. A member of the audience then secretly chooses a polynomial $P(x)$ of degree $n$ with real coefficients, computes the $2n$ values $P(x_1), \dots , P(x_{2n})$, and writes down these $2n$ values on the blackboard in non-decreasing order. After that the magician announces the secret polynomial to the audience. Can the magician find a strategy to perform such a trick?

There are $n \geq 1$ notebooks, numbered from $1$ to $n$, stacked in a pile. Zahar repeats the following operation: he randomly chooses a notebook whose number $k$ does not correspond to its location in this stack, counting from top to bottom, and returns it to the $k$th position, counting from the top, without changing the location of the other notebooks. If there is no such notebook, he stops. Is it guaranteed that Zahar will arrange all the notebooks in ascending order of numbers in a finite number of operations? [i]Proposed by Zahar Naumets[/i]

Circle $\omega$ is inscribed in quadrilateral $ABCD$ such that $AB$ and $CD$ are not parallel and intersect at point $O.$ Circle $\omega_1$ touches the side $BC$ at $K$ and touches line $AB$ and $CD$ at points which are located outside quadrilateral $ABCD;$ circle $\omega_2$ touches side $AD$ at $L$ and touches line $AB$ and $CD$ at points which are located outside quadrilateral $ABCD.$ If $O,K,$ and $L$ are collinear$,$ then show that the midpoint of side $BC,AD,$ and the center of circle $\omega$ are also collinear.

Let $p>3$ a prime number. Prove that there exist $x,y \in \mathbb Z$ such that $p = 2x^2 + 3y^2$ if and only if $p \equiv 5, 11 \; (\mod 24)$ (20 points)

Suppose a function $f(x)$ is continuous on $[-1,\ 1]$ and satisfies the condition : 1) $f(-1)\geq f(1).$ 2) $x+f(x)$ is non decreasing function. 3) $\int_{-1}^ 1 f(x)\ dx=0.$ Show that $\int_{-1}^1 f(x)^2dx\leq \frac 23.$

Determine the largest integer $n\geq 3$ for which the edges of the complete graph on $n$ vertices can be assigned pairwise distinct non-negative integers such that the edges of every triangle have numbers which form an arithmetic progression.

For any given positive numbers $a_1,a_2,\ldots,a_n$, prove that there exist positive numbers $x_1,x_2,\ldots,x_n$ satisfying $\sum_{i=1}^n x_i=1$, such that for any positive numbers $y_1,y_2,\ldots,y_n$ with $\sum_{i=1}^n y_i=1$, the inequality $\sum_{i=1}^n \frac{a_ix_i}{x_i+y_i}\ge \frac{1}{2}\sum_{i=1}^n a_i$ holds.

A non-convex polygon has the property that every three consecutive its vertices from a right-angled triangle. Is it true that this polygon has always an angle equal to $90^{\circ} $ or to $270^{\circ} $?

An equilateral triangle has been drawn inside the circle. Split the triangle to two parts with equal area by a line segment parallel to the triangle side. Draw an inscribed circle inside this smaller triangle. What is the ratio of the area of this circle compared to the area of original circle.

Let $\, a,b \,$ be odd positive integers. Define the sequence $\, (f_n ) \,$ by putting $\, f_1 = a,$ $f_2 = b, \,$ and by letting $\, f_n \,$ for $\, n \geq 3 \,$ be the greatest odd divisor of $\, f_{n-1} + f_{n-2}$. Show that $\, f_n \,$ is constant for $\, n \,$ sufficiently large and determine the eventual value as a function of $\, a \,$ and $\, b$.

Let $n \geq 3$ be a positive integer. In an election debate, we have $n$ seats arranged in a circle and these seats are numbered from $1$ to $n$, clockwise. In each of these chairs sits a politician, who can be a liar or an honest one. Lying politicians always tell lies, and honest politicians always tell the truth. At one heated moment in the debate, they accused each other of being liars, with the politician in chair $1$ saying that the politician immediately to his left is a liar, the politician in chair $2$ saying that all the $2$ politicians immediately to his left are liars, the politician in the char $3$ saying that all the $3$ politicians immediately to his left are liars, and so on. Note that the politician in chair $n$ accuses all $n$ politicians (including himself) of being liars. For what values of $n$ is this situation possible to happen?

Find all finite sets $S$ of positive integers with at least $2$ elements, such that if $m>n$ are two elements of $S$, then $$ \frac{n^2}{m-n} $$ is also an element of $S$.

Let $ABC$ be a triangle. An arbitrary circle which passes through the points $B,C$ intersects the sides $AC,AB$ for the second time in $D,E$ respectively. The line $BD$ intersects the circumcircle of the triangle $AEC$ at $P{}$ and $Q{}$ and the line $CE$ intersects the circumcircle of the triangle $ABD$ at $R{}$ and $S{}$ such that $P{}$ is situated on the segment $BD{}$ and $R{}$ lies on the segment $CE.$ Prove that: [list=a] [*]The points $P,Q,R$ and $S{}$ are concyclic. [*]The triangle $APQ$ is isosceles. [/list] [i]Petru Braica[/i]

In every row of a grid $100 \times n$ is written a permutation of the numbers $1,2 \ldots, 100$. In one move you can choose a row and swap two non-adjacent numbers with difference $1$. Find the largest possible $n$, such that at any moment, no matter the operations made, no two rows may have the same permutations.

Let $\triangle ABC$ be an acute triangle with circumcenter $O$ such that $AB<AC$, let $Q$ be the intersection of the external bisector of $\angle A$ with $BC$, and let $P$ be a point in the interior of $\triangle ABC$ such that $\triangle BPA$ is similar to $\triangle APC$. Show that $\angle QPA + \angle OQB = 90^{\circ}$. [i]Alex Zhu.[/i]

Let $ p_1,p_2,\ldots,p_k $ be the distinct prime divisors of $ n $ and let $ a_n=\frac {1}{p_1}+\frac {1}{p_2}+\cdots+\frac {1}{p_k} $ for $ n\geq 2 $. Show that for every positive integer $ N\geq 2 $ the following inequality holds: $ \sum_{k=2}^{N} a_2a_3 \cdots a_k <1 $ [i]Laurentiu Panaitopol[/i]

Calculate the mean value of the solid angle by which the disc $x^2 + y^2 \le 1$ lying in the plane $z = 0$ is seen from points of the sphere $x^2 + y^2 + (z-2)^2 = 1$.

Find the relation of the black part length and the white part length for the main diagonal of the a) $100\times 99$ chess-board; b) $101\times 99$ chess-board.

Let triangle $ABC$ have $\angle A = 70^\circ, \angle B = 60^\circ$, and $\angle C = 50^\circ$. Extend altitude $BH$ past $H$ to point $D$ so that $BD = BC$. Find $\angle BDA$ in degrees.

Evan's bike lock has been stolen by Jonathan, and he has changed the passcode. Jonathan is refusing to tell Evan the passcode. All Evan knows is it is a five-digit number with following properties: (a) It can be written as $a\cdot \overline{ab}\cdot\overline{abc}$ where $a, b, c$ are pairwise different digits and $a$, $\overline{ab}$, $\overline{abc}$ are prime. (b) The sum of its digits is 21. (c) The passcode's last digit is $c$. Find the bike passcode. [i]Team #1[/i]

Prove that the set $ \left\{ \left. \begin{pmatrix} \frac{1-2x^3}{3x^2} & \frac{1+x^3}{3x^2} & \frac{1+x^3}{3x^2} \\ \frac{1+x^3}{3x^2} & \frac{1-2x^3}{3x^2} & \frac{1+x^3}{3x^2} \\ \frac{1+x^3}{3x^2} & \frac{1+x^3}{3x^2} & \frac{1-2x^3}{3x^2}\end{pmatrix}\right| x\in\mathbb{R}^{*} \right\} $ along with the usual multiplication of matrices form a group, determine an isomorphism between this group and the group of multiplicative real numbers.

On a chess board, the boundaries of the squares are assumed to be black. Draw a circle of the greatest possible radius lying entirely on the black squares.