Let $n$ be a positive integer. Daniel and Merlijn are playing a game. Daniel has $k$ sheets of paper lying next to each other on a table, where $k$ is a positive integer. On each of the sheets, he writes some of the numbers from $1$ up to $n$ (he is allowed to write no number at all, or all numbers). On the back of each of the sheets, he writes down the remaining numbers. Once Daniel is finished, Merlijn can flip some of the sheets of paper (he is allowed to flip no sheet at all, or all sheets). If Merlijn succeeds in making all of the numbers from $1$ up to n visible at least once, then he wins. Determine the smallest $k$ for which Merlijn can always win, regardless of Daniel’s actions.

Let $ n \in \mathbb{Z}^\plus{}$ and let $ a, b \in \mathbb{R}.$ Determine the range of $ x_0$ for which \[ \sum^n_{i\equal{}0} x_i \equal{} a \text{ and } \sum^n_{i\equal{}0} x^2_i \equal{} b,\] where $ x_0, x_1, \ldots , x_n$ are real variables.

A set $S$ of positive integers is said to be [i]channeler[/i] if for any three distinct numbers $a,b,c \in S$, we have $a\mid bc$, $b\mid ca$, $c\mid ab$. a) Prove that for any finite set of positive integers $ \{ c_1, c_2, \ldots, c_n \} $ there exist infinitely many positive integers $k$, such that the set $ \{ kc_1, kc_2, \ldots, kc_n \} $ is a channeler set. b) Prove that for any integer $n \ge 3$ there is a channeler set who has exactly $n$ elements, and such that no integer greater than $1$ divides all of its elements.

Let $A$ be a set with $|A|=225$, meaning that $A$ has 225 elements. Suppose further that there are eleven subsets $A_1, \ldots, A_{11}$ of $A$ such that $|A_i|=45$ for $1\leq i\leq11$ and $|A_i\cap A_j|=9$ for $1\leq i<j\leq11$. Prove that $|A_1\cup A_2\cup\ldots\cup A_{11}|\geq 165$, and give an example for which equality holds.

There are direct routes from every city of a certain country to every other city. The prices are known in advance. Two tourists (they do not necessary start from one city) have decided to visit all the cities, using only direct travel lines. The first always chooses the cheapest ticket to the city, he has never been before (if there are several -- he chooses arbitrary destination among the cheapests). The second -- the most expensive (they do not return to the first city). Prove that the first will spend not more money for the tickets, than the second.

Let \(x,y,z\) be real numbers, each greater than \(1\). Prove that \(\dfrac{x+1}{y+1}+\dfrac{y+1}{z+1}+\dfrac{z+1}{x+1} \leq \dfrac{x-1}{y-1}+\dfrac{y-1}{z-1}+\dfrac{z-1}{x-1}\).

Let $ABCD$ be a square (vertices labelled in clockwise order). Let $Z$ be any point on diagonal $AC$ between $A$ and $C$ such that $AZ > ZC$. Points $X$ and $Y$ exist such that $AXY Z $ is a square (vertices labelled in clockwise order) and point $B$ lies inside $AXY Z$. Let $M$ be the point of intersection of lines $BX$ and $DZ$ (extended if necessary). Prove that $C$, $M$ and $Y$ are colinear

Prove that for each real number $r>2$, there are exactly two or three positive real numbers $x$ satisfying the equation $x^2=r\lfloor x \rfloor$.

Find the maximum number of Permutation of set {$1,2,3,...,2014$} such that for every 2 different number $a$ and $b$ in this set at last in one of the permutation $b$ comes exactly after $a$

For positive real numbers $a,b,c,d$, with $abcd = 1$, determine all values taken by the expression \[\frac {1+a+ab} {1+a+ab+abc} + \frac {1+b+bc} {1+b+bc+bcd} +\frac {1+c+cd} {1+c+cd+cda} +\frac {1+d+da} {1+d+da+dab}.\] (Dan Schwarz)

Prove that the equation \[6(6a^{2}+3b^{2}+c^{2}) = 5n^{2}\] has no solutions in integers except $a=b=c=n=0$.

If $\angle A = 20^\circ$ and $\angle AFG = \angle AGF$, then $\angle B + \angle D = $ [asy] pair A,B,C,D,EE,F,G; A = (0,0); B = (9,4); C = (21,0); D = (13,-12); EE = (4,-16); F = (13/2,-6); G = (8,0); draw(A--C--EE--B--D--cycle); label("$A$",A,W); label("$B$",B,N); label("$C$",C,E); label("$D$",D,SE); label("$E$",EE,SW); label("$F$",F,WSW); label("$G$",G,NW); [/asy] $\text{(A)}\ 48^\circ \qquad \text{(B)}\ 60^\circ \qquad \text{(C)}\ 72^\circ \qquad \text{(D)}\ 80^\circ \qquad \text{(E)}\ 90^\circ$

In triangle $ ABC$,$ \angle BAC \equal{} 120^o$. Let the angle bisectors of angles $ A;B$and $ C$ meet the opposite sides at $ D;E$ and$ F$ respectively. Prove that the circle on diameter $ EF$ passes through $ D.$

In this exercise we only consider convex quadrilaterals. (a) For such a quadrilateral $ABCD$, determine the set of points $P$ contained within that quadrilateral for which $PA$ and $PC$ divide the quadrilateral into two pieces of equal areas. (b) Prove that there is a point $P$ inside such a quadrilateral, such that the triangles $PAB$ and $PCD$ have equal areas, as well as the triangles $PBC$ and $PAD$. (c) Find out which quadrilaterals $ABCD$ contains a point $P$, so that the triangles $PAB$, $PBC$, $PCD$ and $PDA$ have equal areas.

$a_i, x_i$ are positive reals such that $a_1 + a_2 + ... + a_n = x_1 + x_2 + ... + x_n = 1$. Show that \[ 2 \sum_{i<j} x_ix_j \leq \frac{n-2}{n-1} + \sum \frac{a_ix_i ^2}{1-a_i} \] When do we have equality?

Does there exist a function $f: \mathbb R \to \mathbb R $ satisfying the following conditions: (i) for each real $y$ there is a real $x$ such that $f(x)=y$ , and (ii) $f(f(x)) = (x - 1)f(x) + 2$ for all real $x$ ? [i]Proposed by Igor I. Voronovich, Belarus[/i]

In plane there are two circles with radiuses $r_1$ and $r_2$, one outside the other. There are two external common tangents on those circles and one internal common tangent. The internal one intersects external ones in points $A$ and $B$ and touches one of the circles in point $C$. Prove that $AC \cdot BC=r_1\cdot r_2$

Find all pairs $(m,n)$ of positive odd integers, such that $n \mid 3m+1$ and $m \mid n^2+3$.

On side $\overline{AB}$ of square $ABCD$, point $E$ is selected. Points $F$ and $G$ are located on sides $\overline{AB}$ and $\overline{AD}$, respectively, such that $\overline{FG} \perp \overline{CE}$. Let $P$ be the intersection point of segments $\overline{FG}$ and $\overline{CE}$. Given that $[EPF] = 1$, $[EPGA] = 8$, and $[CPFB] = 15$, compute $[PGDC]$. (Here $[\mathcal P]$ denotes the area of the polygon $\mathcal P$.) [i]Proposed by Aaron Lin[/i]

Let $k$ and $m$ be positive integers. For a positive integer $n$, let $f(n)$ be the number of integer sequences $x_1,\,\ldots,\,x_k,\,y_1,\,\ldots,\,y_m,\,z$ satisfying $1\leq x_1\leq\cdots\leq x_k\leq z\leq n$ and $1\leq y_1\leq\cdots\leq y_m\leq z\leq n$. Show that $f(n)$ can be expressed as a polynomial in $n$ with nonnegative coefficients.

For each nonzero integer $ n$ find all functions $ f: \mathbb{R} \minus{} \{\minus{}3,0 \} \rightarrow \mathbb{R}$ satisfying: $ f(x\plus{}3)\plus{}f \left( \minus{}\frac{9}{x} \right)\equal{}\frac{(1\minus{}n)(x^2\plus{}3x\minus{}9)}{9n(x\plus{}3)}\plus{}\frac{2}{n}$ for all $ x \not\equal{} 0,\minus{}3.$ Furthermore, for each fixed $ n$ find all integers $ x$ for which $ f(x)$ is an integer.

Triangle $ABC$ satisfies $\angle ABC < \angle BCA < \angle CAB < 90^{\circ}$. $O$ is the circumcenter of triangle $ABC$, and $K$ is the reflection of $O$ in $BC$. $D,E$ is the foot of perpendicular line from $K$ to line $AB$, $AC$, respectively. Line $DE$ meets $BC$ at $P$, and a circle with diameter $AK$ meets the circumcircle of triangle $ABC$ at $Q(\neq A)$. If $PQ$ cuts the perpendicular bisector of $BC$ at $S$, then prove that $S$ lies on the circle with diameter $AK$.

[u]Round 5[/u] [b]5.1.[/b] Quadrilateral $ABCD$ is such that $\angle ABC = \angle ADC = 90^o$ , $\angle BAD = 150^o$ , $AD = 3$, and $AB = \sqrt3$. The area of $ABCD$ can be expressed as $p\sqrt{q}$ for positive integers $p, q$ where $q$ is not divisible by the square of any prime. Find $p + q$. [b]5.2.[/b] Neetin wants to gamble, so his friend Akshay describes a game to him. The game will consist of three dice: a $100$-sided one with the numbers $1$ to $100$, a tetrahedral one with the numbers $1$ to $4$, and a normal $6$-sided die. If Neetin rolls numbers with a product that is divisible by $21$, he wins. Otherwise, he pays Akshay $100$ dollars. The number of dollars that Akshay must pay Neetin for a win in order to make this game fair is $a/b$ for relatively prime positive integers $a, b$. Find $a + b$. (Fair means the expected net gain is $0$. ) [b]5.3.[/b] What is the sum of the fourth powers of the roots of the polynomial $P(x) = x^2 + 2x + 3$? [u]Round 6[/u] [b]6.1.[/b] Consider the set $S = \{1, 2, 3, 4,..., 25\}$. How many ordered $n$-tuples $S_1 = (a_1, a_2, a_3,..., a_n)$ of pairwise distinct ai exist such that $a_i \in S$ and $i^2 | a_i$ for all $1 \le i \le n$? [b]6.2.[/b] How many ways are there to place $2$ identical rooks and $ 1$ queen on a $ 4 \times 4$ chessboard such that no piece attacks another piece? (A queen can move diagonally, vertically or horizontally and a rook can move vertically or horizontally) [b]6.3.[/b] Let $L$ be an ordered list $\ell_1$, $\ell_2$, $...$, $\ell_{36}$ of consecutive positive integers who all have the sum of their digits not divisible by $11$. It is given that $\ell_1$ is the least element of $L$. Find the least possible value of $\ell_1$. [u]Round 7[/u] [b]7.1.[/b] Spencer, Candice, and Heather love to play cards, but they especially love the highest cards in the deck - the face cards (jacks, queens, and kings). They also each have a unique favorite suit: Spencer’s favorite suit is spades, Candice’s favorite suit is clubs, and Heather’s favorite suit is hearts. A dealer pulls out the $9$ face cards from every suit except the diamonds and wants to deal them out to the $3$ friends. How many ways can he do this so that none of the $3$ friends will see a single card that is part of their favorite suit? [b]7.2.[/b] Suppose a sequence of integers satisfies the recurrence $a_{n+3} = 7a_{n+2} - 14a_{n+1} + 8a_n$. If $a_0 = 4$, $a_1 = 9$, and $a_2 = 25$, find $a_{16}$. Your answer will be in the form $2^a + 2^b + c$, where $2^a < a_{16} < 2^{a+1}$ and $b$ is as large as possible. Find $a + b + c$. [b]7.3.[/b] Parallel lines $\ell_1$ and $\ell_2$ are $1$ unit apart. Unit square $WXYZ$ lies in the same plane with vertex $W$ on $\ell_1$. Line $\ell_2$ intersects segments $YX$ and $YZ$ at points $U$ and $O$, respectively. Given $UO =\frac{9}{10}$, the inradius of $\vartriangle YOU$ can be expressed as $\frac{m}{n}$ for relatively prime positive integers $m, n$. Find $m + n$. [u]Round 8[/u] [b]8.[/b] Let $A$ be the number of contestants who participated in at least one of the three rounds of the 2020 ABMC April contest. Let $B$ be the number of times the letter b appears in the Accuracy Round. Let $M$ be the number of people who submitted both the speed and accuracy rounds before 2:00 PM EST. Further, let $C$ be the number of times the letter c appears in the Speed Round. Estimate $$A \cdot B + M \cdot C.$$Your answer will be scored according to the following formula, where $X$ is the correct answer and $I$ is your input. $$max \left\{ 0, \left\lceil min \left\{13 - \frac{|I-X|}{0.05 |I|}, 13 - \frac{|I-X|}{0.05 |I-2X|} \right\} \right\rceil \right\}$$ PS. You should use hide for answers. Rounds 1-4 have been posted [url=https://artofproblemsolving.com/community/c3h2766239p24226402]here[/url]. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Find the maximum value of $x$ such that $x$ divides all $p^{32} - 1$ for all primes $p> 20$. [i]2022 CCA Math Bonanza Individual Round #9[/i]

Given is a polynomial $f$ of degree $m$ with integer coefficients and positive leading coefficient. A positive integer $n$ is $\textit {good for f(x)}$ if there exists a positive integer $k_n$, such that $n!+1=f(n)^{k_n}$. Prove that there exist only finitely many integers good for $f$.