Let $x$, $y$ be two positive integers such that $\displaystyle 3x^2+x=4y^2+y$. Prove that $x-y$ is a perfect square.

A natural number $n$ is called [i]perfect [/i] if it is equal to the sum of all its natural divisors other than $n$. For example, the number $6$ is perfect because $6 = 1 + 2 + 3$. Find all even perfect numbers that can be given as the sum of two cubes positive integers.

What is the last two digits of the decimal representation of $9^{8^{7^{\cdot^{\cdot^{\cdot^{2}}}}}}$? $ \textbf{(A)}\ 81 \qquad\textbf{(B)}\ 61 \qquad\textbf{(C)}\ 41 \qquad\textbf{(D)}\ 21 \qquad\textbf{(E)}\ 01 $

Zach rolls five tetrahedral dice, each of whose faces are labeled $1, 2, 3$, and $4$. Compute the probability that the sum of the values of the faces that the dice land on is divisible by $3$.

Higher Secondary P3 Let $ABCDEF$ be a regular hexagon with $AB=7$. $M$ is the midpoint of $DE$. $AC$ and $BF$ intersect at $P$, $AC$ and $BM$ intersect at $Q$, $AM$ and $BF$ intersect at $R$. Find the value of $[APB]+[BQC]+[ARF]-[PQMR]$. Here $[X]$ denotes the area of polygon $X$.

Prove that if $ a > 0 $, $ b > 0 $, $ c > 0 $, then $$ \frac{a}{b + c} + \frac{b}{c+ a} + \frac{c}{a+b} \geq \frac{3}{2}.$$

Ana and Carlos entertain themselves with the next game. At the beginning of game in each vertex of the square there is an empty box. In each step, the corresponding player has two possibilities: either he adds a stone to an arbitrary box, or move each box clockwise to the next vertex of the square. Carlos starts and they take 2012 steps in turn (each player 1006). So Carlos marks one of the vertices of the square and allows Ana to make a more play. Carlos wins if after this last step the number ofstones in some box is greater than the number of stones in the box which is at the vertex marked by Carlos; otherwise Ana wins. Which of the two players has a winning strategy?

Suppose that $p$ and $q$ are distinct primes and $S$ is a subset of $\{1, 2, ..., p-1\}$. Let $N(S)$ denote the number of ordered $q$-tuples $(x_1,x_2,...,x_q)$ with $x_i \in S$, $1 \le i \le q$, such that $x_1+x_2+...+x_q \cong 0 (mod p)$.

Determine all positive integers $n$ for which there exists a polynomial $p(x)$ of degree $n$ with integer coefficients such that it takes the value $n$ in $n$ distinct integer points and takes the value $0$ at point $0$.

For all positive numbers $x,y,z$ the product $(x+y+z)^{-1}(x^{-1}+y^{-1}+z^{-1})(xy+yz+xz)^{-1}[(xy)^{-1}+(yz)^{-1}+(xz)^{-1}]$ equals $\text{(A)}\ x^{-2}y^{-2}z^{-2} \qquad \text{(B)}\ x^{-2}+y^{-2}+z^{-2} \qquad \text{(C)}\ (x+y+z)^{-1}$ $\text{(D)}\ \frac{1}{xyz} \qquad \text{(E)}\ \frac{1}{xy+yz+xz}$

Let $k$ be a fixed positive integer. Prove that the sequence $\binom{2}{1},\binom{4}{2},\binom{8}{4},\ldots, \binom{2^{n+1}}{2^n},\ldots$ is eventually constant modulo $2^k$. [i]Proposed by V. Rastorguyev[/i]

Evaluate \[\int_0^{\pi} \{(1-x\sin 2x)e^{\cos ^2 x}+(1+x\sin 2x)e^{\sin ^ 2 x}\}\ dx.\]

Is it possible to arrange everything in all cells of an infinite checkered plane all natural numbers (once) so that for each $n$ in each square $n \times n$ the sum of the numbers is a multiple of $n$?

A single section at a stadium can hold either $7$ adults or $11$ children. When $N$ sections are completely lled, an equal number of adults and children will be seated in them. What is the least possible value of $N$?

$(FRA 4)$ A right-angled triangle $OAB$ has its right angle at the point $B.$ An arbitrary circle with center on the line $OB$ is tangent to the line $OA.$ Let $AT$ be the tangent to the circle different from $OA$ ($T$ is the point of tangency). Prove that the median from $B$ of the triangle $OAB$ intersects $AT$ at a point $M$ such that $MB = MT.$

Each positive integer number $n \ ge 1$ is assigned the number $p_n$ which is the product of all its non-zero digits. For example, $p_6 = 6$, $p_ {32} = 6$, $p_ {203} = 6$. Let $S = p_1 + p_2 + p_3 + \dots + p_ {999}$. Find the largest prime that divides $S $.

For any positive integer $n$, let $\tau (n)$ denote the number of its positive divisors (including 1 and itself). Determine all positive integers $m$ for which there exists a positive integer $n$ such that $\frac{\tau (n^{2})}{\tau (n)}=m$.

What is the smallest possible average of four distinct positive even integers? $ \text{(A)}\ 3\qquad\text{(B)}\ 4\qquad\text{(C)}\ 5\qquad\text{(D)}\ 6\qquad\text{(E)}\ 7 $

[u]Round 5[/u] [b]p13.[/b] For a square pyramid whose base has side length $9$, a square is formed by connecting the centroids of the four triangular faces. What is the area of the square formed by the centroids? [b]p14.[/b] Farley picks a real number p uniformly at random in the range $\left( \frac13, \frac23 \right)$. She then creates a special coin that lands on heads with probability $p$ and tails with probability $1 - p$. She flips this coin, and it lands on heads. What is the probability that $p > \frac12$? [b]p15.[/b] Let $ABCD$ be a quadrilateral with $\angle A = \angle C = 90^o$. Extend $AB$ and $CD$ to meet at point $P$. Given that $P B = 3$, $BA = 21$, and $P C = 1$, find $BD^2$ [u]Round 6[/u] [b]p16.[/b] Three congruent, mutually tangent semicircles are inscribed in a larger semicircle, as shown in the diagram below. If the larger semicircle has a radius of $30$ units, what is the radius of one of the smaller semicircles? [img]https://cdn.artofproblemsolving.com/attachments/5/e/1b73791e95dc4ed6342f0151f3f63e1b31ae3c.png[/img] [b]p17.[/b] In isosceles trapezoid $ABCD$ with $BC \parallel AD$, the distances from $A$ and $B$ to line $CD$ are $3$ and $9$, respectively. If the distance between the two bases of trapezoid $ABCD$ is $5$, find the area of quadrilateral $ABCD$. [b]p18.[/b] How many ways are there to tile the “$E$” shape below with dominos? A domino covers two adjacent squares. [img]https://cdn.artofproblemsolving.com/attachments/b/b/82bdb8d8df8bc3d00b9aef9eb39e55358c4bc6.png[/img] [u]Round 7[/u] [b]p19.[/b] In isoceles triangle $ABC$, $AC = BC$ and $\angle ACB = 20^o$. Let $\Omega$ be the circumcircle of triangle $ABC$ with center $O$, and let $M$ be the midpoint of segment $BC$. Ray $\overrightarrow{OM}$ intersects $\Omega$ at $D$. Let $\omega$ be the circle with diameter $OD$. $AD$ intersects $\omega$ again at a point $X$ not equal to $D$. Given $OD = 2$, find the area of triangle $OXD$. [b]p20.[/b] Find the smallest odd prime factor of $2023^{2029} + 2026^{2029} - 1$. [b]p21.[/b] Achyuta, Alan, Andrew, Anish, and Ava are playing in the EMCC games. Each person starts with a paper with their name taped on their back. A person is eliminated from the game when anybody rips their paper off of their back. The game ends when one person remains. The remaining person then rips their paper off of their own back. At the end of the game, each person collects the papers that they ripped off. How many distinct ways can the papers be distributed at the end of the game? [u]Round 8[/u] [b]p22.[/b] Anthony has three random number generators, labelled $A$, $B$ and $C$. $\bullet$ Generator$ A$ returns a random number from the set $\{12, 24, 36, 48, 60\}$. $\bullet$ Generator $B$ returns a random number from the set $ \{15, 30, 45, 60\}$. $\bullet$ Generator $C$ returns a random number from the set $\{20, 40, 60\}$. He uses generator $A$, $B$, and then $C$ in succession, and then repeats this process indefinitely. Anthony keeps a running total of the sum of all previously generated numbers, writing down the new total every time he uses a generator. After he uses each machine $10 $ times, what is the average number of multiples of $60$ that Anthony will have written down? [b]p23.[/b] A laser is shot from one of the corners of a perfectly reflective room shaped like an equilateral triangle. The laser is reflected 2497 times without shining into a corner of the room, but after the 2497th reflection, it shines directly into the corner it started from. How many different angles could the laser have been initially pointed? [b]p24.[/b] We call a k-digit number blissful if the number of positive integers $n$ such that $n^n$ ends in that $k$-digit number happens to be nonzero and finite. What is the smallest value of $k$ such that there exists a blissful $k$-digit number? PS. You should use hide for answers. Rounds 1-4 have been posted [url=https://artofproblemsolving.com/community/c3h3131523p28369592]here[/url].. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

If the arithmetic mean of $a$ and $b$ is double their geometric mean, with $a>b>0$, then a possible value for the ratio $\frac{a}{b}$, to the nearest integer, is $\textbf{(A)}\ 5 \qquad\textbf{(B)}\ 8 \qquad\textbf{(C)}\ 11 \qquad\textbf{(D)}\ 14 \qquad\textbf{(E)}\ \text{none of these} $

A vintage tram departs a stop with a certain number of boys and girls on board. At the first stop, a third of the girls get out and their places are taken by boys. At the next stop, a third of the boys get out and their places are taken by girls. There are now two more girls than boys and as many boys as there originally were girls. How many boys and girls were there on board at the start?

For each integer $k\geq 2$, determine all infinite sequences of positive integers $a_1$, $a_2$, $\ldots$ for which there exists a polynomial $P$ of the form \[ P(x)=x^k+c_{k-1}x^{k-1}+\dots + c_1 x+c_0, \] where $c_0$, $c_1$, \dots, $c_{k-1}$ are non-negative integers, such that \[ P(a_n)=a_{n+1}a_{n+2}\cdots a_{n+k} \] for every integer $n\geq 1$.

A continuous function $f : [a,b] \to [a,b]$ is called piecewise monotone if $[a, b]$ can be subdivided into finitely many subintervals $$I_1 = [c_0,c_1], I_2 = [c_1,c_2], \dots , I_\ell = [ c_{\ell - 1},c_\ell ]$$ such that $f$ restricted to each interval $I_j$ is strictly monotone, either increasing or decreasing. Here we are assuming that $a = c_0 < c_1 < \cdots < c_{\ell - 1} < c_\ell = b$. We are also assuming that each $I_j$ is a maximal interval on which $f$ is strictly monotone. Such a maximal interval is called a lap of the function $f$, and the number $\ell = \ell (f)$ of distinct laps is called the lap number of $f$. If $f : [a,b] \to [a,b]$ is a continuous piecewise-monotone function, show that the sequence $( \sqrt[n]{\ell (f^n )})$ converges; here $f^n$ means $f$ composed with itself $n$-times, so $f^2 (x) = f(f(x))$ etc.

How many nonempty subsets of ${1, 2, \dots, 15}$ are there such that the sum of the squares of each subset is a multiple of $5$?

Show that the equation $x^2-7y^2 = 1$ has infinitely many solutions in natural numbers.