How many three-digit positive integers $x$ are there with the property that $x$ and $2x$ have only even digits? (One such number is $x = 220$, since $2x = 440$ and each of $x$ and $2x$ has only even digits.) $ \mathrm{(A) \ } 16 \qquad \mathrm{(B) \ } 18 \qquad \mathrm {(C) \ } 64 \qquad \mathrm{(D) \ } 100 \qquad \mathrm{(E) \ } 125$

Let \( p_1, p_2, \cdots, p_{2025} \) be real numbers. For \( 1 \leq i \leq 2025 \), let \[\{a_n^{(i)}\}_{n \geq 0}\] be an infinite real sequence satisfying \[a_0^{(i)} = 0.\] It is known that: (1) \[a_1^{(1)}, a_1^{(2)}, \cdots, a_1^{(2025)}\] are not all zero. (2) For any integer \( n \geq 0 \) and any \( 1 \leq i \leq 2025 \), the following holds: \[p_i \cdot a_n^{(i+1)} = a_{n-1}^{(i)} + a_n^{(i)} + a_{n+1}^{(i)},\] where the sequence \[\{a_n^{(2026)}\}\] satisfies \[a_n^{(2026)} = a_n^{(1)}, \, n = 0, 1, 2, \cdots.\] Prove that there exists a positive real number \( r \) such that for infinitely many positive integers \( n \), \[\max \left\{ |a_n^{(1)}|, |a_n^{(2)}|, \cdots, |a_n^{(2025)}|\right\} \geq r.\]

Each day, Jenny ate $ 20\%$ of the jellybeans that were in her jar at the beginning of the day. At the end of the second day, $ 32$ remained. How many jellybeans were in the jar originally? $ \textbf{(A)}\ 40\qquad \textbf{(B)}\ 50 \qquad \textbf{(C)}\ 55 \qquad \textbf{(D)}\ 60\qquad \textbf{(E)}\ 75$

[u]Round 1[/u] [b]p1.[/b] Tom and Jerry stole a chain of $7$ sausages and are now trying to divide the bounty. They take turns biting the sausages at one of the connections. When one of them breaks a connection, he may eat any single sausages that may fall out. Tom takes the first bite. Each of them is trying his best to eat more sausages than his opponent. Who will succeed? [b]p2. [/b]The King of the Mountain Dwarves wants to light his underground throne room by placing several torches so that the whole room is lit. The king, being very miserly, wants to use as few torches as possible. What is the least number of torches he could use? (You should show why he can't do it with a smaller number of torches.) This is the shape of the throne room: [img]https://cdn.artofproblemsolving.com/attachments/b/2/719daafd91fc9a11b8e147bb24cb66b7a684e9.png[/img] Also, the walls in all rooms are lined with velvet and do not reflect the light. For example, the picture on the right shows how another room in the castle is partially lit. [img]https://cdn.artofproblemsolving.com/attachments/5/1/0f6971274e8c2ff3f2d0fa484b567ff3d631fb.png[/img] [b]p3.[/b] In the Hundred Acre Wood, all the animals are either knights or liars. Knights always tell the truth and liars always lie. One day in the Wood, Winnie-the-Pooh, a knight, decides to visit his friend Rabbit, also a noble knight. Upon arrival, Pooh finds his friend sitting at a round table with $5$ other guests. One-by-one, Pooh asks each person at the table how many of his two neighbors are knights. Surprisingly, he gets the same answer from everybody! "Oh bother!" proclaims Pooh. "I still don't have enough information to figure out how many knights are at this table." "But it's my birthday," adds one of the guests. "Yes, it's his birthday!" agrees his neighbor. Now Pooh can tell how many knights are at the table. Can you? [b]p4.[/b] Several girls participate in a tennis tournament in which each player plays each other player exactly once. At the end of the tournament, it turns out that each player has lost at least one of her games. Prove that it is possible to find three players $A$, $B$, and $C$ such that $A$ defeated $B$, $B$ defeated $C$, and $C$ defeated $A$. [b]p5.[/b] There are $40$ piles of stones with an equal number of stones in each. Two players, Ann and Bob, can select any two piles of stones and combine them into one bigger pile, as long as this pile would not contain more than half of all the stones on the table. A player who can’t make a move loses. Ann goes first. Who wins? [u]Round 2[/u] [b]p6.[/b] In a galaxy far, far away, there is a United Galactic Senate with $100$ Senators. Each Senator has no more than three enemies. Tired of their arguments, the Senators want to split into two parties so that each Senator has no more than one enemy in his own party. Prove that they can do this. (Note: If $A$ is an enemy of $B$, then $B$ is an enemy of $A$.) [b]p7.[/b] Harry has a $2012$ by $2012$ chessboard and checkers numbered from $1$ to $2012 \times 2012$. Can he place all the checkers on the chessboard in such a way that whatever row and column Professor Snape picks, Harry will be able to choose three checkers from this row and this column such that the product of the numbers on two of the checkers will be equal to the number on the third? [img]https://cdn.artofproblemsolving.com/attachments/b/3/a87d559b340ceefee485f41c8fe44ae9a59113.png[/img] PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Prove that there do not exist natural numbers $ n\ge 10$ having all digits different from zero, and such that all numbers which are obtained by permutations of its digits are perfect squares.

Let $n = 2188 = 3^7+1$ and let $A_0^{(0)}, A_1^{(0)}, ..., A_{n-1}^{(0)}$ be the vertices of a regular $n$-gon (in that order) with center $O$ . For $i = 1, 2, \dots, 7$ and $j=0,1,\dots,n-1$, let $A_j^{(i)}$ denote the centroid of the triangle \[ \triangle A_j^{(i-1)} A_{j+3^{7-i}}^{(i-1)} A_{j+2 \cdot 3^{7-i}}^{(i-1)}. \] Here the subscripts are taken modulo $n$. If \[ \frac{|OA_{2014}^{(7)}|}{|OA_{2014}^{(0)}|} = \frac{p}{q} \] for relatively prime positive integers $p$ and $q$, find $p+q$. [i]Proposed by Yang Liu[/i]

Find the sum of the $2007$ roots of \[(x-1)^{2007}+2(x-2)^{2006}+3(x-3)^{2005}+\cdots+2006(x-2006)^2+2007(x-2007).\]

A quadrilateral has one vertex on each side of a square of side-length 1. Show that the lengths $a$, $b$, $c$ and $d$ of the sides of the quadrilateral satisfy the inequalities \[ 2\le a^2+b^2+c^2+d^2\le 4. \]

For every positive $a_1, a_2, \dots, a_6$, prove the inequality \[ \sqrt[4]{\frac{a_1}{a_2 + a_3 + a_4}} + \sqrt[4]{\frac{a_2}{a_3 + a_4 + a_5}} + \dots + \sqrt[4]{\frac{a_6}{a_1 + a_2 + a_3}} \ge 2 \]

A circle of diameter $1$ is removed from a $2\times 3$ rectangle, as shown. Which whole number is closest to the area of the shaded region? [asy] fill((0,0)--(0,2)--(3,2)--(3,0)--cycle,gray); draw((0,0)--(0,2)--(3,2)--(3,0)--cycle,linewidth(1)); fill(circle((1,5/4),1/2),white); draw(circle((1,5/4),1/2),linewidth(1)); [/asy] $\text{(A)}\ 1 \qquad \text{(B)}\ 2 \qquad \text{(C)}\ 3 \qquad \text{(D)}\ 4 \qquad \text{(E)}\ 5$

Let $p$ be an odd prime. A degree $d$ polynomial $f$ with non-negative integer coefficients less than $p$ is called $p-floppy$ if the coefficients of $f(x)f(-x) - f(x^2)$ are all divisible by $p$ and if exactly $d$ entries in the sequence $(f(0), f(1), f(2), \dots , f(p-1))$ are divisible by $p$. How many non-constant $61$-floppy polynomials are there?

Let $a$ and $b$ be positive real numbers satisfying $$\frac{a}{b} \left( \frac{a}{b}+ 2 \right) + \frac{b}{a} \left( \frac{b}{a}+ 2 \right)= 2022.$$ Find the positive integer $n$ such that $$\sqrt{\frac{a}{b}}+\sqrt{\frac{b}{a}}=\sqrt{n}.$$

The perpendicular bisector of the bisector $BL$ of the triangle $ABC$ intersects the bisectors of its external angles $A$ and $C$ at points $P$ and $Q$, respectively. Prove that the circle circumscribed around the triangle $PBQ$ is tangent to the circle circumscribed around the triangle $ABC$.

Let $S > 1$ be a real number. The Cartesian plane is partitioned into rectangles whose sides are parallel to the axes of the coordinate system. and whose vertices have integer coordinates. Prove that if the area of each triangle if at most $S$, then for any positive integer $k$ there exist $k$ vertices of these rectangles which lie on a line.

Let $p>13$ be a prime of the form $2q+1$, where $q$ is prime. Find the number of ordered pairs of integers $(m,n)$ such that $0\le m<n<p-1$ and \[3^m+(-12)^m\equiv 3^n+(-12)^n\pmod{p}.\] [i]Alex Zhu.[/i] [hide="Note"]The original version asked for the number of solutions to $2^m+3^m\equiv 2^n+3^n\pmod{p}$ (still $0\le m<n<p-1$), where $p$ is a Fermat prime.[/hide]

There are $2019$ points given in the plane. A child wants to draw $k$ (closed) discs in such a manner, that for any two distinct points there exists a disc that contains exactly one of these two points. What is the minimal $k$, such that for any initial configuration of points it is possible to draw $k$ discs with the above property?

A rectangularly paper is divided in polygons areas in the following way: at every step one of the existing surfaces is cut by a straight line, obtaining two new areas. Which is the minimum number of cuts needed such that between the obtained polygons there exists $251$ polygons with $11$ sides?

Let $AB$ and $CD$ be two parallel lines connected by the base $BD$. $AD$ and $BC$ are drawn and they intersect at the point $P$. $A$ line $P Q$ is drawn from the point $P$ to $BD$ such that $\angle P AB = \angle DP Q$. Prove that $\frac{1}{AB} + \frac{1}{CD} =\frac{1}{P Q}$.

Back in 1930, Tillie had to memorize her multiplication tables from $0\times 0$ through $12\times 12$. The multiplication table she was given had rows and columns labeled with the factors, and the products formed the body of the table. To the nearest hundredth, what fraction of the numbers in the body of the table are odd? $\textbf{(A) }0.21\qquad\textbf{(B) }0.25\qquad\textbf{(C) }0.46\qquad\textbf{(D) }0.50\qquad\textbf{(E) }0.75$

Compute the quadruple integral $$A=\frac1{\pi^2}\int_{[0,1]^2\times[-\pi,\pi]^2}ab\sqrt{a^2+b^2-2ab\cos(x-y)}dadbdxdy$$ [i]Proposed by Moubinool Omarjee[/i]

Triangle $BAD$ is right-angled at $B$. On $AD$ there is a point $C$ for which $AC=CD$ and $AB=BC$. The magnitude of angle $DAB$, in degrees, is: $\textbf{(A)}\ 67\dfrac{1}{2} \qquad \textbf{(B)}\ 60 \qquad \textbf{(C)}\ 45 \qquad \textbf{(D)}\ 30 \qquad \textbf{(E)}\ 22\dfrac{1}{2}$

Let $ABCD$ be a parallelogram. Construct the equilateral triangle $DCE$ on the side $DC$ and outside of parallelogram. Let $P$ be an arbitrary point in plane of $ABCD$. Show that \[PA+PB+AD \geq PE.\]

Solve the function $f: \Re \to \Re$: \[ f( x^{3} )+ f(y^{3}) = (x+y)(f(x^{2} )+f(y^{2} )-f(xy))\]

Prove that there are no integers $m$ and $n$ such that \[19m^2+95mn+2000n^2=1995.\]

On a $3 \times 3$ board the numbers from $1$ to $9$ are written in some order and without repeating. We say that the arrangement obtained is [i]Isthmian [/i] if the numbers in any two adjacent squares have different parity. Determine the number of different Isthmian arrangements. Note: Two arrangements are considered equal if one can be obtained from the other by rotating the board.