Let $c_i$ denote the $i$th composite integer so that $\{c_i\}=4,6,8,9,...$ Compute \[\prod_{i=1}^{\infty} \dfrac{c^{2}_{i}}{c_{i}^{2}-1}\] (Hint: $\textstyle\sum^\infty_{n=1} \tfrac{1}{n^2}=\tfrac{\pi^2}{6}$)

Let $ K$ be a finite field of $ p$ elements, where $ p$ is a prime. For every polynomial $ f(x)\equal{}\sum_{i\equal{}0}^na_ix^i$ ($ \in K[x]$) put $ \overline{f(x)}\equal{}\sum_{i\equal{}0}^n a_ix^{p^i}$. Prove that for any pair of polynomials $ f(x),g(x)\in K[x]$, $ \overline{f(x)}|\overline{g(x)}$ if and only if $ f(x)|g(x)$.

Given an acute triangle $ABC$ with circumcenter $O$ and orthocenter $H$. Let $K$ be a point inside $ABC$ which is not $O$ nor $H$. Point $L$ and $M$ are located outside the triangle $ABC$ such that $AKCL$ and $AKBM$ are parallelogram. At last, let $BL$ and $CM$ intersects at $N$, and let $J$ be the midpoint of $HK$. Show that $KONJ$ is also a parallelogram. [i]Raja Oktovin, Pekanbaru[/i]

We consider a prism with 6 faces, 5 of which are circumscriptible quadrilaterals. Prove that all the faces of the prism are circumscriptible quadrilaterals.

A point $ P$ of integer coordinates in the Cartesian plane is said [i]visible[/i] if the segment $ OP$ does not contain any other points with integer coordinates (except its ends). Prove that for any $ n\in\mathbb{N}^*$ there exists a visible point $ P_{n}$, at distance larger than $ n$ from any other visible point. [b]Dan Schwarz[/b]

On a past Mathematical Olympiad the maximum possible score on a problem was 5. The average score of boys was 4, the average score of girls was 3.25, and the overall average score was 3.60. Find the total number of participants, knowing that it was in the range from 31 to 50.

A truncated trigonal pyramid is circumscribed around a sphere touching its bases at points $T_1, T_2$. Let $h$ be the altitude of the pyramid, $R_1, R_2$ be the circumradii of its bases, and $O_1, O_2$ be the circumcenters of the bases. Prove that $$R_1R_2h^2 = (R_1^2-O_1T_1^2)(R_2^2-O_2T_2^2).$$

Prove that number $1$ can be represented as a sum of a finite number $n$ of real numbers, less than $1,$ not necessarily distinct, which contain in their decimal representation only the digits $0$ and/or $7.$ Which is the least possible number $n$?

In triangle $ABC$, we have $\angle ABC=60$. The line through $B$ perpendicular to side $AB$ intersects angle bisector of $\angle BAC$ in $D$ and the line through $C$ perpendicular $BC$ intersects angle bisector of $\angle ABC$ in $E$. prove that $\angle BED\le 30$.

A penny is placed in the coordinate plane $\left(0,0\right)$. The penny can be moved $1$ unit to the right, $1$ unit up, or diagonally $1$ unit to the right and $1$ unit up. How many different ways are there for the penny to get to the point $\left(5,5\right)$? $\text{(A) }8\qquad\text{(B) }25\qquad\text{(C) }99\qquad\text{(D) }260\qquad\text{(E) }351$

Solve the equation $$x^5 + (x + 1)^5 + (x + 2)^5 + ... + (x + 1998)^5 = 0.$$

Let $n{}$ and $m$ be positive integers, $n>m>1$. Let $n{}$ divided by $m$ have partial quotient $q$ and remainder $r$ (so that $n = qm + r$, where $r\in\{0,1,...,m-1\}$). Let $n-1$ divided by $m$ have partial quotient $q^{'}$ and remainder $r^{'}$. a) It appears that $q+q^{'} =r +r^{'} = 99$. Find all possible values of $n{}$. b) Prove that if $q+q^{'} =r +r^{'}$, then $2n$ is a perfect square.

From all possible permutations from $(a_1,a_2,...,a_n)$ from the set $\{1,2,..,n\}$, $n\geq 1$, consider the sets that satisfies the $2(a_1+a_2+...+a_m)$ is divisible by $m$, for every $m=1,2,...,n$. Find the total number of permutations.

Given \( b > 0 \), consider the following matrix: \[ B = \begin{pmatrix} b & b^2 \\ b^2 & b^3 \end{pmatrix} \] Denote by \( e_i \) the top left entry of \( B^i \). Prove that the following limit exists and calculate its value: \[ \lim_{i \to \infty} \sqrt[i]{e_i}. \]

In the cuboid $ABCDA'B'C'D'$ with $AB=a$, $AD=b$ and $AA'=c$ such that $a>b>c>0$, the points $E$ and $F$ are the orthogonal projections of $A$ on the lines $A'D$ and $A'B$, respectively, and the points $M$ and $N$ are the orthogonal projections of $C$ on the lines $C'D$ and $C'B$, respectively. Let $DF\cap BE=\{G\}$ and $DN\cap BM=\{P\}$. [list=a] [*] Show that $(A'AG)\parallel (C'CP)$ and determine the distance between these two planes; [*] Show that $GP\parallel (ABC)$ and determine the distance between the line $GP$ and the plane $(ABC)$. [/list] [i]Petre Simion, Nicolae Victor Ioan[/i]

Let $M$ denote the set of $m\times n$ matrices with entries in the set $\{0,1,2,3,4\}$ such that in each row and each column the sum of elements is divisible by $5$. Find the cardinality of set $M$.

Let $ABCD$ be a trapezoid with $AD \parallel BC$ and $\angle BCD < \angle ABC < 90^\circ$. Let $E$ be the intersection point of the diagonals $AC$ and $BD$. The circumcircle $\omega$ of $\triangle BEC$ intersects the segment $CD$ at $X$. The lines $AX$ and $BC$ intersect at $Y$, while the lines $BX$ and $AD$ intersect at $Z$. Prove that the line $EZ$ is tangent to $\omega$ iff the line $BE$ is tangent to the circumcircle of $\triangle BXY$.

A circle of radius $t$ is tangent to the hypotenuse, the incircle, and one leg of an isosceles right triangle with inradius $r=1+\sin \frac{\pi}{8}$. Find $rt$.

Suppose $a, b, c, d$ are positive reals such that $a \geq b \geq c \geq d$ and $ab^2c^3d^4 = 1$. Help Janson prove that $a+b+c+d \geq 4$.

Let $t$ be a positive real number such that $t^4 + t^{-4} = 2023$. Determine the value of $t^3 + t^{-3}$ in the form of $a\sqrt b$, where $a$ and $b$ are positive integers.

Let $ n(\ge2) $ be a positive integer. Find the minimum $ m $, so that there exists $x_{ij}(1\le i ,j\le n)$ satisfying: (1)For every $1\le i ,j\le n, x_{ij}=max\{x_{i1},x_{i2},...,x_{ij}\} $ or $ x_{ij}=max\{x_{1j},x_{2j},...,x_{ij}\}.$ (2)For every $1\le i \le n$, there are at most $m$ indices $k$ with $x_{ik}=max\{x_{i1},x_{i2},...,x_{ik}\}.$ (3)For every $1\le j \le n$, there are at most $m$ indices $k$ with $x_{kj}=max\{x_{1j},x_{2j},...,x_{kj}\}.$

[u]Round 5[/u] [b]5.1.[/b] A triangle has lengths such that one side is $12$ less than the sum of the other two sides, the semi-perimeter of the triangle is $21$, and the largest and smallest sides have a difference of $2$. Find the area of this triangle. [b]5.2.[/b] A rhombus has side length $85$ and diagonals of integer lengths. What is the sum of all possible areas of the rhombus? [b]5.3.[/b] A drink from YAKSHAY’S SHAKE SHOP is served in a container that consists of a cup, shaped like an upside-down truncated cone, and a semi-spherical lid. The ratio of the radius of the bottom of the cup to the radius of the lid is $\frac23$ , the volume of the combined cup and lid is $296\pi$, and the height of the cup is half of the height of the entire drink container. What is the volume of the liquid in the cup if it is filled up to half of the height of the entire drink container? [u]Round 6[/u] [i]Each answer in the next set of three problems is required to solve a different problem within the same set. There is one correct solution to all three problems; however, you will receive points for any correct answer regardless whether other answers are correct.[/i] [b]6.1.[/b] Let the answer to problem $2$ be $b$. There are b people in a room, each of which is either a truth-teller or a liar. Person $1$ claims “Person $2$ is a liar,” Person $2$ claims “Person $3$ is a liar,” and so on until Person $b$ claims “Person $1$ is a liar.” How many people are truth-tellers? [b]6.2.[/b] Let the answer to problem $3$ be $c$. What is twice the area of a triangle with coordinates $(0, 0)$, $(c, 3)$ and $(7, c)$ ? [b]6.3.[/b] Let the answer to problem $ 1$ be $a$. Compute the smaller zero to the polynomial $x^2 - ax + 189$ which has $2$ integer roots. [u]Round 7[/u] [b]7.1. [/b]Sir Isaac Neeton is sitting under a kiwi tree when a kiwi falls on his head. He then discovers Neeton’s First Law of Kiwi Motion, which states: [i]Every minute, either $\left\lfloor \frac{1000}{d} \right\rfloor$ or $\left\lceil \frac{1000}{d} \right\rceil$ kiwis fall on Neeton’s head, where d is Neeton’s distance from the tree in centimeters.[/i] Over the next minute, $n$ kiwis fall on Neeton’s head. Let $S$ be the set of all possible values of Neeton’s distance from the tree. Let m and M be numbers such that $m < x < M$ for all elements $x$ in $S$. If the least possible value of $M - m$ is $\frac{2000}{16899}$ centimeters, what is the value of $n$? Note that $\lfloor x \rfloor$ is the greatest integer less than or equal to $x$, and $\lceil x \rceil$ is the least integer greater than or equal to $x$. [b]7.2.[/b] Nithin is playing chess. If one queen is randomly placed on an $ 8 \times 8$ chessboard, what is the expected number of squares that will be attacked including the square that the queen is placed on? (A square is under attack if the queen can legally move there in one move, and a queen can legally move any number of squares diagonally, horizontally or vertically.) [b]7.3.[/b] Nithin is writing binary strings, where each character is either a $0$ or a $1$. How many binary strings of length $12$ can he write down such that $0000$ and $1111$ do not appear? [u]Round 8[/u] [b]8.[/b] What is the period of the fraction $1/2018$? (The period of a fraction is the length of the repeated portion of its decimal representation.) Your answer will be scored according to the following formula, where $X$ is the correct answer and $I$ is your input. $$max \left\{ 0, \left\lceil min \left\{13 - \frac{|I-X|}{0.1 |I|}, 13 - \frac{|I-X|}{0.1 |I-2X|} \right\} \right\rceil \right\}$$ PS. You should use hide for answers. Rounds 1-4 have been posted [url=https://artofproblemsolving.com/community/c3h2765571p24215461]here[/url]. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Show that $n!=a^{n-1}+b^{n-1}+c^{n-1}$ has only finitely many solutions in positive integers. [i]Proposed by Dorlir Ahmeti, Albania[/i]

[b]p1.[/b] An $8$-inch by $11$-inch sheet of paper is laid flat so that the top and bottom edges are $8$ inches long. The paper is then folded so that the top left corner touches the right edge. What is the minimum possible length of the fold? [b]p2.[/b] Triangle $ABC$ is equilateral, with $AB = 6$. There are points $D$, $E$ on segment AB (in the order $A$, $D$, $E$, $B$), points $F$, $G$ on segment $BC$ (in the order $B$, $F$, $G$, $C$), and points $H$, $I$ on segment $CA$ (in the order $C$, $H$, $I$, $A$) such that $DE = F G = HI = 2$. Considering all such configurations of $D$, $E$, $F$, $G$, $H$, $I$, let $A_1$ be the maximum possible area of (possibly degenerate) hexagon $DEF GHI$ and let $A_2$ be the minimum possible area. Find $A_1 - A_2$. [b]p3.[/b] Find $$\tan \frac{\pi}{7} \tan \frac{2\pi}{7} \tan \frac{3\pi}{7}$$ PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

In acute $\triangle ABC$ with circumcircle $\Gamma$ and incentre $I$, the incircle touches side $AB$ at $F$. The external angle bisector of $\angle ACB$ meets ray $AB$ at $L$. Point $K$ lies on the arc $CB$ of $\Gamma$ not containing $A$, such that $\angle CKI=\angle IKL$. Ray $KI$ meets $\Gamma$ again at $D\ne K$. Prove that $\angle ACF =\angle DCB$.