Determine all functions $f: \mathbb{R} \rightarrow \mathbb{R}$ such that $$f(xf(x-y))+yf(x)=x+y+f(x^2),$$ for all real numbers $x$ and $y.$

We call a tetrahedron right-faced if each of its faces is a right-angled triangle. [i](a)[/i] Prove that every orthogonal parallelepiped can be partitioned into six right-faced tetrahedra. [i](b)[/i] Prove that a tetrahedron with vertices $A_1,A_2,A_3,A_4$ is right-faced if and only if there exist four distinct real numbers $c_1, c_2, c_3$, and $c_4$ such that the edges $A_jA_k$ have lengths $A_jA_k=\sqrt{|c_j-c_k|}$ for $1\leq j < k \leq 4.$

Show that $\sigma (n) -d(m)$ is even for all positive integers $m$ and $n$ where $m$ is the largest odd divisor of $n$.

Octagon $A_1A_2A_3A_4A_5A_6A_7A_8$ is inscribed in a circle where $A_1A_2=A_2A_3=A_3A_4=A_6A_7=13$ and $A_4A_5=A_5A_6=A_7A_8=A_8A_1=5. $ The sum of all possible areas of $A_1A_2A_3A_4A_5A_6A_7A_8$ can be expressed as $a+b\sqrt{c}$ where $\gcd{a,b}=1$ and $c$ is squarefree. Find $abc.$ [asy] label("$A_1$",(5,0),E); label("$A_2$",(2.92, -4.05),SE); label("$A_3$",(-2.92,-4.05),SW); label("$A_4$",(-5,0),W); label("$A_5$",(-4.5,2.179),NW); label("$A_6$",(-3,4), NW); label("$A_7$",(3,4), NE); label("$A_8$",(4.5,2.179),NE); draw((5,0)--(2.9289,-4.05235)); draw((2.92898,-4.05325)--(-2.92,-4.05)); draw((-2.92,-4.05)--(-5,0)); draw((-5,0)--(-4.5, 2.179)); draw((-4.5, 2.179)--(-3,4)); draw((-3,4)--(3,4)); draw((3,4)--(4.5,2.179)); draw((4.5,2.179)--(5,0)); dot((0,0)); draw(circle((0,0),5)); [/asy]

A beam of light shines from point $L$, reflects off a reflector at point $S$, and reaches point $D$ so that $\overline{SD}$ is perpendicular to $\overline{ML}$. Then $x$ is [DIAGRAM NEEDED] $ \mathrm{(A) \ } 13^\circ \qquad \mathrm{(B) \ } 26^\circ \qquad \mathrm {(C) \ } 32^\circ \qquad \mathrm{(D) \ } 58^\circ \qquad \mathrm{(E) \ } 64^\circ$

Let $a_1, a_2... $ be an infinite sequence of real numbers such that $a_{n+1}=\sqrt{{a_n}^2+a_n-1}$. Prove that $a_1 \notin (-2,1)$ [i]Proposed by Oleg Mushkarov and Nikolai Nikolov [/i]

On each non-boundary unit segment of an $8\times 8$ chessboard, we write the number of dissections of the board into dominoes in which this segment lies on the border of a domino. What is the last digit of the sum of all the written numbers?

Let $k$ be a positive integer and let $S$ be a finite set of odd prime numbers. Prove that there is at most one way (up to rotation and reflection) to place the elements of $S$ around the circle such that the product of any two neighbors is of the form $x^2+x+k$ for some positive integer $x$.

Find the maximum value of $k$ for which one can choose $k$ integers out of $1,2... ,2n$ so that none of them divides another one.

A [i]lazy[/i] rook can only move from a square to a vertical or a horizontal neighbour. It follows a path which visits each square of an $8 \times 8$ chessboard exactly once. Prove that the number of such paths starting at a corner square is greater than the number of such paths starting at a diagonal neighbour of a corner square. [i](7 points)[/i]

Let $\Omega$ be the circumcircle of an acute-angled triangle $ABC$. Let $D$ be the midpoint of the minor arc $AB$ of $\Omega$. A circle $\omega$ centered at $D$ is tangent to $AB$ at $E$. The tangents to $\omega$ through $C$ meet the segment $AB$ at $K$ and $L$, where $K$ lies on the segment $AL$. A circle $\Omega_1$ is tangent to the segments $AL, CL$, and also to $ \Omega$ at point $M$. Similarly, a circle $\Omega_2$ is tangent to the segments $BK, CK$, and also to $\Omega$ at point $N$. The lines $LM$ and $KN$ meet at $P$. Prove that $\angle KCE = \angle LCP$. Poland

2017 prime numbers $p_1,...,p_{2017}$ are given. Prove that $\prod_{i<j} (p_i^{p_j}-p_j^{p_i})$ is divisible by 5777.

Let \(m\) be a positive integer. Find, in terms of \(m\), all polynomials \(P(x)\) with integer coefficients such that for every integer \(n\), there exists an integer \(k\) such that \(P(k)=n^m\). [i]Proposed by Raymond Feng[/i]

It is given that $2^{333}$ is a 101-digit number whose first digit is 1. How many of the numbers $2^k$, $1\le k\le 332$ have first digit 4?

Determine all tuples of integers $(a,b,c)$ such that: $$(a-b)^3(a+b)^2 = c^2 + 2(a-b) + 1$$

In a convex quadrilateral $ABCD$, $E$ is the intersection of $AB$ and $CD$, $F$ is the intersection of $AD$ and $BC$ and $G$ is the intersection of $AC$ and $EF$. Prove that the following two claims are equivalent: $(i)$ $BD$ and $EF$ are parallel. $(ii)$ $G$ is the midpoint of $EF$.

Consider the statement, "If $n$ is not prime, then $n-2$ is prime." Which of the following values of $n$ is a counterexample to this statement? $\textbf{(A) } 11 \qquad \textbf{(B) } 15 \qquad \textbf{(C) } 19 \qquad \textbf{(D) } 21 \qquad \textbf{(E) } 27$

[b]U[/b]ndecillion years ago in a galaxy far, far away, there were four space stations in the three-dimensional space, each pair spaced 1 light year away from each other. Admiral Ackbar wanted to establish a base somewhere in space such that the sum of squares of the distances from the base to each of the stations does not exceed 15 square light years. (The sizes of the space stations and the base are negligible.) Determine the volume, in cubic light years, of the set of all possible locations for the Admiral’s base.

Let $\Delta ABC$ be a triangle with $AB=AC$ and $\angle A = \alpha$, and let $O,H$ be its circumcenter and orthocenter, respectively. If $P,Q$ are points on $AB$ and $AC$, respectively, such that $APHQ$ forms a rhombus, determine $\angle POQ$ in terms of $\alpha$.

Let $\gamma,\Gamma$ be two concentric circles with radii $r,R$ with $r<R$. Let $ABCD$ be a cyclic quadrilateral inscribed in $\gamma$. If $\overrightarrow{AB}$ denotes the Ray starting from $A$ and extending indefinitely in $B's$ direction then Let $\overrightarrow{AB}, \overrightarrow{BC}, \overrightarrow{CD} , \overrightarrow{DA}$ meet $\Gamma$ at the points $C_1,D_1,A_1,B_1$ respectively. Prove that \[\frac{[A_1B_1C_1D_1]}{[ABCD]} \ge \frac{R^2}{r^2}\] where $[.]$ denotes area.

Prove that there is no natural $n$ such that $8n + 7$ is the sum of three squares.

We call number as funny if it divisible by sum its digits $+1$.(for example $ 1+2+1|12$ ,so $12$ is funny) What is maximum number of consecutive funny numbers ? [i] O. Podlipski [/i]

If $a$ , $b$ are integers and $s=a^3+b^3-60ab(a+b)\geq 2012$ , find the least possible value of $s$.

Let $ a, b, c$ be positive real numbers such that \[ a+b+c=\frac{1}{a^2} + \frac{1}{b^2} + \frac{1}{c^2} . \] Prove that \[ 2(a+b+c) \ge \sqrt[3]{7 a^2 b +1 } + \sqrt[3]{7 b^2 c +1 } + \sqrt[3]{7 c^2 a +1 } . \] Find all triples $ (a,b,c) $ for which equality holds.

[u]Set 6[/u] [b]B16.[/b] Let $\ell_r$ denote the line $x + ry + r^2 = 420$. Jeffrey draws the lines $\ell_a$ and $\ell_b$ and calculates their single intersection point. [b]B17.[/b] Let set $L$ consist of lines of the form $3x + 2ay = 60a + 48$ across all real constants a. For every line $\ell$ in $L$, the point on $\ell$ closest to the origin is in set $T$ . The area enclosed by the locus of all the points in $T$ can be expressed in the form nπ for some positive integer $n$. Compute $n$. [b]B18.[/b] What is remainder when the $2020$-digit number $202020 ... 20$ is divided by $275$? [u]Set 7[/u] [b]B19.[/b] Consider right triangle $\vartriangle ABC$ where $\angle ABC = 90^o$, $\angle ACB = 30^o$, and $AC = 10$. Suppose a beam of light is shot out from point $A$. It bounces off side $BC$ and then bounces off side $AC$, and then hits point $B$ and stops moving. If the beam of light travelled a distance of $d$, then compute $d^2$. [b]B20.[/b] Let $S$ be the set of all three digit numbers whose digits sum to $12$. What is the sum of all the elements in $S$? [b]B21.[/b] Consider all ordered pairs $(m, n)$ where $m$ is a positive integer and $n$ is an integer that satisfy $$m! = 3n^2 + 6n + 15,$$ where $m! = m \times (m - 1) \times ... \times 1$. Determine the product of all possible values of $n$. [u]Set 8[/u] [b]B22.[/b] Compute the number of ordered pairs of integers $(m, n)$ satisfying $1000 > m > n > 0$ and $6 \cdot lcm(m - n, m + n) = 5 \cdot lcm(m, n)$. [b]B23.[/b] Andrew is flipping a coin ten times. After every flip, he records the result (heads or tails). He notices that after every flip, the number of heads he had flipped was always at least the number of tails he had flipped. In how many ways could Andrew have flipped the coin? [b]B24.[/b] Consider a triangle $ABC$ with $AB = 7$, $BC = 8$, and $CA = 9$. Let $D$ lie on $\overline{AB}$ and $E$ lie on $\overline{AC}$ such that $BCED$ is a cyclic quadrilateral and $D, O, E$ are collinear, where $O$ is the circumcenter of $ABC$. The area of $\vartriangle ADE$ can be expressed as $\frac{m\sqrt{n}}{p}$, where $m$ and $p$ are relatively prime positive integers, and $n$ is a positive integer not divisible by the square of any prime. What is $m + n + p$? [u]Set 9[/u] [i]This set consists of three estimation problems, with scoring schemes described.[/i] [b]B25.[/b] Submit one of the following ten numbers: $$3 \,\,\,\, 6\,\,\,\, 9\,\,\,\, 12\,\,\,\, 15\,\,\,\, 18\,\,\,\, 21\,\,\,\, 24\,\,\,\, 27\,\,\,\, 30.$$ The number of points you will receive for this question is equal to the number you selected divided by the total number of teams that selected that number, then rounded up to the nearest integer. For example, if you and four other teams select the number $27$, you would receive $\left\lceil \frac{27}{5}\right\rceil = 6$ points. [b]B26.[/b] Submit any integer from $1$ to $1,000,000$, inclusive. The standard deviation $\sigma$ of all responses $x_i$ to this question is computed by first taking the arithmetic mean $\mu$ of all responses, then taking the square root of average of $(x_i -\mu)^2$ over all $i$. More, precisely, if there are $N$ responses, then $$\sigma =\sqrt{\frac{1}{N} \sum^N_{i=1} (x_i -\mu)^2}.$$ For this problem, your goal is to estimate the standard deviation of all responses. An estimate of $e$ gives $\max \{ \left\lfloor 130 ( min \{ \frac{\sigma }{e},\frac{e}{\sigma }\}^{3}\right\rfloor -100,0 \}$ points. [b]B27.[/b] For a positive integer $n$, let $f(n)$ denote the number of distinct nonzero exponents in the prime factorization of $n$. For example, $f(36) = f(2^2 \times 3^2) = 1$ and $f(72) = f(2^3 \times 3^2) = 2$. Estimate $N = f(2) + f(3) +.. + f(10000)$. An estimate of $e$ gives $\max \{30 - \lfloor 7 log_{10}(|N - e|)\rfloor , 0\}$ points. PS. You had better use hide for answers. First sets have been posted [url=https://artofproblemsolving.com/community/c4h2777391p24371239]here[/url]. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].