From a square board $11$ squares long and $11$ squares wide, the central square is removed. Prove that the remaining $120$ squares cannot be covered by $15$ strips each $8$ units long and one unit wide.

Alex is going to make a set of cubical blocks of the same size and to write a digit on each of their faces so that it would be possible to form every $30$-digit integer with these blocks. What is the minimal number of blocks in a set with this property? (The digits $6$ and $9$ do not turn one into another.)

A man gets lost in a large forest, the boundary of which is a straight line. (We can assume that the forest fills the half-plane.) It is known that the distance from a person to Granina forest does not exceed $2$ km. a) Suggest a path along which he will certainly be able to get out of the forest after walking no more than $14$ km. (Of course, a person does not know in which direction the border of the forest is, BUT he has the opportunity to move along any pre-selected curve. It is believed that a person left the forest as soon as he reached its border, while the border of the forest is invisible to him, no matter how close he would have approached it.) b) Find a path with the same property and length no more than $13$ km.

In the interior of the convex 2011-gon are $2011$ points, such that no three among the given $4022$ points (the interior points and the vertices) are collinear. The points are coloured one of two different colours and a colouring is called "good" if some of the points can be joined in such a way that the following conditions are satisfied: 1) Each segment joins two points of the same colour. 2) None of the line segments intersect. 3) For any two points of the same colour there exists a path of segments connecting them. Find the number of "good" colourings.

Let $k>1$ be a fixed positive integer. Prove that if $n$ is a sufficiently large positive integer, there exists a sequence of integers with the following properties: [list=disc] [*]Each element of the sequence is between $1$ and $n$, inclusive. [*]For any two different contiguous subsequence of the sequence with length between $2$ and $k$ inclusive, the multisets of values in those two subsequences is not the same. [*]The sequence has length at least $0.499n^2$ [/list]

Eve and Odette play a game on a $3\times 3$ checkerboard, with black checkers and white checkers. The rules are as follows: $\text{I.}$ They play alternately. $\text{II.}$ A turn consists of placing one checker on an unoccupied square of the board. $\text{III.}$ In her turn, a player may select either a white checker or a black checker and need not always use the same colour. $\text{IV.}$ When the board is full, Eve obtains one point for every row, column or diagonal that has an even number of black checkers, and Odette obtains one point for very row, column or diagonal that has an odd number of black checkers. $\text{V.}$ The player obtaining at least five of the eight points WINS. $\text{(a)}$ Is a $4-4$ tie possible? Explain. $\text{(b)}$ Describe a winning strategy for the girl who is first to play.

On a $ 30 \times30 $ square board or placed figures of shape 1 (of 5 squares) (in all four possible positions) and shaped figures of shape 2 (of 4 squares) . The figures do not overlap, they do not pass through the edges of the board and the squares of which they are drawn lie exactly through the squares of the board. a) Prove that the board can be fully covered using $100$ figures of both shapes. b) Prove that if there are already $50$ shaped figures on the board of shape 1, then at least one more figure can be placed on the board. c) Prove that if there are already $28$ figures of both shapes on the board then at least one more figure of both shapes can be placed on the board. [img]https://cdn.artofproblemsolving.com/attachments/3/f/f20d5a91d61557156edf203ff43acac461d9df.png[/img]

The paper is marked with the finite number of blue and red dots and some these points are connected by lines. Let's name a point $P$ [i]special [/i] if more than half of the points connected with $P$ has a color other than point $P$. Juku selects one special point and reverses its color. Then Juku selects a new special point and changes its color, etc. Prove that by a finite number of integers Juku ends up in a situation where the paper has not made a special point.

There are $ n$ students; each student knows exactly $d $ girl students and $d $ boy students ("knowing" is a symmetric relation). Find all pairs $ (n,d) $ of integers .

An $n \times m$ matrix is nice if it contains every integer from $1$ to $mn$ exactly once and $1$ is the only entry which is the smallest both in its row and in its column. Prove that the number of $n \times m$ nice matrices is $(nm)!n!m!/(n+m-1)!$.

Jacek has $n$ cards numbered consecutively with the numbers $1,. . . , n$, which he places in a row on the table, in any order he chooses. Jacek will remove cards from the table in the sequence consistent with the numbering of cards: first they will remove the card number $1$, then the card number $2$, and so on. Before Jacek starts taking the cards, Pie will color each one of cards in red, blue or yellow. Prove that Pie can color the cards in such a way that when Jacek takes them off, it will be fulfilled at every moment the following condition: between any two cards of the same suit there is at least one card of a different color.

The circuit diagram drawn (see figure ) contains a battery $B$, a lamp $L$ and five switches $S_1$ to $S_5$. The probability that switch $S_3$ is closed (makes contact) is $\frac23$, for the other four switches that probability is $\frac12$ (the probabilities are mutually independent). Calculate the probability that the light is on. [asy] unitsize (2 cm); draw((-1,1)--(-0.5,1)); draw((-0.25,1)--(1,1)--(1,0.25)); draw((1,-0.25)--(1,-1)--(0.05,-1)); draw((-0.05,-1)--(-1,-1)--(-1,0.25)); draw((-1,0.5)--(-1,1)); draw((-1,1)--(-0.5,0.5)); draw((-0.25,0.25)--(0,0)); draw((-1,0)--(-0.75,0)); draw((-0.5,0)--(0,0)); draw((0,1)--(0,0.75)); draw((0,0.5)--(0,0)); draw((-0.25,1)--(-0.5,1.25)); draw((-1,0.25)--(-1.25,0.5)); draw((-0.5,0.5)--(-0.25,0.5)); draw((0,0.75)--(0.25,0.5)); draw((-0.75,0)--(-0.5,-0.25)); draw(Circle((1,0),0.25)); draw(((1,0) + 0.25*dir(45))--((1,0) + 0.25*dir(225))); draw(((1,0) + 0.25*dir(135))--((1,0) + 0.25*dir(315))); draw((0.05,-0.9)--(0.05,-1.1)); draw((-0.05,-0.8)--(-0.05,-1.2)); label("$L$", (1.25,0), E); label("$B$", (-0.1,-1.1), SW); label("$S_1$", (-0.5,1.25), NE); label("$S_2$", (-1.25,0.5), SW); label("$S_3$", (-0.5,0.5), SW); label("$S_4$", (0.25,0.5), NE); label("$S_5$", (-0.5,-0.25), SW); [/asy]

A convex hexagon is called [i]pretty[/i] if it has four diagonals of length 1, such that their endpoints are all the vertex of the hexagon. ($a$) Given any real number $k$ with $0<k<1$ find a [i]pretty[/i] hexagon with area equal to $k$ ($b$) Show that the area of any [i]pretty[/i] hexagon is less than 1.

A set of $n\ge 9$ points is given on the plane. For any 9 it points can be selected from all circles so that all these points end up on selected circles. Prove that all n points lie on two circles

Sixteen wooden Cs are placed in a $4$-by-$4$ grid, all with the same orientation, and each is to be colored either red or blue. A quadrant operation on the grid consists of choosing one of the four two-by-two subgrids of Cs found at the corners of the grid and moving each C in the subgrid to the adjacent square in the subgrid that is $90$ degrees away in the clockwise direction, without changing the orientation of the C. Given that two colorings are the considered same if and only if one can be obtained from the other by a series of quadrant operations, determine the number of distinct colorings of the Cs. [img]https://cdn.artofproblemsolving.com/attachments/a/9/1e59dce4d33374960953c0c99343eef807a5d2.png[/img]

[u]Round 1[/u] [b]p1.[/b] Today, the date $4/9/16$ has the property that it is written with three perfect squares in strictly increasing order. What is the next date with this property? [b]p2.[/b] What is the greatest integer less than $100$ whose digit sumis equal to its greatest prime factor? [b]p3.[/b] In chess, a bishop can only move diagonally any number of squares. Find the number of possible squares a bishop starting in a corner of a $20\times 16$ chessboard can visit in finitely many moves, including the square it stars on. [u]Round 2 [/u] [b]p4.[/b] What is the fifth smallest positive integer with at least $5$ distinct prime divisors? [b]p5.[/b] Let $\tau (n)$ be the number of divisors of a positive integer $n$, including $1$ and $n$. Howmany positive integers $n \le 1000$ are there such that $\tau (n) > 2$ and $\tau (\tau (n)) = 2$? [b]p6.[/b] How many distinct quadratic polynomials $P(x)$ with leading coefficient $1$ exist whose roots are positive integers and whose coefficients sum to $2016$? [u]Round 3[/u] [b]p7.[/b] Find the largest prime factor of $112221$. [b]p8.[/b] Find all ordered pairs of positive integers $(a,b)$ such that $\frac{a^2b^2+1}{ab-1}$ is an integer. [b]p9.[/b] Suppose $f : Z \to Z$ is a function such that $f (2x)= f (1-x)+ f (1-x)$ for all integers $x$. Find the value of $f (2) f (0) +f (1) f (6)$. [u]Round 4[/u] [b]p10.[/b] For any six points in the plane, what is the maximum number of isosceles triangles that have three of the points as vertices? [b]p11.[/b] Find the sum of all positive integers $n$ such that $\sqrt{n+ \sqrt{n -25}}$ is also a positive integer. [b]p12.[/b] Distinct positive real numbers are written at the vertices of a regular $2016$-gon. On each diagonal and edge of the $2016$-gon, the sum of the numbers at its endpoints is written. Find the minimum number of distinct numbers that are now written, including the ones at the vertices. PS. You should use hide for answers. Rounds 5-8 have been posted [url=https://artofproblemsolving.com/community/c3h3158474p28715078]here[/url]. and 9-12 [url=https://artofproblemsolving.com/community/c3h3162282p28763571]here[/url]. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

[b]p1.[/b] An ant starts at the top vertex of a triangular pyramid (tetrahedron). Each day, the ant randomly chooses an adjacent vertex to move to. What is the probability that it is back at the top vertex after three days? [b]p2.[/b] A square “rolls” inside a circle of area $\pi$ in the obvious way. That is, when the square has one corner on the circumference of the circle, it is rotated clockwise around that corner until a new corner touches the circumference, then it is rotated around that corner, and so on. The square goes all the way around the circle and returns to its starting position after rotating exactly $720^o$. What is the area of the square? [b]p3.[/b] How many ways are there to fill a $3\times 3$ grid with the integers $1$ through $9$ such that every row is increasing left-to-right and every column is increasing top-to-bottom? [b]p4.[/b] Noah has an old-style M&M machine. Each time he puts a coin into the machine, he is equally likely to get $1$ M&M or $2$ M&M’s. He continues putting coins into the machine and collecting M&M’s until he has at least $6$ M&M’s. What is the probability that he actually ends up with $7$ M&M’s? [b]p5.[/b] Erik wants to divide the integers $1$ through $6$ into nonempty sets $A$ and $B$ such that no (nonempty) sum of elements in $A$ is a multiple of $7$ and no (nonempty) sum of elements in $B$ is a multiple of $7$. How many ways can he do this? (Interchanging $A$ and $B$ counts as a different solution.) [b]p6.[/b] A subset of $\{1, 2, 3, 4, 5, 6, 7, 8\}$ of size $3$ is called special if whenever $a$ and $b$ are in the set, the remainder when $a + b$ is divided by $8$ is not in the set. ($a$ and $b$ can be the same.) How many special subsets exist? [b]p7.[/b] Let $F_1 = F_2 = 1$, and let $F_n = F_{n-1} + F_{n-2}$ for all $n \ge 3$. For each positive integer $n$, let $g(n)$ be the minimum possible value of $$|a_1F_1 + a_2F_2 + ...+ a_nF_n|,$$ where each $a_i$ is either $1$ or $-1$. Find $g(1) + g(2) +...+ g(100)$. [b]p8.[/b] Find the smallest positive integer $n$ with base-$10$ representation $\overline{1a_1a_2... a_k}$ such that $3n = \overline{a_1a_2


a_k1}$. [b]p9.[/b] How many ways are there to tile a $4 \times 6$ grid with $L$-shaped triominoes? (A triomino consists of three connected $1\times 1$ squares not all in a line.) [b]p10.[/b] Three friends want to share five (identical) muffins so that each friend ends up with the same total amount of muffin. Nobody likes small pieces of muffin, so the friends cut up and distribute the muffins in such a way that they maximize the size of the smallest muffin piece. What is the size of this smallest piece? [u]Numerical tiebreaker problems:[/u] [b]p11.[/b] $S$ is a set of positive integers with the following properties: (a) There are exactly 3 positive integers missing from $S$. (b) If $a$ and $b$ are elements of $S$, then $a + b$ is an element of $S$. (We allow $a$ and $b$ to be the same.) How many possibilities are there for the set $S$? [b]p12.[/b] In the trapezoid $ABCD$, both $\angle B$ and $\angle C$ are right angles, and all four sides of the trapezoid are tangent to the same circle. If $\overline{AB} = 13$ and $\overline{CD} = 33$, find the area of $ABCD$. [b]p13.[/b] Alice wishes to walk from the point $(0, 0)$ to the point $(6, 4)$ in increments of $(1, 0)$ and $(0, 1)$, and Bob wishes to walk from the point $(0, 1)$ to the point $(6, 5)$ in increments of $(1, 0)$ and $(0,1)$. How many ways are there for Alice and Bob to get to their destinations if their paths never pass through the same point (even at different times)? [b]p14.[/b] The continuous function $f(x)$ satisfies $9f(x + y) = f(x)f(y)$ for all real numbers $x$ and $y$. If $f(1) = 3$, what is $f(-3)$? PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

[u]Round 1[/u] [b]1.1.[/b] A circle has a circumference of $20\pi$ inches. Find its area in terms of $\pi$. [b]1.2.[/b] Let $x, y$ be the solution to the system of equations: $x^2 + y^2 = 10 \,\,\, , \,\,\, x = 3y$. Find $x + y$ where both $x$ and $y$ are greater than zero. [b]1. 3.[/b] Chris deposits $\$ 100$ in a bank account. He then spends $30\%$ of the money in the account on biology books. The next week, he earns some money and the amount of money he has in his account increases by $30 \%$. What percent of his original money does he now have? [u]Round 2[/u] [b]2.1.[/b] The bell rings every $45$ minutes. If the bell rings right before the first class and right after the last class, how many hours are there in a school day with $9$ bells? [b]2.2.[/b] The middle school math team has $9$ members. They want to send $2$ teams to ABMC this year: one full team containing 6 members and one half team containing the other $3$ members. In how many ways can they choose a $6$ person team and a $3$ person team? [b]2.3.[/b] Find the sum: $$1 + (1 - 1)(1^2 + 1 + 1) + (2 - 1)(2^2 + 2 + 1) + (3 - 1)(3^2 + 3 + 1) + ...· + (8 - 1)(8^2 + 8 + 1) + (9 - 1)(9^2 + 9 + 1).$$ [u]Round 3[/u] [b]3.1.[/b] In square $ABHI$, another square $BIEF$ is constructed with diagonal $BI$ (of $ABHI$) as its side. What is the ratio of the area of $BIEF$ to the area of $ABHI$? [b]3.2.[/b] How many ordered pairs of positive integers $(a, b)$ are there such that $a$ and $b$ are both less than $5$, and the value of $ab + 1$ is prime? Recall that, for example, $(2, 3)$ and $(3, 2)$ are considered different ordered pairs. [b]3.3.[/b] Kate Lin drops her right circular ice cream cone with a height of $ 12$ inches and a radius of $5$ inches onto the ground. The cone lands on its side (along the slant height). Determine the distance between the highest point on the cone to the ground. [u]Round 4[/u] [b]4.1.[/b] In a Museum of Fine Mathematics, four sculptures of Euler, Euclid, Fermat, and Allen, one for each statue, are nailed to the ground in a circle. Bob would like to fully paint each statue a single color such that no two adjacent statues are blue. If Bob only has only red and blue paint, in how many ways can he paint the four statues? [b]4.2.[/b] Geo has two circles, one of radius 3 inches and the other of radius $18$ inches, whose centers are $25$ inches apart. Let $A$ be a point on the circle of radius 3 inches, and B be a point on the circle of radius $18$ inches. If segment $\overline{AB}$ is a tangent to both circles that does not intersect the line connecting their centers, find the length of $\overline{AB}$. [b]4.3.[/b] Find the units digit to $2017^{2017!}$. [u]Round 5[/u] [b]5.1.[/b] Given equilateral triangle $\gamma_1$ with vertices $A, B, C$, construct square $ABDE$ such that it does not overlap with $\gamma_1$ (meaning one cannot find a point in common within both of the figures). Similarly, construct square $ACFG$ that does not overlap with $\gamma_1$ and square $CBHI$ that does not overlap with $\gamma_1$. Lines $DE$, $FG$, and $HI$ form an equilateral triangle $\gamma_2$. Find the ratio of the area of $\gamma_2$ to $\gamma_1$ as a fraction. [b]5.2.[/b] A decimal that terminates, like $1/2 = 0.5$ has a repeating block of $0$. A number like $1/3 = 0.\overline{3}$ has a repeating block of length $ 1$ since the fraction bar is only over $ 1$ digit. Similarly, the numbers $0.0\overline{3}$ and $0.6\overline{5}$ have repeating blocks of length $ 1$. Find the number of positive integers $n$ less than $100$ such that $1/n$ has a repeating block of length $ 1$. [b]5.3.[/b] For how many positive integers $n$ between $1$ and $2017$ is the fraction $\frac{n + 6}{2n + 6}$ irreducible? (Irreducibility implies that the greatest common factor of the numerator and the denominator is $1$.) [u]Round 6[/u] [b]6.1.[/b] Consider the binary representations of $2017$, $2017 \cdot 2$, $2017 \cdot 2^2$, $2017 \cdot 2^3$, $... $, $2017 \cdot 2^{100}$. If we take a random digit from any of these binary representations, what is the probability that this digit is a $1$ ? [b]6.2.[/b] Aaron is throwing balls at Carlson’s face. These balls are infinitely small and hit Carlson’s face at only $1$ point. Carlson has a flat, circular face with a radius of $5$ inches. Carlson’s mouth is a circle of radius $ 1$ inch and is concentric with his face. The probability of a ball hitting any point on Carlson’s face is directly proportional to its distance from the center of Carlson’s face (so when you are $2$ times farther away from the center, the probability of hitting that point is $2$ times as large). If Aaron throws one ball, and it is guaranteed to hit Carlson’s face, what is the probability that it lands in Carlson’s mouth? [b]6.3.[/b] The birth years of Atharva, his father, and his paternal grandfather form a geometric sequence. The birth years of Atharva’s sister, their mother, and their grandfather (the same grandfather) form an arithmetic sequence. If Atharva’s sister is $5$ years younger than Atharva and all $5$ people were born less than $200$ years ago (from $2017$), what is Atharva’s mother’s birth year? [u]Round 7[/u] [b]7. 1.[/b] A function $f$ is called an “involution” if $f(f(x)) = x$ for all $x$ in the domain of $f$ and the inverse of $f$ exists. Find the total number of involutions $f$ with domain of integers between $ 1$ and $ 8$ inclusive. [b]7.2.[/b] The function $f(x) = x^3$ is an odd function since each point on $f(x)$ corresponds (through a reflection through the origin) to a point on $f(x)$. For example the point $(-2, -8)$ corresponds to $(2, 8)$. The function $g(x) = x^3 - 3x^2 + 6x - 10$ is a “semi-odd” function, since there is a point $(a, b)$ on the function such that each point on $g(x)$ corresponds to a point on $g(x)$ via a reflection over $(a, b)$. Find $(a, b)$. [b]7.3.[/b] A permutations of the numbers $1, 2, 3, 4, 5$ is an arrangement of the numbers. For example, $12345$ is one arrangement, and $32541$ is another arrangement. Another way to look at permutations is to see each permutation as a function from $\{1, 2, 3, 4, 5\}$ to $\{1, 2, 3, 4, 5\}$. For example, the permutation $23154$ corresponds to the function f with $f(1) = 2$, $f(2) = 3$, $f(3) = 1$, $f(5) = 4$, and $f(4) = 5$, where $f(x)$ is the $x$-th number of the permutation. But the permutation $23154$ has a cycle of length three since $f(1) = 2$, $f(2) = 3$, $f(3) = 1$, and cycles after $3$ applications of $f$ when regarding a set of $3$ distinct numbers in the domain and range. Similarly the permutation $32541$ has a cycle of length three since $f(5) = 1$, $f(1) = 3$, and $f(3) = 5$. In a permutation of the natural numbers between $ 1$ and $2017$ inclusive, find the expected number of cycles of length $3$. [u]Round 8[/u] [b]8.[/b] Find the number of characters in the problems on the accuracy round test. This does not include spaces and problem numbers (or the periods after problem numbers). For example, “$1$. What’s $5 + 10$?” would contain $11$ characters, namely “$W$,” “$h$,” “$a$,” “$t$,” “$’$,” “$s$,” “$5$,” “$+$,” “$1$,” “$0$,” “?”. If the correct answer is $c$ and your answer is $x$, then your score will be $$\max \left\{ 0, 13 -\left\lceil \frac{|x-c|}{100} \right\rceil \right\}$$ PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Given the nine-sided regular polygon $ A_1 A_2 A_3 A_4 A_5 A_6 A_7 A_8 A_9$, how many distinct equilateral triangles in the plane of the polygon have at least two vertices in the set $ \{A_1,A_2,...A_9\}$? $ \textbf{(A)} \ 30 \qquad \textbf{(B)} \ 36 \qquad \textbf{(C)} \ 63 \qquad \textbf{(D)} \ 66 \qquad \textbf{(E)} \ 72$

Let $n$ be a positive integer. Given $n^2$ points in a unit square, prove that there exists a broken line of length $2n + 1$ that passes through all the points. [i]Allen Yuan[/i]

[u]Round 1[/u] [b]p1.[/b] A circle is inscribed inside a square such that the cube of the radius of the circle is numerically equal to the perimeter of the square. What is the area of the circle? [b]p2.[/b] If the coefficient of $z^ky^k$ is $252$ in the expression $(z + y)^{2k}$, find $k$. [b]p3.[/b] Let $f(x) = \frac{4x^4-2x^3-x^2-3x-2}{x^4-x^3+x^2-x-1}$ be a function defined on the real numbers where the denominator is not zero. The graph of $f$ has a horizontal asymptote. Compute the sum of the x-coordinates of the points where the graph of $f$ intersects this horizontal asymptote. If the graph of f does not intersect the asymptote, write $0$. [u]Round 2 [/u] [b]p4.[/b] How many $5$-digit numbers have strictly increasing digits? For example, $23789$ has strictly increasing digits, but $23889$ and $23869$ do not. [b]p5.[/b] Let $$y =\frac{1}{1 +\frac{1}{9 +\frac{1}{5 +\frac{1}{9 +\frac{1}{5 +...}}}}}$$ If $y$ can be represented as $\frac{a\sqrt{b} + c}{d}$ , where $b$ is not divisible by any squares, and the greatest common divisor of $a$ and $d$ is $1$, find the sum $a + b + c + d$. [b]p6.[/b] “Counting” is defined as listing positive integers, each one greater than the previous, up to (and including) an integer $n$. In terms of $n$, write the number of ways to count to $n$. [u]Round 3 [/u] [b]p7.[/b] Suppose $p$, $q$, $2p^2 + q^2$, and $p^2 + q^2$ are all prime numbers. Find the sum of all possible values of $p$. [b]p8.[/b] Let $r(d)$ be a function that reverses the digits of the $2$-digit integer $d$. What is the smallest $2$-digit positive integer $N$ such that for some $2$-digit positive integer $n$ and $2$-digit positive integer $r(n)$, $N$ is divisible by $n$ and $r(n)$, but not by $11$? [b]p9.[/b] What is the period of the function $y = (\sin(3\theta) + 6)^2 - 10(sin(3\theta) + 7) + 13$? [u]Round 4 [/u] [b]p10.[/b] Three numbers $a, b, c$ are given by $a = 2^2 (\sum_{i=0}^2 2^i)$, $b = 2^4(\sum_{i=0}^4 2^i)$, and $c = 2^6(\sum_{i=0}^6 2^i)$ . $u, v, w$ are the sum of the divisors of a, b, c respectively, yet excluding the original number itself. What is the value of $a + b + c -u - v - w$? [b]p11.[/b] Compute $\sqrt{6- \sqrt{11}} - \sqrt{6+ \sqrt{11}}$. [b]p12.[/b] Let $a_0, a_1,..., a_n$ be such that $a_n\ne 0$ and $$(1 + x + x^3)^{341}(1 + 2x + x^2 + 2x^3 + 2x^4 + x^6)^{342} =\sum_{i=0}^n a_ix^i.$$ Find the number of odd numbers in the sequence $a_0, a_1,..., a_n$. PS. You should use hide for answers. Rounds 5-7 have been posted [url=https://artofproblemsolving.com/community/c4h2781343p24424617]here[/url]. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

A neat fruit arrangement on a large round dish is edged with strawberries. Between $100$ and $200$ berries are used for this border. A deliciously hungry child eats first one of the strawberries and then starts going round and round the dish, she eats strawberries in the following way: When she has eaten a berry, she leaves it next lie, then she eats the next, leaves the next, etc. Thus she continues until there is only one strawberry left. This berry is the one that was lying right after the very first thing she ate. How many berries were there originally?

Let $ X$ be a set containing $ 2k$ elements, $ F$ is a set of subsets of $ X$ consisting of certain $ k$ elements such that any one subset of $ X$ consisting of $ k \minus{} 1$ elements is exactly contained in an element of $ F.$ Show that $ k \plus{} 1$ is a prime number.

One of the numbers $1$ or $-1$ is assigned to each vertex of a cube. To each face of the cube is assigned the integer which is the product of the four integers at the vertices of the face. Is it possible that the sum of the $14$ assigned integers is $0$? (G. Galperin)

[b]p1.[/b] Compute $2020 \cdot \left( 2^{(0\cdot1)} + 9 - \frac{(20^1)}{8}\right)$. [b]p2.[/b] Nathan has five distinct shirts, three distinct pairs of pants, and four distinct pairs of shoes. If an “outfit” has a shirt, pair of pants, and a pair of shoes, how many distinct outfits can Nathan make? [b]p3.[/b] Let $ABCD$ be a rhombus such that $\vartriangle ABD$ and $\vartriangle BCD$ are equilateral triangles. Find the angle measure of $\angle ACD$ in degrees. [b]p4.[/b] Find the units digit of $2019^{2019}$. [b]p5.[/b] Determine the number of ways to color the four vertices of a square red, white, or blue if two colorings that can be turned into each other by rotations and reflections are considered the same. [b]p6.[/b] Kathy rolls two fair dice numbered from $1$ to $6$. At least one of them comes up as a $4$ or $5$. Compute the probability that the sumof the numbers of the two dice is at least $10$. [b]p7.[/b] Find the number of ordered pairs of positive integers $(x, y)$ such that $20x +19y = 2019$. [b]p8.[/b] Let $p$ be a prime number such that both $2p -1$ and $10p -1$ are prime numbers. Find the sum of all possible values of $p$. [b]p9.[/b] In a square $ABCD$ with side length $10$, let $E$ be the intersection of $AC$ and $BD$. There is a circle inscribed in triangle $ABE$ with radius $r$ and a circle circumscribed around triangle $ABE$ with radius $R$. Compute $R -r$ . [b]p10.[/b] The fraction $\frac{13}{37 \cdot 77}$ can be written as a repeating decimal $0.a_1a_2...a_{n-1}a_n$ with $n$ digits in its shortest repeating decimal representation. Find $a_1 +a_2 +...+a_{n-1}+a_n$. [b]p11.[/b] Let point $E$ be the midpoint of segment $AB$ of length $12$. Linda the ant is sitting at $A$. If there is a circle $O$ of radius $3$ centered at $E$, compute the length of the shortest path Linda can take from $A$ to $B$ if she can’t cross the circumference of $O$. [b]p12.[/b] Euhan and Minjune are playing tennis. The first one to reach $25$ points wins. Every point ends with Euhan calling the ball in or out. If the ball is called in, Minjune receives a point. If the ball is called out, Euhan receives a point. Euhan always makes the right call when the ball is out. However, he has a $\frac34$ chance of making the right call when the ball is in, meaning that he has a $\frac14$ chance of calling a ball out when it is in. The probability that the ball is in is equal to the probability that the ball is out. If Euhan won, determine the expected number of wrong callsmade by Euhan. [b]p13.[/b] Find the number of subsets of $\{1, 2, 3, 4, 5, 6,7\}$ which contain four consecutive numbers. [b]p14.[/b] Ezra and Richard are playing a game which consists of a series of rounds. In each round, one of either Ezra or Richard receives a point. When one of either Ezra or Richard has three more points than the other, he is declared the winner. Find the number of games which last eleven rounds. Two games are considered distinct if there exists a round in which the two games had different outcomes. [b]p15.[/b] There are $10$ distinct subway lines in Boston, each of which consists of a path of stations. Using any $9$ lines, any pair of stations are connected. However, among any $8$ lines there exists a pair of stations that cannot be reached from one another. It happens that the number of stations is minimized so this property is satisfied. What is the average number of stations that each line passes through? [b]p16.[/b] There exist positive integers $k$ and $3\nmid m$ for which $$1 -\frac12 + \frac13 - \frac14 +...+ \frac{1}{53}-\frac{1}{54}+\frac{1}{55}=\frac{3^k \times m}{28\times 29\times ... \times 54\times 55}.$$ Find the value $k$. [b]p17.[/b] Geronimo the giraffe is removing pellets from a box without replacement. There are $5$ red pellets, $10$ blue pellets, and $15$ white pellets. Determine the probability that all of the red pellets are removed before all the blue pellets and before all of the white pellets are removed. [b]p18.[/b] Find the remainder when $$70! \left( \frac{1}{4 \times 67}+ \frac{1}{5 \times 66}+...+ \frac{1}{66\times 5}+ \frac{1}{67\times 4} \right)$$ is divided by $71$. [b]p19.[/b] Let $A_1A_2...A_{12}$ be the regular dodecagon. Let $X$ be the intersection of $A_1A_2$ and $A_5A_{11}$. Given that $X A_2 \cdot A_1A_2 = 10$, find the area of dodecagon. [b]p20.[/b] Evaluate the following infinite series: $$\sum^{\infty}_{n=1}\sum^{\infty}_{m=1} \frac{n \sec^2m -m \tan^2 n}{3^{m+n}(m+n)}$$. PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].