For all primes $p \geq 3,$ define $F(p) = \sum^{\frac{p-1}{2}}_{k=1}k^{120}$ and $f(p) = \frac{1}{2} - \left\{ \frac{F(p)}{p} \right\}$, where $\{x\} = x - [x],$ find the value of $f(p).$

Let $n\ge3$ positive integers $a_1,\ldots,a_n$ be written on a circle so that each of them divides the sum of its two neighbors. Let us denote $$S_n=\frac{a_n+a_2}{a_1}+\frac{a_1+a_3}{a_2}+\ldots+\frac{a_{n-2}+a_n}{a_{n-1}}+\ldots+\frac{a_{n-1}+a_1}{a_n}.$$Determine the minimum and maximum values of $S_n$.

Let $ ABC$ be an acute-angled triangle such that there exist points $ D,E,F$ on side $ BC,CA,AB$, respectively such that the inradii of triangle $ AEF,BDF,CDE$ are all equal to $ r_0$. If the inradii of triangle $ DEF$ and $ ABC$ are $ r$ and $ R$, respectively, prove that \[ r\plus{}r_0\equal{}R.\] [i]Soewono, Bandung[/i]

On the sides $AB, BC$ and $CA$ of triangle $ABC$, points $K, L$ and $M$ are selected, respectively, such that $AK = AM$ and $BK = BL$. If $\angle{MLB} = \angle{CAB}$, Prove that $ML = KI$, where $I$ is the incenter of triangle $CML$.

The side lengths of a triangle area $t$ form an arithmetic progression with difference $d$. Find the sides and angles of the triangle. Specifically, solve this problem for $d=1$ and $t=6$.

Kolya and Dima play a game on an $8\times 8$ board, making moves in turn. During his turn, Kolya must put one cross in any empty cell (i.e., in a cell in which a cross has not yet been drawn and which has not yet been covered with a domino). Dima must cover two adjacent cells with a domino (which are not yet covered with other dominoes), in which there are an even number of crosses in total (0 or 2). The one who can't make a move loses. Which of does the player have a winning strategy, if [list=a] [*]Dima makes the first move? [*]Kolya makes the first move? [/list] [i]Proposed by M. Didin[/i]

Let $ABCD$ be a parallelogram. Let $G,H$ be the feet of the altitudes from $A$ to $CD$ and $BC$ respectively. If $AD=15$, $AG=12$, and $AH=16$, find the length of $AB$. [i]2019 CCA Math Bonanza Lightning Round #2.4[/i]

Let \( f \) and \( g \) be two nonzero polynomials with integer coefficients such that \( \deg(f) > \deg(g) \). Suppose that for infinitely many prime numbers \( p \), the polynomial \( pf + g \) has a rational root. Prove that \( f \) has a rational root. Clarification: A rational root of a polynomial \( f \) is a number \( q \in \mathbb{Q} \) such that \( f(q) = 0 \).

Regular hexagon $ABCDEF$ has side length $2$. Line segment $BD$ is drawn, and circle $O$ is inscribed inside the pentagon $ABDEF$ such that $O$ is tangent to $AF$, $BD$, and $EF$. Compute the radius of $O$.

Let $ A_0 \equal{} (a_1,\dots,a_n)$ be a finite sequence of real numbers. For each $ k\geq 0$, from the sequence $ A_k \equal{} (x_1,\dots,x_k)$ we construct a new sequence $ A_{k \plus{} 1}$ in the following way. 1. We choose a partition $ \{1,\dots,n\} \equal{} I\cup J$, where $ I$ and $ J$ are two disjoint sets, such that the expression \[ \left|\sum_{i\in I}x_i \minus{} \sum_{j\in J}x_j\right| \] attains the smallest value. (We allow $ I$ or $ J$ to be empty; in this case the corresponding sum is 0.) If there are several such partitions, one is chosen arbitrarily. 2. We set $ A_{k \plus{} 1} \equal{} (y_1,\dots,y_n)$ where $ y_i \equal{} x_i \plus{} 1$ if $ i\in I$, and $ y_i \equal{} x_i \minus{} 1$ if $ i\in J$. Prove that for some $ k$, the sequence $ A_k$ contains an element $ x$ such that $ |x|\geq\frac n2$. [i]Author: Omid Hatami, Iran[/i]

$ABCD$ is a square. Describe the locus of points $P$, different from $A, B, C, D$, on that plane for which \[\widehat{APB}+\widehat{CPD}=180^\circ\]

Find all real-valued functions $f$ defined on pairs of real numbers, having the following property: for all real numbers $a, b, c$, the median of $f(a,b), f(b,c), f(c,a)$ equals the median of $a, b, c$. (The [i]median[/i] of three real numbers, not necessarily distinct, is the number that is in the middle when the three numbers are arranged in nondecreasing order.)

Each of the squares on a $15$×$15$ board has a zero. At every step you choose a row or a column, we delete all the numbers from it and then we write the numbers from $1$ to $15$ in the empty cells, in an arbitrary order. find the sum possible maximum of the numbers on the board that can be achieved after a number finite number of steps.

Let $a, b$ and $c$ be positive integers such that $1 < a < b < c$. Suppose that $(ab-l)(bc-1 )(ca-1)$ is divisible by $abc$. Find the values of $a, b$ and $c$. Justify your answer.

Let $ABC$ be a non-right triangle and let $M$ be the midpoint of $BC$. Let $D$ be a point on $AM$ (D≠A, D≠M). Let ω1 be a circle through $D$ that intersects $BC$ at $B$ and let ω2 be a circle through $D$ that intersects $BC$ at $C$. Let $AB$ intersect ω1 at $B$ and $E$, and let $AC$ intersect ω2 at $C$ and $F$. Prove, that the tangent on ω1 at $E$ and the tangent on ω2 at $F$ intersect on $AM$.

Let $a,b,c$ be positive real numbers such that $a + b + c = 1$. Show that $$\left(\frac{1}{a} + \frac{1}{bc}\right)\left(\frac{1}{b} + \frac{1}{ca}\right)\left(\frac{1}{c} + \frac{1}{ab}\right) \geq 1728$$

Is it possible to choose $1983$ distinct positive integers, all less than or equal to $10^5$, no three of which are consecutive terms of an arithmetic progression?

Let $ABC$ be a triangle with $AB=4$, $AC=5$, $BC=6$, and circumcircle $\Omega$. Points $E$ and $F$ lie on $AC$ and $AB$ respectively such that $\angle ABE=\angle CBE$ and $\angle ACF=\angle BCF$. The second intersection point of the circumcircle of $\triangle AEF$ with $\Omega$ (other than $A$) is $P$. Suppose $AP^2=\frac mn$ where $m$ and $n$ are positive relatively prime integers. Find $100m+n$. [i]Proposed by David Altizio[/i]

Consider the regular $101$-gon. A line $l$ does not contain any vertex of this polygon. Prove that line $l$ intersects even number of the diagonals of this polygon.

Show that there exists a proper non-empty subset $S$ of the set of real numbers such that, for every real number $x$, the set $\{nx + S : n \in N\}$ is finite, where $nx + S =\{nx + s : s \in S\}$

Find all integers $x$ and $y$ satisfying the following equation $x^2 - 2xy + 5y^2 + 2x - 6y - 3 = 0$.

On a large chessboard, there are $4$ puddings that form a square with size $1$. A pudding $A$ could jump over a pudding $B$, or equivalently, $A$ moves to the symmetric point with respect to $B$. Is it possible that after finite times of jumping, the puddings form a square with size $2$?

Let $ABC$ be an equilateral triangle with side 3. A circle $C_1$ is tangent to $AB$ and $AC$. A circle $C_2$, with a radius smaller than the radius of $C_1$, is tangent to $AB$ and $AC$ as well as externally tangent to $C_1$. Successively, for $n$ positive integer, the circle $C_{n+1}$, with a radius smaller than the radius of $C_n$, is tangent to $AB$ and $AC$ and is externally tangent to $C_n$. Determine the possible values for the radius of $C_1$ such that 4 circles from this sequence, but not 5, are contained on the interior of the triangle $ABC$.

A sheet of paper has the shape of an isosceles trapezoid $C_1AB_2C_2$ with the shorter base $B_2C_2$. The foot of the perpendicular from the midpoint $D$ of $C_1C_2$ to $AC_1$ is denoted by $B_1$. Suppose that upon folding the paper along $DB_1, AD$ and $AC_1$ points $C_1,C_2$ become a single point $C$ and points $B_1,B_2$ become a point $B$. The area of the tetrahedron $ABCD$ is $64$ cm$^3$ . Find the sides of the initial trapezoid.

$N$ oligarchs built a country with $N$ cities with each one of them owning one city. In addition, each oligarch built some roads such that the maximal amount of roads an oligarch can build between two cities is $1$ (note that there can be more than $1$ road going through two cities, but they would belong to different oligarchs). A total of $d$ roads were built. Some oligarchs wanted to create a corporation by combining their cities and roads so that from any city of the corporation you can go to any city of the corporation using only corporation roads (roads can go to other cities outside corporation) but it turned out that no group of less than $N$ oligarchs can create a corporation. What is the maximal amount that $d$ can have?