Knowing that the system \[x + y + z = 3,\]\[x^3 + y^3 + z^3 = 15,\]\[x^4 + y^4 + z^4 = 35,\] has a real solution $x, y, z$ for which $x^2 + y^2 + z^2 < 10$, find the value of $x^5 + y^5 + z^5$ for that solution.

Find the maximum value of $\frac{1}{x^{2}}+\frac{2}{y^{2}}+\frac{3}{z^{2}}$, where $x, y, z$ are positive reals satisfying $\frac{1}{\sqrt{2}}\leq z <\frac{ \min(x\sqrt{2}, y\sqrt{3})}{2}, x+z\sqrt{3}\geq\sqrt{6}, y\sqrt{3}+z\sqrt{10}\geq 2\sqrt{5}.$

[b]p1.[/b] The number $100$ is written as a sum of distinct positive integers. Determine, with proof, the maximum number of terms that can occur in the sum. [b]p2.[/b] Inside an equilateral triangle of side length $s$ are three mutually tangent circles of radius $1$, each one of which is also tangent to two sides of the triangle, as depicted below. Find $s$. [img]https://cdn.artofproblemsolving.com/attachments/4/3/3b68d42e96717c83bd7fa64a2c3b0bf47301d4.png[/img] [b]p3.[/b] Color a $4\times 7$ rectangle so that each of its $28$ unit squares is either red or green. Show that no matter how this is done, there will be two columns and two rows, so that the four squares occurring at the intersection of a selected row with a selected column all have the same color. [b]p4.[/b] (a) Show that the $y$-intercept of the line through any two distinct points of the graph of $f(x) = x^2$ is $-1$ times the product of the $x$-coordinates of the two points. (b) Find all real valued functions with the property that the $y$-intercept of the line through any two distinct points of its graph is $-1$ times the product of the $x$-coordinates. Prove that you have found all such functions and that all functions you have found have this property. [b]p5.[/b] Let $n$ be a positive integer. We consider sets $A \subseteq \{1, 2,..., n\}$ with the property that the equation $x+y=z$ has no solution with $x\in A$, $y \in A$, $z \in A$. (a) Show that there is a set $A$ as described above that contains $[(n + l)/2]$ members where $[x]$ denotes the largest integer less than or equal to $x$. (b) Show that if $A$ has the property described above, then the number of members of $A$ is less than or equal to $[(n + l)/2]$. PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Show that the equation $$z^4 + 4(i + 1)z + 1 = 0$$ has a root in each quadrant of the complex plane.

The fourth-degree equation $x^4-x-504=0$ has $4$ roots $r_1$, $r_2$, $r_3$, $r_4$. If $S_x$ denotes the value of ${r_1}^4+{r_2}^4+{r_3}^4+{r_4}^4$, compute $S_4$. [i]2015 CCA Math Bonanza Individual Round #10[/i]

Let $\Gamma$ be a circunference and $O$ its center. $AE$ is a diameter of $\Gamma$ and $B$ the midpoint of one of the arcs $AE$ of $\Gamma$. The point $D \ne E$ in on the segment $OE$. The point $C$ is such that the quadrilateral $ABCD$ is a parallelogram, with $AB$ parallel to $CD$ and $BC$ parallel to $AD$. The lines $EB$ and $CD$ meets at point $F$. The line $OF$ cuts the minor arc $EB$ of $\Gamma$ at $I$. Prove that the line $EI$ is the angle bissector of $\angle BEC$.

The number $r$ can be expressed as a four-place decimal $0.abcd,$ where $a, b, c,$ and $d$ represent digits, any of which could be zero. It is desired to approximate $r$ by a fraction whose numerator is 1 or 2 and whose denominator is an integer. The closest such fraction to $r$ is $\frac 27.$ What is the number of possible values for $r$?

Define the sequence $s_0$, $s_1$, $s_2$,$ . . .$ by $s_0 = 0$ and $s_n = 3s_{n-1}+2$ for $n \ge 1$. The monic polynomial $f(x)$ defined as $$f(x) =\frac{1}{s_{2023}} \sum^{32}_{k=0} s_{2023+k}x^{32-k}$$ can be factored uniquely (up to permutation) as the product of $16$ monic quadratic polynomials $p_1$, $p_2$, $....$, $p_{16}$ with real coefficients, where $p_i(x) = x^2 + a_ix + b_i$ for $1\le i \le 16$. Compute the integer $N$ that minimizes $$\left|N - \sum^{16}_{k=1} (a_k + b_k)\right|.$$

[b]p1.[/b] Prove that no matter what digits are placed in the four empty boxes, the eight-digit number $9999\Box\Box\Box\Box$ is not a perfect square. [b]p2.[/b] Prove that the number $m/3+m^2/2+m^3/6$ is integral for all integral values of $m$. [b]p3.[/b] An elevator in a $100$ store building has only two buttons: UP and DOWN. The UP button makes the elevator go $13$ floors up, and the DOWN button makes it go $8$ floors down. Is it possible to go from the $13$th floor to the $8$th floor? [b]p4.[/b] Cut the triangle shown in the picture into three pieces and rearrange them into a rectangle. (Pieces can not overlap.) [img]https://cdn.artofproblemsolving.com/attachments/4/b/ca707bf274ed54c1b22c4f65d3d0b0a5cfdc56.png[/img] [b]p5.[/b] Two players Tom and Sid play the following game. There are two piles of rocks, $7$ rocks in the first pile and $9$ rocks in the second pile. Each of the players in his turn can take either any amount of rocks from one pile or the same amount of rocks from both piles. The winner is the player who takes the last rock. Who does win in this game if Tom starts the game? [b]p6.[/b] In the next long multiplication example each letter encodes its own digit. Find these digits. $\begin{tabular}{ccccc} & & & a & b \\ * & & & c & d \\ \hline & & c & e & f \\ + & & a & b & \\ \hline & c & f & d & f \\ \end{tabular}$ PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Let $ T$ denote the set of all ordered triples $ (p,q,r)$ of nonnegative integers. Find all functions $ f: T \rightarrow \mathbb{R}$ satisfying \[ f(p,q,r) = \begin{cases} 0 & \text{if} \; pqr = 0, \\ 1 + \frac{1}{6}(f(p + 1,q - 1,r) + f(p - 1,q + 1,r) & \\ + f(p - 1,q,r + 1) + f(p + 1,q,r - 1) & \\ + f(p,q + 1,r - 1) + f(p,q - 1,r + 1)) & \text{otherwise} \end{cases} \] for all nonnegative integers $ p$, $ q$, $ r$.

$A_1, A_2, ..., A_n$ are the subsets of $|S|=2019$ such that union of any three of them gives $S$ but if we combine two of subsets it doesn't give us $S$. Find the maximum value of $n$.

An equilateral triangle of side $x$ has its vertices on the sides of a square side $1$. What are the possible values of $x$?

In a chess tournament there are $n \geq 5$ players, and they have already played $\left[ \frac{n^2}{4} \right] +2$ games (each pair have played each other at most once). [b](a)[/b] Prove that there are five players $a, b, c, d, e$ for which the pairs $ab, ac, bc, ad, ae, de$ have already played. [b](b)[/b] Is the statement also valid for the $\left[ \frac{n^2}{4} \right] +1$ games played? Make the proof by induction over $n.$

Given a cyclic $ABCD$ with $AB=AD$. Points $M$ and $N$ are marked on the sides $CD$ and $BC$, respectively, so that $DM+BN=MN$. Prove that the circumcenter of the triangle $AMN$ belongs to the segment $AC$. N.Sedrakian

$6$ open disks in the plane are such that the center of no disk lies inside another. Show that no point lies inside all $6$ disks.

Prove the following assertion: The four altitudes of a tetrahedron $ABCD$ intersect in a point if and only if \[AB^2 + CD^2 = BC^2 + AD^2 = CA^2 + BD^2.\]

Show that among the square roots of the first $ 2015 $ natural numbers, we cannot choose an arithmetic sequence composed of $ 45 $ elements.

Determine if there exist non-constant polynomials $P(x)$, $Q(x)$ and $R(x)$ with real coefficients and leading coefficient $1$, such that each of the polynomials \[ P(Q(x)), \quad Q(R(x)), \quad R(P(x)) \] has at least one real root, while each of the polynomials \[ Q(P(x)), \quad R(Q(x)), \quad P(R(x)) \] has no real roots.

Let $f : \left[ 0, 1 \right] \to \mathbb R$ be a continuous function and $g : \left[ 0, 1 \right] \to \left( 0, \infty \right)$. Prove that if $f$ is increasing, then \[\int_{0}^{t}f(x) g(x) \, dx \cdot \int_{0}^{1}g(x) \, dx \leq \int_{0}^{t}g(x) \, dx \cdot \int_{0}^{1}f(x) g(x) \, dx .\]

Let $\langle x_n\rangle$ be a sequence of real numbers defined as \[x_1=1; x_n=\dfrac{2n}{(n-1)^2}\sum_{i=1}^{n-1}x_i\] Show that the sequence $y_n=x_{n+1}-x_n$ has finite limits as $n\to \infty.$

An integer $n \geq 3$ is called [i]special[/i] if it does not divide $\left ( n-1 \right )!\left ( 1+\frac{1}{2}+\cdot \cdot \cdot +\frac{1}{n-1} \right )$. Find all special numbers $n$ such that $10 \leq n \leq 100$.

A game of solitaire strats of with $25$ cards. Some are facing up and sum are facing down. In each move a card that's facing up should me choosen, taken away, and turning over the cards next to it (if there are cards next to it). The game is won when you have accomplished to take all the $25$ cards from the table. If you initially start with $n$ cards facing up, find all the values of $n$ such that the game can be won. Explain how to win the game, independently from the initial placement of the cards facing up, justify your answer for why it is impossible to win with other values of $n$. Two cards are neighboring when one is immediately next to the other, to the left or right. Example: The card marked $A$ has two neighboring cards and the one marked with only a $B$ has only one neighboring card. After taking a card there is a hole left, such that the card marked $C$ has only one neighboring card, and the one marked $D$ does'nt have any.

Let $ n$ be the number of integer values of $ x$ such that $ P \equal{} x^4 \plus{} 6x^3 \plus{} 11x^2 \plus{} 3x \plus{} 31$ is the square of an integer. Then $ n$ is: $ \textbf{(A)}\ 4 \qquad \textbf{(B)}\ 3 \qquad \textbf{(C)}\ 2 \qquad \textbf{(D)}\ 1 \qquad \textbf{(E)}\ 0$

Let $f$ be a primitive polynomial with integral coefficients (their highest common factor is $1$ ) such that $f$ is irreducible in $\mathbb{Q}[X]$ , and $f(X^2)$ is reducible in $\mathbb{Q}[X]$ . Show that $f= \pm(u^2-Xv^2)$ for some polynomials $u$ and $v$ with integral coefficients.

In this problem, we explore a variant of the Monty Hall Problem. There are $n$ doors numbered $1, \dots, n$. A single gold coin is placed randomly behind one of the doors, with the probability it is placed behind door $i$ equalling $p_i.$ There are $r$ "rounds" in which we may make at most $k$ "turns" each, defined as follows: During a "turn", you pick two doors and send them to the game host. Then, the host picks one of the two doors in the following manner: [list] [*]If neither door contains the coin, the host randomly picks one with equal probability. [*] If one of the doors contains the coin, the host picks the door which does not have the coin. [/list] The host reveals that the picked door does not contain the coin, and opens it. A "round" consists of Alice performing at least 1 and at most $k$ turns. After all the turns in round $j$ are complete, suppose there are $d_j$ doors remaining. Bob will compute the probability of each individual door containing the coin. Let $m_j$ be the minimum of these probabilities computed during the $j$th round. Then, Bob awards Alice $d_jm_j$ points. Note that Bob will pay Alice $r$ times, and Alice's total payout is the sum of the $r$ individual payouts. Note that opened doors remain revealed between rounds. Suppose $S$ is some strategy that determines which doors Alice sends to the host. Let $F(S, n,k,r,(p_1, \dots, p_n))$ be the minimum possible amount Alice could earn with strategy $S$ for parameters $(n,k,r,(p_1, \dots, p_n))$, and let \[G(n,k,r,(p_1, \dots, p_n))= \max\limits _S F(S, n,k,r,(p_1, \dots, p_n)).\] Find all tuples $(n,k,r,(p_1, \dots, p_n))$ for which $G(n,k,r,(p_1, \dots, p_n))=r.$ You may find it useful to consider lists where each element of a list is at most double the prior element. [i]Proposed by Hari Desikan[/i]