Find all pairs of real numbers $(x,y)$ for which \[ \begin{aligned} x^2+y^2+xy&=133 \\ x+y+\sqrt{xy}&=19 \end{aligned} \]

A cell phone plan costs $\$20$ dollars each month, plus $5$ cents per text message sent, plus $10$ cents for each minute used over $30$ hours. In January Michelle sent $100$ text messages and talked for $30.5$ hours. How much did she have to pay? $ \textbf{(A)}\ \$ 24.00 \qquad \textbf{(B)}\ \$ 24.50\qquad \textbf{(C)}\ \$ 25.50\qquad \textbf{(D)}\ \$ 28.00\qquad \textbf{(E)}\ \$ 30.00$

Let $a_i, b_i$ ($1 \le i \le n$, $n \ge 2$) be positive real numbers such that $\sum_{i=1}^n a_i = \sum_{i=1}^n b_i$. Prove that $\sum_{i=1}^n \frac{(a_{i+1}+b_{i+1})^2}{n(a_i-b_i)^2+4(n-1)\sum_{j=1}^n a_jb_j} \ge \frac{1}{n-1}$

Given a polynomial with integer coefficents$$P(x)=x^n+a_{n-1}x^{n-1}+...+a_1x+a_0,n\ge 1$$satisfying these conditions: i) $|a_0|$ is not a perfect square. ii) $P(x)$ is irreducible in $\mathbb{Q}[x].$ Prove that: $P(x^2)$ is irreducible in $\mathbb{Q}[x].$

Roy's cat eats $\frac{1}{3}$ of a can of cat food every morning and $\frac{1}{4}$ of a can of cat food every evening. Before feeding his cat on Monday morning, Roy opened a box containing $6$ cans of cat food. On what day of the week did the cat finish eating all the cat food in the box? ${ \textbf{(A)}\ \text{Tuesday}\qquad\textbf{(B)}\ \text{Wednesday}\qquad\textbf{(C)}\ \text{Thursday}\qquad\textbf{(D)}}\ \text{Friday}\qquad\textbf{(E)}\ \text{Saturday}$

Let $a \ge 2$ be an integer. Find all polynomials $f$ with real coefficients such that $$A = \{a^{n^2} | n \ge 1, n \in Z\} \subset \{f(n) | n \ge 1, n \in Z\} = B.$$

Let $n$ and $k$ be positive integers with $n\geq k\geq 2$. For $i=1,\dots,n$, let $S_i$ be a nonempty set of consecutive integers such that among any $k$ of them, there are two with nonempty intersection. Prove that there is a set $X$ of $k-1$ integers such that each $S_i$, $i=1,\dots,n$ contains at least one integer in $X$.

Cindy was asked by her teacher to subtract $ 3$ from a certain number and then divide the result by $ 9$. Instead, she subtracted $ 9$ and then divided the result by $ 3$, giving an answer of $ 43$. What would her answer have been had she worked the problem correctly? $ \textbf{(A)}\ 15 \qquad \textbf{(B)}\ 34 \qquad \textbf{(C)}\ 43 \qquad \textbf{(D)}\ 51 \qquad \textbf{(E)}\ 138$

Given a positive integer $n \ge 2$. Find all $n$-tuples of positive integers $(a_1,a_2,\ldots,a_n)$, such that $1<a_1 \le a_2 \le a_3 \le \cdots \le a_n$, $a_1$ is odd, and (1) $M=\frac{1}{2^n}(a_1-1)a_2 a_3 \cdots a_n$ is a positive integer; (2) One can pick $n$-tuples of integers $(k_{i,1},k_{i,2},\ldots,k_{i,n})$ for $i=1,2,\ldots,M$ such that for any $1 \le i_1 <i_2 \le M$, there exists $j \in \{1,2,\ldots,n\}$ such that $k_{i_1,j}-k_{i_2,j} \not\equiv 0, \pm 1 \pmod{a_j}$.

Given a quadrilateral $ABCD$ inscribed in circle $\Gamma$.From a point P outside $\Gamma$, draw tangents $PA$ and $PB$ with $A$ and $B$ as touspoints. The line $PC$ intersects $\Gamma$ at point $D$. Draw a line through $B$ parallel to $PA$, this line intersects $AC$ and $AD$ at points $E$ and $F$ respectively. Prove that $BE = BF$.

If $\frac{x}{x-1}=\frac{y^2+2y-1}{y^2-2y-2}$, then $x$ equals $\text{(A)}\ y^2+2y-1 \qquad \text{(B)}\ y^2+2y-2 \qquad \text{(C)}\ y^2+2y+2$ $\text{(D)}\ y^2+2y+1 \qquad \text{(E)}\ -y^2-2y+1$

Let $f(x)=x^n + a_{n-1}x^{n-1} + ...+ a_0 $ be a polynomial of degree $ n\ge 1 $ with $ n$ (not necessarily distinct) integer roots. Assume that there exist distinct primes $p_0,p_1,..,p_{n-1}$ such that $a_i > 1$ is a power of $p_i$, for all $ i=0,1,..,n-1$. Find all possible values of $ n$.

Let $ABC$ be a triangle, $I_a$ the center of the excircle at side $BC$, and $M$ its reflection across $BC$. Prove that $AM$ is parallel to the Euler line of the triangle $BCI_a$.

The polynomial $x^3 + px^2 + qx + r$ has three roots in the interval $(0,2)$. Prove that $-2 <p + q + r < 0$.

The ellipsoid $E$ is contained in the simplex $S$, which is located in the unit ball B space $R^n$. Prove that the sum of the principal semi-axes of the ellipsoid $E$ is no more than units.

Find all the numbers of $5$ non-zero digits such that deleting consecutively the digit of the left, in each step, we obtain a divisor of the previous number.

Two boundary points of a ball of radius 1 are joined by a curve contained in the ball and having length less than 2. Prove that the curve is contained entirely within some hemisphere of the given ball.

A house has an even number of lamps distributed among its rooms in such a way that there are at least three lamps in every room. Each lamp shares a switch with exactly one other lamp, not necessarily from the same room. Each change in the switch shared by two lamps changes their states simultaneously. Prove that for every initial state of the lamps there exists a sequence of changes in some of the switches at the end of which each room contains lamps which are on as well as lamps which are off. [i]Proposed by Australia[/i]

Find all positive integers $m$ and $n$ such that $(2^{2^{n}}+1)(2^{2^{m}}+1) $ is divisible by $m\cdot n $ .

We consider two sequences of real numbers $x_{1} \geq x_{2} \geq \ldots \geq x_{n}$ and $\ y_{1} \geq y_{2} \geq \ldots \geq y_{n}.$ Let $z_{1}, z_{2}, .\ldots, z_{n}$ be a permutation of the numbers $y_{1}, y_{2}, \ldots, y_{n}.$ Prove that $\sum \limits_{i=1}^{n} ( x_{i} -\ y_{i} )^{2} \leq \sum \limits_{i=1}^{n}$ $( x_{i} - z_{i})^{2}.$

The complex numbers $z$ and $w$ satisfy the system \begin{align*}z+\frac{20i}{w}&=5+i,\\w+\frac{12i}{z}&=-4+10i.\end{align*} Find the smallest possible value of $|zw|^2$.

Prove the inequality \[ \frac{a_1+ a_3}{a_1 + a_2} + \frac{a_2 + a_4}{a_2 + a_3} + \frac{a_3 + a_1}{a_3 + a_4} + \frac{a_4 + a_2}{a_4 + a_1} \geq 4, \] where $a_i > 0, i = 1, 2, 3, 4.$

Consider a trapezium $ ABCD $ in which $ AB\parallel CD. $ Show that $$ (AC^2+AB^2-BC^2)(BD^2-BC^2+CD^2) =(AC^2-AD^2+CD^2)(BD^2+AB^2-AD^2) . $$

The diagonals of a cyclic quadrilateral $ABCD$ meet at $P$. Let $K$ and $L$ be points on the segments $CP$ and $DP$ such that the circumcircle of $PKL$ is tangent to $CD$ at $M$. Let $X$ and $Y$ be points on the segments $AP$ and $BP$ such that $AX=CK$ and $BY=DL$. Points $Z$ and $W$ are the midpoints of $PK$ and $PL$. Prove that if $C,D,X$ and $Y$ are concyclic, then $\angle MZP = \angle MWP$.

[b]p1[/b]. Consider the following four statements referring to themselves: 1. At least one of these statements is true. 2. At least two of these statements are false. 3. At least three of these statements are true. 4. All four of these statements are false. Determine which statements are true and which are false. Justify your answer. [b]p2.[/b] Let $f(x) = a_{2017}x^{2017} + a_{2016}x^{2016} + ... + a_1x + a_0$ where the coefficients $a_0, a_1, ... , a_{2017}$ have not yet been determined. Alice and Bob play the following game: $\bullet$ Alice and Bob alternate choosing nonzero integer values for the coefficients, with Alice going first. (For example, Alice’s first move could be to set $a_{18}$ to $-3$.) $\bullet$ After all of the coefficients have been chosen: - If f(x) has an integer root then Alice wins. - If f(x) does not have an integer root then Bob wins. Determine which player has a winning strategy and what the strategy is. Make sure to justify your answer. [b]p3.[/b] Suppose that a circle can be inscribed in a polygon $P$ with $2017$ equal sides. Prove that $P$ is a regular polygon; that is, all angles of $P$ are also equal. [b]p4.[/b] A $3 \times 3 \times 3$ cube of cheese is sliced into twenty-seven $ 1 \times 1 \times 1$ blocks. A mouse starts anywhere on the outside and eats one of the $1\times 1\times 1$ cubes. He then moves to an adjacent cube (in any direction), eats that cube, and continues until he has eaten all $27$ cubes. (Two cubes are considered adjacent if they share a face.) Prove that no matter what strategy the mouse uses, he cannot eat the middle cube last. [Note: One should neglect gravity – intermediate configurations don’t collapse.] p5. Suppose that a constant $c > 0$ and an infinite sequence of real numbers $x_0, x_1, x_2, ...$ satisfy $x_{k+1} =\frac{x_k + 1}{1 - cx_k}$ for all $k \ge 0$. Prove that the sequence $x_0, x_1, x_2, ....$ contains infinitely many positive terms and also contains infinitely many negative terms. PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].