[b]p1.[/b] A shape made by joining four identical regular hexagons side-to-side is called a hexo. Two hexos are considered the same if one can be rotated / reflected to match the other. Find the number of different hexos. [b]p2.[/b] The sequence $1, 2, 3, 3, 3, 4, 5, 5, 5, 5, 5, 6,... $ consists of numbers written in increasing order, where every even number $2n$ is written once, and every odd number $2n + 1$ is written $2n + 1$ times. What is the $2019^{th}$ term of this sequence? [b]p3.[/b] On planet EMCCarth, months can only have lengths of $35$, $36$, or $42$ days, and there is at least one month of each length. Victor knows that an EMCCarth year has $n$ days, but realizes that he cannot figure out how many months there are in an EMCCarth year. What is the least possible value of $n$? [b]p4.[/b] In triangle $ABC$, $AB = 5$ and $AC = 9$. If a circle centered at $A$ passing through $B$ intersects $BC$ again at $D$ and $CD = 7$, what is $BC$? [b]p5.[/b] How many nonempty subsets $S$ of the set $\{1, 2, 3,..., 11, 12\}$ are there such that the greatest common factor of all elements in $S$ is greater than $1$? [b]p6.[/b] Jasmine rolls a fair $6$-sided die, with faces labeled from $1$ to $6$, and a fair $20$-sided die, with faces labeled from $1$ to $20$. What is the probability that the product of these two rolls, added to the sum of these two rolls, is a multiple of $3$? [b]p7.[/b] Let $\{a_n\}$ be a sequence such that $a_n$ is either $2a_{n-1}$ or $a_{n-1} - 1$. Given that $a_1 = 1$ and $a_{12} = 120$, how many possible sequences $a_1$, $a_2$, $...$, $a_{12}$ are there? [b]p8.[/b] A tetrahedron has two opposite edges of length $2$ and the remaining edges have length $10$. What is the volume of this tetrahedron? [b]p9.[/b] In the garden of EMCCden, there is a tree planted at every lattice point $-10 \le x, y \le 10$ except the origin. We say that a tree is visible to an observer if the line between the tree and the observer does not intersect any other tree (assume that all trees have negligible thickness). What fraction of all the trees in the garden of EMCCden are visible to an observer standing at the origin? [b]p10.[/b] Point $P$ lies inside regular pentagon $\zeta$, which lies entirely within regular hexagon $\eta$. A point $Q$ on the boundary of pentagon $\zeta$ is called projective if there exists a point $R$ on the boundary of hexagon $\eta$ such that $P$, $Q$, $R$ are collinear and $2019 \cdot \overline{PQ} = \overline{QR}$. Given that no two sides of $\zeta$ and $\eta$ are parallel, what is the maximum possible number of projective points on $\zeta$? PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Find the smallest positive integer $n$ with the following property: there does not exist an arithmetic progression of $1999$ real numbers containing exactly $n$ integers.

Given $a_n = (n^2 + 1) 3^n,$ find a recurrence relation $a_n + p a_{n+1} + q a_{n+2} + r a_{n+3} = 0.$ Hence evaluate $\sum_{n\geq0} a_n x^n.$

Given infinite sequence $a_n$. It is known that the limit of $$b_n=a_{n+1}-a_n/2$$ equals zero. Prove that the limit of $a_n$ equals zero.

A sequence $a_n$ is defined by $$a_0=0,\qquad a_1=3;$$$$a_n=8a_{n-1}+9a_{n-2}+16\text{ for }n\ge2.$$Find the least positive integer $h$ such that $a_{n+h}-a_n$ is divisible by $1999$ for all $n\ge0$.

Let $N$ be a positive integer, and consider an $N \times N$ grid. A [i]right-down path[/i] is a sequence of grid cells such that each cell is either one cell to the right of or one cell below the previous cell in the sequence. A [i]right-up path[/i] is a sequence of grid cells such that each cell is either one cell to the right of or one cell above the previous cell in the sequence. Prove that the cells of the $N \times N$ grid cannot be partitioned into less than $N$ right-down or right-up paths. For example, the following partition of the $5 \times 5$ grid uses $5$ paths. [asy] size(4cm); draw((5,-1)--(0,-1)--(0,-2)--(5,-2)--(5,-3)--(0,-3)--(0,-4)--(5,-4),gray+linewidth(0.5)+miterjoin); draw((1,-5)--(1,0)--(2,0)--(2,-5)--(3,-5)--(3,0)--(4,0)--(4,-5),gray+linewidth(0.5)+miterjoin); draw((0,0)--(5,0)--(5,-5)--(0,-5)--cycle,black+linewidth(2.5)+miterjoin); draw((0,-1)--(3,-1)--(3,-2)--(1,-2)--(1,-4)--(4,-4)--(4,-3)--(2,-3)--(2,-2),black+linewidth(2.5)+miterjoin); draw((3,0)--(3,-1),black+linewidth(2.5)+miterjoin); draw((1,-4)--(1,-5),black+linewidth(2.5)+miterjoin); draw((4,-3)--(4,-1)--(5,-1),black+linewidth(2.5)+miterjoin); [/asy] [i]Proposed by Zixiang Zhou, Canada[/i]

Let $(a_n)$ and $(b_n)$ be the sequences of real numbers such that \[ (2 + i)^n = a_n + b_ni \] for all integers $n\geq 0$, where $i = \sqrt{-1}$. What is \[\sum_{n=0}^\infty\frac{a_nb_n}{7^n}\,?\] $\textbf{(A) }\frac 38\qquad\textbf{(B) }\frac7{16}\qquad\textbf{(C) }\frac12\qquad\textbf{(D) }\frac9{16}\qquad\textbf{(E) }\frac47$

A sequence is called an [i]arithmetic progression of the first order[/i] if the differences of the successive terms are constant. It is called an [i]arithmetic progression of the second order[/i] if the differences of the successive terms form an arithmetic progression of the first order. In general, for $k\geq 2$, a sequence is called an [i]arithmetic progression of the $k$-th order[/i] if the differences of the successive terms form an arithmetic progression of the $(k-1)$-th order. The numbers \[4,6,13,27,50,84\] are the first six terms of an arithmetic progression of some order. What is its least possible order? Find a formula for the $n$-th term of this progression.

[b]p1.[/b] Evaluate $1+3+5+··· +2019$. [b]p2.[/b] Evaluate $1^2 -2^2 +3^2 -4^2 +...· +99^2 -100^2$. [b]p3. [/b]Find the sum of all solutions to $|2018+|x -2018|| = 2018$. [b]p4.[/b] The angles in a triangle form a geometric series with common ratio $\frac12$ . Find the smallest angle in the triangle. [b]p5.[/b] Compute the number of ordered pairs $(a,b,c,d)$ of positive integers $1 \le a,b,c,d \le 6$ such that $ab +cd$ is a multiple of seven. [b]p6.[/b] How many ways are there to arrange three birch trees, four maple, and five oak trees in a row if trees of the same species are considered indistinguishable. [b]p7.[/b] How many ways are there for Mr. Paul to climb a flight of 9 stairs, taking steps of either two or three at a time? [b]p8.[/b] Find the largest natural number $x$ for which $x^x$ divides $17!$ [b]p9.[/b] How many positive integers less than or equal to $2018$ have an odd number of factors? [b]p10.[/b] Square $MAIL$ and equilateral triangle $LIT$ share side $IL$ and point $T$ is on the interior of the square. What is the measure of angle $LMT$? [b]p11.[/b] The product of all divisors of $2018^3$ can be written in the form $2^a \cdot 2018^b$ for positive integers $a$ and $b$. Find $a +b$. [b]p12.[/b] Find the sum all four digit palindromes. (A number is said to be palindromic if its digits read the same forwards and backwards. [b]p13.[/b] How ways are there for an ant to travel from point $(0,0)$ to $(5,5)$ in the coordinate plane if it may only move one unit in the positive x or y directions each step, and may not pass through the point $(1, 1)$ or $(4, 4)$? [b]p14.[/b] A certain square has area $6$. A triangle is constructed such that each vertex is a point on the perimeter of the square. What is the maximum possible area of the triangle? [b]p15.[/b] Find the value of ab if positive integers $a,b$ satisfy $9a^2 -12ab +2b^2 +36b = 162$. [b]p16.[/b] $\vartriangle ABC$ is an equilateral triangle with side length $3$. Point $D$ lies on the segment $BC$ such that $BD = 1$ and $E$ lies on $AC$ such that $AE = AD$. Compute the area of $\vartriangle ADE$. [b]p17[/b]. Let $A_1, A_2,..., A_{10}$ be $10$ points evenly spaced out on a line, in that order. Points $B_1$ and $B_2$ lie on opposite sides of the perpendicular bisector of $A_1A_{10}$ and are equidistant to $l$. Lines $B_1A_1,...,B_1A_{10}$ and $B_2A_1,...· ,B_2A_{10}$ are drawn. How many triangles of any size are present? [b]p18.[/b] Let $T_n = 1+2+3··· +n$ be the $n$th triangular number. Determine the value of the infinite sum $\sum_{k\ge 1} \frac{T_k}{2^k}$. [b]p19.[/b] An infinitely large bag of coins is such that for every $0.5 < p \le 1$, there is exactly one coin in the bag with probability $p$ of landing on heads and probability $1- p$ of landing on tails. There are no other coins besides these in the bag. A coin is pulled out of the bag at random and when flipped lands on heads. Find the probability that the coin lands on heads when flipped again. [b]p20.[/b] The sequence $\{x_n\}_{n\ge 1}$ satisfies $x1 = 1$ and $(4+ x_1 + x_2 +··· + x_n)(x_1 + x_2 +··· + x_{n+1}) = 1$ for all $n \ge 1$. Compute $\left \lfloor \frac{x_{2018}}{x_{2019}} \right \rfloor$. PS. You had better use hide for answers.

The integers $1, 2, 3,. . . , 2016$ are written in a board. You can choose any pair of numbers in the board and replace them with their average. For example, you can replace $1$ and $2$ with $1.5$, or you can replace $1$ and $3$ with a second copy of $2$. After such replacements, the board will have only one number. (a) Prove that there is a sequence of substitutions that will make let the final number be $2$. (b) Prove that there is a sequence of substitutions that will make let the final number be $1000$.

[u]Round 1[/u] [b]p1.[/b] Alex is writing a sequence of $A$’s and $B$’s on a chalkboard. Any $20$ consecutive letters must have an equal number of $A$’s and $B$’s, but any 22 consecutive letters must have a different number of $A$’s and $B$’s. What is the length of the longest sequence Alex can write?. [b]p2.[/b] A positive number is placed on each of the $10$ circles in this picture. It turns out that for each of the nine little equilateral triangles, the number on one of its corners is the sum of the numbers on the other two corners. Is it possible that all $10$ numbers are different? [img]https://cdn.artofproblemsolving.com/attachments/b/f/c501362211d1c2a577e718d2b1ed1f1eb77af1.png[/img] [b]p3.[/b] Pablo and Nina take turns entering integers into the cells of a $3 \times 3$ table. Pablo goes first. The person who fills the last empty cell in a row must make the numbers in that row add to $0$. Can Nina ensure at least two of the columns have a negative sum, no matter what Pablo does? [b]p4. [/b]All possible simplified fractions greater than $0$ and less than $1$ with denominators less than or equal to $100$ are written in a row with a space before each number (including the first). Zeke and Qing play a game, taking turns choosing a blank space and writing a “$+$” or “$-$” sign in it. Zeke goes first. After all the spaces have been filled, Zeke wins if the value of the resulting expression is an integer. Can Zeke win no matter what Qing does? [img]https://cdn.artofproblemsolving.com/attachments/3/6/15484835686fbc2aa092e8afc6f11cd1d1fb88.png[/img] [b]p5.[/b] A police officer patrols a town whose map is shown. The officer must walk down every street segment at least once and return to the starting point, only changing direction at intersections and corners. It takes the officer one minute to walk each segment. What is the fastest the officer can complete a patrol? [img]https://cdn.artofproblemsolving.com/attachments/0/c/d827cf26c8eaabfd5b0deb92612a6e6ebffb47.png[/img] [u]Round 2[/u] [b]p6.[/b] Prove that among any $3^{2022}$ integers, it is possible to find exactly $3^{2021}$ of them whose sum is divisible by $3^{2021}$. [b]p7.[/b] Given a list of three numbers, a zap consists of picking two of the numbers and decreasing each of them by their average. For example, if the list is $(5, 7, 10)$ and you zap $5$ and $10$, whose average is $7.5$, the new list is $(-2.5, 7, 2.5)$. Is it possible to start with the list $(3, 1, 4)$ and, through some sequence of zaps, end with a list in which the sum of the three numbers is $0$? PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Given an infinite sequence of numbers $a_1, a_2, a_3, ...$ such that for each positive integer $k$, there exists positive integer $t$ for which $a_k = a_{k+t} = a_{k+2t} = ....$ Does this sequences must be periodic?

Serge and Tanya want to show Masha a magic trick. Serge leaves the room. Masha writes down a sequence $(a_1, a_2, \ldots , a_n)$, where all $a_k$ equal $0$ or $1$. After that Tanya writes down a sequence $(b_1, b_2, \ldots , b_n)$, where all $b_k$ also equal $0$ or $1$. Then Masha either does nothing or says “Mutabor” and replaces both sequences: her own sequence by $(a_n, a_{n-1}, \ldots , a_1)$, and Tanya’s sequence by $(1 - b_n, 1 - b_{n-1}, \ldots , 1 - b_1)$. Masha’s sequence is covered by a napkin, and Serge is invited to the room. Serge should look at Tanya’s sequence and tell the sequence covered by the napkin. For what $n$ Serge and Tanya can prepare and show such a trick? Serge does not have to determine whether the word “Mutabor” has been pronounced.

A sequence $(a_k)_{k=1}^{\infty}$ has the property that there is a natural number $n$ such that $a_1 + a_2 +...+ a_n = 0$ and $a_{n+k} = a_k$ for all $k$. Prove that there exists a natural number $N$ such that $$\sum_{i=N}^{N+k} a_i \ge 0 \,\, \,\, for \,\,\,\, k = 0,1,2...$$

Cassidy has string of $n$ bits, where $n$ is a positive integer, which initially are all $0$s or $1$s. Every second, Cassidy may choose to do one of two things: 1. Change the first bit (so the first bit changes from a $0$ to a $1$, or vice versa) 2. Change the first bit after the first $1$. Let $M$ be the minimum number of such moves it takes to get from $1\dots 1$ to $0 \dots 0$ (both of length $12$), and $N$ the number of starting sequences with $12$ bits that Cassidy can turn into all $0$s. Find $M + N$.