The numbers $3$, $4$ ,$...$, $2019$ are written on a blackboard. David and Edgardo play alternately, starting with David. On their turn, each player must erase a number from the board and write two positive integers whose sum is equal to the number just deleted. The winner is the one who makes all the numbers on the board equal. Determine who has a winning strategy and describe it.

Suppose a $3\times 3$ matrix $A$ satisfies $\mathbf{v}^t A \mathbf{v} > 0$ for any vector $\mathbf{v} \in\mathbb{R}^3 -\{0\}$. (Note that $A$ may not be a symmetric matrix.) (1) Prove that $\det(A)>0$. (2) Consider diagonal matrix $D=\text{diag}(-1,1,1)$. Prove that there's exactly one negative real among eigenvalues of $AD$.

Find the minimum area bounded by the graphs of $ y\equal{}x^2$ and $ y\equal{}kx(x^2\minus{}k)\ (k>0)$.

If $a$ and $b$ are integers and if the solutions of the system of equations $$y - 2x - a = 0$$ $$y^2 - xy + x^2 - b = 0$$ are rational, prove that the solutions are integers.

Consider a cyclic quadrilateral $ABCD$. The extensions of its sides $AB,DC$ meet at the point $P$ and the extensions of its sides $AD,BC$ meet at the point $Q$. Suppose $\quad QE,QF$ are tangents to the circumcircle of quadrilateral $ABCD$ at $E,F$ respectively. Show that $P,E,F$ are collinear.

Let $x_1,x_2,\ldots,x_n$ be arbitrary real numbers. Prove the inequality \[ \frac{x_1}{1+x_1^2} + \frac{x_2}{1+x_1^2 + x_2^2} + \cdots + \frac{x_n}{1 + x_1^2 + \cdots + x_n^2} < \sqrt{n}. \]

Let \(f:\mathbb R\to\mathbb R\) be a function such that for all real numbers \(x\neq1\), \[f(x-f(x))+f(x)=\frac{x^2-x+1}{x-1}.\] Find all possible values of \(f(2023)\). [i]Proposed by Linus Tang[/i]

Let $ D$, $ E$, $ F$ be the feet of the altitudes wrt sides $ BC$, $ CA$, $ AB$ of acute-angled triangle $ \triangle ABC$, respectively. In triangle $ \triangle CFB$, let $ P$ be the foot of the altitude wrt side $ BC$. Define $ Q$ and $ R$ wrt triangles $ \triangle ADC$ and $ \triangle BEA$ analogously. Prove that lines $ AP$, $ BQ$, $ CR$ don't intersect in one common point.

How many integers $0 \leq x < 125$ are there such that $x^3 - 2x + 6 \equiv  0 \pmod {125}$? $ \textbf{a)}\ 0 \qquad\textbf{b)}\ 1 \qquad\textbf{c)}\ 2 \qquad\textbf{d)}\ 3 \qquad\textbf{e)}\ \text{None of above} $

On an $m\times n$ grid there's a snail in each cell. Each round, the snail army can choose four snail in a $2\times 2$ square and make them perform the complete [b]Quadrilateral Dance[/b], which is rotating the four snails clockwise by $90$ degrees, moving each one to an adjacent cell. Find all pairs of positive integers $(m,n)$ such that the snails can achieve any permutation by performing a finite number of times of [b]Quadrilateral Dance[/b]. [i]Proposed by chengbilly[/i]

In the tetrahedron $ABCD,\angle BDC=90^o$ and the foot of the perpendicular from $D$ to $ABC$ is the intersection of the altitudes of $ABC$. Prove that: \[ (AB+BC+CA)^2\le6(AD^2+BD^2+CD^2). \] When do we have equality?

Find the biggest positive integer $n$ for which the number $(n!)^6-6^n$ is divisible by $2022$.

A 16 ×16 square sheet of paper is folded once in half horizontally and once in half vertically to make an 8 × 8 square. This square is again folded in half twice to make a 4 × 4 square. This square is folded in half twice to make a 2 × 2 square. This square is folded in half twice to make a 1 × 1 square. Finally, a scissor is used to make cuts through both diagonals of all the layers of the 1 × 1 square. How many pieces of paper result?

[u]Round 1[/u] [b]p1.[/b] Alice and Bob compiled a list of movies that exactly one of them saw, then Cindy and Dale did the same. To their surprise, these two lists were identical. Prove that if Alice and Cindy list all movies that exactly one of them saw, this list will be identical to the one for Bob and Dale. [b]p2.[/b] Several whole rounds of cheese were stored in a pantry. One night some rats sneaked in and consumed $10$ of the rounds, each rat eating an equal portion. Some were satisfied, but $7$ greedy rats returned the next night to finish the remaining rounds. Their portions on the second night happened to be half as large as on the first night. How many rounds of cheese were initially in the pantry? [b]p3.[/b] You have $100$ pancakes, one with a single blueberry, one with two blueberries, one with three blueberries, and so on. The pancakes are stacked in a random order. Count the number of blueberries in the top pancake, and call that number N. Pick up the stack of the top N pancakes, and flip it upside down. Prove that if you repeat this counting-and-flipping process, the pancake with one blueberry will eventually end up at the top of the stack. [b]p4.[/b] There are two lemonade stands along the $4$-mile-long circular road that surrounds Sour Lake. $100$ children live in houses along the road. Every day, each child buys a glass of lemonade from the stand that is closest to her house, as long as she does not have to walk more than one mile along the road to get there. A stand's [u]advantage [/u] is the difference between the number of glasses it sells and the number of glasses its competitor sells. The stands are positioned such that neither stand can increase its advantage by moving to a new location, if the other stand stays still. What is the maximum number of kids who can't buy lemonade (because both stands are too far away)? [b]p5.[/b] Merlin uses several spells to move around his $64$-room castle. When Merlin casts a spell in a room, he ends up in a different room of the castle. Where he ends up only depends on the room where he cast the spell and which spell he cast. The castle has the following magic property: if a sequence of spells brings Merlin from some room $A$ back to room $A$, then from any other room $B$ in the castle, that same sequence brings Merlin back to room $B$. Prove that there are two different rooms $X$ and $Y$ and a sequence of spells that both takes Merlin from $X$ to $Y$ and from $Y$ to $X$. [u]Round 2[/u] [b]p6.[/b] Captains Hook, Line, and Sinker are deciding where to hide their treasure. It is currently buried at the $X$ in the map below, near the lairs of the three pirates. Each pirate would prefer that the treasure be located as close to his own lair as possible. You are allowed to propose a new location for the treasure to the pirates. If at least two out of the three pirates prefer the new location (because it moves closer to their own lairs), then the treasure will be moved there. Assuming the pirates’ lairs form an acute triangle, is it always possible to propose a sequence of new locations so that the treasure eventually ends up in your backyard (wherever that is)? [img]https://cdn.artofproblemsolving.com/attachments/c/c/a9e65624d97dec612ef06f8b30be5540cfc362.png[/img] [b]p7.[/b] Homer went on a Donut Diet for the month of May ($31$ days). He ate at least one donut every day of the month. However, over any stretch of $7$ consecutive days, he did not eat more than $13$ donuts. Prove that there was some stretch of consecutive days over which Homer ate exactly $30$ donuts. PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

If you're interested in participating in COP 4th, please sign up here by putting "I'm in" or "Yes!" or et cetera. Thanks.

Determine how many $100$-positive integer sequences satisfy the two conditions following: - At least one term of the sequence is equal to $4$ or $5$. - Any two adjacent terms differ as a maximum in $2$.

Two players alternately replace the stars in the expression \[*x^{2000}+*x^{1999}+...+*x+1 \] by real numbers. The player who makes the last move loses if the resulting polynomial has a real root $t$ with $|t| < 1$, and wins otherwise. Give a winning strategy for one of the players.

Determine the fractions of a fraction of the form $\frac{1}{ab}$ where $a,b$ are prime natural numbers such that $0 < a < b \le 200$ and $a + b > 200$

Determine all integer solutions to the equation $x^3 + y^3 + 2015 = 0$.

$(HUN 2)$ Prove that $1+\frac{1}{2^3}+\frac{1}{3^3}+\cdots+\frac{1}{n^3}<\frac{5}{4}$

Determine all functions $f:\mathbb{Z}\rightarrow\mathbb{Z}$ with the property that \[f(x-f(y))=f(f(x))-f(y)-1\] holds for all $x,y\in\mathbb{Z}$.

In a triangle $ABC$, the incircle with incenter $I$ is tangent to $BC$ at $A_1, CA$ at $B_1$, and $AB$ at $C_1$. Denote the intersection of $AA_1$ and $BB_1$ by $G$, the intersection of $AC$ and $A_1C_1$ by $X$, and the intersection of $BC$ and $B_1C_1$ by $Y$ . Prove that $IG \perp XY$ .

Consider the set of all strictly decreasing sequences of $n$ natural numbers having the property that in each sequence no term divides any other term of the sequence. Let $A = (a_j)$ and $B = (b_j)$ be any two such sequences. We say that $A$ precedes $B$ if for some $k$, $a_k < b_k$ and $a_i = b_i$ for $i < k$. Find the terms of the first sequence of the set under this ordering.

A polygon with sides running along the sides of the squares was cut out of an endless chessboard. A segment of the perimeter of a polygon is called black if the polygon adjacent to it from the inside is which cell is black, respectively white if the cell is white. Let $A$ be the number of black segments on the perimeter, and $B$ be the number of white ones, Let the polygon consist of $a$ black and $b$ white cells. Prove that $A-B = 4(a -b)$.

The isosceles triangle $\triangle ABC$, with $AB=AC$, is inscribed in the circle $\omega$. Let $P$ be a variable point on the arc $\stackrel{\frown}{BC}$ that does not contain $A$, and let $I_B$ and $I_C$ denote the incenters of triangles $\triangle ABP$ and $\triangle ACP$, respectively. Prove that as $P$ varies, the circumcircle of triangle $\triangle PI_BI_C$ passes through a fixed point.