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.

Susie pays for $4$ muffins and $3$ bananas. Calvin spends twice as much paying for $2$ muffins and $16$ bananas. A muffin is how many times as expensive as a banana? $ \textbf {(A) } \frac{3}{2} \qquad \textbf {(B) } \frac{5}{3} \qquad \textbf {(C) } \frac{7}{4} \qquad \textbf {(D) } 2 \qquad \textbf {(E) } \frac{13}{4}$

Let $\triangle ABC$ and $\triangle C'B'A$ be two congruent triangles ( with this order and orient. ). Define point $M$ as the midpoint of segment $AB$ and suppose that the extension of $CB'$ from $B'$ passes trough $M$ , if $F$ be a point on the smaller arc $MC$ of circumcircle of triangle $\triangle BMC$ such that $\angle FB'A=90$ and $\angle C'CB' \neq 90$ , then prove that $\angle B'C'C=\angle CAF$. [i]Proposed by Alireza Dadgarnia[/i]

Let $ABCD$ be a rectangle with $AB = 20$ and $AD = 23.$ Let $M$ be the midpoint of $CD,$ and let $X$ be the reflection of $M$ across point $A.$ Compute the area of triangle $XBD.$

We define a relation between subsets of $\mathbb R ^n$. $A \sim B\Longleftrightarrow$ we can partition $A,B$ in sets $A_1,\dots,A_n$ and $B_1,\dots,B_n$(i.e $\displaystyle A=\bigcup_{i=1} ^n A_i,\ B=\bigcup_{i=1} ^n B_i, A_i\cap A_j=\emptyset,\ B_i\cap B_j=\emptyset$) and $A_i\simeq B_i$. Say the the following sets have the relation $\sim$ or not ? a) Natural numbers and composite numbers. b) Rational numbers and rational numbers with finite digits in base 10. c) $\{x\in\mathbb Q|x<\sqrt 2\}$ and $\{x\in\mathbb Q|x<\sqrt 3\}$ d) $A=\{(x,y)\in\mathbb R^2|x^2+y^2<1\}$ and $A\setminus \{(0,0)\}$

Let $p,q \in \mathbb N^{\ast}$, $p,q \geq 2$. We say that a set $X$ has the property $\left( \mathcal S \right)$ if no matter how we choose $p$ subsets $B_i \subset X$, $i = \overline{1,n}$, not necessarily distinct, each with $q$ elements, there is a subset $Y \subset X$ with $p$ elements s.t. the intersection of $Y$ with each of the $B_i$'s has an element at most, $i=\overline{1,p}$. Prove that: (a) if $p=4,q=3$ then any set composed of $9$ elements doesn't have $\left( \mathcal S \right)$; (b) any set $X$ composed of $pq-q$ elements doesn't have the property $\left( \mathcal S \right)$; (c) any set $X$ composed of $pq-q+1$ elements has the property $\left( \mathcal S \right)$. [i]Dan Schwarz[/i]

Let $ABC$ be a triangle such that the altitude $CD$ is equal to $AB$. The squares $DBEF$ and $ADGH$ are constructed with $F,G$ on $CD$. Show that the segments $CD,AE$ and $BH$ are concurrent.

It is given that $a_{11}, a_{22}$ are real numbers, that $x_1, x_2, a_{12}, b_1, b_2$ are complex numbers, and that $a_{11}a_{22}=a_{12}\overline{a_{12}}$ (Where $\overline{a_{12}}$ is he conjugate of $a_{12}$). We consider the following system in $x_1, x_2$: \[\overline{x_1}(a_{11}x_1 + a_{12}x_2) = b_1,\]\[\overline{x_2}(a_{12}x_1 + a_{22}x_2) = b_2.\] [b](a) [/b]Give one condition to make the system consistent. [b](b) [/b]Give one condition to make $\arg x_1 - \arg x_2 = 98^{\circ}.$

Let $ABC$ be a scalene acute triangle, where $AL$ $(L \in BC)$ is the internal bisector of $\angle BAC$ and $M$ is the midpoint of $BC$. Let the internal bisectors of $\angle AMB$ and $\angle CMA$ intersect $AB$ and $AC$ in $P$ and $Q$, respectively. Prove that the circumcircle of $APQ$ is tangent to $BC$ if and only if $L$ belongs to it.

Consider the infinite grid of lattice points in $\mathbb{Z}^3$. Little D and Big Z play a game, where Little D first loses a shoe on an unmunched point in the grid. Then, Big Z munches a shoe-free plane perpendicular to one of the coordinate axes. They continue to alternate turns in this fashion, with Little D's goal to lose a shoe on each of $n$ consecutive lattice points on a line parallel to one of the coordinate axes. Determine all $n$ for which Little D can accomplish his goal. [i]David Yang.[/i]

Let $a, b, c, d$ be positive real numbers satisfying $a+b+c+d =1$. Show that \[\frac{2}{(a+b)(c+d)} \leq \frac{1}{\sqrt{ab}}+ \frac{1}{\sqrt{cd}}\mbox{.}\] [i](Swiss Mathematical Olympiad 2011, Final round, problem 6)[/i]

We are numbering the rows and columns of a $29 \text{x} 29$ chess table with numbers $1, 2, ..., 29$ in order (Top row is numbered with $1$ and first columns is numbered with $1$ as well). We choose some of the squares in this chess table and for every selected square, we know that there exist at most one square having a row number greater than or equal to this selected square's row number and a column number greater than or equal to this selected square's column number. How many squares can we choose at most?

Let $s=a+b+c$, where $a$, $b$, and $c$ are integers that are lengths of the sides of a box. The volume of the box is numerically equal to the sum of the lengths of the twelve edges of the box plus its surface area. Find the sum of the possible values of $s$.

Let $n \ge 2$ be an integer. There are $n$ beads numbered $1, 2, \ldots, n$. Two necklaces made out of some of these beads are considered the same if we can get one by rotating the other (with no flipping allowed). For example, with $n \ge 5$, the necklace with four beads $1, 5, 3, 2$ in the clockwise order is same as the one with $5, 3, 2, 1$ in the clockwise order, but is different from the one with $1, 2, 3, 5$ in the clockwise order. We denote by $D_0(n)$ (respectively $D_1(n)$) the number of ways in which we can use all the beads to make an even number (resp. an odd number) of necklaces each of length at least $3$. Prove that $n - 1$ divides $D_1(n) - D_0(n)$.

Let a circle $ (O)$ with diameter $ AB$. A point $ M$ move inside $ (O)$. Internal bisector of $ \widehat{AMB}$ cut $ (O)$ at $ N$, external bisector of $ \widehat{AMB}$ cut $ NA,NB$ at $ P,Q$. $ AM,BM$ cut circle with diameter $ NQ,NP$ at $ R,S$. Prove that: median from $ N$ of triangle $ NRS$ pass over a fix point.

Find all integers $b$ and $c$ for which the equation $x^2-bx+c=0$ has two real roots $x_{1}$ and $x_{2}$ satisfying $x_{1}^2+x_{2}^2=5$.