[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].

In a $ 19\times 19$ board, a piece called [i]dragon[/i] moves as follows: It travels by four squares (either horizontally or vertically) and then it moves one square more in a direction perpendicular to its previous direction. It is known that, moving so, a dragon can reach every square of the board. The [i]draconian distance[/i] between two squares is defined as the least number of moves a dragon needs to move from one square to the other. Let $ C$ be a corner square, and $ V$ the square neighbor of $ C$ that has only a point in common with $ C$. Show that there exists a square $ X$ of the board, such that the draconian distance between $ C$ and $ X$ is greater than the draconian distance between $ C$ and $ V$.

a) Prove that $\lfloor x\rfloor$ is odd iff $\Big\lfloor 2\{\frac{x}{2}\}\Big\rfloor=1$ ($\lfloor x\rfloor$ denotes the largest integer less than or equal to $x$ and $\{x\}=x-\lfloor x\rfloor$). b) Let $n$ be a natural number. Find the number of [i]square free[/i] numbers $a$, such that $\Big\lfloor\frac{n}{\sqrt{a}}\Big\rfloor$ is odd. (A natural number is [i]square free[/i] if it's not divisible by any square of a prime number).

Fatima and Asma are playing the following game. First, Fatima chooses $2013$ pairwise different numbers, called $a_1, a_2, ..., a_{2013}$. Then, Asma tries to know the value of each number $a_1, a_2, ..., a_{2013}$.. At each time, Asma chooses $1 \le i < j \le 2013$ and asks Fatima ''[i]What is the set $\{a_i,a_j\}$?[/i]'' (For example, if Asma asks what is the set $\{a_i,a_j\}$, and $a_1 = 17$ and $a_2 = 13$, Fatima will answer $\{13. 17\}$). Find the least number of questions Asma needs to ask, to know the value of all the numbers $a_1, a_2, ..., a_{2013}$.

A lightbulb is given that emits red, green or blue light and an infinite set $S$ of switches, each with three positions labeled red, green and blue. We know the following: [list=1] [*]For every combination of the switches the lighbulb emits a given color. [*]If all switches are in a position with a given color, the lightbulb emits the same color. [*]If there are two combinations of the switches where each switch is in a different position, the lightbulb emits a different color for the two combinations. [/list] We create the following set $U$ containing some of the subsets of $S$: for each combination of the switches let us observe the color of the lightbulb, and put the set of those switches in $U$ which are in the same position as the color of the lightbulb. Prove that $U$ is an ultrafilter on $S$. In other words, prove that $U$ satisfies the following conditions: [list=1] [*]The empty set is not in $U.$ [*]If two sets are in $U,$ their intersection is also in $U.$ [*]If a set is in $U,$ every subset of $S$ containing it is also in $U.$ [*]Considering a set and its complement in $S,$ exactly one of these sets is contained in $U.$ [/list]

Three couples sit for a photograph in $2$ rows of three people each such that no couple is sitting in the same row next to each other or in the same column one behind the other. How many such arrangements are possible?

We can change a natural number $n$ in three ways: a) If the number $n$ has at least two digits, we erase the last digit and we subtract that digit from the remaining number (for example, from $123$ we get $12 - 3 = 9$); b) If the last digit is different from $0$, we can change the order of the digits in the opposite one (for example, from $123$ we get $321$); c) We can multiply the number $n$ by a number from the set $ \{1, 2, 3,..., 2010\}$. Can we get the number $21062011$ from the number $1012011$?

Let $S$ be the set of points inside and on the boarder of a regular haxagon with side length 1. Find the least constant $r$, such that there exists one way to colour all the points in $S$ with three colous so that the distance between any two points with same colour is less than $r$.

Fix positive integers $k,n$. A candy vending machine has many different colours of candy, where there are $2n$ candies of each colour. A couple of kids each buys from the vending machine $2$ candies of different colours. Given that for any $k+1$ kids there are two kids who have at least one colour of candy in common, find the maximum number of kids.

Determine if there exists a triangle that can be cut into $101$ congruent triangles.

Let $ S$ be a sequence that: \[ \left\{ \begin{array}{cc} S_0\equal{}0\hfill\\ S_1\equal{}1\hfill\\ S_n\equal{}S_{n\minus{}1}\plus{}S_{n\minus{}2}\plus{}F_n& (n>1) \end{array} \right.\] such that $ F_n$ is Fibonacci sequence such that $ F_1\equal{}F_2\equal{}1$. Find $ S_n$ in terms of Fibonacci numbers.

Eighteen people are standing in a (socially-distanced) line to enter a grocery store. Five people are wearing a black mask, $6$ are wearing a gray mask, and $7$ are wearing a white mask. Suppose that these $18$ people got on line in a random order. The expected number of pairs of adjacent people wearing different-colored masks can be given by $\tfrac{a}{b}$, where $\gcd(a, b) = 1$. Compute $a+b$.

Let $F$ be a family of subsets of $S = \left \{ 1,2,...,n \right \}$ ($n \geq 2$). A valid play is to choose two disjoint sets $A$ and $B$ from $F$ and add $A \cup B$ to $F$ (without removing $A$ and $B$). Initially, $F$ has all the subsets that contain only one element of $S$. The goal is to have all subsets of $n - 1$ elements of $S$ in $F$ using valid plays. Determine the lowest number of plays required in order to achieve the goal.

A city has a system of bus routes laid out in such a way that (a) there are exactly $11$ bus stops on each route; (b) it is possible to travel between any two bus stops without changing routes; (c) any two bus routes have exactly one bus stop in common. What is the number of bus routes in the city?

Let $T$ be a triangulation of a $100$-gon.We construct $P(T)$ by copying the same $100$-gon and drawing a diagonal if it was not drawn in $T$ an there is a quadrilateral with this diagonal and two other vertices so that all the sides and diagonals(Except the one we are going to draw) are present in $T$.Let $f(T)$ be the number of intersections of diagonals in $P(T)$.Find the minimum and maximum of $f(T)$.

We have $2^m$ sheets of paper, with the number $1$ written on each of them. We perform the following operation. In every step we choose two distinct sheets; if the numbers on the two sheets are $a$ and $b$, then we erase these numbers and write the number $a + b$ on both sheets. Prove that after $m2^{m -1}$ steps, the sum of the numbers on all the sheets is at least $4^m$ . [i]Proposed by Abbas Mehrabian, Iran[/i]

There are three kinds of things, which are designated respectively by the words (stripped of all common meaning) [i]notes[/i], [i]staves [/i], and [i]heads[/i]. There can be a certain relationship between a note and a head, which is expressed by the saying: they match. Also, a note and a head can match and two different staves can match. Given are the following axioms: (a) If a note and a head each match the same stave, then they match, (b) If two different notes both match with stave B, and also both match with head V, then B and V match, (c) If two staves match, then there is a note that matches both, (d) If a note and a stave are given, then there is a head that matches both. Prove the following theorem, denoting the axiom you apply by its letter. If three staves that differ from each other, each one matches every other, and no note matches any of the three staves, then there is a head that matches all three staves. [hide=original wording] Er zijn drie soorten van dingen, die respectievelijk worden aangeduid met de (van alle gangbare betekenis ontdane) woorden noten, balken en vellen. Tussen een noot en een vel kan een zekere betrekking bestaan die uitgedrukt wordt door de zegswijze: zij passen bij elkaar. Ook kunnen een noot en een vel bij elkaar passen en twee verschillende balken kunnen bij elkaar passen. Gegeven zijn de volgende axioma’s: (a) Als een noot en een vel elk passen bij de zelfde balk, dan passen zij bij elkaar; (b) Als tw’ee verschillende noten beide passen bij balk b, en ook passen bij het vel v, dan passen b en v bij elkaar; (c) Als twee balken bij elkaar passen, dan is er een noot die bij beiden past; (d) Als een noot en een balk zijn gegeven, dan is er een vel dat bij beiden past. Bewijs de volgende stelling en geef daarbij telkens door zijn letter het axioma aan dat U toepast. Als van drie onderling verschillende balken elke past bij elke andere en er geen noot bij de drie balken past, dan is er een vel dat bij alle drie de balken past.[/hide]

Denote $S$ as the subset of $\{1,2,3,\dots,1000\}$ with the property that none of the sums of two different elements in $S$ is in $S$. Find the maximum number of elements in $S$.

Any two islands of the Chaos Archipelago are connected by a bridge - a red bridge or a blue bridge. Show that at least one of the following two assertions holds: $\mathcal{A}_{1}$: For any two islands $a$ and $b$, we can reach $b$ from $a$ through at most $3$ red bridges (and no blue bridges). $\mathcal{A}_{2}$: For any two islands $a$ and $b$, we can reach $b$ from $a$ through at most $2$ blue bridges (and no red bridges). [i]Alternative formulation:[/i] Let $G$ be a graph. Prove that the diameter of $G$ is $\leq 3$ or the diameter of the complement of $G$ is $\leq 2$. [i]Note.[/i] This problem is the main Theorem in Frank Harary, Robert W. Robinson, [i]The Diameter of a Graph and its Complement[/i], The American Mathematical Monthly, Vol. 92, No. 3. (Mar., 1985), pp. 211-212. darij

Fix positive integers $k,n$. A candy vending machine has many different colours of candy, where there are $2n$ candies of each colour. A couple of kids each buys from the vending machine $2$ candies of different colours. Given that for any $k+1$ kids there are two kids who have at least one colour of candy in common, find the maximum number of kids.

Each student chooses $1$ math problem and $1$ physics problem among $20$ math problems and $11$ physics problems. No same pair of problem is selected by two students. And at least one of the problems selected by any student is selected by at most one other student. At most how many students are there?

Given is a grid 8x8. Every square is colored in black or white, so that in every 3x3, the number of white squares is even. What is the minimum number of black squares

In a card game, each card is associated with a numerical value from 1 to 100, with each card beating less, with one exception: 1 beats 100. The player knows that 100 cards with different values lie in front of him. The dealer who knows the order of these cards can tell the player which card beats the other for any pair of cards he draws. Prove that the dealer can make one hundred such messages, so that after that the player can accurately determine the value of each card.

Zaineb makes a large necklace from beads labeled $290, 291, \ldots, 2023$. She uses each bead exactly once, arranging the beads in the necklace any order she likes. Prove that no matter how the beads are arranged, there must be three beads in a row whose labels are the side lengths of a triangle.

Consider the $10$-digit number $M=9876543210$. We obtain a new $10$-digit number from $M$ according to the following rule: we can choose one or more disjoint pairs of adjacent digits in $M$ and interchange the digits in these chosen pairs, keeping the remaining digits in their own places. For example, from $M=9\underline{87}6 \underline{54} 3210$ by interchanging the $2$ underlined pairs, and keeping the others in their places, we get $M_{1}=9786453210$. Note that any number of (disjoint) pairs can be interchanged. Find the number of new numbers that can be so obtained from $M$.