$(BUL 5)$ Let $Z$ be a set of points in the plane. Suppose that there exists a pair of points that cannot be joined by a polygonal line not passing through any point of $Z.$ Let us call such a pair of points unjoinable. Prove that for each real $r > 0$ there exists an unjoinable pair of points separated by distance $r.$

Coefficients $p$ and $q$ of the equation $x^2+px+q = 0$ are changed and the new ones differ from the old ones by $0.001$ or less. Can the greater root of the new equation differ from that of the old one by $1000$ or more?

What is the least possible sum of two positive integers $a$ and $b$ where $a \cdot b = 10! ?$

Denote by $S(n)$ the sum of digits of $n$. Given a positive integer $N$, we consider the following process: We take the sum of digits $S(N)$, then take its sum of digits $S(S(N))$, then its sum of digits $S(S(S(N)))$... We continue this until we are left with a one-digit number. We call the number of times we had to activate $S(\cdot)$ the [b]depth[/b] of $N$. For example, the depth of 49 is 2, since $S(49)=13\rightarrow S(13)=4$, and the depth of 45 is 1, since $S(45)=9$. [list=a] [*] Prove that every positive integer $N$ has a finite depth, that is, at some point of the process we get a one-digit number. [*] Define $x(n)$ to be the [u]minimal[/u] positive integer with depth $n$. Find the residue of $x(5776)\mod 6$. [*] Find the residue of $x(5776)-x(5708)\mod 2016$. [/list]

In tetrahedron $ABCD$, let $V$ be the volume of the tetrahedron and $R$ the radius of the sphere that it tangent to all four faces of the tetrahedron. Let $P$ be the surface area of the tetrahedron. Prove that $$r=\frac{3V}{P}.$$ [i]Proposed by CaptainFlint.[/i]

Let $ n$ be a positive integer. Prove that $ 2^{n\minus{}1}$ divides \[ \sum_{0\leq k < n/2} \binom{n}{2k\plus{}1}5^k.\]

In triangle $ABC$, $\angle A = 90^\circ$ and $\angle C = 70^\circ$. $F$ is point on $AB$ such that $\angle ACF = 30^\circ$, and $E$ is a point on $CA$ such that $\angle CF E = 20^\circ$. Prove that $BE$ bisects $\angle B$.

The figure below, composed of four regular pentagons with a side length of $1$, was glued in space as follows. First, it was folded along the broken sections, by combining the bold sections, and then formed in such a way that colored sections formed a square. Find the length of the segment $AB$ created in this way. [img]https://cdn.artofproblemsolving.com/attachments/0/7/bddad6449f74cbc7ea2623957ef05b3b0d2f19.png[/img]

[b]p1.[/b] Let $2^k$ be the largest power of $2$ dividing $30! = 30 \cdot 29 \cdot 28 ... 2 \cdot 1$. Find $k$. [b]p2.[/b] Let $d(n)$ be the total number of digits needed to write all the numbers from $1$ to $n$ in base $10$, for example, $d(5) = 5$ and $d(20) = 31$. Find $d(2012)$. [b]p3.[/b] Jim and TongTong play a game. Jim flips $10$ coins and TongTong flips $11$ coins, whoever gets the most heads wins. If they get the same number of heads, there is a tie. What is the probability that TongTong wins? [b]p4.[/b] There are a certain number of potatoes in a pile. When separated into mounds of three, two remain. When divided into mounds of four, three remain. When divided into mounds of five, one remain. It is clear there are at least $150$ potatoes in the pile. What is the least number of potatoes there can be in the pile? [b]p5.[/b] Call an ordered triple of sets $(A, B, C)$ nice if $|A \cap B| = |B \cap C| = |C \cap A| = 2$ and $|A \cap B \cap C| = 0$. How many ordered triples of subsets of $\{1, 2, · · · , 9\}$ are nice? [b]p6.[/b] Brett has an $ n \times n \times n$ cube (where $n$ is an integer) which he dips into blue paint. He then cuts the cube into a bunch of $ 1 \times 1 \times 1$ cubes, and notices that the number of un-painted cubes (which is positive) evenly divides the number of painted cubes. What is the largest possible side length of Brett’s original cube? Note that $\lfloor x\rfloor$ denotes the largest integer less than or equal to $x$. [b]p7.[/b] Choose two real numbers $x$ and $y$ uniformly at random from the interval $[0, 1]$. What is the probability that $x$ is closer to $1/4$ than $y$ is to $1/2$? [b]p8. [/b] In triangle $ABC$, we have $\angle BAC = 20^o$ and $AB = AC$. $D$ is a point on segment $AB$ such that $AD = BC$. What is $\angle ADC$, in degree. [b]p9.[/b] Let $a, b, c, d$ be real numbers such that $ab + c + d = 2012$, $bc + d + a = 2010$, $cd + a + b = 2013$, $da + b + c = 2009$. Find $d$. [b]p10. [/b]Let $\theta \in [0, 2\pi)$ such that $\cos \theta = 2/3$. Find $\sum_{n=0}^{\infty}\frac{1}{2^n}\cos(n \theta)$ PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Keiko walks once around a track at exactly the same constant speed every day. The sides of the track are straight, and the ends are semicircles. The track has width 6 meters, and it takes her 36 seconds longer to walk around the outside edge of the track than around the inside edge. What is Keiko's speed in meters per second? $ \textbf{(A)}\ \frac{\pi}{3} \qquad \textbf{(B)}\ \frac{2\pi}{3} \qquad \textbf{(C)}\ \pi \qquad \textbf{(D)}\ \frac{4\pi}{3} \qquad \textbf{(E)}\ \frac{5\pi}{3} $

Find a irreducible fraction with denominator not greater than 2005, that is closest to $\frac{9}{25}$ but is not $\frac{9}{25}$

Find $$\sum_{a=1}^{9} \sum_{b=1}^{9} \sum_{c=1}^{9} \sum_{d=1}^{9} \min(2a + 0b + 2c + 4d, 4a + 1b + 4c + 3d) + \max(10, a + b + 2c + 2d).$$ [i]Team #10[/i]

Let $ABCD$ be a parallelogram with at least an angle not equal to $90^o$ and $k$ the circumcircle of the triangle $ABC$. Let $E$ be the diametrically opposite point of $B$. Show that the circumcircle of the triangle $ADE$ and $k$ have the same radius.

If $(1)a,b,c,d\in\{1,2,3,4\};(2)a\neq b,b\neq c,c\neq d,d\neq a;(3)a=\min\{a,b,c,d\}$, then the number of different 4-digit-number $\overline{abcd}$ is________.

Points $(\sqrt{\pi}, a)$ and $(\sqrt{\pi}, b)$ are distinct points on the graph of $y^2+x^4=2x^2y+1$. What is $|a-b|$? $ \textbf{(A) }1\qquad\textbf{(B) }\dfrac{\pi}{2}\qquad\textbf{(C) }2\qquad\textbf{(D) }\sqrt{1+\pi}\qquad\textbf{(E) }1+\sqrt{\pi} $

For any positive integer $n$, let $f(n)$ be the number of subsets of $\{1, 2, . . . , n\}$ whose sum is equal to $n$. Does there exist infinitely many positive integers $m$ such that $f(m) = f(m + 1)$? (Note that each element in a subset must be distinct.)

Ahmad and Salem play the following game. Ahmad writes two integers (not necessarily different) on a board. Salem writes their sum and product. Ahmad does the same thing: he writes the sum and product of the two numbers which Salem has just written. They continue in this manner, not stopping unless the two players write the same two numbers one after the other (for then they are stuck!). The order of the two numbers which each player writes is not important. Thus if Ahmad starts by writing $3$ and $-2$, the first five moves (or steps) are as shown: (a) Step 1 (Ahmad) $3$ and $-2$ (b) Step 2 (Salem) $1$ and $-6$ (c) Step 3 (Ahmad) $-5$ and $-6$ (d) Step 4 (Salem) $-11$ and $30$ (e) Step 5 (Ahmad) $19$ and $-330$ (i) Describe all pairs of numbers that Ahmad could write, and ensure that Salem must write the same numbers, and so the game stops at step 2. (ii) What pair of integers should Ahmad write so that the game finishes at step 4? (iii) Describe all pairs of integers which Ahmad could write at step 1, so that the game will finish after finitely many steps. (iv) Ahmad and Salem decide to change the game. The first player writes three numbers on the board, $u, v$ and $w$. The second player then writes the three numbers $u + v + w,uv + vw + wu$ and $uvw$, and they proceed as before, taking turns, and using this new rule describing how to work out the next three numbers. If Ahmad goes first, determine all collections of three numbers which he can write down, ensuring that Salem has to write the same three numbers at the next step.

Let $\mathbb{R}$ be the set of real numbers. Let $f:\mathbb{R}\rightarrow\mathbb{R}$ be a function such that \[f(x+y)f(x-y)\geqslant f(x)^2-f(y)^2\] for every $x,y\in\mathbb{R}$. Assume that the inequality is strict for some $x_0,y_0\in\mathbb{R}$. Prove that either $f(x)\geqslant 0$ for every $x\in\mathbb{R}$ or $f(x)\leqslant 0$ for every $x\in\mathbb{R}$.

[u]Round 9[/u] [b]p25.[/b] Let $S$ be the set of the first $2017$ positive integers. Find the number of elements $n \in S$ such that $\sum^n_{i=1} \left\lfloor \frac{n}{i} \right\rfloor$ is even. [b]p26.[/b] Let $\{x_n\}_{n \ge 0}$ be a sequence with $x_0 = 0$,$x_1 = \frac{1}{20}$ ,$x_2 = \frac{1}{17}$ ,$x_3 = \frac{1}{10}$ , and $x_n = \frac12 ((x_{n-2} +x_{n-4})$ for $n\ge 4$. Compute $$ \left\lfloor \frac{1}{x_{2017!} -x_{2017!-1}} \right\rfloor.$$ [b]p27.[/b] Let $ABCDE$ be be a cyclic pentagon. Given that $\angle CEB = 17^o$, find $\angle CDE + \angle EAB$, in degrees. [u]Round 10[/u] [b]p28.[/b] Let $S = \{1,2,4, ... ,2^{2016},2^{2017}\}$. For each $0 \le i \le 2017$, let $x_i$ be chosen uniformly at random from the subset of $S$ consisting of the divisors of $2^i$ . What is the expected number of distinct values in the set $\{x_0,x_1,x_2,... ,x_{2016},x_{2017}\}$? [b]p29.[/b] For positive real numbers $a$ and $b$, the points $(a, 0)$, $(20,17)$ and $(0,b)$ are collinear. Find the minimum possible value of $a+b$. [b]p30.[/b] Find the sum of the distinct prime factors of $2^{36}-1$. [u]Round 11[/u] [b]p31.[/b] There exist two angle bisectors of the lines $y = 20x$ and $y = 17x$ with slopes $m_1$ and $m_2$. Find the unordered pair $(m_1,m_2)$. [b]p32.[/b] Triangle 4ABC has sidelengths $AB = 13$, $BC = 14$, $C A =15$ and orthocenter $H$. Let $\Omega_1$ be the circle through $B$ and $H$, tangent to $BC$, and let $\Omega_2$ be the circle through $C$ and $H$, tangent to $BC$. Finally, let $R \ne H$ denote the second intersection of $\Omega_1$ and $\Omega_2$. Find the length $AR$. [b]p33.[/b] For a positive integer $n$, let $S_n = \{1,2,3, ...,n\}$ be the set of positive integers less than or equal to $n$. Additionally, let $$f (n) = |\{x \in S_n : x^{2017}\equiv x \,\, (mod \,\, n)\}|.$$ Find $f (2016)- f (2015)+ f (2014)- f (2013)$. [u]Round 12[/u] [b]p34. [/b] Estimate the value of $\sum^{2017}_{n=1} \phi (n)$, where $\phi (n)$ is the number of numbers less than or equal $n$ that are relatively prime to n. If your estimate is $E$ and the correct answer is $A$, your score for this problem will be max $\max \left(0,\lfloor 15 - 75 \frac{|A-E|}{A} \rceil \right).$ [b]p35.[/b] An up-down permutation of order $n$ is a permutation $\sigma$ of $(1,2,3, ..., n)$ such that $\sigma(i ) <\sigma (i +1)$ if and only if $i$ is odd. Denote by $P_n$ the number of up-down permutations of order $n$. Estimate the value of $P_{20} +P_{17}$. If your estimate is $E$ and the correct answer is $A$, your score for this problem will be $\max \left(0, 16 -\lceil \max \left(\frac{E}{A}, 2- \frac{E}{A}\right) \rceil \right).$ [b]p36.[/b] For positive integers $n$, superfactorial of $n$, denoted $n\$ $, is defined as the product of the first $n$ factorials. In other words, we have $n\$ = \prod^n_{i=1}(i !)$. Estimate the number of digits in the product $(20\$)\cdot (17\$)$. If your estimate is $E$ and the correct answer is $A$, your score for this problem will be $\max \left(0, \lfloor 15 -\frac12 |A-E| \rfloor \right).$ PS. You should use hide for answers. Rounds 1-4 have been posted [url=https://artofproblemsolving.com/community/c3h3158491p28715220]here [/url] and 5-8 [url=https://artofproblemsolving.com/community/c3h3158514p28715373]here[/url]. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

How many integers between $1000$ and $9999$ have four distinct digits? $\textbf{(A) }3024\qquad\textbf{(B) }4536\qquad\textbf{(C) }5040\qquad\textbf{(D) }6480\qquad \textbf{(E) }6561$

For each positive integer $n$, let $a_n$ be the number of permutations $\tau$ of $\{1, 2, ... , n\}$ such that $\tau (\tau (\tau (x))) = x$ for $x = 1, 2, ..., n$. The first few values are $a_1 = 1, a_2 = 1, a_3 = 3, a_4 = 9$. Prove that $3^{334}$ divides $a_{2001}$. (A permutation of $\{1, 2, ... , n\}$ is a rearrangement of the numbers $\{1, 2, ... , n\}$ or equivalently, a one-to-one and onto function from $\{1, 2, ... , n\}$ to $\{1, 2, ... , n\}$. For example, one permutation of $\{1, 2, 3\}$ is the rearrangement $\{2, 1, 3\}$, which is equivalent to the function $\sigma : \{1, 2, 3\} \to \{1, 2, 3\}$ defined by $\sigma (1) = 2, \sigma (2) = 1, \sigma (3) = 3$.)

In a triangle $ABC$, with $AB\neq AC$ and $A\neq 60^{0},120^{0}$, $D$ is a point on line $AC$ different from $C$. Suppose that the circumcentres and orthocentres of triangles $ABC$ and $ABD$ lie on a circle. Prove that $\angle ABD=\angle ACB$.

A $3 \times 3$ grid of unit cells is given. A [i]snake of length $k$[/i] is an animal which occupies an ordered $k$-tuple of cells in this grid, say $(s_1, \dots, s_k)$. These cells must be pairwise distinct, and $s_i$ and $s_{i+1}$ must share a side for $i = 1, \dots, k-1$. After being placed in a finite $n \times n$ grid, if the snake is currently occupying $(s_1, \dots, s_k)$ and $s$ is an unoccupied cell sharing a side with $s_1$, the snake can [i]move[/i] to occupy $(s, s_1, \dots, s_{k-1})$ instead. The snake has [i]turned around[/i] if it occupied $(s_1, s_2, \dots, s_k)$ at the beginning, but after a finite number of moves occupies $(s_k, s_{k-1}, \dots, s_1)$ instead. Find the largest integer $k$ such that one can place some snake of length $k$ in a $3 \times 3$ grid which can turn around.

Find all $ r > 0$ such that when $ f: \mathbb R^{2}\to \mathbb R$ is differentiable, $ \|\textrm{grad} \; f(0,0)\| \equal{} 1$, $ \|\textrm{grad} \; f(u) \minus{} \textrm{grad} \; f(v)\| \leq \| u \minus{} v\|$, then the max of $ f$ on the disk $ \|u\|\leq r$, is attained at exactly one point.

Find all triples $(a,b,k)$, $k \geq 2$, of positive integers such that $(a^k+b)(b^k+a)$ is a power of two.