Consider the functions $f,g,h:\mathbb{R}_{\geqslant 0}\to\mathbb{R}_{\geqslant 0}$ and the binary operation $*:\mathbb{R}_{\geqslant 0}\times \mathbb{R}_{\geqslant 0}\to \mathbb{R}_{\geqslant 0}$ defined as \[x*y=f(x)+g(y)+h(x)\cdot|x-y|,\]for all $x,y\in\mathbb{R}_{\geqslant 0}$. Suppose that $(\mathbb{R}_{\geqslant 0},*)$ is a commutative monoid. Determine the functions $f,g,h$.

Three digits are selected at random and without replacement from the set of digits $0$ through $9$. What is the probability that the three digits can be arranged to form a multiple of $5$? $\text{(A) }\frac{17}{90}\qquad\text{(B) }\frac{7}{15}\qquad\text{(C) }\frac{1}{2}\qquad\text{(D) }\frac{8}{15}\qquad\text{(E) }\frac{1}{5}$

In the convex quadrilateral $ABCD$, point $X$ is selected on side $AD$, and the diagonals intersect at point $E$. It is known that $AC = BD$, $\angle ABX = \angle AX B = 50^o$, $\angle CAD = 51^o$, $\angle AED = 80^o$. Find the value of angle $\angle AXC$.

Find the minimum value of $ 2x^2\plus{}2y^2\plus{}5z^2\minus{}2xy\minus{}4yz\minus{}4x\minus{}2z\plus{}15$ for real numbers $ x$, $ y$, $ z$.

Let $ABC$ be an acute triangle with $AC \neq BC$. Points $H$ and $I$ are the orthocenter and incenter of the triangle, respectively. Line $CH$ and $CI$ meet the circumcircle of triangle $ABC$ again at $D$ and $L$ (other than $C$), respectively. Prove that $\angle CIH=90^{\circ}$ if and only if $\angle IDL=90^{\circ}$.

Let $AH_a$ and $BH_b$ be altitudes, $AL_a$ and $BL_b$ be angle bisectors of a triangle $ABC$. It is known that $H_aH_b // L_aL_b$. Is it necessarily true that $AC = BC$? (B. Frenkin)

Let $n$ be a positive integer, and $a_1,...,a_n, b_1,..., b_n$ be $2n$ positive real numbers such that $a_1 + ... + a_n = b_1 + ... + b_n = 1$. Find the minimal value of $ \frac {a_1^2} {a_1 + b_1} + \frac {a_2^2} {a_2 + b_2} + ...+ \frac {a_n^2} {a_n + b_n}$.

Let $B$ and $C$ be arbitrary points on sides $AP$ and $PD$ respectively of an acute triangle $APD$. The diagonals of the quadrilateral $ABCD$ meet at $Q$, and $H_1,H_2$ are the orthocenters of triangles $APD$ and $BPC$, respectively. Prove that if the line $H_1H_2$ passes through the intersection point $X \ (X \neq Q)$ of the circumcircles of triangles $ABQ$ and $CDQ$, then it also passes through the intersection point $Y \ (Y \neq Q)$ of the circumcircles of triangles $BCQ$ and $ADQ.$

For each positive real number $x$, let $f(x)=\frac{x}{1+x}$ . Prove that if $a$, $b,$ $c$ are the sidelengths of a triangle, then $f(a)$, $f(b),$ $f(c)$ are sidelengths of a triangle.

There are $c$ red, $p$ blue, and $b$ white balls on a table. Two players $A$ and $B$ play a game by alternately making moves. In every move, a player takes two or three balls from the table. Player $A$ begins. A player wins if after his/her move at least one of the three colors no longer exists among the balls remaining on the table. For which values of $c,p,b$ does player $A$ have a winning strategy?

Let $\alpha>-2$ , $n\in \mathbb{N}$ and $y_1,\cdots,y_n$ be the solutions to the system of equations: $\sum_{j=1}^n \frac{y_j}{j+k+\alpha}= \frac{1}{n+1+k+\alpha}$ , $k=1,\cdots,n$ Prove that $y_{j-1}y_{j+1}\leq y_j^2 \,\forall 1<j<n$

You wish to color every vertex, edge, face, and the interior of a cube one color each such that no two adjacent objects are the same color. Faces are adjacent if they share an edge. Edges are adjacent if they share a vertex. The interior is adjacent to all of its faces, edges, and vertices. Each face is adjacent to all of its edges and vertices. Each edge is adjacent to both of its vertices. What is the minimum number of colors required to do this?

The number of all positive integers $n$ such that $n + s(n) = 2016$, where $s(n)$ is the sum of all digits of $n$ is (A): $1$ (B): $2$ (C): $3$ (D): $4$ (E): None of the above.

The base of a triangle is $ 15$ inches. Two lines are drawn parallel to the base, terminating in the other two sides, and dividing the triangle into three equal areas. The length of the parallel closer to the base is: $ \textbf{(A)}\ 5\sqrt{6}\text{ inches} \qquad\textbf{(B)}\ 10\text{ inches} \qquad\textbf{(C)}\ 4\sqrt{3}\text{ inches} \qquad\textbf{(D)}\ 7.5\text{ inches}\\ \textbf{(E)}\ \text{none of these}$

In all triangles $ABC$ does it hold: $$(b^n+c^p)\tan^{n+p}\frac A2+(c^n+a^p)\tan^{n+p}\frac B2+(a^n+b^p)\tan^{n+p}\frac C2\ge6\sqrt{\left(\frac{4r^2}{R\sqrt3}\right)^{n+p}}$$ where $n,p\in(0,\infty)$. [i]Proposed by Nicolae Papacu[/i]

The $49$ numbers $2,3,4,...,49,50$ are written on the blackboard . An allowed operation consists of choosing two different numbers $a$ and $b$ of the blackboard such that $a$ is a multiple of $b$ and delete exactly one of the two. María performs a sequence of permitted operations until she observes that it is no longer possible to perform any more. Determine the minimum number of numbers that can remain on the board at that moment.

Let $a, b, c$ be real numbers in the interval $[0, 1]$, satisfying $ab + c \le 1$. Find the maximal value of their sum $a + b + c$.

Given are the real line and the two unique marked points $0$ and $1$. We can perform as many times as we want the following operation: we take two already marked points $a$ and $b$ and mark the reflection of $a$ over $b$. Let $f(n)$ be the minimum number of operations needed to mark on the real line the number $n$ (which is the number at a distance $\left| n\right|$ from $0$ and it is on the right of $0$ if $n>0$ and on the left of $0$ if $n<0$). For example, $f(0)=f(1)=0$ and $f(-1)=f(2)=1$. Find $f(n)$.

Determine the number of angles $\theta$ between $0$ and $2 \pi$, other than integer multiples of $\pi /2$, such that the quantities $\sin \theta, \cos \theta, $ and $\tan \theta$ form a geometric sequence in some order.

$ P$ is a point on the exterior of a circle centered at $ O$. The tangents to the circle from $ P$ touch the circle at $ A$ and $ B$. Let $ Q$ be the point of intersection of $ PO$ and $ AB$. Let $ CD$ be any chord of the circle passing through $ Q$. Prove that $ \triangle PAB$ and $ \triangle PCD$ have the same incentre.

Reduce $$\frac{2}{\sqrt{4-3\sqrt[4]{5} + 2\sqrt[4]{25}-\sqrt[4]{125}}}$$ to its lowest form. Then generalize this result and show that it holds for any positive $n$.

Consider a $ 7\times 7$ numbers table $ a_{ij} \equal{} (i^2 \plus{} j)(i \plus{} j^2), 1\le i,j\le 7.$ When we add arbitrarily each term of an arithmetical progression consisting of $ 7$ integers to corresponding to term of certain row (or column) in turn, call it an operation. Determine whether such that each row of numbers table is an arithmetical progression, after a finite number of operations.

The triangle $ABC$ is right-angled at $A$. Its incentre is $I$, and $H$ is the foot of the perpendicular from $I$ on $AB$. The perpendicular from $H$ on $BC$ meets $BC$ at $E$, and it meets the bisector of $\angle ABC$ at $D$. The perpendicular from $A$ on $BC$ meets $BC$ at $F$. Prove that $\angle EFD = 45^o$

[hide=R stands for Ramanujan , P stands for Pascal]they had two problem sets under those two names[/hide] [u]Set 4[/u] [b]R4.16 / P1.4[/b] Adam and Becky are building a house. Becky works twice as fast as Adam does, and they both work at constant speeds for the same amount of time each day. They plan to finish building in $6$ days. However, after $2$ days, their friend Charlie also helps with building the house. Because of this, they finish building in just $5$ days. What fraction of the house did Adam build? [b]R4.17[/b] A bag with $10$ items contains both pencils and pens. Kanye randomly chooses two items from the bag, with replacement. Suppose the probability that he chooses $1$ pen and $1$ pencil is $\frac{21}{50}$ . What are all possible values for the number of pens in the bag? [b]R4.18 / P2.8[/b] In cyclic quadrilateral $ABCD$, $\angle ABD = 40^o$, and $\angle DAC = 40^o$. Compute the measure of $\angle ADC$ in degrees. (In cyclic quadrilaterals, opposite angles sum up to $180^o$.) [b]R4.19 / P2.6[/b] There is a strange random number generator which always returns a positive integer between $1$ and $7500$, inclusive. Half of the time, it returns a uniformly random positive integer multiple of $25$, and the other half of the time, it returns a uniformly random positive integer that isn’t a multiple of $25$. What is the probability that a number returned from the generator is a multiple of $30$? [b]R4.20 / P2.7[/b] Julia is shopping for clothes. She finds $T$ different tops and $S$ different skirts that she likes, where $T \ge S > 0$. Julia can either get one top and one skirt, just one top, or just one skirt. If there are $50$ ways in which she can make her choice, what is $T - S$? [u]Set 5[/u] [b]R5.21[/b] A $5 \times 5 \times 5$ cube’s surface is completely painted blue. The cube is then completely split into $ 1 \times 1 \times 1$ cubes. What is the average number of blue faces on each $ 1 \times 1 \times 1$ cube? [b]R5.22 / P2.10[/b] Find the number of values of $n$ such that a regular $n$-gon has interior angles with integer degree measures. [b]R5.23[/b] $4$ positive integers form an geometric sequence. The sum of the $4$ numbers is $255$, and the average of the second and the fourth number is $102$. What is the smallest number in the sequence? [b]R5.24[/b] Let $S$ be the set of all positive integers which have three digits when written in base $2016$ and two digits when written in base $2017$. Find the size of $S$. [b]R5.25 / P3.12[/b] In square $ABCD$ with side length $13$, point $E$ lies on segment $CD$. Segment $AE$ divides $ABCD$ into triangle $ADE$ and quadrilateral $ABCE$. If the ratio of the area of $ADE$ to the area of $ABCE$ is $4 : 11$, what is the ratio of the perimeter of $ADE$ to the perimeter of $ABCE$? [u]Set 6[/u] [b]R6.26 / P6.25[/b] Submit a decimal n to the nearest thousandth between $0$ and $200$. Your score will be $\min (12, S)$, where $S$ is the non-negative difference between $n$ and the largest number less than or equal to $n$ chosen by another team (if you choose the smallest number, $S = n$). For example, 1.414 is an acceptable answer, while $\sqrt2$ and $1.4142$ are not. [b]R6.27 / P6.27[/b] Guang is going hard on his YNA project. From $1:00$ AM Saturday to $1:00$ AM Sunday, the probability that he is not finished with his project $x$ hours after $1:00$ AM on Saturday is $\frac{1}{x+1}$ . If Guang does not finish by 1:00 AM on Sunday, he will stop procrastinating and finish the project immediately. Find the expected number of minutes $A$ it will take for him to finish his project. An estimate of $E$ will earn $12 \cdot 2^{-|E-A|/60}$ points. [b]R6.28 / P6.28[/b] All the diagonals of a regular $100$-gon (a regular polygon with $100$ sides) are drawn. Let $A$ be the number of distinct intersection points between all the diagonals. Find $A$. An estimate of $E$ will earn $12 \cdot \left(16 \log_{10}\left(\max \left(\frac{E}{A},\frac{A}{E}\right)\right)+ 1\right)^{-\frac12}$ or $0$ points if this expression is undefined. [b]R6.29 / P6.29 [/b]Find the smallest positive integer $A$ such that the following is true: if every integer $1, 2, ..., A$ is colored either red or blue, then no matter how they are colored, there are always 6 integers among them forming an increasing arithmetic progression that are all colored the same color. An estimate of $E$ will earn $12 min \left(\frac{E}{A},\frac{A}{E}\right)$ points or $0$ points if this expression is undefined. [b]R6.30 / P6.30[/b] For all integers $n \ge 2$, let $f(n)$ denote the smallest prime factor of $n$. Find $A =\sum^{10^6}_{n=2}f(n)$. In other words, take the smallest prime factor of every integer from $2$ to $10^6$ and sum them all up to get $A$. You may find the following values helpful: there are $78498$ primes below $10^6$, $9592$ primes below $10^5$, $1229$ primes below $10^4$, and $168$ primes below $10^3$. An estimate of $E$ will earn $\max \left(0, 12-4 \log_{10}(max \left(\frac{E}{A},\frac{A}{E}\right)\right)$ or $0$ points if this expression is undefined. PS. You should use hide for answers. R1-15 /P1-5 have been posted [url=https://artofproblemsolving.com/community/c3h2786721p24495629]here[/url], and P11-25 [url=https://artofproblemsolving.com/community/c3h2786880p24497350]here[/url]. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Let $p = 2017$ be a prime and $\mathbb{F}_p$ be the integers modulo $p$. A function $f: \mathbb{Z}\rightarrow\mathbb{F}_p$ is called [i]good[/i] if there is $\alpha\in\mathbb{F}_p$ with $\alpha\not\equiv 0\pmod{p}$ such that \[f(x)f(y) = f(x + y) + \alpha^y f(x - y)\pmod{p}\] for all $x, y\in\mathbb{Z}$. How many good functions are there that are periodic with minimal period $2016$? [i]Ashwin Sah[/i]