Let $a, b$ and $c$ be positive real numbers such that $$a^2+ab+ac-bc = 0.$$ a) Show that if two of the numbers $a, b$ and $c$ are equal, then at least one of the numbers $a, b$ and $c$ is irrational. b) Show that there exist infinitely many triples $(m, n, p)$ of positive integers such that $$m^2 + mn + mp -np = 0.$$

Let $x$ be a solution to the equation $\lfloor x \lfloor x + 2\rfloor + 2\rfloor = 10$. Compute the smallest $C$ such that for any solution $x$, $x < C$. Here, $\lfloor m \rfloor$ is defined as the greatest integer less than or equal to $m$. For example, $\lfloor 3\rfloor = 3$ and $\lfloor -4.25\rfloor = -5$.

Calculate the sum: $1+ 2q + 3q^2 +...+nq^{n-1}$

Find all positive integers $ k$ for which the following statement is true: If $ F(x)$ is a polynomial with integer coefficients satisfying the condition $ 0 \leq F(c) \leq k$ for each $ c\in \{0,1,\ldots,k \plus{} 1\}$, then $ F(0) \equal{} F(1) \equal{} \ldots \equal{} F(k \plus{} 1)$.

[b]p1.[/b] Twelve tables are set up in a row for a Millenium party. You want to put $2000$ cupcakes on the tables so that the numbers of cupcakes on adjacent tables always differ by one (for example, if the $5$th table has $20$ cupcakes, then the $4$th table has either $19$ or $21$ cupcakes, and the $6$th table has either $19$ or $21$ cupcakes). a) Find a way to do this. b) Suppose a Y2K bug eats one of the cupcakes, so you have only $1999$ cupcakes. Show that it is impossible to arrange the cupcakes on the tables according to the above conditions. [b]p2.[/b] Let $P$ and $Q$ lie on the hypotenuse $AB$ of the right triangle $CAB$ so that $|AP|=|PQ|=|QB|=|AB|/3$. Suppose that $|CP|^2+|CQ|^2=5$. Prove that $|AB|$ has the same value for all such triangles, and find that value. Note: $|XY|$ denotes the length of the segment $XY$. [b]p3.[/b] Let $P$ be a polynomial with integer coefficients and let $a, b, c$ be integers. Suppose $P(a)=b$, $P(b)=c$, and $P(c)=a$. Prove that $a=b=c$. [b]p4.[/b] A lattice point is a point $(x,y)$ in the plane for which both $x$ and $y$ are integers. Each lattice point is painted with one of $1999$ available colors. Prove that there is a rectangle (of nonzero height and width) whose corners are lattice points of the same color. [b]p5.[/b] A $1999$-by-$1999$ chocolate bar has vertical and horizontal grooves which divide it into $1999^2$ one-by-one squares. Caesar and Brutus are playing the following game with the chocolate bar: A move consists of a player picking up one chocolate rectangle; breaking it along a groove into two smaller rectangles; and then either putting both rectangles down or eating one piece and putting the other piece down. The players move alternately. The one who cannot make a move at his turn (because there are only one-by-one squares left) loses. Caesar starts. Which player has a winning strategy? Describe a winning strategy for that player. PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Determine all real solutions of the following system of equations: $$x+y^2=y^3$$ $$y+x^2=x^3$$

Say that a positive integer is [i]sweet[/i] if it uses only the digits 0, 1, 2, 4, and 8. For instance, 2014 is sweet. There are sweet integers whose squares are sweet: some examples (not necessarily the smallest) are 1, 2, 11, 12, 20, 100, 202, and 210. There are sweet integers whose cubes are sweet: some examples (not necessarily the smallest) are 1, 2, 10, 20, 200, 202, 281, and 2424. Prove that there exists a sweet positive integer $n$ whose square and cube are both sweet, such that the sum of all the digits of $n$ is 2014.

For $k \in \left \{ 0, 1, \ldots, 9 \right \},$ let $\epsilon_k \in \left \{-1, 1 \right \}$. If the minimum possible value of $\sum_{i = 1}^9 \sum_{j = 0}^{i -1} \epsilon_i \epsilon_j 2^{i + j}$ is $m$, find $|m|$.

For positive integers $x, y, $ $r_x(y)$ to represent the smallest positive integer $ r $ such that $ r \equiv y(\text{mod x})$ .For any positive integers $a, b, n ,$ Prove that $$\sum_{i=1}^{n} r_b(a i)\leq \frac{n(a+b)}{2}$$

Cookie Monster says a positive integer $n$ is $crunchy$ if there exist $2n$ real numbers $x_1,x_2,\ldots,x_{2n}$, not all equal, such that the sum of any $n$ of the $x_i$'s is equal to the product of the other $n$ of the $x_i$'s. Help Cookie Monster determine all crunchy integers. [i]Yannick Yao[/i]

Prove that every positive rational number can be expressed uniquely as a finite sum of the form $$a_1+\frac{a_2}{2!}+\frac{a_3}{3!}+\dots+\frac{a_n}{n!},$$ where $a_n$ are integers such that $0 \leq a_n \leq n-1$ for all $n > 1$.

The sum of the reciprocals of the roots of the equation $ ax^2 \plus{} bx \plus{} c \equal{} 0$ is: $ \textbf{(A)}\ \frac {1}{a} \plus{} \frac {1}{b} \qquad \textbf{(B)}\ \minus{} \frac {c}{b} \qquad \textbf{(C)}\ \frac {b}{c} \qquad \textbf{(D)}\ \minus{} \frac {a}{b} \qquad \textbf{(E)}\ \minus{} \frac {b}{c}$

Let $a,b,c$ be sides of the triangle. Prove that \[ a^2\left(\frac{b}{c}-1\right)+b^2\left(\frac{c}{a}-1\right)+c^2\left(\frac{a}{b}-1\right)\geq 0 . \]

Find all functions $f : \mathbb{Q} \to \mathbb{R}$ such that $f(x)f(y)f(x+y) = f(xy)(f(x) + f(y))$ for all $x,y\in\mathbb{Q}$. [i]Sammy Luo and Alex Zhu.[/i]

A monic polynomial is a polynomial whose highest degree coefficient is 1. Let $P(x)$ and $Q(x)$ be monic polynomial with real coefficients and $degP(x)=degQ(x)=10$. Prove that if the equation $P(x)=Q(x)$ has no real solutions then $P(x+1)=Q(x-1)$ has a real solution

a) Divide $a^{128} - b^{128}$ by $(a + b)(a^2 + b^2)(a^4 + b^4)(a^8 + b^8)(a^{16} + b^{16})(a^{32} + b^{32})(a^{64} + b^{64}) $. b) Divide $a^{2^k} - b^{2^k}$ by $(a + b)(a^2 + b^2)(a^4 + b^4) ... (a^{2^{k-1}} + b^{2^{k-1}})$

Find all real numbers $a, b, c$ such that $x^3 + ax^2 + bx + c$ has three real roots $\alpha, \beta,\gamma$ (not necessarily all distinct) and the equation $x^3 + \alpha^3 x^2 + \beta^3 x + \gamma^3$ has roots $\alpha^3, \beta^3,\gamma^3$ .

For positive real numbers $a$ and $b,$ let $f(a,b)$ denote the real number $x$ such that area of the (non-degenerate) triangle with side lengths $a,b,$ and $x$ is maximized. Find \[ \sum_{n=2}^{100}f\left(\sqrt{\tbinom{n}{2}},\sqrt{\tbinom{n+1}{2}}\right). \]

Let $n$ be an integer and $a, b$ real numbers such that $n > 1$ and $a > b > 0$. Prove that $$(a^n - b^n) \left ( \frac{1}{b^{n- 1}} - \frac{1}{a^{n -1}}\right) > 4n(n -1)(\sqrt{a} - \sqrt{b})^2$$

Three line segments, all of length $1$, form a connected figure in the plane. Any two different line segments can intersect only at their endpoints. Find the maximum area of the convex hull of the figure.

Without using a calculator (especially a computer), find out what is more: $$\sqrt[3]{5\sqrt{13}+18}- \sqrt[3]{2\sqrt{13}+5} \,\,\, or \,\,\, 1 $$

Let $f:\mathbb{N} \cup \{0\} \to \mathbb{N} \cup \{0\}$ be defined by $f(0)=0$, $$f(2n+1)=2f(n)$$ for $n \ge 0$ and $$f(2n)=2f(n)+1$$ for $n \ge 1$ If $g(n)=f(f(n))$, prove that $g(n-g(n))=0$ for all $n \ge 0$.

Find all pairs of integers $(a,b)$ such that $(b^2+7(a-b))^2=a^{3}b$.

a) Let $ x_1, x_2, ..., x_n $ ($ n> 2 $) be negative real numbers and $ x_1 + x_2 + ... + x_n = m. $ Determine the maximum value of the sum $ S = x_1x_2 + x_1x_3 + \dots + x_1x_n + x_2x_3 + x_2x_4 + \dots + x_2x_n + \dots + x_ {n-1} x_n. $ b) Let $ x_1, x_2, ..., x_n $ ($ n> 2 $) be nonnegative natural numbers and $ x_1 + x_2 + ... + x_n = m. $ Determine the maximum value of the sum $ S = x_1x_2 + x_1x_3 + \dots + x_1x_n + x_2x_3 + x_2x_4 + \dots + x_2x_n + \dots + x_ {n-1} x_n. $

Evaluate the product $\prod_{k=0}^{2^{1999}}(4\sin^2 \frac{k\pi}{2^{2000}}-3)$