[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.

Source: 2018 Canadian Open Math Challenge Part C Problem 2 ----- Alice has two boxes $A$ and $B$. Initially box $a$ contains $n$ coins and box $B$ is empty. On each turn, she may either move a coin from box $a$ to box $B$, or remove $k$ coins from box $A$, where $k$ is the current number of coins in box $B$. She wins when box $A$ is empty. $\text{(a)}$ If initially box $A$ contains 6 coins, show that Alice can win in 4 turns. $\text{(b)}$ If initially box $A$ contains 31 coins, show that Alice cannot win in 10 turns. $\text{(c)}$ What is the minimum number of turns needed for Alice to win if box $A$ initially contains 2018 coins?

Faces of a convex polyhedron are six squares and 8 equilateral triangles and each edge is a common side for one triangle and one square. All dihedral angles obtained from the triangle and square with a common edge, are equal. Prove that it is possible to circumscribe a sphere around the polyhedron, and compute the ratio of the squares of volumes of that polyhedron and of the ball whose boundary is the circumscribed sphere.

A quadrilateral is cut from a piece of gift wrapping paper, which has equally wide white and gray stripes. The grey stripes in the quadrilateral have a combined area of $10$. Determine the area of the quadrilateral. [img]https://1.bp.blogspot.com/-ia13b4RsNs0/XzP0cepAcEI/AAAAAAAAMT8/0UuCogTRyj4yMJPhfSK3OQihRqfUT7uSgCLcBGAsYHQ/s0/2020%2Bmohr%2Bp2.png[/img]

Find all numbers $x$ such that: $1+2\cdot2^x+3\cdot3^x<6^x$

We are given a finite collection of segments in the plane, of total length 1. Prove that there exists a line $ l$ such that the sum of the lengths of the projections of the given segments to the line $ l$ is less than $ \frac{2}{\pi}.$

Determine all functions $f: \mathbb{R} \rightarrow \mathbb{R}$ that satisfy $$(f(a)-f(b))(f(b)-f(c))(f(c)-f(a)) = f(ab^2+bc^2+ca^2) - f(a^2b+b^2c+c^2a)$$for all real numbers $a$, $b$, $c$. [i]Proposed by Ankan Bhattacharya, USA[/i]

5. Tom has 13 weight pieces that look equal, however 12 of them weigh the same and the 13th piece is fake and weighs more than the others. He also has two balances: one shows correctly which pan is heavier or that their weights are equal, the other one gives the correct result when the weights on the pans differ, and gives a random result when the weights are equal. (Tom does not know which balance is which). Tom can choose the balance before each weighting. Prove that he can surely determine the fake weight piece in three weighings. Andrey Arzhantsev

Triangle $ABC$ has side lengths $AB=18$, $BC=36$, and $CA=24$. The circle $\Gamma$ passes through point $C$ and is tangent to segment $AB$ at point $A$. Let $X$, distinct from $C$, be the second intersection of $\Gamma$ with $BC$. Moreover, let $Y$ be the point on $\Gamma$ such that segment $AY$ is an angle bisector of $\angle XAC$. Suppose the length of segment $AY$ can be written in the form $AY=\frac{p\sqrt{r}}{q}$ where $p$, $q$, and $r$ are positive integers such that $gcd(p, q)=1$ and $r$ is square free. Find the value of $p+q+r$.

For any positive integer $d$, prove there are infinitely many positive integers $n$ such that $d(n!)-1$ is a composite number.

On a chessboard of $16 \times 16$ squares, a "horse" moves making only movements of two types: from each square you can move either two squares to the right and one up, or two boxes up and one to the right. Determine in how many ways different the horse can move from the lower left square of the board to the top right box.

Find all sequences ${{a}_{1}},{{a}_{2}},...,{{a}_{2000}}$ of real numbers such that $\sum\limits_{n=1}^{2000}{{{a}_{n}}=1999}$ and such that $\frac{1}{2}<{{a}_{n}}<1$ and ${{a}_{n+1}}={{a}_{n}}(2-{{a}_{n}})$ for all $n\ge 1$.

Let $O$ be the center of the circle of the triangle $ABC$ with $AB \ne AC$. Furthermore, let $S$ and $T$ be points on the rays $AB$ and $AC$, such that $\angle ASO = \angle ACO$ and $\angle ATO = \angle ABO$. Show that $ST$ bisects the segment $BC$.

Let $ABC$ be an acute-angled triangle in which no two sides have the same length. The reflections of the centroid $G$ and the circumcentre $O$ of $ABC$ in its sides $BC,CA,AB$ are denoted by $G_1,G_2,G_3$ and $O_1,O_2,O_3$, respectively. Show that the circumcircles of triangles $G_1G_2C$, $G_1G_3B$, $G_2G_3A$, $O_1O_2C$, $O_1O_3B$, $O_2O_3A$ and $ABC$ have a common point. [i]The centroid of a triangle is the intersection point of the three medians. A median is a line connecting a vertex of the triangle to the midpoint of the opposite side.[/i]

Let $M = F_1\times\cdots\times F_k$ be the product of $k$ smooth, closed surfaces (2-dimensional, $C^\infty$, compact, connected, manifold without boundary), $s$ of which are non-orientable. Prove that $M$ can be embedded in $\mathbb{R}^{2k+s+1}$.

Triangle $ABC$ has an obtuse angle at $\angle A$. Points $D$ and $E$ are placed on $\overline{BC}$ in the order $B$, $D$, $E$, $C$ such that $\angle BAD=\angle BCA$ and $\angle CAE=\angle CBA$. If $AB=10$, $AC=11$, and $DE=4$, determine $BC$.

Find the angle $\angle A$ of a triangle $ABC$, when we know it's altitudes $BD$ and $CE$ intersect in an interior point $H$ of the triangle and $BH=2HD$ and $CH=HE$.

Let $r$ be the result of doubling both the base and exponent of $a^b$, $b\neq 0$. If $r$ equals the product of $a^b$ by $x^b$, then $x$ equals: ${{ \textbf{(A)} a\qquad\textbf{(B)}\ 2a \qquad\textbf{(C)}\ 4a \qquad\textbf{(D)}\ 2}\qquad\textbf{(E)}\ 4} $

[u]Round 5[/u] [b]p13.[/b] Initially, the three numbers $20$, $201$, and $2016$ are written on a blackboard. Each minute, Zhuo selects two of the numbers on the board and adds $1$ to each. Find the minimum $n$ for which Zhuo can make all three numbers equal to $n$. [b]p14.[/b] Call a three-letter string rearrangeable if, when the first letter is moved to the end, the resulting string comes later alphabetically than the original string. For example, $AAA$ and $BAA$ are not rearrangeable, while $ABB$ is rearrangeable. How many three-letters strings with (not necessarily distinct) uppercase letters are rearrangeable? [b]p15.[/b] Triangle $ABC$ is an isosceles right triangle with $\angle C = 90^o$ and $AC = 1$. Points $D$, $E$ and $F$ are chosen on sides $BC$,$CA$ and $AB$, respectively, such that $AEF$, $BFD$, $CDE$, and $DEF$ are isosceles right triangles. Find the sum of all distinct possible lengths of segment $DE$. [u]Round 6[/u] [b]p16.[/b] Let $p, q$, and $r$ be prime numbers such that $pqr = 17(p + q + r)$. Find the value of the product $pqr$. [b]p17.[/b] A cylindrical cup containing some water is tilted $45$ degrees from the vertical. The point on the surface of the water closest to the bottom of the cup is $6$ units away. The point on the surface of the water farthest from the bottom of the cup is $10$ units away. Compute the volume of the water in the cup. [b]p18.[/b] Each dot in an equilateral triangular grid with $63$ rows and $2016 = \frac12 \cdot 63 \cdot 64$ dots is colored black or white. Every unit equilateral triangle with three dots has the property that exactly one of its vertices is colored black. Find all possible values of the number of black dots in the grid. [u]Round 7[/u] [b]p19.[/b] Tomasz starts with the number $2$. Each minute, he either adds $2$ to his number, subtracts $2$ from his number, multiplies his number by $2$, or divides his number by $2$. Find the minimum number of minutes he will need in order to make his number equal $2016$. [b]p20.[/b] The edges of a regular octahedron $ABCDEF$ are painted with $3$ distinct colors such that no two edges with the same color lie on the same face. In how many ways can the octahedron be painted? Colorings are considered different under rotation or reflection. [b]p21.[/b] Jacob is trapped inside an equilateral triangle $ABC$ and must visit each edge of triangle $ABC$ at least once. (Visiting an edge means reaching a point on the edge.) His distances to sides $AB$, $BC$, and $CA$ are currently $3$, $4$, and $5$, respectively. If he does not need to return to his starting point, compute the least possible distance that Jacob must travel. [u]Round 8[/u] [b]p22.[/b] Four integers $a, b, c$, and $d$ with a $\le b \le c \le d$ satisfy the property that the product of any two of them is equal to the sum of the other two. Given that the four numbers are not all equal, determine the $4$-tuple $(a, b, c, d)$. [b]p23.[/b] In equilateral triangle $ABC$, points $D$,$E$, and $F$ lie on sides $BC$,$CA$ and $AB$, respectively, such that $BD = 4$ and $CD = 5$. If $DEF$ is an isosceles right triangle with right angle at $D$, compute $EA + FA$. [b]p24.[/b] On each edge of a regular tetrahedron, four points that separate the edge into five equal segments are marked. There are sixteen planes that are parallel to a face of the tetrahedron and pass through exactly three of the marked points. When the tetrahedron is cut along each of these sixteen planes, how many new tetrahedrons are produced? PS. You should use hide for answers. Rounds 1-4 have been posted [url=https://artofproblemsolving.com/community/c3h2934049p26256220]here[/url]. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Find all functions $f : \mathbb{Z} \to\mathbb{ Z}$ such that \[ n^2+4f(n)=f(f(n))^2 \] for all $n\in \mathbb{Z}$. [i]Proposed by Sahl Khan, UK[/i]