If the point $(x,-4)$ lies on the straight line joining the points $(0,8)$ and $(-4,0)$ in the xy-plane, then $x$ is equal to $\textbf{(A) }-2\qquad\textbf{(B) }2\qquad\textbf{(C) }-8\qquad\textbf{(D) }6\qquad \textbf{(E) }-6$

In triangle $ABC$ the median $BM$ is equal to half of the side $BC$. Show that $\angle ABM = \angle BCA + \angle BAC$. [i](Proposed by Anton Trygub)[/i]

There are $n$ passengers in a line, waiting to board a plane with $n$ seats. For $1 \le k \le n$, the $k^{th}$ passenger in line has a ticket for the $k^{th}$ seat. However, the rst passenger ignores his ticket, and decides to sit in a seat at random. Thereafter, each passenger sits as follows: If his/her assigned is empty, then he/she sits in it. Otherwise, he/she sits in an empty seat at random. How many different ways can all $n$ passengers be seated?

Let $BC$ be a fixed chord of a circle $\omega$. Let $A$ be a variable point on the major arc $BC$ of $\omega$. Let $H$ be the orthocenter of $ABC$. The points $D, E$ lie on $AB, AC$ such that $H$ is the midpoint of $DE$. $O_A$ is the circumcenter of $ADE$. Prove that as $A$ varies, $O_A$ lies on a fixed circle.

Prove that if a regular icosahedron and a regular dodecahedron have a common circumsphere, then they have a common insphere. [i](7 points)[/i]

Consider positive integers $m <n,p < q$ such that $(m, n) = 1, (p, q) = 1$ and satisfy the condition that if $\frac{m}{n}= tan\alpha$ and $\frac{p}{q} = tan\beta$, then $\alpha + \beta = 45^o$. i) Given $m, n$, find $p, q$. ii) Given $n, q$, find $m, p$. ii) Given $m, q$, find $n, p$.

Let $Q_0(x)=1$, $Q_1(x)=x,$ and \[Q_n(x)=\frac{(Q_{n-1}(x))^2-1}{Q_{n-2}(x)}\] for all $n\ge 2.$ Show that, whenever $n$ is a positive integer, $Q_n(x)$ is equal to a polynomial with integer coefficients.

Find the number of positive integers $n<2017$ such that $n^2+n^0+n^1+n^7$ is not divisible by the square of any prime. [i]Proposed by [b]illogical_21[/b][/i]

Triangle $ABC$ in the plane $\Pi$ is called [i]good [/i] if it has the following property: For any point $D$ in space outside the plane $\Pi$, it is possible to construct a triangle with sides of lengths $CD,BD,AD$. Find all good triangles

[hide=D stands for Descartes, L stands for Leibniz]they had two problem sets under those two names[/hide] [u]Set 4[/u] [b]D.16 / L.6[/b] Alex has $100$ Bluffy Funnies in some order, which he wants to sort in order of height. They’re already almost in order: each Bluffy Funny is at most $1$ spot off from where it should be. Alex can only swap pairs of adjacent Bluffy Funnies. What is the maximum possible number of swaps necessary for Alex to sort them? [b]D.17[/b] I start with the number $1$ in my pocket. On each round, I flip a coin. If the coin lands heads heads, I double the number in my pocket. If it lands tails, I divide it by two. After five rounds, what is the expected value of the number in my pocket? [b]D.18 / L.12[/b] Point $P$ inside square $ABCD$ is connected to each corner of the square, splitting the square into four triangles. If three of these triangles have area $25$, $25$, and $15$, what are all the possible values for the area of the fourth triangle? [b]D.19[/b] Mr. Stein and Mr. Schwartz are playing a yelling game. The teachers alternate yelling. Each yell is louder than the previous and is also relatively prime to the previous. If any teacher yells at $100$ or more decibels, then they lose the game. Mr. Stein yells first, at $88$ decibels. What volume, in decibels, should Mr. Schwartz yell at to guarantee that he will win? [b]D.20 / L.15[/b] A semicircle of radius $1$ has line $\ell$ along its base and is tangent to line $m$. Let $r$ be the radius of the largest circle tangent to $\ell$, $m$, and the semicircle. As the point of tangency on the semicircle varies, the range of possible values of $r$ is the interval $[a, b]$. Find $b - a$. [u]Set 5[/u] [b]D.21 / L.14[/b] Hungryman starts at the tile labeled “$S$”. On each move, he moves $1$ unit horizontally or vertically and eats the tile he arrives at. He cannot move to a tile he already ate, and he stops when the sum of the numbers on all eaten tiles is a multiple of nine. Find the minimum number of tiles that Hungryman eats. [img]https://cdn.artofproblemsolving.com/attachments/e/7/c2ecc2a872af6c4a07907613c412d3b86cd7bc.png [/img] [b]D.22 / L.11[/b] How many triples of nonnegative integers $(x, y, z)$ satisfy the equation $6x + 10y +15z = 300$? [b]D.23 / L.16[/b] Anson, Billiam, and Connor are looking at a $3D$ figure. The figure is made of unit cubes and is sitting on the ground. No cubes are floating; in other words, each unit cube must either have another unit cube or the ground directly under it. Anson looks from the left side and says, “I see a $5 \times 5$ square.” Billiam looks from the front and says the same thing. Connor looks from the top and says the same thing. Find the absolute difference between the minimum and maximum volume of the figure. [b]D.24 / L.13[/b] Tse and Cho are playing a game. Cho chooses a number $x \in [0, 1]$ uniformly at random, and Tse guesses the value of $x(1 - x)$. Tse wins if his guess is at most $\frac{1}{50}$ away from the correct value. Given that Tse plays optimally, what is the probability that Tse wins? [b]D.25 / L.20[/b] Find the largest solution to the equation $$2019(x^{2019x^{2019}-2019^2+2019})^{2019}) = 2019^{x^{2019}+1}.$$ [u]Set 6[/u] [i]This round is an estimation round. No one is expected to get an exact answer to any of these questions, but unlike other rounds, you will get points for being close. In the interest of transparency, the formulas for determining the number of points you will receive are located on the answer sheet, but they aren’t very important when solving these problems.[/i] [b]D.26 / L.26[/b] What is the sum over all MBMT volunteers of the number of times that volunteer has attended MBMT (as a contestant or as a volunteer, including this year)? Last year there were $47$ volunteers; this is the fifth MBMT. [b]D.27 / L.27[/b] William is sharing a chocolate bar with Naveen and Kevin. He first randomly picks a point along the bar and splits the bar at that point. He then takes the smaller piece, randomly picks a point along it, splits the piece at that point, and gives the smaller resulting piece to Kevin. Estimate the probability that Kevin gets less than $10\%$ of the entire chocolate bar. [b]D.28 / L.28[/b] Let $x$ be the positive solution to the equation $x^{x^{x^x}}= 1.1$. Estimate $\frac{1}{x-1}$. [b]D.29 / L.29[/b] Estimate the number of dots in the following box: [img]https://cdn.artofproblemsolving.com/attachments/8/6/416ba6379d7dfe0b6302b42eff7de61b3ec0f1.png[/img] It may be useful to know that this image was produced by plotting $(4\sqrt{x}, y)$ some number of times, where x, y are random numbers chosen uniformly randomly and independently from the interval $[0, 1]$. [b]D.30 / L.30[/b] For a positive integer $n$, let $f(n)$ be the smallest prime greater than or equal to $n$. Estimate $$(f(1) - 1) + (f(2) - 2) + (f(3) - 3) + ...+ (f(10000) - 10000).$$ For $26 \le i \le 30$, let $E_i$ be your team’s answer to problem $i$ and let $A_i$ be the actual answer to problem $i$. Your score $S_i$ for problem $i$ is given by $S_{26} = \max(0, 12 - |E_{26} - A_{26}|/5)$ $S_{27} = \max(0, 12 - 100|E_{27} - A_{27}|)$ $S_{28} = \max(0, 12 - 5|E_{28} - A_{28}|))$ $S_{29} = 12 \max \left(0, 1 - 3 \frac{|E_{29} - A_{29}|}{A_{29}} \right)$ $S_{30} = \max (0, 12 - |E_{30} - A_{30}|/2000)$ PS. You should use hide for answers. D.1-15 / L1-9 problems have been collected [url=https://artofproblemsolving.com/community/c3h2790795p24541357]here [/url] and L10,16-30 [url=https://artofproblemsolving.com/community/c3h2790825p24541816]here[/url]. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Cindy and Neil wanted to paint the side of a staircase in the six-square pattern shown below so that each of the six squares is painted a solid color, and no two squares that share an edge are the same color. Cindy draws all n patterns that can be colored using the four colors red, white, blue, and green. Neil looked at these patterns and claimed that k of the patterns Cindy drew were incorrect because two adjacent squares were colored with the same color. This is because Neil is color-blind and cannot distinguish red from green. Find $n + k$. For picture go to http://www.purplecomet.org/welcome/practice

Determine all real numbers $ a$ such that there is a function $ f: \mathbb{R} \rightarrow \mathbb{R}$ satisfying \[ x\plus{}f(y)\equal{}af(y\plus{}f(x))\] for all real numbers $ x$ and $ y$. [i]Hery Susanto, Malang[/i]

The area of the quadrilateral with vertices at the four points in three dimensional space $(0,0,0)$, $(2,6,1)$, $(-3,0,3)$ and $(-4,2,5)$ is the number $\dfrac{m}{n}$, where $m$ and $n$ are relatively prime positive integers. Find $m+n$.

We consider the points $A,B,C,D$, not in the same plane, such that $AB\perp CD$ and $AB^2+CD^2=AD^2+BC^2$. a) Prove that $AC\perp BD$. b) Prove that if $CD<BC<BD$, then the angle between the planes $(ABC)$ and $(ADC)$ is greater than $60^{\circ}$.

Every two residents of a city have an even number of common friends in the city. One day, some of the people sent postcards to some of their friends. Each resident with odd number of friends sent exactly one postcard, and every other - no more than one. Every resident received no more than one postcard. Prove that the number of ways the cards could be sent is odd.

The numbers from $1$ to $64$ must be written on the small squares of a chessboard, with a different number in each small square. Consider the $112$ numbers you can make by adding the numbers in two small squares which have a common edge. Is it possible to write the numbers in the squares so that these $112$ sums are all different?

Shiori places seven books, numbered from $1$ to $7$, on a bookshelf in some order. Later, she discovers that she can place two dividers between the books, separating the books into left, middle, and right sections, such that: $\bullet$ The left section is numbered in increasing order from left to right, or has at most one book. $\bullet$ The middle section is numbered in decreasing order from left to right, or has at most one book. $\bullet$ The right section is numbered in increasing order from left to right, or has at most one book. In how many possible orderings could Shiori have placed the books? For example, $(2, 3, 5, 4, 1, 6, 7)$ and $(2, 3, 4, 1, 5, 6, 7)$ are possible orderings with the partitions $2, 3, 5|4, 1|6, 7$ and $2, 3, 4|1|5, 6, 7$, but $(5, 6, 2, 4, 1, 3, 7)$ is not.