Let $a$ and $b$ be positive integers. Show that if $a^3+b^3$ is the square of an integer, then $a + b$ is not a product of two different prime numbers.

In quadrilateral $ABCD$, $\angle DAB=\angle ABC=110^{\circ}$, $\angle BCD=35^{\circ}$, $\angle CDA=105^{\circ}$, and $AC$ bisects $\angle DAB$. Find $\angle ABD$.

Let be a sequence $ \left( x_n \right)_{n\ge 0} $ with $ x_0\in (0,1) $ and defined as $$ 2x_n=x_{n-1}+\sqrt{3-3x_{n-1}^2} . $$ Prove that this sequence is bounded and periodic. Moreover, find $ x_0 $ for which this sequence is convergent. [i]Ovidiu Țâțan[/i]

Let a regular $7$-gon $A_0A_1A_2A_3A_4A_5A_6$ be inscribed in a circle. Prove that for any two points $P, Q$ on the arc $A_0A_6$ the following equality holds: \[\sum_{i=0}^6 (-1)^{i} PA_i = \sum_{i=0}^6 (-1)^{i} QA_i .\]

[u]Round 1[/u] [b]p1.[/b] The fractal T-shirt for this year's Duke Math Meet is so complicated that the printer broke trying to print it. Thus, we devised a method for manually assembling each shirt - starting with the full-size 'base' shirt, we paste a smaller shirt on top of it. And then we paste an even smaller shirt on top of that one. And so on, infinitely many times. (As you can imagine, it took a while to make all the shirts.) The completed T-shirt consists of the original 'base' shirt along with all of the shirts we pasted onto it. Now suppose the base shirt requires $2011$ $cm^2$ of fabric to make, and that each pasted-on shirt requires $4/5$ as much fabric as the previous one did. How many $cm^2$ of fabric in total are required to make one complete shirt? [b]p2.[/b] A dog is allowed to roam a yard while attached to a $60$-meter leash. The leash is anchored to a $40$-meter by $20$-meter rectangular house at the midpoint of one of the long sides of the house. What is the total area of the yard that the dog can roam? [b]p3.[/b] $10$ birds are chirping on a telephone wire. Bird $1$ chirps once per second, bird $2$ chirps once every $2$ seconds, and so on through bird $10$, which chirps every $10$ seconds. At time $t = 0$, each bird chirps. Define $f(t)$ to be the number of birds that chirp during the $t^{th}$ second. What is the smallest $t > 0$ such that $f(t)$ and $f(t + 1)$ are both at least $4$? [u]Round 2[/u] [b]p4.[/b] The answer to this problem is $3$ times the answer to problem 5 minus $4$ times the answer to problem 6 plus $1$. [b]p5.[/b] The answer to this problem is the answer to problem 4 minus $4$ times the answer to problem 6 minus $1$. [b]p6.[/b] The answer to this problem is the answer to problem 4 minus $2$ times the answer to problem 5. [u]Round 3[/u] [b]p7.[/b] Vivek and Daniel are playing a game. The game ends when one person wins $5$ rounds. The probability that either wins the first round is $1/2$. In each subsequent round the players have a probability of winning equal to the fraction of games that the player has lost. What is the probability that Vivek wins in six rounds? [b]p8.[/b] What is the coefficient of $x^8y^7$ in $(1 + x^2 - 3xy + y^2)^{17}$? [b]p9.[/b] Let $U(k)$ be the set of complex numbers $z$ such that $z^k = 1$. How many distinct elements are in the union of $U(1),U(2),...,U(10)$? [u]Round 4[/u] [b]p10.[/b] Evaluate $29 {30 \choose 0}+28{30 \choose 1}+27{30 \choose 2}+...+0{30 \choose 29}-{30\choose 30}$. You may leave your answer in exponential format. [b]p11.[/b] What is the number of strings consisting of $2a$s, $3b$s and $4c$s such that $a$ is not immediately followed by $b$, $b$ is not immediately followed by $c$ and $c$ is not immediately followed by $a$? [b]p12.[/b] Compute $\left(\sqrt3 + \tan (1^o)\right)\left(\sqrt3 + \tan (2^o)\right)...\left(\sqrt3 + \tan (29^o)\right)$. [u]Round 5[/u] [b]p13.[/b] Three massless legs are randomly nailed to the perimeter of a massive circular wooden table with uniform density. What is the probability that the table will not fall over when it is set on its legs? [b]p14.[/b] Compute $$\sum^{2011}_{n=1}\frac{n + 4}{n(n + 1)(n + 2)(n + 3)}$$ [b]p15.[/b] Find a polynomial in two variables with integer coefficients whose range is the positive real numbers. PS. You had better use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Prove that for any three pairwise different integer numbers $x,y,z$ the expression $(x-y)^5 + (y-z)^5 + (z-x)^5$ is divisible by $5(x-y)(y-z)z-x)$.

Let $f(x)$ and $g(x)$ be strictly increasing linear functions from $\mathbb R $ to $\mathbb R $ such that $f(x)$ is an integer if and only if $g(x)$ is an integer. Prove that for any real number $x$, $f(x)-g(x)$ is an integer.

Given $n$ numbers $a_1,a_2,...,a_n$ ($n\geq 3$) where $a_i\in\{0,1\}$ for all $i=1,2.,,,.n$. Consider $n$ following $n$-tuples \[ \begin{aligned} S_1 & =(a_1,a_2,...,a_{n-1},a_n)\\ S_2 & =(a_2,a_3,...,a_n,a_1)\\ & \vdots\\ S_n & =(a_n,a_1,...,a_{n-2},a_{n-1}).\end{aligned}\] For each tuple $r=(b_1,b_2,...,b_n)$, let \[ \omega (r)=b_1\cdot 2^{n-1}+b_2\cdot 2^{n-2}+\cdots+b_n. \] Assume that the numbers $\omega (S_1),\omega (S_2),...,\omega (S_n)$ receive exactly $k$ different values. a) Prove that $k|n$ and $\frac{2^n-1}{2^k-1}|\omega (S_i)\quad\forall i=1,2,...,n.$ b) Let \[ \begin{aligned} M & =\max _{i=\overline{1,n}}\omega (S_i)\\ m & =\min _{i=\overline{1,n}}\omega (S_i). \end{aligned} \] Prove that \[ M-m\geq\frac{(2^n-1)(2^{k-1}-1)}{2^k-1}. \]

Some of the $n$ faces of a polyhedron are colored in black such that any two black-colored faces have no common vertex. The rest of the faces of the polyhedron are colored in white. Prove that the number of common sides of two white-colored faces of the polyhedron is at least $n-2$.

Compute the maximum area of a triangle having a median of length 1 and a median of length 2.