A line that passes through the origin intersects both the line $x=1$ and the line $y=1+\frac{\sqrt{3}}{3}x$. The three lines create an equilateral triangle. What is the perimeter of the triangle? $ \textbf{(A) }2\sqrt{6}\qquad\textbf{(B) }2+2\sqrt{3}\qquad\textbf{(C) }6\qquad\textbf{(D) }3+2\sqrt{3}\qquad\textbf{(E) }6+\frac{\sqrt{3}}{3} $

Let $\mathbb{Z}_{>0}$ denote the set of positive integers. For any positive integer $k$, a function $f: \mathbb{Z}_{>0} \to \mathbb{Z}_{>0}$ is called [i]$k$-good[/i] if $\gcd(f(m) + n, f(n) + m) \le k$ for all $m \neq n$. Find all $k$ such that there exists a $k$-good function. [i]Proposed by James Rickards, Canada[/i]

[u]Round 5[/u] [b]p13.[/b] Five different schools are competing in a tournament where each pair of teams plays at most once. Four pairs of teams are randomly selected and play against each other. After these four matches, what is the probability that Chad's and Jordan's respective schools have played against each other, assuming that Chad and Jordan come from different schools? [b]p14.[/b] A square of side length $1$ and a regular hexagon are both circumscribed by the same circle. What is the side length of the hexagon? [b]p15.[/b] From the list of integers $1,2, 3,...,30$ Jordan can pick at least one pair of distinct numbers such that none of the $28$ other numbers are equal to the sum or the difference of this pair. Of all possible such pairs, Jordan chooses the pair with the least sum. Which two numbers does Jordan pick? [u]Round 6[/u] [b]p16.[/b] What is the sum of all two-digit integers with no digit greater than four whose squares also have no digit greater than four? [b]p17.[/b] Chad marks off ten points on a circle. Then, Jordan draws five chords under the following constraints: $\bullet$ Each of the ten points is on exactly one chord. $\bullet$ No two chords intersect. $\bullet$ There do not exist (potentially non-consecutive) points $A, B,C,D,E$, and $F$, in that order around the circle, for which $AB$, $CD$, and $EF$ are all drawn chords. In how many ways can Jordan draw these chords? [b]p18.[/b] Chad is thirsty. He has $109$ cubic centimeters of silicon and a 3D printer with which he can print a cup to drink water in. He wants a silicon cup whose exterior is cubical, with five square faces and an open top, that can hold exactly $234$ cubic centimeters of water when filled to the rim in a rectangular-box-shaped cavity. Using all of his silicon, he prints a such cup whose thickness is the same on the five faces. What is this thickness, in centimeters? [u]Round 7[/u] [b]p19.[/b] Jordan wants to create an equiangular octagon whose side lengths are exactly the first $8$ positive integers, so that each side has a different length. How many such octagons can Jordan create? [b]p20.[/b] There are two positive integers on the blackboard. Chad computes the sum of these two numbers and tells it to Jordan. Jordan then calculates the sum of the greatest common divisor and the least common multiple of the two numbers, and discovers that her result is exactly $3$ times as large as the number Chad told her. What is the smallest possible sum that Chad could have said? [b]p21.[/b] Chad uses yater to measure distances, and knows the conversion factor from yaters to meters precisely. When Jordan asks Chad to convert yaters into meters, Chad only gives Jordan the result rounded to the nearest integer meters. At Jordan's request, Chad converts $5$ yaters into $8$ meters and $7$ yaters into $12$ meters. Given this information, how many possible numbers of meters could Jordan receive from Chad when requesting to convert $2014$ yaters into meters? [u]Round 8[/u] [b]p22.[/b] Jordan places a rectangle inside a triangle with side lengths $13$, $14$, and $15$ so that the vertices of the rectangle all lie on sides of the triangle. What is the maximum possible area of Jordan's rectangle? [b]p23.[/b] Hoping to join Chad and Jordan in the Exeter Space Station, there are $2014$ prospective astronauts of various nationalities. It is given that $1006$ of the astronaut applicants are American and that there are a total of $64$ countries represented among the applicants. The applicants are to group into $1007$ pairs with no pair consisting of two applicants of the same nationality. Over all possible distributions of nationalities, what is the maximum number of possible ways to make the $1007$ pairs of applicants? Express your answer in the form $a \cdot b!$, where $a$ and $b$ are positive integers and $a$ is not divisible by $b + 1$. Note: The expression $k!$ denotes the product $k \cdot (k - 1) \cdot ... \cdot 2 \cdot 1$. [b]p24.[/b] We say a polynomial $P$ in $x$ and $y$ is $n$-[i]good [/i] if $P(x, y) = 0$ for all integers $x$ and $y$, with $x \ne y$, between $1$ and $n$, inclusive. We also define the complexity of a polynomial to be the maximum sum of exponents of $x$ and $y$ across its terms with nonzero coeffcients. What is the minimal complexity of a nonzero $4$-good polynomial? In addition, give an example of a $4$-good polynomial attaining this minimal complexity. PS. You should use hide for answers. Rounds 1-4 have been posted [url=https://artofproblemsolving.com/community/c3h2915803p26040550]here[/url]. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Determine all finite increasing arithmetic progressions in which each term is the reciprocal of a positive integer and the sum of all the terms is $1$.

Given two real numbers $p$ and $q$, we study the following system of equations with variables $x,y \in \mathbb{R}$: \begin{align*} x^2+py+q&=0,\\ y^2+px+q&=0. \end{align*} Determine the number of distinct solutions $(x,y)$ in terms of $p$ and $q$.

Real numbers $x_1,x_2,...x_{2004},y_1,y_2,...y_{2004}$ differ from $1$ and are such that $x_ky_k=1$ for every $k=1,2,...,2004$. Calculate the sum $$S=\frac{1}{1-x_1^3}+\frac{1}{1-x_2^3}+...+\frac{1}{1-x_{2004}^3}+\frac{1}{1-y_1^3}+\frac{1}{1-y_2^3}+...+\frac{1}{1-y_{2004}^3}$$

Let \( n \) be a positive integer. A graph on \( 2n - 1 \) vertices is given such that the size of the largest clique in the graph is \( n \). Prove that there exists a vertex that is present in every clique of size \( n\)

Let $N$ be the number of positive integers that are less than or equal to 2003 and whose base-2 representation has more 1's than 0's. Find the remainder when $N$ is divided by 1000.

There are numerous sets of $17$ distinct positive integers that sum to $2018$, such that each integer has the same sum of digits in base $10$. Let $M$ be the maximum possible integer that could exist in any such set. Find the sum of $M$ and the number of such sets that contain $M$.

At time $t = 0$ a drag racer starts from rest at the origin and moves along a straight line with velocity given by $v = 5t^2$, where $v$ is in $\text{m/s}$ and $t$ in $\text{s}$. The expression for the displacement of the car from $t = 0$ to time $t$ is $ \textbf{(A)}\ 5t^3 \qquad\textbf{(B)}\ 5t^3/3\qquad\textbf{(C)}\ 10t \qquad\textbf{(D)}\ 15t^2 \qquad\textbf{(E)}\ 5t/2 $

The perimeter of triangle $ABC$ is $k$ times larger than side $BC$, $AB \ne AC$. In what ratio does the median to side $BC$ divide the diameter of the circle inscribed in this triangle, perpendicular to this side?

Suppose that $\{a_n\}$ is a sequence such that $a_{n+1}=(1+\frac{k}{n})a_{n}+1$ with $a_{1}=1$.Find all positive integers $k$ such that any $a_n$ be integer.

The sequence of real numbers $a_1,a_2,...,a_{2015}$ is such that the 2015 equations: $a_1^3=a_1^2;a_1^3+a_2^3=(a_1+a_2 )^2;...;a_1^3+a_2^3+...+a_{2015}^3=(a_1+a_2+...+a_{2015} )^2$ are true. Prove that $a_1,a_2,…,a_{2015}$ are integers.

In a room, each person is an painter and/or a musician. $2$ percent of the painters are musicians, and $5$ percent of the musicians are painters. Only one person is both an painter and a musician. How many people are in the room? [i]Proposed by Evan Chang[/i]

Determine all positive integers relatively prime to all the terms of the infinite sequence \[ a_n=2^n+3^n+6^n -1,\ n\geq 1. \]

Let $m$ and $n$ be positive integers and $p$ be a prime number. Find the greatest positive integer $s$ (as a function of $m,n$ and $p$) such that from a random set of $mnp$ positive integers we can choose $snp$ numbers, such that they can be partitioned into $s$ sets of $np$ numbers, such that the sum of the numbers in every group gives the same remainder when divided by $p$.