Consider the equation \[(3x^3+xy^2)(x^2y+3y^3)=(x-y)^7\] (a) Prove that there are infinitely many pairs $(x,y)$ of positive integers satisfying the equation. (b) Describe all pairs $(x,y)$ of positive integers satisfying the equation.

Problem Shortlist BMO 2017 Let $ a $,$ b$,$ c$, be positive real numbers such that $abc= 1 $. Prove that $$\frac{1}{a^{5}+b^{5}+c^{2}}+\frac{1}{b^{5}+c^{5}+a^{2}}+\frac{1}{c^{5}+b^{5}+b^{2}}\leq 1 . $$

Let $\mathbb{N}$ denote the set of positive integers. Find all functions $f:\mathbb{N}\longrightarrow\mathbb{N}$ such that \[n+f(m)\mid f(n)+nf(m)\] for all $m,n\in \mathbb{N}$ [i]Proposed by Dorlir Ahmeti, Albania[/i]

For every $ 0 \le i \le 17$, $ a_i \equal{} \{ \minus{} 1, 0, 1\}$. How many $ (a_0,a_1, \dots , a_{17})$ $ 18 \minus{}$tuples are there satisfying : $ a_0 \plus{} 2a_1 \plus{} 2^2a_2 \plus{} \cdots \plus{} 2^{17}a_{17} \equal{} 2^{10}$ $\textbf{(A)}\ 9 \qquad\textbf{(B)}\ 8 \qquad\textbf{(C)}\ 7 \qquad\textbf{(D)}\ 4 \qquad\textbf{(E)}\ 1$

Let $k\geq 2$ be a positive integer and $x_1,x_2,\dots ,x_k\in (0,1)$. Also, let $m_1,m_2,\dots ,m_k$ and $n_1,n_2,\dots ,n_k$ be integers. Define $$A=x_1^{m_1}x_2^{m_2}\dots x_k^{m_k},\quad B=x_1^{n_1}x_2^{n_2}\dots x_k^{n_k}.$$ Let $$C=x_1^{\min(m_1,n_1)}x_2^{\min(m_2,n_2)}\dots x_k^{\min(m_k,n_k)}$$ $$D=x_1^{\max(m_1,n_1)}x_2^{\max(m_2,n_2)}\dots x_k^{\max(m_k,n_k)}.$$ Prove that $A+B\leq C+D$. When does equality hold? [i]Dorel Miheț[/i]

Find the smallest term of the sequence $a_1, a_2, a_3, \ldots$ defined by $a_1=2014^{2015^{2016}}$ and $$ a_{n+1}= \begin{cases} \frac{a_n}{2} & \text{ if } a_n \text{ is even} \\ a_n + 7 & \text{ if } a_n \text{ is odd} \\ \end{cases} $$

A graph $G(V,E)$ is triangle-free, but adding any edges to the graph will form a triangle. It's given that $|V|=2019$, $|E|>2018$, find the minimum of $|E|$ .

Let $a$ be a fixed positive integer and $(e_n)$ the sequence, which is defined by $e_0=1$ and $$ e_n=a + \prod_{k=0}^{n-1} e_k$$ for $n \geq 1$. Prove that (a) There exist infinitely many prime numbers that divide one element of the sequence. (b) There exists one prime number that does not divide an element of the sequence. (Theresia Eisenkölbl)

Let $a,b,c,d$ real numbers such that: $$ a+b+c+d=0 \text{ and } a^2+b^2+c^2+d^2 = 12 $$ Find the minimum and maximum possible values for $abcd$, and determine for which values of $a,b,c,d$ the minimum and maximum are attained.

Consider an acute-angled triangle $ABC$ with $AB<AC$ and let $\omega$ be its circumscribed circle. Let $t_B$ and $t_C$ be the tangents to the circle $\omega$ at points $B$ and $C$, respectively, and let $L$ be their intersection. The straight line passing through the point $B$ and parallel to $AC$ intersects $t_C$ in point $D$. The straight line passing through the point $C$ and parallel to $AB$ intersects $t_B$ in point $E$. The circumcircle of the triangle $BDC$ intersects $AC$ in $T$, where $T$ is located between $A$ and $C$. The circumcircle of the triangle $BEC$ intersects the line $AB$ (or its extension) in $S$, where $B$ is located between $S$ and $A$. Prove that $ST$, $AL$, and $BC$ are concurrent. $\text{Vangelis Psychas and Silouanos Brazitikos}$

How many integers $n$ from $1$ to $2020$, inclusive, are there such that $2020$ divides $n^2 + 1$?

Let $\mathbb{N}$ denote the set of positive integers. Find all functions $f:\mathbb{N}\longrightarrow\mathbb{N}$ such that \[n+f(m)\mid f(n)+nf(m)\] for all $m,n\in \mathbb{N}$ [i]Proposed by Dorlir Ahmeti, Albania[/i]

Does there exist a subset $M$ of positive integers such that for all positive rational numbers $r<1$ there exists exactly one finite subset of $M$ like $S$ such that sum of reciprocals of elements in $S$ equals $r$.

In a triangle, one excircle touches side $AB$ at point $C_1$ and the other touches side $BC$ at point $A_1$. Prove that on the straight line $A_1C_1$ the constructed excircles cut out equal segments.

What is the product of real numbers $a$ which make $x^2+ax+1$ a negative integer for only one real number $x$? $ \textbf{(A)}\ -1 \qquad\textbf{(B)}\ -2 \qquad\textbf{(C)}\ -4 \qquad\textbf{(D)}\ -6 \qquad\textbf{(E)}\ -8 $

Let $ I $ and $ 0 $ be the square identity and null matrices, both of size $ 2019 $. There is a square matrix $A$ with rational entries and size $ 2019 $ such that: a) $ A ^ 3 + 6A ^ 2-2I = 0 $? b) $ A ^ 4 + 6A ^ 3-2I = 0 $?

Find the number of $7$-tuples $(n_1,\ldots,n_7)$ of integers such that \[\sum_{i=1}^7 n_i^6=96957.\]

Let $G$ be the complete graph on $2015$ vertices. Each edge of $G$ is dyed red, blue or white. For a subset $V$ of vertices of $G$, and a pair of vertices $(u,v)$, define \[ L(u,v) = \{ u,v \} \cup \{ w | w \in V \ni \triangle{uvw} \text{ has exactly 2 red sides} \}\]Prove that, for any choice of $V$, there exist at least $120$ distinct values of $L(u,v)$.

In order to earn her vacation spending money, Alexis helped her mother remove weeds from the garden. When she was done, she came into the house to put away her gardening gloves and change into clean clothes. On her way to her room she notices Joshua with his face to the floor in the family room, looking pretty silly. "Josh, did you know you lose IQ points for sniffing the carpet?" "Shut up. I'm $\textit{not}$ sniffing the carpet. I'm $\textit{doing something}$." "Sure, if $\textit{sniffing the carpet}$ counts as $\textit{doing something}.$" At this point Alexis stands over her twin brother grinning, trying to see how silly she can make him feel. Joshua climbs to his feet and stands on his toes to make himself a half inch taller than his sister, who is ordinarily a half inch taller than Joshua. "I'm measuring something. I'm $\textit{designing}$ something." Alexis stands on her toes too, reminding her brother that she is still taller than he. "When you're done, can you design me a dress?" "Very funny." Joshua walks to the table and points to some drawings. "I'm designing the sand castle I want to build at the beach. Everything needs to be measured out so that I can build something awesome." "And this requires sniffing carpet?" inquires Alexis, who is just a little intrigued by her brother's project. "I was imagining where to put the base of a spiral staircase. Everything needs to be measured out correctly. See, the castle walls will be in the shape of a rectangle, like this room. The center of the staircase will be $9$ inches from one of the corners, $15$ inches from another, $16$ inches from another, and some whole number of inches from the furthest corner." Joshua shoots Alexis a wry smile. The twins liked to challenge each other, and Alexis knew she had to find the distance from the center of the staircase to the fourth corner of the castle on her own, or face Joshua's pestering, which might last for hours or days. Find the distance from the center of the staircase to the furthest corner of the rectangular castle, assuming all four of the distances to the corners are described as distances on the same plane (the ground).

Chords $ AB$ and $ CD$ of a circle intersect at a point $ E$ inside the circle. Let $ M$ be an interior point of the segment $ EB$. The tangent line at $ E$ to the circle through $ D$, $ E$, and $ M$ intersects the lines $ BC$ and $ AC$ at $ F$ and $ G$, respectively. If \[ \frac {AM}{AB} \equal{} t, \] find $\frac {EG}{EF}$ in terms of $ t$.

We are given $1999$ coins. No two coins have the same weight. A machine is provided which allows us with one operation to determine, for any three coins, which one has the middle weight. Prove that the coin that is the $1000$th by weight can be determined using no more than $1000000$ operations and that this is the only coin whose position by weight can be determined using this machine.

Determine all pairs $(k, n)$ of positive integers that satisfy $$1! + 2! + ... + k! = 1 + 2 + ... + n.$$

Two players $A$ and $B$ take turns taking stones from a pile of $N$ stones. They play in the order $A$, $B$, $A$, $B$, $A$, $....$, $A$ starts the game and the one who takes out the last stone loses.$ B$ can serve on each play $1$, $2$ or 3 stones, while$ A$ can draw $2, 3, 4$ stones or $1$ stone in each turn f it is the last one in the pile. Determine for what values of $N$ does $A$ have a winning strategy, and for what values the winning strategy is $B$'s.

Prinstan Trollner and Dukejukem are competing at the game show WASS. Both players spin a wheel which chooses an integer from $1$ to $50$ uniformly at random, and this number becomes their score. Dukejukem then flips a weighted coin that lands heads with probability $\tfrac{3}{5}$. If he flips heads, he adds $1$ to his score. A player wins the game if their score is higher than the other player's score. A player wins the game if their score is higher than the other player's score. The probability Dukejukem defeats the Trollner to win WASS equals $\tfrac{m}{n}$ where $m$ and $n$ are coprime positive integers. Computer $m+n$.

Let $0 < a < 1$ be a real number. Prove that for all finite, strictly increasing sequences $k_1, k_2, \ldots , k_n$ of non-negative integers we have the inequality \[\biggl( \sum_{i=1}^n a^{k_i} \biggr)^2 < \frac{1+a}{1-a} \sum_{i=1}^n a^{2k_i}.\]