Determine all positive integers $a$, $b$ and $c$ which satisfy the equation $$a^2+b^2+1=c!.$$ [i]Proposed by Nikola Velov[/i]

Let $ABCD$ be an isosceles trapezoid with bases $AB$ and $CD$. The incircle of the triangle $BCD$ touches $CD$ at $E$. Point $F$ is chosen on the bisector of the angle $DAC$ such that the lines $EF$ and $CD$ are perpendicular. The circumcircle of the triangle $ACF$ intersects the line $CD$ again at $G$. Prove that the triangle $AFG$ is isosceles.

Prove that all numbers of the sequence \[ \frac{107811}{3}, \quad \frac{110778111}{3}, \frac{111077781111}{3}, \quad \ldots \] are exact cubes.

Consider a set $S = \{a_1, \ldots, a_{2024}\}$ consisting of $2024$ distinct positive integers that satisfies the following property: [center] "For every positive integer $m < 2024,$ the sum of no $m$ distinct elements of $S$ is a multiple of $2024.$" [/center] Prove $a_1, \ldots, a_{2024}$ all leave the same remainder when divided by $2024.$ Justify your answer.

Suppose $a$, $b$, and $c$ are numbers satisfying the three equations: $$a + 2b = 20,$$ $$b + 2c = 2,$$ $$c + 2a = 3.$$ Find $9a + 9b + 9c$.

Nair has puzzle pieces shaped like an equilateral triangle. She has pieces of two sizes: large and small. [img]https://cdn.artofproblemsolving.com/attachments/a/1/aedfbfb2cb17bf816aa7daeb0d35f46a79b6e9.jpg[/img] Nair build triangular figures by following these rules: $\bullet$ Figure $1$ is made up of $4$ small pieces, Figure $2$ is made up of $2$ large pieces and $8$ small, Figure $3$ by $6$ large and $12$ small, and so on. $\bullet$ The central column must be made up exclusively of small parts. $\bullet$ Outside the central column, only large pieces can be placed. [img]https://cdn.artofproblemsolving.com/attachments/5/7/e7f6340de0e04d5b5979e72edd3f453f2ac8a5.jpg[/img] Following the pattern, how many pieces will Nair use to build Figure $20$?

Given triangle $ ABC$ with $ AB>AC$. $ l$ is tangent line of the circumcircle of triangle $ ABC$ at $ A$. A circle with center $ A$ and radius $ AC$, intersect $ AB$ at $ D$ and $ l$ at $ E$ and $ F$. Prove that the lines $ DE$ and $ DF$ pass through the incenter and excenter of triangle $ ABC$.

We have a rhombus $ABCD$ with $\angle BAD=60^\circ$. We take points $F,H,G$ on the sides $AD,DC$ and the diagonal $AC$, respectively, such that $DFGH$ is a parallelogram. Prove that $BFH$ is equilateral.

Compute $$\sum_{i=1}^{4} \sum_{t=1}^{4} \sum_{e=1}^{4} \left\lfloor \frac{ite}{5} \right\rfloor.$$

The map of a country is in the form of a convex polygon with $n (n\geq5)$ sides, such as any 3 diagonals do not concur inside the polygon. Some of the diagonals are roads, which allow movement in both directions and the other diagonals are not roads. There are cities on the intersection points of any two diagonals inside the polygon and at least one of the two diagonals is a road. Prove that you can move from any city to any other city using at most 3 roads.

Which of the following divides $3^{3n+1} + 5^{3n+2}+7^{3n+3}$ for every positive integer $n$? $ \textbf{(A)}\ 3 \qquad\textbf{(B)}\ 5 \qquad\textbf{(C)}\ 7 \qquad\textbf{(D)}\ 11 \qquad\textbf{(E)}\ 53 $

Define the sequences $ a_n, b_n, c_n$ as follows. $ a_0 \equal{} k, b_0 \equal{} 4, c_0 \equal{} 1$. If $ a_n$ is even then $ a_{n \plus{} 1} \equal{} \frac {a_n}{2}$, $ b_{n \plus{} 1} \equal{} 2b_n$, $ c_{n \plus{} 1} \equal{} c_n$. If $ a_n$ is odd, then $ a_{n \plus{} 1} \equal{} a_n \minus{} \frac {b_n}{2} \minus{} c_n$, $ b_{n \plus{} 1} \equal{} b_n$, $ c_{n \plus{} 1} \equal{} b_n \plus{} c_n$. Find the number of positive integers $ k < 1995$ such that some $ a_n \equal{} 0$.

An infinite sequence of digits $1$ and $2$ is determined by the following two properties: i) The sequence is built by writing, in some order, blocks $12$ and blocks $112.$ ii) If each block $12$ is replaced by $1$ and each block $112$ by $2$, the same sequence is again obtained. In which position is the hundredth digit $1$? What is the thousandth digit of the sequence?

Let $P(x)$ be a polynomial with integer coefficients. We denote $\deg(P)$ its degree which is $\geq 1.$ Let $n(P)$ be the number of all the integers $k$ for which we have $(P(k))^{2}=1.$ Prove that $n(P)- \deg(P) \leq 2.$

Three coins lie on integer points on the number line. A move consists of choosing and moving two coins, the first one $ 1$ unit to the right and the second one $ 1$ unit to the left. Under which initial conditions is it possible to move all coins to one single point?

A $2015$- digit natural number $A$ has the property that any $5$ of it's consecutive digits form a number divisible by $32$. Prove that $A$ is divisible by $2^{2015}$

Kara rolls a six-sided die six times, and notices that the results satisfy the following conditions: [list] [*] She rolled a $6$ exactly three times; [*] The product of her first three rolls is the same as the product of her last three rolls. [/list] How many distinct sequences of six rolls could Kara have rolled? [i]Proposed by Andrew Wu[/i]

In a group of cows and chickens, the number of legs was $ 14$ more than twice the number of heads. The number of cows was: $ \textbf{(A)}\ 5 \qquad\textbf{(B)}\ 7 \qquad\textbf{(C)}\ 10 \qquad\textbf{(D)}\ 12 \qquad\textbf{(E)}\ 14$

If $ m \equal{} \frac {cab}{a \minus{} b}$, then $ b$ equals: $ \textbf{(A)}\ \frac {m(a \minus{} b)}{ca} \qquad\textbf{(B)}\ \frac {cab \minus{} ma}{ \minus{} m} \qquad\textbf{(C)}\ \frac {1}{1 \plus{} c} \qquad\textbf{(D)}\ \frac {ma}{m \plus{} ca}$ $ \textbf{(E)}\ \frac {m \plus{} ca}{ma}$

Shauna takes $5$ tests, each worth a maximum of a $100$ points. Her scores on the first three tests were $76$, $94$, and $87$. In order to average an $81$ on all five tests, what is the lowest score she could earn on one of the two tests? $\textbf{(A) } 48 \qquad\textbf{(B) } 52 \qquad\textbf{(C) } 66 \qquad\textbf{(D) } 70 \qquad\textbf{(E) } 74$

Let $ABC$ be a triangle with area $S$, and let $P$ be a point in the plane. Prove that $AP+BP+CP\geq 2\sqrt[4]{3}\sqrt{S}$.

Find all elements $n \in A = \{2,3,...,2016\} \subset \mathbb{N}$ such that: every number $m \in A$ smaller than $n$, and coprime with $n$, must be a prime number

Determine all functions $f : \mathbb{R} \to \mathbb{R}$ that satisfy the following two properties. (i) The Riemann integral $\int_a^b f(t) \mathrm dt$ exists for all real numbers $a < b$. (ii) For every real number $x$ and every integer $n \ge 1$ we have \[ f(x) = \frac{n}{2} \int_{x-\frac{1}{n}}^{x+\frac{1}{n}} f(t) \mathrm dt. \]

Let $GL(n, K)$ be a linear group over the field K with a topology induced by a non-Archimedean absolute value of the field K. Prove that if the matrix $M \in GL (n, K)$ is contained by some compact subgroup of $GL(n, K)$, then all eigenvalues of M have absolute value 1.

Sherry starts at the number 1. Whenever she's at 1, she moves one step up (to 2). Whenever she's at a number strictly between 1 and 10, she moves one step up or one step down, each with probability $\frac{1}{2}$. When she reaches 10, she stops. What is the expected number (average number) of steps that Sherry will take?