When a positive integer $N$ is fed into a machine, the output is a number calculated according to the rule shown below. [asy] size(300); defaultpen(linewidth(0.8)+fontsize(13)); real r = 0.05; draw((0.9,0)--(3.5,0),EndArrow(size=7)); filldraw((4,2.5)--(7,2.5)--(7,-2.5)--(4,-2.5)--cycle,gray(0.65)); fill(circle((5.5,1.25),0.8),white); fill(circle((5.5,1.25),0.5),gray(0.65)); fill((4.3,-r)--(6.7,-r)--(6.7,-1-r)--(4.3,-1-r)--cycle,white); fill((4.3,-1.25+r)--(6.7,-1.25+r)--(6.7,-2.25+r)--(4.3,-2.25+r)--cycle,white); fill((4.6,-0.25-r)--(6.4,-0.25-r)--(6.4,-0.75-r)--(4.6,-0.75-r)--cycle,gray(0.65)); fill((4.6,-1.5+r)--(6.4,-1.5+r)--(6.4,-2+r)--(4.6,-2+r)--cycle,gray(0.65)); label("$N$",(0.45,0)); draw((7.5,1.25)--(11.25,1.25),EndArrow(size=7)); draw((7.5,-1.25)--(11.25,-1.25),EndArrow(size=7)); label("if $N$ is even",(9.25,1.25),N); label("if $N$ is odd",(9.25,-1.25),N); label("$\frac N2$",(12,1.25)); label("$3N+1$",(12.6,-1.25)); [/asy] For example, starting with an input of $N = 7$, the machine will output $3 \cdot 7 + 1 = 22$. Then if the output is repeatedly inserted into the machine five more times, the final output is $26$. $$ 7 \to 22 \to 11 \to 34 \to 17 \to 52 \to 26$$ When the same 6-step process is applied to a different starting value of $N$, the final output is $1$. What is the sum of all such integers $N$? $$ N \to \_\_ \to \_\_ \to \_\_ \to \_\_ \to \_\_ \to 1$$ $\textbf{(A)}\ 73 \qquad \textbf{(B)}\ 74 \qquad \textbf{(C)}\ 75 \qquad \textbf{(D)}\ 82 \qquad \textbf{(E)}\ 83$

$(MON 5)$ Find the radius of the circle circumscribed about the isosceles triangle whose sides are the solutions of the equation $x^2 - ax + b = 0$.

Let $XY$ be a chord of a circle $\Omega$, with center $O$, which is not a diameter. Let $P, Q$ be two distinct points inside the segment $XY$, where $Q$ lies between $P$ and $X$. Let $\ell$ the perpendicular line drawn from $P$ to the diameter which passes through $Q$. Let $M$ be the intersection point of $\ell$ and $\Omega$, which is closer to $P$. Prove that $$ MP \cdot XY \ge 2 \cdot QX \cdot PY$$

Prove that if $ \alpha$ and $ \beta$ are positive irrational numbers satisfying $ \frac{1}{\alpha}\plus{}\frac{1}{\beta}\equal{} 1$, then the sequences \[ \lfloor\alpha\rfloor,\lfloor 2\alpha\rfloor,\lfloor 3\alpha\rfloor,\cdots\] and \[ \lfloor\beta\rfloor,\lfloor 2\beta\rfloor,\lfloor 3\beta\rfloor,\cdots\] together include every positive integer exactly once.

Find all the integer solutions of the equation $ m^4 + 2n^2 = 9mn$.

Let $m$ and $n$ be positive integers with $m\geq n$. There are $m$ cupcakes of different flavors arranged around a circle and $n$ people who like cupcakes. Each person assigns a nonnegative real number score to each cupcake, depending on how much they like the cupcake. Suppose that for each person $P$, it is possible to partition the circle of $m$ cupcakes into $n$ groups of consecutive cupcakes so that the sum of $P$'s scores of the cupcakes in each group is at least $1$. Prove that it is possible to distribute the $m$ cupcakes to the $n$ people so that each person $P$ receives cupcakes of total score at least $1$ with respect to $P$.

An aqueous solution is known to contain $\text{Ag}^+, \text{Mg}^{2+},$ and $\text{Sr}^{2+}$ ions. Which reagent should be used to selectively precipitate the $\text{Ag}^+$? ${ \textbf{(A)}\ 0.20 \text{M NaCl} \qquad\textbf{(B)}\ 0.20 \text{M NaOH} \qquad\textbf{(C)}\ 0.20 \text{M Na}_2\text{SO}_4 \qquad\textbf{(D)}\ 0.20 \text{M Na}_3\text{PO}_4 }$

Does there exist a function $s\colon \mathbb{Q} \rightarrow \{-1,1\}$ such that if $x$ and $y$ are distinct rational numbers satisfying ${xy=1}$ or ${x+y\in \{0,1\}}$, then ${s(x)s(y)=-1}$? Justify your answer. [i]Proposed by Dan Brown, Canada[/i]

Define for positive integer $n$, a function $f_n(x)=\frac{\ln x}{x^n}\ (x>0).$ In the coordinate plane, denote by $S_n$ the area of the figure enclosed by $y=f_n(x)\ (x\leq t)$, the $x$-axis and the line $x=t$ and denote by $T_n$ the area of the rectagle with four vertices $(1,\ 0),\ (t,\ 0),\ (t,\ f_n(t))$ and $(1,\ f_n(t))$. (1) Find the local maximum $f_n(x)$. (2) When $t$ moves in the range of $t>1$, find the value of $t$ for which $T_n(t)-S_n(t)$ is maximized. (3) Find $S_1(t)$ and $S_n(t)\ (n\geq 2)$. (4) For each $n\geq 2$, prove that there exists the only $t>1$ such that $T_n(t)=S_n(t)$. Note that you may use $\lim_{x\to\infty} \frac{\ln x}{x}=0.$

Is it true that for any positive integer $n>1$, there exists an infinite arithmetic progression $M_n$ of positive integers, such that for any $m \in M_n$, the number $n^m-1$ is not a perfect power (a positive integer is a perfect power if it is of the form $a^b$ for positive integers $a, b>1$)?

Altitudes $AA_1$ and $BB_1$ of triangle ABC meet in point $H$. Line $CH$ meets the semicircle with diameter $AB$, passing through $A_1, B_1$, in point $D$. Segments $AD$ and $BB_1$ meet in point $M$, segments $BD$ and $AA_1$ meet in point $N$. Prove that the circumcircles of triangles $B_1DM$ and $A_1DN$ touch.

[u]Set 1[/u] [b]p1.[/b] Farmer John has $4000$ gallons of milk in a bucket. On the first day, he withdraws $10\%$ of the milk in the bucket for his cows. On each following day, he withdraws a percentage of the remaining milk that is $10\%$ more than the percentage he withdrew on the previous day. For example, he withdraws $20\%$ of the remaining milk on the second day. How much milk, in gallons, is left after the tenth day? [b]p2.[/b] Will multiplies the first four positive composite numbers to get an answer of $w$. Jeremy multiplies the first four positive prime numbers to get an answer of $j$. What is the positive difference between $w$ and $j$? [b]p3.[/b] In Nathan’s math class of $60$ students, $75\%$ of the students like dogs and $60\%$ of the students like cats. What is the positive difference between the maximum possible and minimum possible number of students who like both dogs and cats? [u]Set 2[/u] [b]p4.[/b] For how many integers $x$ is $x^4 - 1$ prime? [b]p5.[/b] Right triangle $\vartriangle ABC$ satisfies $\angle BAC = 90^o$. Let $D$ be the foot of the altitude from $A$ to $BC$. If $AD = 60$ and $AB = 65$, find the area of $\vartriangle ABC$. [b]p6.[/b] Define $n! = n \times (n - 1) \times ... \times 1$. Given that $3! + 4! + 5! = a^2 + b^2 + c^2$ for distinct positive integers $a, b, c$, find $a + b + c$. [u]Set 3[/u] [b]p7.[/b] Max nails a unit square to the plane. Let M be the number of ways to place a regular hexagon (of any size) in the same plane such that the square and hexagon share at least $2$ vertices. Vincent, on the other hand, nails a regular unit hexagon to the plane. Let $V$ be the number of ways to place a square (of any size) in the same plane such that the square and hexagon share at least $2$ vertices. Find the nonnegative difference between $M$ and $V$ . [b]p8.[/b] Let a be the answer to this question, and suppose $a > 0$. Find $\sqrt{a +\sqrt{a +\sqrt{a +...}}}$ . [b]p9.[/b] How many ordered pairs of integers $(x, y)$ are there such that $x^2 - y^2 = 2019$? [u]Set 4[/u] [b]p10.[/b] Compute $\frac{p^3 + q^3 + r^3 - 3pqr}{p + q + r}$ where $p = 17$, $q = 7$, and $r = 8$. [b]p11.[/b] The unit squares of a $3 \times 3$ grid are colored black and white. Call a coloring good if in each of the four $2 \times 2$ squares in the $3 \times 3$ grid, there is either exactly one black square or exactly one white square. How many good colorings are there? Consider rotations and reflections of the same pattern distinct colorings. [b]p12.[/b] Define a $k$-[i]respecting [/i]string as a sequence of $k$ consecutive positive integers $a_1$, $a_2$, $...$ , $a_k$ such that $a_i$ is divisible by $i$ for each $1 \le i \le k$. For example, $7$, $8$, $9$ is a $3$-respecting string because $7$ is divisible by $1$, $8$ is divisible by $2$, and $9$ is divisible by $3$. Let $S_7$ be the set of the first terms of all $7$-respecting strings. Find the sum of the three smallest elements in $S_7$. [u]Set 5[/u] [b]p13.[/b] A triangle and a quadrilateral are situated in the plane such that they have a finite number of intersection points $I$. Find the sum of all possible values of $I$. [b]p14.[/b] Mr. DoBa continuously chooses a positive integer at random such that he picks the positive integer $N$ with probability $2^{-N}$ , and he wins when he picks a multiple of 10. What is the expected number of times Mr. DoBa will pick a number in this game until he wins? [b]p15.[/b] If $a, b, c, d$ are all positive integers less than $5$, not necessarily distinct, find the number of ordered quadruples $(a, b, c, d)$ such that $a^b - c^d$ is divisible by $5$. PS. You had better use hide for answers. Last 4 sets have been posted [url=https://artofproblemsolving.com/community/c4h2777362p24370554]here[/url]. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Three points $A,B,C$ are such that $B\in AC$. On one side of $AC$, draw the three semicircles with diameters $AB,BC,CA$. The common interior tangent at $B$ to the first two semicircles meets the third circle $E$. Let $U,V$ be the points of contact of the common exterior tangent to the first two semicircles. Evaluate the ratio $R=\frac{[EUV]}{[EAC]}$ as a function of $r_{1} = \frac{AB}{2}$ and $r_2 = \frac{BC}{2}$, where $[X]$ denotes the area of polygon $X$.

Five points on a circle are numbered 1,2,3,4, and 5 in clockwise order. A bug jumps in a clockwise direction from one point to another around the circle; if it is on an odd-numbered point, it moves one point, and if it is on an even-numbered point, it moves two points. If the bug begins on point 5, after 1995 jumps it will be on point [asy] size(80); defaultpen(linewidth(0.7)+fontsize(10)); draw(unitcircle); for(int i = 0; i < 5; ++i) { pair P = dir(90+i*72); dot(P); label("$"+string(i+1)+"$",P,1.4*P); }[/asy] $\textbf{(A)}\ 1 \qquad \textbf{(B)}\ 2 \qquad \textbf{(C)}\ 3 \qquad \textbf{(D)}\ 4 \qquad \textbf{(E)}\ 5$

$f(x)$ is continuous on the interval $[0, \pi]$ and satisfies \[ \int\limits_0^\pi f(x)dx=0, \qquad \int\limits_0^\pi f(x)\cos x dx=0 \] Show that $f(x)$ has at least two zeros in the interval $(0, \pi)$.

Determine all functions $f: R\to R$, such that $f (2x + f (y)) = x + y + f (x)$ for all $x, y \in R$. (Gerhard Kirchner)

On a circle, distinct points $A_1, ... , A_{16}$ are chosen. Consider all possible convex polygons all of whose vertices are among $A_1, ... , A_{16}$ . These polygons are divided into $2$ groups, the first group comprising all polygons with $A_1$ as a vertex, the second group comprising the remaining polygons. Which group is more numerous?

Let $ABCD$ be a convex quadrilateral with $AB = AD.$ Let $T$ be a point on the diagonal $AC$ such that $\angle ABT + \angle ADT = \angle BCD.$ Prove that $AT + AC \geq AB + AD.$

Points $A_1$, $B_1$ and $C_1$ are taken on the respective edges $SA$, $SB$, $SC$ of a regular triangular pyramid $SABC$ so that the planes $A_1B_1C_1$ and $ABC$ are parallel. Let $O$ be the center of the sphere passing through $A$, $B$, $C_1$ and $S$. Prove that the line $SO$ is perpendicular to the plane $A_1B_1C$.

Let $n$ be a positive integer. Show that the equation \[\sqrt{x}+\sqrt{y}=\sqrt{n}\] have solution of pairs of positive integers $(x,y)$ if and only if $n$ is divisible by some perfect square greater than $1$. [i]Proposer: Nanang Susyanto[/i]

Circles $\omega_1$ and $\omega_2$ intersect at points $A$ and $B$. At point $A$ to $\omega_1$ and $\omega_2$ the tangents $\ell_1$ and $\ell_2$ are drawn respectively. The points $T_1$ and $T_2$ are chosen respectively on the circles $\omega_1$ and $\omega_2$ so that the angular measures of the arcs $T_1A$ and $AT_2$ are equal (the measure of the circular arc is calculated clockwise). The tangent $t_1$ at the point $ T_1$ to the circle $\omega_1$ intersects $\ell_2$ at the point $M_1$. Similarly, the tangent $t_2$ at the point $T_2$ to the circle $\omega_2$ intersects $\ell_1$ at point $M_2$. Prove that the midpoints of the segments $M_1M_2$ are on the same a straight line that does not depend on the position of points $T_1$, $T_2$.

Let $ n $ be a positive integer. Consider words of length $n$ composed of letters from the set $ \{ M, E, O \} $. Let $ a $ be the number of such words containing an even number (possibly 0) of blocks $ ME $ and an even number (possibly 0) blocks of $ MO $ . Similarly let $ b $ the number of such words containing an odd number of blocks $ ME $ and an odd number of blocks $ MO $. Prove that $ a>b $.

Find all natural numbers $n>3$, such that $2^{2000}$ is divisible by $1+C^1_n+C^2_n+C^3_n$.

Let $a_n$ be a sequence such that $a_1 = 1$ and $a_{n+1} = \lfloor a_n +\sqrt{a_n} +\frac12 \rfloor $, where $\lfloor x \rfloor$ denotes the greatest integer less than or equal to $x$. What are the last four digits of $a_{2012}$?

Let $a_1=5$ and $a_{n+1}= a^2_{n}-2$ for any $n=1,2,...$. a) Find $\lim_{n \rightarrow \infty}\frac{a_{n+1}}{a_1a_2 ...a_{n}}$ b) Find $\lim_{\nu \rightarrow \infty}\left(\frac{1}{a_1}+\frac{1}{a_1a_2}+...+\frac{1}{a_1a_2 ...a_{\nu}}\right)$