There are $n \ge 3$ positive real numbers $a_1, a_2, \dots, a_n$. For each $1 \le i \le n$ we let $b_i = \frac{a_{i-1} + a_{i+1}}{a_i}$ (here we define $a_0$ to be $a_n$ and $a_{n+1}$ to be $a_1$). Assume that for all $i$ and $j$ in the range $1$ to $n$, we have $a_i \le a_j$ if and only if $b_i \le b_j$. Prove that $a_1 = a_2 = \dots = a_n$.

Let $ a, b, c, d,m, n \in \mathbb{Z}^\plus{}$ such that \[ a^2\plus{}b^2\plus{}c^2\plus{}d^2 \equal{} 1989,\] \[ a\plus{}b\plus{}c\plus{}d \equal{} m^2,\] and the largest of $ a, b, c, d$ is $ n^2.$ Determine, with proof, the values of $m$ and $ n.$

a) A game for two. The first player writes two rows of ten numbers each, the second under the first. He should provide the following property: if number $b$ is written under $a$, and $d$ -- under $c$, then $a + d = b + c$. The second player has to determine all the numbers. He is allowed to ask the questions like "What number is written in the $x$ place in the $y$ row?" What is the minimal number of the questions asked by the second player before he founds out all the numbers? b) There was a table $m\times n$ on the blackboard with the property: if You chose two rows and two columns, then the sum of the numbers in the two opposite vertices of the rectangles formed by those lines equals the sum of the numbers in two another vertices. Some of the numbers are cleaned but it is still possible to restore all the table. What is the minimal possible number of the remaining numbers?

The set of nonempty integers $A$ is said to be "elegant" if it is for any $a\in A,$ $1\leq k\leq 2023,$ $$\left| \left\{ b\in A:\left\lfloor\frac b{3^k}\right\rfloor =\left\lfloor\frac a{3^k}\right\rfloor\right\}\right| =2^k.$$ Prove that if the intersection of the integer set $S$ and any "elegant" set is not empty$,$ then $S$ contains an "elegant" set.

After a cyclist has gone $ \frac{2}{3}$ of his route, he gets a flat tire. Finishing on foot, he spends twice as long walking as he did riding. How many times as fast does he ride as walk?

Find all real non-zero polynomials satisfying $P(x)^3+3P(x)^2=P(x^{3})-3P(-x)$ for all $x\in\mathbb{R}$.

Pick out three numbers from $0,1,\cdots,9$, their sum is an even number and not less than $10$. We have________different ways to pick numbers.

[b]p1.[/b] Sometimes one finds in an old park a tetrahedral pile of cannon balls, that is, a pile each layer of which is a tightly packed triangular layer of balls. A. How many cannon balls are in a tetrahedral pile of cannon balls of $N$ layers? B. How high is a tetrahedral pile of cannon balls of $N$ layers? (Assume each cannon ball is a sphere of radius $R$.) [b]p2.[/b] A prime is an integer greater than $1$ whose only positive integer divisors are itself and $1$. A. Find a triple of primes $(p, q, r)$ such that $p = q + 2$ and $q = r + 2$ . B. Prove that there is only one triple $(p, q, r)$ of primes such that $p = q + 2$ and $q = r + 2$ . [b]p3.[/b] The function $g$ is defined recursively on the positive integers by $g(1) =1$, and for $n>1$ , $g(n)= 1+g(n-g(n-1))$ . A. Find $g(1)$ , $g(2)$ , $g(3)$ and $g(4)$ . B. Describe the pattern formed by the entire sequence $g(1) , g(2 ), g(3), ...$ C. Prove your answer to Part B. [b]p4.[/b] Let $x$ , $y$ and $z$ be real numbers such that $x + y + z = 1$ and $xyz = 3$ . A. Prove that none of $x$ , $y$ , nor $z$ can equal $1$. B. Determine all values of $x$ that can occur in a simultaneous solution to these two equations (where $x , y , z$ are real numbers). [b]p5.[/b] A round robin tournament was played among thirteen teams. Each team played every other team exactly once. At the conclusion of the tournament, it happened that each team had won six games and lost six games. A. How many games were played in this tournament? B. Define a [i]circular triangle[/i] in a round robin tournament to be a set of three different teams in which none of the three teams beat both of the other two teams. How many circular triangles are there in this tournament? C. Prove your answer to Part B. PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

If $x$ and $y$ are real numbers, compute the minimum possible value of \[\frac{4xy(3x^2+10xy+6y^2)}{x^4+4y^4}.\]

Given an integer $n\ge 2$, compute $\sum_{\sigma} \textrm{sgn}(\sigma) n^{\ell(\sigma)}$, where all $n$-element permutations are considered, and where $\ell(\sigma)$ is the number of disjoint cycles in the standard decomposition of $\sigma$.

For positive reals $a,b,c$ with $\sqrt{a}+\sqrt{b}+\sqrt{c}\ge 3$ prove that $$\frac{a^3}{a^2+b}+\frac{b^3}{b^2+c}+\frac{c^3}{c^2+a}\ge \frac{3}{2}$$

Compute the sum of all 2-digit prime numbers $p$ such that there exists a prime number $q$ for which $100q + p$ is a perfect square.

(1) $D$ is an arbitary point in $\triangle{ABC}$. Prove that: \[ \frac{BC}{\min{AD,BD,CD}} \geq \{ \begin{array}{c} \displaystyle 2\sin{A}, \ \angle{A}< 90^o \\ \\ 2, \ \angle{A} \geq 90^o \end{array} \] (2)$E$ is an arbitary point in convex quadrilateral $ABCD$. Denote $k$ the ratio of the largest and least distances of any two points among $A$, $B$, $C$, $D$, $E$. Prove that $k \geq 2\sin{70^o}$. Can equality be achieved?

Mary mixes $2$ gallons of a solution that is $40$ percent alcohol with $3$ gallons of a solution that is $60$ percent alcohol. Sandra mixes $4$ gallons of a solution that is $30$ percent alcohol with $\frac{m}{n}$ gallons of a solution that is $80$ percent alcohol, where $m$ and $n$ are relatively prime positive integers. Mary and Sandra end up with solutions that are the same percent alcohol. Find $m + n$.

Prove that there are infinitely many coprime, positive integers $a,b$ such that $a$ divides $b^2 -5$ and $b$ divides $a^2 -5.$

Let $ABCD$ be a rectangle and $E$ be a point on segment $AD$. We are given that quadrilateral $BCDE$ has an inscribed circle $\omega_1$ that is tangent to $BE$ at $T$. If the incircle $\omega_2$ of $ABE$ is also tangent to $BE$ at $T$, then find the ratio of the radius of $\omega_1$ to the radius of $\omega_2$. [i]Proposed by James Lin.[/i]

Polynomial $P(x)$ with integer coefficients is given. For some positive integer $n$ numbers $P(0),P(1),\dots,P(2^n+1)$ are all divisible by $2^{2^n}$. Prove that values of $P(x)$ in all integer points are divisible by $2^{2^n}$.

Let $F_n$ be the set of all bijective functions $f:\left\{1,2,\ldots,n\right\}\rightarrow\left\{1,2,\ldots,n\right\}$ that satisfy the conditions: 1. $f(k)\leq k+1$ for all $k\in\left\{1,2,\ldots,n\right\}$ 2. $f(k)\neq k$ for all $k\in\left\{2,3,\ldots,n\right\}$ Find the probability that $f(1)\neq1$ for $f$ randomly chosen from $F_n$.

Let $k$ be a positive integer. Find all collection of integers $(a_1, a_2,\cdots, a_k)$ such that there exist a non-linear polynomial $P$ with integer coefficients, so that for all positive integers $n$ there exist a positive integer $m$ satisfying: $$P(n+a_1)+P(n+a_2)+...+P(n+a_k)=P(m)$$ [i]Proposed by Ivan Chan Kai Chin[/i]

The bisector of the angle $A$ of the triangle $ABC$ intersects the side $BC$ at $D$. A circle $c$ through the vertex $A$ touches the side $BC$ at $D$. Prove that the circumcircle of the triangle $ABC$ touches the circle $c$ at $A$.

Prove that for any integer $n\ge 6$ we can divide an equilateral triangle completely into $n$ smaller equilateral triangles.

Determine whether or nor there exist two disjoint infinite sets $ A$ and $ B$ of points in the plane satisfying the following conditions: a.) No three points in $ A \cup B$ are collinear, and the distance between any two points in $ A \cup B$ is at least 1. b.) There is a point of $ A$ in any triangle whose vertices are in $ B,$ and there is a point of $ B$ in any triangle whose vertices are in $ A.$

A sequence $a_n$ is defined by $$a_0=0,\qquad a_1=3;$$$$a_n=8a_{n-1}+9a_{n-2}+16\text{ for }n\ge2.$$Find the least positive integer $h$ such that $a_{n+h}-a_n$ is divisible by $1999$ for all $n\ge0$.

Let $f(x)$ be a monic cubic polynomial with $f(0)=-64$, and all roots of $f(x)$ are non-negative real numbers. What is the largest possible value of $f(-1)$? (A polynomial is monic if its leading coefficient is 1.)

How many $2$-digit factors does $555555$ have?