Let $\mathbb{R}$ denote the set of the reals. Find all $f : \mathbb{R} \to \mathbb{R}$ such that $$ f(x)f(y) = xf(f(y-x)) + xf(2x) + f(x^2) $$ for all real $x, y$.

What is the maximal number of regions a circle can be divided in by segments joining $n$ points on the boundary of the circle ? [i]Posted already on the board I think...[/i]

Determine all triples $(m , n , p)$ satisfying : \[n^{2p}=m^2+n^2+p+1\] where $m$ and $n$ are integers and $p$ is a prime number.

[i]Mediovagio[/i] is a computer game that consists in a $3 \times 3$ table in which each of the nine cells has a integer number from $1$ to $n$. When one clicks a cell, the numbers in the clicked cell and in the cells that share an edge with it are increased by $1$ and the sum is evaluated${}\bmod n$. Determine the values of $n$ for which it's possible, with a finite number of clicks, obtain any combination of numbers from an given initial combination. EDIT: I corrected the statement.

A train car held $6000$ pounds of mud which was $88$ percent water. Then the train car sat in the sun, and some of the water evaporated so that now the mud is only $82$ percent water. How many pounds does the mud weigh now?

Let $a,b,c$ be sides of a triangle and $p$ its semiperimeter. Show that $a\sqrt{\frac{(p-b)(p-c)}{bc}}+b \sqrt{\frac{(p-c)(p-a)}{ac}}+c\sqrt{\frac{(p-a)(p-b)}{ab}}\geq p$

As shown in the figure, it is known that the quadrilateral $ABCD$ satisfies $\angle ADB = \angle ACB = 90^o$. Suppose $AC$ and $BD$ intersect at point $P$, point $R$ lies on $CD$ and $RP \perp AB$. $M$ and $N$ are the midpoints of $AB$ and $CD$ respectively. Point $K$ is a point on the extension line of $NM$, the circumscribed circles of $\vartriangle DKC$ and $\vartriangle AKB$ intersect at point $S$. Prove that $KS \perp SR$. [img]https://cdn.artofproblemsolving.com/attachments/5/d/fc0a391f8ebcdee792e9b226cbf55a058251a1.png[/img]

Given is triangle $ABC$ with an inscribed circle with center $M$ and radius $r$. The tangent to this circle parallel to $BC$ intersects $AC$ in $D$ and $AB$ in $E$. The tangent to this circle parallel to $AC$ intersects $AB$ in $F$ and $BC$ in $G$. The tangent to this circle parallel to $AB$ intersects $BC$ in $H$ and $AC$ in $K$. Name the centers of the inscribed circles of triangle $AED$, triangle $FBG$ and triangle $KHC$ successively $M_A, M_B, M_C$ and the rays successively $r_A, r_B$ and $r_C$. Prove that $r_A + r_B + r_C = r$.

How many integers greater than $10$ and less than $100$, written in base-$10$ notation, are increased by $9$ when their digits are reversed? $\textbf{(A)}\ 0 \qquad \textbf{(B)}\ 1 \qquad \textbf{(C)}\ 8 \qquad \textbf{(D)}\ 9 \qquad \textbf{(E)}\ 10$

In an acute-angled triangle $ABC$, the altitudes from $A,B,C$ meet the sides of $ABC$ at $A_1$, $B_1$, $C_1$, and meet the circumcircle of $ABC$ at $A_2$, $B_2$, $C_2$, respectively. Line $A_1 C_1$ intersects the circumcircles of triangles $AC_1 C_2$ and $CA_1 A_2$ at points $P$ and $Q$ ($Q\neq A_1$, $P\neq C_1$). Prove that the circle $PQB_1$ touches the line $AC$.

Let $G$ be a finite simple graph and let $k$ be the largest number of vertices of any clique in $G$. Suppose that we label each vertex of $G$ with a non-negative real number, so that the sum of all such labels is $1$. Define the [i]value of an edge[/i] to be the product of the labels of the two vertices at its ends. Define the [i]value of a labelling[/i] to be the sum of values of the edges. Prove that the maximum possible value of a labelling of $G$ is $\frac{k-1}{2k}$. (A [i]finite simple graph[/i] is a graph with finitely many vertices, in which each edge connects two distinct vertices and no two edges connect the same two vertices. A [i]clique[/i] in a graph is a set of vertices in which any two are connected by an edge.)

Find all function $ f: \mathbb{N}\rightarrow\mathbb{N}$ satisfy $ f(mn)\plus{}f(m\plus{}n)\equal{}f(m)f(n)\plus{}1$ for all natural number $ n$

Suppose that a rectangle with sides $ a$ and $ b$ is arbitrarily cut into $ n$ squares with sides $ x_{1},\ldots,x_{n}$. Show that $ \frac{x_{i}}{a}\in\mathbb{Q}$ and $ \frac{x_{i}}{b}\in\mathbb{Q}$ for all $ i\in\{1,\cdots, n\}$.

Lucy starts by writing $s$ integer-valued $2022$-tuples on a blackboard. After doing that, she can take any two (not necessarily distinct) tuples $\mathbf{v}=(v_1,\ldots,v_{2022})$ and $\mathbf{w}=(w_1,\ldots,w_{2022})$ that she has already written, and apply one of the following operations to obtain a new tuple: \begin{align*} \mathbf{v}+\mathbf{w}&=(v_1+w_1,\ldots,v_{2022}+w_{2022}) \\ \mathbf{v} \lor \mathbf{w}&=(\max(v_1,w_1),\ldots,\max(v_{2022},w_{2022})) \end{align*} and then write this tuple on the blackboard. It turns out that, in this way, Lucy can write any integer-valued $2022$-tuple on the blackboard after finitely many steps. What is the smallest possible number $s$ of tuples that she initially wrote?

There are $ 2010 $ people sitting around a round table. First, we give one person $ x $ a candy. Next, we give candies to $1$ st person, $1+2$ th person, $ 1+2+3$ th person, $\cdots$ , and $1+2+\cdots + 2009 $ th person clockwise from $ x $. Find the number of people who get at least one candy.

Let $ ABC$ be an acute triangle. Points $ D$, $ E$, and $ F$ lie on segments $ BC$, $ CA$, and $ AB$, respectively, and each of the three segments $ AD$, $ BE$, and $ CF$ contains the circumcenter of $ ABC$. Prove that if any two of the ratios $ \frac{BD}{DC}$, $ \frac{CE}{EA}$, $ \frac{AF}{FB}$, $ \frac{BF}{FA}$, $ \frac{AE}{EC}$, $ \frac{CD}{DB}$ are integers, then triangle $ ABC$ is isosceles.

Let $\Delta ABC$ be a triangle. The internal bisectors of angles $\angle CAB$ and $\angle ABC$ intersect segments $BC$, respectively $AC$ in $D$, respectively $E$. Prove that \[DE\leq (3-2\sqrt{2})(AB+BC+CA).\]

$a_{1},a_{2},\dots,a_{100}$ are real numbers such that:\[ a_{1}\geq a_{2}\geq\dots\geq a_{100}\geq0\] \[ a_{1}^{2}+a_{2}^{2}\geq100\] \[ a_{3}^{2}+a_{4}^{2}+\dots+a_{100}^{2}\geq100\] What is the minimum value of sum $a_{1}+a_{2}+\dots+a_{100}.$

The monic polynomial $P(x) = x^n + a_{n-1}x^{n-1} +...+ a_0$ of degree $n > 1$ has $n$ distinct negative roots. Prove that $a_1P(1) > 2n^2a_o$

[u]Round 5[/u] [b]p13.[/b] Sally is at the special glasses shop, where there are many different optical lenses that distort what she sees and cause her to see things strangely. Whenever she looks at a shape through lens $A$, she sees a shape with $2$ more sides than the original (so a square would look like a hexagon). When she looks through lens $B$, she sees the shape with $3$ fewer sides (so a hexagon would look like a triangle). How many sides are in the shape that has $200$ more diagonals when looked at from lense $A$ than from lense $B$? [b]p14.[/b] How many ways can you choose $2$ cells of a $5$ by $5$ grid such that they aren't in the same row or column? [b]p15.[/b] If $a + \frac{1}{b} = (2015)^{-1}$ and $b + \frac{1}{a} = (2016)^2$ then what are all the possible values of $b$? [u]Round 6[/u] [b]p16.[/b] In Canadian football, linebackers must wear jersey numbers from $30 -35$ while defensive linemen must wear numbers from $33 -38$ (both intervals are inclusive). If a team has $5$ linebackers and $4$ defensive linemen, how many ways can it assign jersey numbers to the $9$ players such that no two people have the same jersey number? [b]p17.[/b] What is the maximum possible area of a right triangle with hypotenuse $8$? [b]p18.[/b] $9$ people are to play touch football. One will be designated the quarterback, while the other eight will be divided into two (indistinct) teams of $4$. How many ways are there for this to be done? [u]Round 7[/u] [b]p19.[/b] Express the decimal $0.3$ in base $7$. [b]p20.[/b] $2015$ people throw their hats in a pile. One at a time, they each take one hat out of the pile so that each has a random hat. What is the expected number of people who get their own hat? [b]p21.[/b] What is the area of the largest possible trapezoid that can be inscribed in a semicircle of radius $4$? [u]Round 8[/u] [b]p22.[/b] What is the base $7$ expression of $1211_3 \cdot 1110_2 \cdot 292_{11} \cdot 20_3$ ? [b]p23.[/b] Let $f(x)$ equal the ratio of the surface area of a sphere of radius $x$ to the volume of that same sphere. Let $g(x)$ be a quadratic polynomial in the form $x^2 + bx + c$ with $g(6) = 0$ and the minimum value of $g(x)$ equal to $c$. Express $g(x)$ as a function of $f(x)$ (e.g. in terms of $f(x)$). [b]p24.[/b] In the country of Tahksess, the income tax code is very complicated. Citizens are taxed $40\%$ on their first $\$20, 000$ and $45\%$ on their next $\$40, 000$ and $50\%$ on their next $\$60, 000$ and so on, with each $5\%$ increase in tax rate aecting $\$20, 000$ more than the previous tax rate. The maximum tax rate, however, is $90\%$. What is the overall tax rate (percentage of money owed) on $1$ million dollars in income? PS. You should use hide for answers. Rounds 1-4 have been posted [url=https://artofproblemsolving.com/community/c3h3157009p28696627]here [/url] and 9-12 [url=https://artofproblemsolving.com/community/c3h3158564p28715928]here[/url]. .Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

There are 100 students taking an exam. The professor calls them one by one and asks each student a single person question: “How many of 100 students will have a “passed” mark by the end of this exam?” The students answer must be an integer. Upon receiving the answer, the professor immediately publicly announces the student’s mark which is either “passed” or “failed.” After all the students have got their marks, an inspector comes and checks if there is any student who gave the correct answer but got a “failed” mark. If at least one such student exists, then the professor is suspended and all the marks are replaced with “passed.” Otherwise no changes are made. Can the students come up with a strategy that guarantees a “passed” mark to each of them? [i] Denis Afrizonov [/i]

Assume that $C$ is a right angle of triangle $ABC$ and $N$ is a midpoint of the semicircle, constructed on $CB$ as on diameter externally. Prove that $AN$ divides the bisector of angle $C$ in half.

$23$ frat brothers are sitting in a circle. One, call him Alex, starts with a gallon of water. On the first turn, Alex gives each person in the circle some rational fraction of his water. On each subsequent turn, every person with water uses the same scheme as Alex did to distribute his water, but in relation to themselves. For instance, suppose Alex gave $\frac{1}{2}$ and $\frac{1}{6}$ of his water to his left and right neighbors respectively on the first turn and kept $\frac{1}{3}$ for himself. On each subsequent turn everyone gives $\frac{1}{2}$ and $\frac{1}{6}$ of the water they started the turn with to their left and right neighbors, respectively, and keep the final third for themselves. After $23$ turns, Alex again has a gallon of water. What possibilities are there for the scheme he used in the first turn? (Note: you may find it useful to know that $1+x+x^2+\cdot +x^{23}$ has no polynomial factors with rational coefficients)

We call an integer $ n > 1$ [i]good[/i] if, for any natural numbers $ 1 \le b_1, b_2, \ldots , b_{n\minus{}1} \le n \minus{} 1$ and any $ i \in \{0, 1, \ldots , n \minus{} 1\}$, there is a subset $ I$ of $ \{1, \ldots , n \minus{} 1\}$ such that $ \sum_{k\in I} b_k \equiv i \pmod n$. (The sum over the empty set is zero.) Find all good numbers.

Let $a,b,c$ be positive real numbers such that $abc(a+b+c)=3.$ Prove that we have \[(a+b)(b+c)(c+a)\geq 8.\] Also determine the case of equality.