Anselmo and Bonifacio start a game where they alternatively substitute a number written on a board. In each turn, a player can substitute the written number by either the number of divisors of the written number or by the difference between the written number and the number of divisors it has. Anselmo is the first player to play, and whichever player is the first player to write the number $0$ is the winner. Given that the initial number is $1036$, determine which player has a winning strategy and describe that strategy. Note: For example, the number of divisors of $14$ is $4$, since its divisors are $1$, $2$, $7$, and $14$.

[b]p1.[/b] Let $X,Y ,Z$ be nonzero real numbers such that the quadratic function $X t^2 - Y t + Z = 0$ has the unique root $t = Y$ . Find $X$. [b]p2.[/b] Let $ABCD$ be a kite with $AB = BC = 1$ and $CD = AD =\sqrt2$. Given that $BD =\sqrt5$, find $AC$. [b]p3.[/b] Find the number of integers $n$ such that $n -2016$ divides $n^2 -2016$. An integer $a$ divides an integer $b$ if there exists a unique integer $k$ such that $ak = b$. [b]p4.[/b] The points $A(-16, 256)$ and $B(20, 400)$ lie on the parabola $y = x^2$ . There exists a point $C(a,a^2)$ on the parabola $y = x^2$ such that there exists a point $D$ on the parabola $y = -x^2$ so that $ACBD$ is a parallelogram. Find $a$. [b]p5.[/b] Figure $F_0$ is a unit square. To create figure $F_1$, divide each side of the square into equal fifths and add two new squares with sidelength $\frac15$ to each side, with one of their sides on one of the sides of the larger square. To create figure $F_{k+1}$ from $F_k$ , repeat this same process for each open side of the smallest squares created in $F_n$. Let $A_n$ be the area of $F_n$. Find $\lim_{n\to \infty} A_n$. [img]https://cdn.artofproblemsolving.com/attachments/8/9/85b764acba2a548ecc61e9ffc29aacf24b4647.png[/img] [b]p6.[/b] For a prime $p$, let $S_p$ be the set of nonnegative integers $n$ less than $p$ for which there exists a nonnegative integer $k$ such that $2016^k -n$ is divisible by $p$. Find the sum of all $p$ for which $p$ does not divide the sum of the elements of $S_p$ . [b]p7. [/b] Trapezoid $ABCD$ has $AB \parallel CD$ and $AD = AB = BC$. Unit circles $\gamma$ and $\omega$ are inscribed in the trapezoid such that circle $\gamma$ is tangent to $CD$, $AB$, and $AD$, and circle $\omega$ is tangent to $CD$, $AB$, and $BC$. If circles $\gamma$ and $\omega$ are externally tangent to each other, find $AB$. [b]p8.[/b] Let $x, y, z$ be real numbers such that $(x+y)^2+(y+z)^2+(z+x)^2 = 1$. Over all triples $(x, y, z)$, find the maximum possible value of $y -z$. [b]p9.[/b] Triangle $\vartriangle ABC$ has sidelengths $AB = 13$, $BC = 14$, and $CA = 15$. Let $P$ be a point on segment $BC$ such that $\frac{BP}{CP} = 3$, and let $I_1$ and $I_2$ be the incenters of triangles $\vartriangle ABP$ and $\vartriangle ACP$. Suppose that the circumcircle of $\vartriangle I_1PI_2$ intersects segment $AP$ for a second time at a point $X \ne P$. Find the length of segment $AX$. [b]p10.[/b] For $1 \le i \le 9$, let Ai be the answer to problem i from this section. Let $(i_1,i_2,... ,i_9)$ be a permutation of $(1, 2,... , 9)$ such that $A_{i_1} < A_{i_2} < ... < A_{i_9}$. For each $i_j$ , put the number $i_j$ in the box which is in the $j$th row from the top and the $j$th column from the left of the $9\times 9$ grid in the bonus section of the answer sheet. Then, fill in the rest of the squares with digits $1, 2,... , 9$ such that $\bullet$ each bolded $ 3\times 3$ grid contains exactly one of each digit from $ 1$ to $9$, $\bullet$ each row of the $9\times 9$ grid contains exactly one of each digit from $ 1$ to $9$, and $\bullet$ each column of the $9\times 9$ grid contains exactly one of each digit from $ 1$ to $9$. PS. You had better use hide for answers.

[u]Round 5[/u] [b]5.1[/b] A circle with a radius of $1$ is inscribed in a regular hexagon. This hexagon is inscribed in a larger circle. If the area that is outside the hexagon but inside the larger circle can be expressed as $\frac{a\pi}{b} - c\sqrt{d}$, where $a, b, c, d$ are positive integers, $a, b$ are relatively prime, and no prime perfect square divides into $d$. find the value of $a + b + c + d$. [b]5.2[/b] At a dinner party, $10$ people are to be seated at a round table. If person A cannot be seated next to person $B$ and person $C$ must be next to person $D$, how many ways can the 10 people be seated? Consider rotations of a configuration identical. [b]5.3[/b] Let $N$ be the sum of all the positive integers that are less than $2022$ and relatively prime to $1011$. Find $\frac{N}{2022}$. [u]Round 6[/u] [b]6.1[/b] The line $y = m(x - 6)$ passes through the point $ A$ $(6, 0)$, and the line $y = 8 -\frac{x}{m}$ pass through point $B$ $(0,8)$. The two lines intersect at point $C$. What is the largest possible area of triangle $ABC$? [b]6.2[/b] Let $N$ be the number of ways there are to arrange the letters of the word MATHEMATICAL such that no two As can be adjacent. Find the last $3$ digits of $\frac{N}{100}$. [b]6.3[/b] Find the number of ordered triples of integers $(a, b, c)$ such that $|a|, |b|, |c| \le 100$ and $3abc = a^3 + b^3 + c^3$. [u]Round 7[/u] [b]7.1[/b] In a given plane, let $A, B$ be points such that $AB = 6$. Let $S$ be the set of points such that for any point $C$ in $S$, the circumradius of $\vartriangle ABC$ is at most $6$. Find $a + b + c$ if the area of $S$ can be expressed as $a\pi + b\sqrt{c}$ where $a, b, c$ are positive integers, and $c$ is not divisible by the square of any prime. [b]7.2[/b] Compute $\sum_{1\le a<b<c\le 7} abc$. [b]7.3[/b] Three identical circles are centered at points $A, B$, and $C$ respectively and are drawn inside a unit circle. The circles are internally tangent to the unit circle and externally tangent to each other. A circle centered at point $D$ is externally tangent to circles $A, B$, and $C$. If a circle centered at point $E$ is externally tangent to circles $A, B$, and $D$, what is the radius of circle $E$? The radius of circle $E$ can be expressed as $\frac{a\sqrt{b}-c}{d}$ where $a, b, c$, and d are all positive integers, gcd(a, c, d) = 1, and b is not divisible by the square of any prime. What is the sum of $a + b + c + d$? [u]Round 8[/u] [b]8.[/b] Let $A$ be the number of unused Algebra problems in our problem bank. Let $B$ be the number of times the letter ’b’ appears in our problem bank. Let M be the median speed round score. Finally, let $C$ be the number of correct answers to Speed Round $1$. 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/c3h2826128p24988676]here[/url]. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

In a multiple choice test there were 4 questions and 3 possible answers for each question. A group of students was tested and it turned out that for any three of them there was a question which the three students answered differently. What is the maximum number of students tested?

Let $K$ and $N > K$ be fixed positive integers. Let $n$ be a positive integer and let $a_1, a_2, ..., a_n$ be distinct integers. Suppose that whenever $m_1, m_2, ..., m_n$ are integers, not all equal to $0$, such that $\mid{m_i}\mid \le K$ for each $i$, then the sum $$\sum_{i = 1}^{n} m_ia_i$$ is not divisible by $N$. What is the largest possible value of $n$? [i]Proposed by Ilija Jovcevski, North Macedonia[/i]

Let the boxes in picture $1$ be marked as in picture $2$ below (from top to bottom in layers). In one move it is allowed to switch the empty box with another box adjacent to it (two boxes are adjacent if they share a common side). Can the arrangement of the numbers in picture $3$ be obtained after finitely many moves?

The vertices of a regular $n$-gon are initially marked with one of the signs $+$ or $-$ . A [i]move[/i] consists in choosing three consecutive vertices and changing the signs from the vertices , from $+$ to $-$ and from $-$ to $+$. [b]a)[/b] Prove that if $n=2015$ then for any initial configuration of signs , there exists a sequence of [i]moves[/i] such that we'll arrive at a configuration with only $+$ signs. [b]b)[/b] Prove that if $n=2016$ , then there exists an initial configuration of signs such that no matter how we make the [i]moves[/i] we'll never arrive at a configuration with only $+$ signs.

[i]25 problems for 30 minutes[/i] [b]p1.[/b] Compute $2^2 + 0 \cdot 0 + 2^2 + 3^3$. [b]p2.[/b] How many total letters (not necessarily distinct) are there in the names Jerry, Justin, Jackie, Jason, and Jeffrey? [b]p3.[/b] What is the remainder when $20232023$ is divided by $50$? [b]p4.[/b] Let $ABCD$ be a square. The fraction of the area of $ABCD$ that is the area of the intersection of triangles $ABD$ and $ABC$ can be expressed as $\frac{a}{b}$ , where $a$ and $b$ relatively prime positive integers. Find $a + b$. [b]p5.[/b] Raymond is playing basketball. He makes a total of $15$ shots, all of which are either worth $2$ or $3$ points. Given he scored a total of $40$ points, how many $2$-point shots did he make? [b]p6.[/b] If a fair coin is flipped $4$ times, the probability that it lands on heads more often than tails is $\frac{a}{b}$ , where $a$ and $b$ relatively prime positive integers. Find $a + b$. [b]p7.[/b] What is the sum of the perfect square divisors of $640$? [b]p8.[/b] A regular hexagon and an equilateral triangle have the same perimeter. The ratio of the area between the hexagon and equilateral triangle can be expressed in the form $\frac{a}{b}$ , where $a$ and $b$ are relatively prime positive integers. Find $a + b$. [b]p9.[/b] If a cylinder has volume $1024\pi$, radius of $r$ and height $h$, how many ordered pairs of integers $(r, h)$ are possible? [b]p10.[/b] Pump $A$ can fill up a balloon in $3$ hours, while pump $B$ can fill up a balloon in $5$ hours. Pump $A$ starts filling up a balloon at $12:00$ PM, and pump $B$ is added alongside pump $A$ at a later time. If the balloon is completely filled at $2:00$ PM, how many minutes after $12:00$ PM was Pump $B$ added? [b]p11.[/b] For some positive integer $k$, the product $81 \cdot k$ has $20$ factors. Find the smallest possible value of $k$. [b]p12.[/b] Two people wish to sit in a row of fifty chairs. How many ways can they sit in the chairs if they do not want to sit directly next to each other and they do not want to sit with exactly one empty chair between them? [b]p13.[/b] Let $\vartriangle ABC$ be an equilateral triangle with side length $2$ and $M$ be the midpoint of $BC$. Let $P$ be a point in the same plane such that $2PM = BC$. The minimum value of $AP$ can be expressed as $\sqrt{a}-b$, where $a$ and $b$ are positive integers such that $a$ is not divisible by any perfect square aside from $1$. Find $a + b$. [b]p14.[/b] What are the $2022$nd to $2024$th digits after the decimal point in the decimal expansion of $\frac{1}{27}$ , expressed as a $3$ digit number in that order (i.e the $2022$nd digit is the hundreds digit, $2023$rd digit is the tens digit, and $2024$th digit is the ones digit)? [b]p15.[/b] After combining like terms, how many terms are in the expansion of $(xyz+xy+yz+xz+x+y+z)^{20}$? [b]p16.[/b] Let $ABCD$ be a trapezoid with $AB \parallel CD$ where $AB > CD$, $\angle B = 90^o$, and $BC = 12$. A line $k$ is dropped from $A$, perpendicular to line $CD$, and another line $\ell$ is dropped from $C$, perpendicular to line $AD$. $k$ and $\ell$ intersect at $X$. If $\vartriangle AXC$ is an equilateral triangle, the area of $ABCD$ can be written as $m\sqrt{n}$, where $m$ and $n$ are positive integers such that $n$ is not divisible by any perfect square aside from $1$. Find $m + n$. [b]p17.[/b] If real numbers $x$ and $y$ satisfy $2x^2 + y^2 = 8x$, maximize the expression $x^2 + y^2 + 4x$. [b]p18.[/b] Let $f(x)$ be a monic quadratic polynomial with nonzero real coefficients. Given that the minimum value of $f(x)$ is one of the roots of $f(x)$, and that $f(2022) = 1$, there are two possible values of $f(2023)$. Find the larger of these two values. [b]p19.[/b] I am thinking of a positive integer. After realizing that it is four more than a multiple of $3$, four less than a multiple of $4$, four more than a multiple of 5, and four less than a multiple of $7$, I forgot my number. What is the smallest possible value of my number? [b]p20.[/b] How many ways can Aston, Bryan, Cindy, Daniel, and Evan occupy a row of $14$ chairs such that none of them are sitting next to each other? [b]p21.[/b] Let $x$ be a positive real number. The minimum value of $\frac{1}{x^2} +\sqrt{x}$ can be expressed in the form \frac{a}{b^{(c/d)}} , where $a$, $b$, $c$, $d$ are all positive integers, $a$ and $b$ are relatively prime, $c$ and $d$ are relatively prime, and $b$ is not divisible by any perfect square. Find $a + b + c + d$. [b]p22.[/b] For all $x > 0$, the function $f(x)$ is defined as $\lfloor x \rfloor \cdot (x + \{x\})$. There are $24$ possible $x$ such that $f(x)$ is an integer between $2000$ and $2023$, inclusive. If the sum of these $24$ numbers equals $N$, then find $\lfloor N \rfloor$. Note: Recall that $\lfloor x \rfloor$ is the greatest integer less than or equal to $x$, called the floor function. Also, $\{x\}$ is defined as $x - \lfloor x \rfloor$, called the fractional part function. [b]p23.[/b] Let $ABCD$ be a rectangle with $AD = 1$. Let $P$ be a point on diagonal $\overline{AC}$, and let $\omega$ and $\xi$ be the circumcircles of $\vartriangle APB$ and $\vartriangle CPD$, respectively. Line $\overleftrightarrow{AD}$ is extended, intersecting $\omega$ at $X$, and $\xi$ at $Y$ . If $AX = 5$ and $DY = 2$, find $[ABCD]^2$. Note: $[ABCD]$ denotes the area of the polygon $ABCD$. [b]p24.[/b] Alice writes all of the three-digit numbers on a blackboard (it’s a pretty big blackboard). Let $X_a$ be the set of three-digit numbers containing a somewhere in its representation, where a is a string of digits. (For example, $X_{12}$ would include $12$, $121$, $312$, etc.) If Bob then picks a value of $a$ at random so $0 \le a \le 999$, the expected number of elements in $X_a$ can be expressed as $\frac{m}{n}$ , where $m$ and $n$ are relatively prime positive integers. Find$ m + n$. [b]p25.[/b] Let $f(x) = x^5 + 2x^4 - 2x^3 + 4x^2 + 5x + 6$ and $g(x) = x^4 - x^3 + x^2 - x + 1$. If $a$, $b$, $c$, $d$ are the roots of $g(x)$, then find $f(a) + f(b) + f(c) + f(d)$. PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Maria wants to solve a challenge with a deck of cards, each with a different figure. Initially, the cards are distributed randomly into two piles, not necessarily in equal parts. Maria's goal is to get all the cards into the same pile. On each turn, Maria takes the top card from each pile and compares them. In the rule book, there's a table that indicates, for each card match, which of the two wins. Both cards are then placed on the bottom of the winning card in the order Maria chooses. The challenge ends when all the cards are in one pile. Show that it is always possible for Maria to solve the challenge. Regardless of the initial distribution of the cards and the table in the rule book.

Given a positive integer $n$, find the proportion of the subsets of $\{1,2, \ldots, 2n\}$ such that their smallest element is odd.

There are $2000$ cities in the country, some pairs of cities are connected by roads. It is known that no more than $N$ different non-self-intersecting cyclic routes of odd length. Prove that the country can be divided into $N + 2$ republics so that no two cities from the same republic are connected by a road.

Let $n \geq 2$ be a given integer $a)$ Prove that one can arrange all the subsets of the set $\{1,2... ,n\}$ as a sequence of subsets $A_{1}, A_{2},\cdots , A_{2^{n}}$, such that $|A_{i+1}| = |A_{i}| + 1$ or $|A_{i}| - 1$ where $i = 1,2,3,\cdots , 2^{n}$ and $A_{2^{n} + 1} = A_{1}$ $b)$ Determine all possible values of the sum $\sum \limits_{i = 1}^{2^n} (-1)^{i}S(A_{i})$ where $S(A_{i})$ denotes the sum of all elements in $A_{i}$ and $S(\emptyset) = 0$, for any subset sequence $A_{1},A_{2},\cdots ,A_{2^n}$ satisfying the condition in $a)$

For a finite set $A$ of positive integers, a partition of $A$ into two disjoint nonempty subsets $A_1$ and $A_2$ is $\textit{good}$ if the least common multiple of the elements in $A_1$ is equal to the greatest common divisor of the elements in $A_2$. Determine the minimum value of $n$ such that there exists a set of $n$ positive integers with exactly $2015$ good partitions.

Alice and Bob play the following game: They start with non-empty piles of coins. Taking turns, with Alice playing first, each player choose a pile with an even number of coins and moves half of the coins of this pile to the other pile. The game ends if a player cannot move, in which case the other player wins. Determine all pairs $(a,b)$ of positive integers such that if initially the two piles have $a$ and $b$ coins respectively, then Bob has a winning strategy. Proposed by Dimitris Christophides, Cyprus

At first, on a board, the number $1$ is written $100$ times. Every minute, we pick a number $a$ from the board, erase it, and write $a/3$ thrice instead. We say that a positive integer $n$ is [i]persistent[/i] if after any amount of time, regardless of the numbers we pick, we can find at least $n$ equal numbers on the board. Find the greatest persistent number.

A deck consists of $n$ different cards. A move consists of taking out a group of cards in sequence from some place in the deck, and putting it back someplace else without changing the order within the group or turning any cards over. We are required to reverse the order of cards in the deck by such moves. (a) Prove that for $n = 9$, this can be done in $5$ moves. (b) Prove that for $n = 52$, this i. can be done in $27$ moves, ii. can’t be done in $17$ moves, iii. can’t be done in $26$ moves. (SM Voronin, Tchelyabinsk)

Neel and Roshan are going to the Newark Liberty International Airport to catch separate flights. Neel plans to arrive at some random time between 5:30 am and 6:30 am, while Roshan plans to arrive at some random time between 5:40 am and 6:40 am. The two want to meet, however briefly, before going through airport security. As such, they agree that each will wait for $n$ minutes once he arrives at the airport before going through security. What is the smallest $n$ they can select such that they meet with at least 50% probability? The answer will be of the form $a + b\sqrt{c}$ for integers $a$, $b$, and $c$, where $c$ has no perfect square factor other than $1$. Report $a + b + c.$

Let $f: \mathbb{N} \rightarrow \mathbb{N}$ be a function, and let $f^m$ be $f$ applied $m$ times. Suppose that for every $n \in \mathbb{N}$ there exists a $k \in \mathbb{N}$ such that $f^{2k}(n)=n+k$, and let $k_n$ be the smallest such $k$. Prove that the sequence $k_1,k_2,\ldots $ is unbounded. [i]Proposed by Palmer Mebane, United States[/i]

Construct a tetromino by attaching two $2 \times 1$ dominoes along their longer sides such that the midpoint of the longer side of one domino is a corner of the other domino. This construction yields two kinds of tetrominoes with opposite orientations. Let us call them $S$- and $Z$-tetrominoes, respectively. Assume that a lattice polygon $P$ can be tiled with $S$-tetrominoes. Prove that no matter how we tile $P$ using only $S$- and $Z$-tetrominoes, we always use an even number of $Z$-tetrominoes. [i]Proposed by Tamas Fleiner and Peter Pal Pach, Hungary[/i]

[u]Round 1[/u] [b]p1.[/b] Ten children arrive at a birthday party and leave their shoes by the door. All the children have different shoe sizes. Later, as they leave one at a time, each child randomly grabs a pair of shoes their size or larger. After some kids have left, all of the remaining shoes are too small for any of the remaining children. What is the greatest number of shoes that might remain by the door? [b]p2.[/b] Turans, the king of Saturn, invented a new language for his people. The alphabet has only $6$ letters: A, N, R, S, T, U; however, the alphabetic order is different than in English. A word is any sequence of $6$ different letters. In the dictionary for this language, the first word is SATURN. Which word follows immediately after TURANS? [b]p3.[/b] Benji chooses five integers. For each pair of these numbers, he writes down the pair's sum. Can all ten sums end with different digits? [b]p4.[/b] Nine dwarves live in a house with nine rooms arranged in a $3\times3$ square. On Monday morning, each dwarf rubs noses with the dwarves in the adjacent rooms that share a wall. On Monday night, all the dwarves switch rooms. On Tuesday morning, they again rub noses with their adjacent neighbors. On Tuesday night, they move again. On Wednesday morning, they rub noses for the last time. Show that there are still two dwarves who haven't rubbed noses with one another. [b]p5.[/b] Anna and Bobby take turns placing rooks in any empty square of a pyramid-shaped board with $100$ rows and $200$ columns. If a player places a rook in a square that can be attacked by a previously placed rook, he or she loses. Anna goes first. Can Bobby win no matter how well Anna plays? [img]https://cdn.artofproblemsolving.com/attachments/7/5/b253b655b6740b1e1310037da07a0df4dc9914.png[/img] [u]Round 2[/u] [b]p6.[/b] Some boys and girls, all of different ages, had a snowball fight. Each girl threw one snowball at every kid who was older than her. Each boy threw one snowball at every kid who was younger than him. Three friends were hit by the same number of snowballs, and everyone else took fewer hits than they did. Prove that at least one of the three is a girl. [b]p7.[/b] Last year, jugglers from around the world travelled to Jakarta to participate in the Jubilant Juggling Jamboree. The festival lasted $32$ days, with six solo performances scheduled each day. The organizers noticed that for any two days, there was exactly one juggler scheduled to perform on both days. No juggler performed more than once on a single day. Prove there was a juggler who performed every day. PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

[b]p1.[/b] What is $\sqrt[2015]{2^01^5}$? [b]p2.[/b] What is the ratio of the area of square $ABCD$ to the area of square $ACEF$? [b]p3.[/b] $2015$ in binary is $11111011111$, which is a palindrome. What is the last year which also had this property? [b]p4.[/b] What is the next number in the following geometric series: $1020100$, $10303010$, $104060401$? [b]p5.[/b] A circle has radius $A$ and area $r$. If $A = r^2\pi$, then what is the diameter, $C$, of the circle? [b]p6.[/b] If $$O + N + E = 1$$ $$T + H + R + E + E = 3$$ $$N + I + N + E = 9$$ $$T + E + N = 10$$ $$T + H + I + R + T + E + E + N = 13$$ Then what is the value of $O$? [b]p7.[/b] By shifting the initial digit, which is $6$, of the positive integer $N$ to the end (for example, $65$ becomes $56$), we obtain a number equal to $\frac{N}{4}$ . What is the smallest such $N$? [b]p8.[/b] What is $\sqrt[3]{\frac{2015!(2013!)+2014!(2012!)}{2013!(2012!)}}$ ? [b]p9.[/b] How many permutations of the digits of $1234$ are divisible by $11$? [b]p10.[/b] If you choose $4$ cards from a normal $52$ card deck (with replacement), what is the probability that you will get exactly one of each suit (there are $4$ suits)? [b]p11.[/b] If $LMT$ is an equilateral triangle, and $MATH$ is a square, such that point $A$ is in the triangle, then what is $HL/AL$? [b]p12.[/b] If $$\begin{tabular}{cccccccc} & & & & & L & H & S\\ + & & & & H & I & G & H \\ + & & S & C & H & O & O & L \\ \hline = & & S & O & C & O & O & L \\ \end{tabular}$$ and $\{M, A, T,H, S, L,O, G, I,C\} = \{0, 1, 2, 3,4, 5, 6, 7, 8, 9\} $, then what is the ordered pair $(M + A +T + H, [T + e + A +M])$ where $e$ is $2.718...$and $[n]$ is the greatest integer less than or equal to $n$ ? [b]p13.[/b] There are $5$ marbles in a bag. One is red, one is blue, one is green, one is yellow, and the last is white. There are $4$ people who take turns reaching into the bag and drawing out a marble without replacement. If the marble they draw out is green, they get to draw another marble out of the bag. What is the probability that the $3$rd person to draw a marble gets the white marble? [b]p14.[/b] Let a "palindromic product" be a product of numbers which is written the same when written back to front, including the multiplication signs. For example, $234 * 545 * 432$, $2 * 2 *2 *2$, and $14 * 41$ are palindromic products whereas $2 *14 * 4 * 12$, $567 * 567$, and $2* 2 * 3* 3 *2$ are not. 2015 can be written as a "palindromic product" in two ways, namely $13 * 5 * 31$ and $31 * 5 * 13$. How many ways can you write $2016$ as a palindromic product without using 1 as a factor? [b]p15.[/b] Let a sequence be defined as $S_n = S_{n-1} + 2S_{n-2}$, and $S_1 = 3$ and $S_2 = 4$. What is $\sum_{n=1}^{\infty}\frac{S_n}{3^n}$ ? [b]p16.[/b] Put the numbers $0-9$ in some order so that every $2$-digit substring creates a number which is either a multiple of $7$, or a power of $2$. [b]p17.[/b] Evaluate $\dfrac{8+ \dfrac{8+ \dfrac{8+...}{3+...}}{3+ \dfrac{8+...}{3+...}}}{3+\dfrac{8+ \dfrac{8+...}{3+...}}{ 3+ \dfrac{8+...}{3+...}}}$, assuming that it is a positive real number. [b]p18.[/b] $4$ non-overlapping triangles, each of area $A$, are placed in a unit circle. What is the maximum value of $A$? [b]p19.[/b] What is the sum of the reciprocals of all the (positive integer) factors of $120$ (including $1$ and $120$ itself). [b]p20.[/b] How many ways can you choose $3$ distinct elements of $\{1, 2, 3,...,4000\}$ to make an increasing arithmetic series? PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

A lock has $16$ keys arranged in a $4 \times 4$ array, each key oriented either horizontally or vertically. In order to open it, all the keys must be vertically oriented. When a key is switched to another position, all the other keys in the same row and column automatically switch their positions too (see diagram). Show that no matter what the starting positions are, it is always possible to open this lock. (Only one key at a time can be switched.)

Let $k\ge 1$ be a positive integer. We consider $4k$ chips, $2k$ of which are red and $2k$ of which are blue. A sequence of those $4k$ chips can be transformed into another sequence by a so-called move, consisting of interchanging a number (possibly one) of consecutive red chips with an equal number of consecutive blue chips. For example, we can move from $r\underline{bb}br\underline{rr}b$ to $r\underline{rr}br\underline{bb}b$ where $r$ denotes a red chip and $b$ denotes a blue chip. Determine the smallest number $n$ (as a function of $k$) such that starting from any initial sequence of the $4k$ chips, we need at most $n$ moves to reach the state in which the first $2k$ chips are red.

Each of $10$ identical jars contains some milk, up to $10$ percent of its capacity. At any time, we can tell the precise amount of milk in each jar. In a move, we may pour out an exact amount of milk from one jar into each of the other $9$ jars, the same amount in each case. Prove that we can have the same amount of milk in each jar after at most $10$ moves. [i](4 points)[/i]

Do there exist 2021 points with integer coordinates on the plane such that the pairwise distances between them are pairwise distinct consecutive integers?