You have a pencil, paper and an angle of $19$ degrees made out of two equal very thin sticks. Can you construct an angle of $1$ degree using only these tools?

Let $ G $ be a countably infinite, $ d $ -regular, connected, vertex-transitive graph. Show that there is a complete pairing in $ G $.

The siblings Robb, Arya and Sansa have received seven sealed bags from an unknown donor with varying number of beads. Six of the bags have labels indicating the number beads: $7, 9, 11, 13, 15, 18$, but the seventh bag lacks etiquette. The sensor has set certain requirements: Robb must have three bags and his sisters two bags each. In addition, Arya will have the bag that contains $7$ beads. The bags should be distributed so that each of the siblings get the same number of pearls (this is possible according to the donor). How many pearls are there in the bag without a label, how many pearls are there in total and how should the bags be distributed?

Suppose $S=\{1,2,3,...,2017\}$,for every subset $A$ of $S$,define a real number $f(A)\geq 0$ such that: $(1)$ For any $A,B\subset S$,$f(A\cup B)+f(A\cap B)\leq f(A)+f(B)$; $(2)$ For any $A\subset B\subset S$, $f(A)\leq f(B)$; $(3)$ For any $k,j\in S$,$$f(\{1,2,\ldots,k+1\})\geq f(\{1,2,\ldots,k\}\cup \{j\});$$ $(4)$ For the empty set $\varnothing$, $f(\varnothing)=0$. Confirm that for any three-element subset $T$ of $S$,the inequality $$f(T)\leq \frac{27}{19}f(\{1,2,3\})$$ holds.

[i]Version 1[/i]. Let $n$ be a positive integer, and set $N=2^{n}$. Determine the smallest real number $a_{n}$ such that, for all real $x$, \[ \sqrt[N]{\frac{x^{2 N}+1}{2}} \leqslant a_{n}(x-1)^{2}+x . \] [i]Version 2[/i]. For every positive integer $N$, determine the smallest real number $b_{N}$ such that, for all real $x$, \[ \sqrt[N]{\frac{x^{2 N}+1}{2}} \leqslant b_{N}(x-1)^{2}+x . \]

In the $[ABCD]$ tetrahedron having all the faces acute angled triangles, is denoted by $r_X$, $R_X$ the radius lengths of the circle inscribed and circumscribed respectively on the face opposite to the $X \in \{A,B,C,D\}$ peak, and with $R$ the length of the radius of the sphere circumscribed to the tetrahedron. Show that inequality occurs$$8R^2 \geq (r_A + R_A)^2 + (r_B + R_B)^2 + (r_C + R_C)^2 + (r_D + R_D)^2$$

We are given a triangle $ABC$ and three rectangles $R_1,R_2,R_3$ with sides parallel to two fixed perpendicular directions and such that their union covers the sides $AB,BC$, and $CA$; i.e., each point on the perimeter of $ABC$ is contained in or on at least one of the rectangles. Prove that all points inside the triangle are also covered by the union of $R_1,R_2,R_3.$

Find the integer part of $ \frac{1}{\sqrt1}+\frac{1}{\sqrt2}+\frac{1}{\sqrt3}+...+\frac{1}{\sqrt{1000}} $

Let $ABCD$ be a convex quadrilateral with $AB$ is not parallel to $CD$ Circle $\Gamma_{1}$ with center $O_1$ passes through $A$ and $B$, and touches segment $CD$ at $P$. Circle $\Gamma_{2}$ with center $O_2$ passes through $C$ and $D$, and touches segment $AB$ at $Q$. Let $E$ and $F$ be the intersection of circles $\Gamma_{1}$ and $\Gamma_{2}$. Prove that $EF$ bisects segment $PQ$ if and only if $BC$ is parallel to $AD$.

Find $A^2$, where $A$ is the sum of the absolute values of all roots of the following equation: \begin{eqnarray*}x &=& \sqrt{19} + \frac{91}{{\displaystyle \sqrt{19}+\frac{91}{{\displaystyle \sqrt{19}+\frac{91}{{\displaystyle \sqrt{19}+\frac{91}{{\displaystyle \sqrt{19}+\frac{91}{x}}}}}}}}}\end{eqnarray*}

Andover has a special weather forecast this week. On Monday, there is a $\frac{1}{2}$ chance of rain. On Tuesday, there is a $\frac{1}{3}$ chance of rain. This pattern continues all the way to Sunday, when there is a $\frac{1}{8}$ chance of rain. The probability that it doesn't rain in Andover all week can be expressed as $\frac{m}{n}$ for relatively prime positive integers $m$ and $n$. Compute $m+n$. [i]Proposed by Nathan Xiong[/i]

Let $m$ positive integers $a_1, \dots , a_m$ be given. Prove that there exist fewer than $2^m$ positive integers $b_1, \dots , b_n$ such that all sums of distinct $b_k$’s are distinct and all $a_i \ (i \leq m)$ occur among them.

Find unknown digits $a$ and $b$ such that number $\overline{a783b}$ is divisible with $56$

[b]p1.[/b] Three camps are located in the vertices of an equilateral triangle. The roads connecting camps are along the sides of the triangle. Captain America is inside the triangle and he needs to know the distances between camps. Being able to see the roads he has found that the sum of the shortest distances from his location to the roads is 50 miles. Can you help Captain America to evaluate the distances between the camps? [b]p2.[/b] $N$ regions are located in the plane, every pair of them have a non-empty overlap. Each region is a connected set, that means every two points inside the region can be connected by a curve all points of which belong to the region. Iron Man has one charge remaining to make a laser shot. Is it possible for him to make the shot that goes through all $N$ regions? [b]p3.[/b] Money in Wonderland comes in $\$5$ and $\$7$ bills. (a) What is the smallest amount of money you need to buy a slice of pizza that costs $\$1$ and get back your change in full? (The pizza man has plenty of $\$5$ and $\$7$ bills.) For example, having $\$7$ won't do since the pizza man can only give you $\$5$ back. (b) Vending machines in Wonderland accept only exact payment (do not give back change). List all positive integer numbers which CANNOT be used as prices in such vending machines. (That is, find the sums of money that cannot be paid by exact change.) [b]p4.[/b] (a) Put $5$ points on the plane so that each $3$ of them are vertices of an isosceles triangle (i.e., a triangle with two equal sides), and no three points lie on the same line. (b) Do the same with $6$ points. [b]p5.[/b] Numbers $1,2,3,…,100$ are randomly divided in two groups $50$ numbers in each. In the first group the numbers are written in increasing order and denoted $a_1,a_2, ..., a_{50}$. In the second group the numberss are written in decreasing order and denoted $b_1,b_2, ..., b_{50}$. Thus $a_1<a_2<...<a_{50}$ and $ b_1>b_2>...>b_{50}$. Evaluate $|a_1-b_1|+|a_2-b_2|+...+|a_{50}-b_{50}|$. PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Solve the equation $\sqrt{x} = \log_2 x$.

$30$ segments of lengths$$1,\quad \sqrt{3},\quad \sqrt{5},\quad \sqrt{7},\quad \sqrt{9},\quad \ldots ,\quad \sqrt{59} $$ have been drawn on a blackboard. In each step, two of the segments are deleted and a new segment of length equal to the hypotenuse of the right triangle with legs equal to the two deleted segments is drawn. After $29$ steps only one segment remains. Find the possible values of its length.

In a right-angled triangle in which all side lengths are integers, one has a cathetus length $1994$. Determine the length of the hypotenuse.

Consider a convex quadrilateral \(ABCD\) with \(AC > BD\). In the plane of this quadrilateral, points \(M\) and \(N\) are chosen such that triangles \(ABM\) and \(CDN\) are equilateral, and segments \(MD\) and \(NA\) intersect lines \(AB\) and \(CD\) respectively. Similarly, points \(P\) and \(Q\) are chosen such that triangles \(ADP\) and \(BCQ\) are equilateral, but here segments \(PB\) and \(QA\) do not intersect lines \(AD\) and \(BC\) respectively. Prove that \(MN = AC + BD\) if and only if \(PQ = AC - BD\). [i]Proposed by Zaza Meliqidze, Georgia [/i]

Let $ABC$ be a right triangle with hypotenuse $AB$. Point $E$ is on $AB$ with $AE = 10BE$, and point $D$ is outside triangle $ABC$ such that $DC = DB$ and $\angle CDA = \angle BDE$. Let $[ABC]$ and $[BCD]$ denote the areas of triangles $ABC$ and $BCD$. Determine the value of $\frac{[BCD]}{[ABC]}$.

Determine all functions $f:\mathbb{R} \to \mathbb{R}$ such that \[ f(xy+f(x)) + f(y) = xf(y) + f(x+y) \] for all real numbers $x$ and $y$.

Suppose $a$ and $b$ are two variables that satisfy $\textstyle\int_0^2(-ax^2+b)dx=0$. What is $\tfrac{a}{b}$?

Orvin went to the store with just enough money to buy $30$ balloons. When he arrived, he discovered that the store had a special sale on balloons: buy $1$ balloon at the regular price and get a second at $\frac{1}{3}$ off the regular price. What is the greatest number of balloons Orvin could buy? $ \textbf {(A) } 33 \qquad \textbf {(B) } 34 \qquad \textbf {(C) } 36 \qquad \textbf {(D) } 38 \qquad \textbf {(E) } 39$

Let $ABC$ be an acute triangle and $D$ a point on the side $BC$ such that $\angle BAD = \angle DAC$. The circumcircles of the triangles $ABD$ and $ACD$ intersect the segments $AC$ and $AB$ at $E$ and $F$, respectively. The internal bisectors of $\angle BDF$ and $\angle CDE$ intersect the sides $AB$ and $AC$ at $P$ and $Q$, respectively. Points $X$ and $Y$ are chosen on the side $BC$ such that $PX$ is parallel to $AC$ and $QY$ is parallel to $AB$. Finally, let $Z$ be the point of intersection of $BE$ and $CF$. Prove that $ZX = ZY$.

Let $\alpha, \beta$ be two rational numbers strictly between 0 and 1. Alice and Bob play a game. At the start of the game, Alice chooses a positive integer $n$. Knowing that, Bob then chooses a positive integer $T$. They then do the following for $T$ rounds: at the $i$th round, Bob chooses a set $X_i$ of $n$ positive integers that form a complete residue system modulo $n$. Then Alice chooses a subset $Y_i$ of $X_i$ such that the sum of elements in $Y_i$ is at most $\alpha$ times the sum of elements in $X_i$. After the $T$ rounds, Alice wins if it is possible to pick an integer $s$ between 0 and $n-1$ such that there are at least $\beta T$ positive integers among the elements in $Y_1, Y_2, . . . , Y_T$ (counted with multiplicities) that are equal to $s \pmod n$, and Bob wins otherwise. Find all pairs $(\alpha, \beta)$ of rational numbers strictly between 0 and 1 such that Alice has a winning strategy. [i]Proposed by Hans[/i]

Let $ a_1$, $ a_2$, $ \ldots$, $ a_n$ be distinct positive integers, $ n\ge 3$. Prove that there exist distinct indices $ i$ and $ j$ such that $ a_i \plus{} a_j$ does not divide any of the numbers $ 3a_1$, $ 3a_2$, $ \ldots$, $ 3a_n$. [i]Proposed by Mohsen Jamaali, Iran[/i]