$777$ pairwise distinct complex numbers are written on a board. It turns out that there are exactly 760 ways to choose two numbers \(a\) and \(b\) from the board such that: \[ a^2 + b^2 + 1 = 2ab \] Ways that differ by the order of selection are considered the same. Prove that there exist two numbers \(c\) and \(d\) from the board such that: \[ c^2 + d^2 + 2025 = 2cd \]

Suppose that a sequence $x_1,x_2,\ldots,x_{2001}$ of positive real numbers satisfies $$3x^2_{n+1}=7x_nx_{n+1}-3x_{n+1}-2x^2_n+x_n\enspace\text{ and }\enspace x_{37}=x_{2001}.$$Find the maximum possible value of $x_1$.

Find all polynomials $ p$ of one variable with integer coefficients such that if $ a$ and $ b$ are natural numbers such that $ a \plus{} b$ is a perfect square, then $ p\left(a\right) \plus{} p\left(b\right)$ is also a perfect square.

Factorise $$(a+2b-3c)^3+(b+2c-3a)^3+(c+2a-3b)^3$$

Let $a$, $b$ be two distinct real numbers and let $c$ be a positive real numbers such that $a^4 - 2019a = b^4 - 2019b = c$. Prove that $- \sqrt{c} < ab < 0$.

Let $ p,q,r$ be distinct real numbers that satisfy: $ q\equal{}p(4\minus{}p), \, r\equal{}q(4\minus{}q), \, p\equal{}r(4\minus{}r).$ Find all possible values of $ p\plus{}q\plus{}r$.

Let $(x_n)_{n\ge2}$ be a sequence of real numbers such that $x_2>0$ and $x_{n+1}=-1+\sqrt[n]{1+nx_n}$ for $n\ge2$. Find (a) $\lim_{n\to\infty}x_n$, (b) $\lim_{n\to\infty}nx_n$.

Find all non decreasing functions or non increasing function $f \colon \mathbb{R} \to \mathbb{R}$ such that for all $x,y \in \mathbb{R}$ $$ f(x+f(y))=f(x)+f(y) \text{ or } f(f(f(x)))+y$$ .

Prove that the equation \[ x^n + 1 = y^{n+1}, \] where $n$ is a positive integer not smaller then 2, has no positive integer solutions in $x$ and $y$ for which $x$ and $n+1$ are relatively prime.

Determine all real numbers $x > 1, y > 1$, and $z > 1$,satisfying the equation $x+y+z+\frac{3}{x-1}+\frac{3}{y-1}+\frac{3}{z-1}=2(\sqrt{x+2}+\sqrt{y+2}+\sqrt{z+2})$

In what case does the system of equations $\begin{matrix} x + y + mz = a \\ x + my + z = b \\ mx + y + z = c \end{matrix}$ have a solution? Find conditions under which the unique solution of the above system is an arithmetic progression.

[b]p1.[/b] What is the slope of the line perpendicular to the the graph $\frac{x}{4}+\frac{y}{9}= 1$ at $(0, 9)$? [b]p2.[/b] A boy is standing in the middle of a very very long staircase and he has two pogo sticks. One pogo stick allows him to jump $220$ steps up the staircase. The second pogo stick allows him to jump $125$ steps down the staircase. What is the smallest positive number of steps that he can reach from his original position by a series of jumps? [b]p3.[/b] If you roll three fair six-sided dice, what is the probability that the product of the results will be a multiple of $3$? [b]p4.[/b] Right triangle $ABC$ has squares $ABXY$ and $ACWZ$ drawn externally to its legs and a semicircle drawn externally to its hypotenuse $BC$. If the area of the semicircle is $18\pi$ and the area of triangle $ABC$ is $30$, what is the sum of the areas of squares $ABXY$ and $ACWZ$? [img]https://cdn.artofproblemsolving.com/attachments/5/1/c9717e7731af84e5286335420b73b974da2643.png[/img] [b]p5.[/b] You have a bag containing $3$ types of pens: red, green, and blue. $30\%$ of the pens are red pens, and $20\%$ are green pens. If, after you add $10$ blue pens, $60\%$ of the pens are blue pens, how many green pens did you start with? [b]p6.[/b] Canada gained partial independence from the United Kingdom in $1867$, beginning its long role as the headgear of the United States. It gained its full independence in $1982$. What is the last digit of $1867^{1982}$? [b]p7.[/b] Bacon, Meat, and Tomato are dealing with paperwork. Bacon can fill out $5$ forms in $3$ minutes, Meat can fill out $7$ forms in $5$ minutes, and Tomato can staple $3$ forms in $1$ minute. A form must be filled out and stapled together (in either order) to complete it. How long will it take them to complete $105$ forms? [b]p8.[/b] Nice numbers are defined to be $7$-digit palindromes that have no $3$ identical digits (e.g., $1234321$ or $5610165$ but not $7427247$). A pretty number is a nice number with a $7$ in its decimal representation (e.g., $3781873$). What is the $7^{th}$ pretty number? [b]p9.[/b] Let $O$ be the center of a semicircle with diameter $AD$ and area $2\pi$. Given square $ABCD$ drawn externally to the semicircle, construct a new circle with center $B$ and radius $BO$. If we extend $BC$, this new circle intersects $BC$ at $P$. What is the length of $CP$? [img]https://cdn.artofproblemsolving.com/attachments/b/1/be15e45cd6465c7d9b45529b6547c0010b8029.png[/img] [b]p10.[/b] Derek has $10$ American coins in his pocket, summing to a total of $53$ cents. If he randomly grabs $3$ coins from his pocket, what is the probability that they're all different? [b]p11.[/b] What is the sum of the whole numbers between $6\sqrt{10}$ and $7\pi$ ? [b]p12.[/b] What is the volume of a cylinder whose radius is equal to its height and whose surface area is numerically equal to its volume? [b]p13.[/b] $15$ people, including Luke and Matt, attend a Berkeley Math meeting. If Luke and Matt sit next to each other, a fight will break out. If they sit around a circular table, all positions equally likely, what is the probability that a fight doesn't break out? [b]p14.[/b] A non-degenerate square has sides of length $s$, and a circle has radius $r$. Let the area of the square be equal to that of the circle. If we have a rectangle with sides of lengths $r$, $s$, and its area has an integer value, what is the smallest possible value for $s$? [b]p15.[/b] How many ways can you arrange the letters of the word "$BERKELEY$" such that no two $E$'s are next to each other? [b]p16.[/b] Kim, who has a tragic allergy to cake, is having a birthday party. She invites $12$ people but isn't sure if $11$ or $12$ will show up. However, she needs to cut the cake before the party starts. What is the least number of slices (not necessarily of equal size) that she will need to cut to ensure that the cake can be equally split among either $11$ or $12$ guests with no excess? [b]p17.[/b] Tom has $2012$ blue cards, $2012$ red cards, and $2012$ boxes. He distributes the cards in such a way such that each box has at least $1$ card. Sam chooses a box randomly, then chooses a card randomly. Suppose that Tom arranges the cards such that the probability of Sam choosing a blue card is maximized. What is this maximum probability? [b]p18.[/b] Allison wants to bake a pie, so she goes to the discount market with a handful of dollar bills. The discount market sells different fruit each for some integer number of cents and does not add tax to purchases. She buys $22$ apples and $7$ boxes of blueberries, using all of her dollar bills. When she arrives back home, she realizes she needs more fruit, though, so she grabs her checkbook and heads back to the market. This time, she buys $31$ apples and $4$ boxes of blueberries, for a total of $60$ cents more than her last visit. Given she spent less than $100$ dollars over the two trips, how much (in dollars) did she spend on her first trip to the market? [b]p19.[/b] Consider a parallelogram $ABCD$. Let $k$ be the line passing through A and parallel to the bisector of $\angle ABC$, and let $\ell$ be the bisector of $\angle BAD$. Let $k$ intersect line $CD$ at $E$ and $\ell$ intersect line $CD$ at $F$. If $AB = 13$ and $BC = 37$, find the length $EF$. [b]p20.[/b] Given for some real $a, b, c, d,$ $$P(x) = ax^4 + bx^3 + cx^2 + dx$$ $$P(-5) = P(-2) = P(2) = P(5) = 1$$ Find $P(10).$ PS. You had better use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Consider two parabolas $y = x^2$ and $y = x^2 - 1$. Let $U$ be the set of points between the parabolas (including the points on the parabolas themselves). Does $U$ contain a line segment of length greater than $10^6$ ? Alexey Tolpygo

Each square of a $(2^n-1) \times (2^n-1)$ board contains either $1$ or $-1$. Such an arrangement is called [i]successful[/i] if each number is the product of its neighbors. Find the number of successful arrangements.

Two men set out at the same time to walk towards each other from $ M$ and $ N$, $ 72$ miles apart. The first man walks at the rate of $ 4$ mph. The second man walks $ 2$ miles the first hour, $ 2\frac {1}{2}$ miles the second hour, $ 3$ miles the third hour, and so on in arithmetic progression. Then the men will meet: $ \textbf{(A)}\ \text{in 7 hours} \qquad \textbf{(B)}\ \text{in }{8\frac {1}{4}}\text{ hours}\qquad \textbf{(C)}\ \text{nearer }{M}\text{ than }{N}\qquad \\ \textbf{(D)}\ \text{nearer }{N}\text{ than }{M}\qquad \textbf{(E)}\ \text{midway between }{M}\text{ and }{N}$

[b]p1.[/b] Trung has $2$ bells. One bell rings $6$ times per hour and the other bell rings $10$ times per hour. At the start of the hour both bells ring. After how much time will the bells ring again at the same time? Express your answer in hours. [b]p2.[/b] In a soccer tournament there are $n$ teams participating. Each team plays every other team once. The matches can end in a win for one team or in a draw. If the match ends with a win, the winner gets $3$ points and the loser gets $0$. If the match ends in a draw, each team gets $1$ point. At the end of the tournament the total number of points of all the teams is $21$. Let $p$ be the number of points of the team in the first place. Find $n + p$. [b]p3.[/b] What is the largest $3$ digit number $\overline{abc}$ such that $b \cdot \overline{ac} = c \cdot \overline{ab} + 50$? [b]p4.[/b] Let s(n) be the number of quadruplets $(x, y, z, t)$ of positive integers with the property that $n = x + y + z + t$. Find the smallest $n$ such that $s(n) > 2014$. [b]p5.[/b] Consider a decomposition of a $10 \times 10$ chessboard into p disjoint rectangles such that each rectangle contains an integral number of squares and each rectangle contains an equal number of white squares as black squares. Furthermore, each rectangle has different number of squares inside. What is the maximum of $p$? [b]p6.[/b] If two points are selected at random from a straight line segment of length $\pi$, what is the probability that the distance between them is at least $\pi- 1$? [b]p7.[/b] Find the length $n$ of the longest possible geometric progression $a_1, a_2,..,, a_n$ such that the $a_i$ are distinct positive integers between $100$ and $2014$ inclusive. [b]p8.[/b] Feng is standing in front of a $100$ story building with two identical crystal balls. A crystal ball will break if dropped from a certain floor $m$ of the building or higher, but it will not break if it is dropped from a floor lower than $m$. What is the minimum number of times Feng needs to drop a ball in order to guarantee he determined $m$ by the time all the crystal balls break? [b]p9.[/b] Let $A$ and $B$ be disjoint subsets of $\{1, 2,..., 10\}$ such that the product of the elements of $A$ is equal to the sum of the elements in $B$. Find how many such $A$ and $B$ exist. [b]p10.[/b] During the semester, the students in a math class are divided into groups of four such that every two groups have exactly $2$ students in common and no two students are in all the groups together. Find the maximum number of such groups. PS. You had better use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Determine all triples of real numbers $(x, y, z)$ which satisfy the following system of equations: \[ \begin{cases} x+y+z=0 \\ x^3+y^3+z^3 = 90 \\ x^5+y^5+z^5=2850. \end{cases} \]

Several paper-made disks (not necessarily equal) are put on the table so that there is some overlapping, but no disk is entirely inside another. The parts that overlap are cut off and removed. Show that the remaining parts cannot be assembled so as to form different disks.

The numbers $x, y, z, t, a$ and $b$ are positive integers, so that $xt-yz = 1$ and $$\frac{x}{y} \ge \frac{a}{b} \ge \frac{z}{t} .$$Prove that $$ab \le (x + z) (y +t)$$

Consider three sequences $(a_n)_{n=1}^{^\infty}$, $(b_n)_{n=1}^{^\infty}$ , $(c_n)_{n=1}^{^\infty}$, each of which has pairwisedistinct terms. Prove that there exist two indices $k$ and $l$ for which $k < l$, $$a_k < a_l , b_k < b_l , \,\,\, and \,\,\, c_k < c_l.$$

Find functions $ f: \mathbb{N} \rightarrow \mathbb{N}$, such that $ f(x^2 \plus{} f(y)) \equal{} xf(x) \plus{} y$, for $ x,y \in \mathbb{N}$.

The polynomial $P$ of degree $n$ satisfies $P(k) = \frac{k}{k +1}$ for $k = 0,1,2,...,n$. Find $P(n+1)$.

Let $a, b$ and $c$ be positive real numbers such that $abc = 1$. Prove the inequality $\Big(ab + bc +\frac{1}{ca}\Big)\Big(bc + ca +\frac{1}{ab}\Big)\Big(ca + ab +\frac{1}{bc}\Big)\ge (1 + 2a)(1 + 2b)(1 + 2c)$.

Prove that there does not exist a polynomial $P (x)$ with integer coefficients and a natural number $m$ such that $$x^m + x + 2 = P(P(x))$$ holds for all integers $x$.

Let $p > 3$ be a given prime number. For a set $S \subseteq \mathbb{Z}$ and $a \in \mathbb{N}$ , define $S_a = \{ x \in \{ 0,1, 2,...,p-1 \}$ | $(\exists_s \in S) x \equiv_p a \cdot s \}$ . $(a)$ How many sets $S \subseteq \{ 1, 2,...,p-1 \} $ are there for which the sequence $S_1 , S_2 , ..., S_{p-1}$ contains exactly two distinct terms? $(b)$ Determine all numbers $k \in \mathbb{N}$ for which there is a set $ S \subseteq \{ 1, 2,...,p-1 \} $ such that the sequence $S_1 , S_2 , ..., S_{p-1} $ contains exactly $k$ distinct terms. [i]Proposed by Milan Basic and Milos Milosavljevic[/i]