On a cellular plane with a cell side equal to $1$, arbitrarily $100 \times 100$ napkin is thrown. It covers some nodes (the node lying on the border of a napkin, is also considered covered). What is the smallest number of lines (going not necessarily along grid lines) you can certainly cover all these nodes?

There are $n$ boyfriend-girlfriend pairs at a party. Initially all the girls sit at a round table. For the first dance, each boy invites one of the girls to dance with.After each dance, a boy takes the girl he danced with to her seat, and for the next dance he invites the girl next to her in the counterclockwise direction. For which values of $n$ can the girls be selected in such a way that in every dance at least one boy danced with his girlfriend, assuming that there are no less than $n$ dances?

An ant begins at a vertex of a convex regular icosahedron (a figure with 20 triangular faces and 12 vertices). The ant moves along one edge at a time. Each time the ant reaches a vertex, it randomly chooses to next walk along any of the edges extending from that vertex (including the edge it just arrived from). Find the probability that after walking along exactly six (not necessarily distinct) edges, the ant finds itself at its starting vertex.

There are $n$ points in the plane, some of which are connected by segments. Some of the segments are colored in white, while the others are colored black in such a way that there exist a completely white as well as a completely black closed broken line of segments, each of them passing through every one of the $n$ points exactly once. It is known that the segments $AB$ and $BC$ are white. Prove that it is possible to recolor the segments in red and blue in such a way that $AB$ and $BC$ are recolored as red, [hide=not all of which segments are recolored red]meaning that recoloring every white as red and every black as blue is not acceptable[/hide], and that there exist a completely red as well as a completely blue closed broken line of segments, each of them passing through every one of the $n$ points exactly once.

Three faces of a tetrahedron are right triangles, while the fourth is not an obtuse triangle. [i](a) [/i]Prove that a necessary and sufficient condition for the fourth face to be a right triangle is that at some vertex exactly two angles are right. [i](b)[/i] Prove that if all the faces are right triangles, then the volume of the tetrahedron equals one -sixth the product of the three smallest edges not belonging to the same face.

In a triangle $ABC, D$ lies on $AB, E$ lies on $AC$ and $ \angle ABE = 30^o, \angle EBC = 50^o, \angle ACD = 20^o$, $\angle DCB = 60^o$. Find $\angle EDC$.

Prove that in a plane, arbitrary $ n$ points can be overlapped by discs that the sum of all the diameters is less than $ n$, and the distances between arbitrary two are greater than $ 1$. (where the distances between two discs that have no common points are defined as that the distances between its centers subtract the sum of its radii; the distances between two discs that have common points are zero)

Which fractions $ \dfrac{p}{q},$ where $p,q$ are positive integers $< 100$, is closest to $\sqrt{2} ?$ Find all digits after the point in decimal representation of that fraction which coincide with digits in decimal representation of $\sqrt{2}$ (without using any table).

Let $ABC$ be an acute triangle with circumcenter $O$ such that $AB=4$, $AC=5$, and $BC=6$. Let $D$ be the foot of the altitude from $A$ to $BC$, and $E$ be the intersection of $AO$ with $BC$. Suppose that $X$ is on $BC$ between $D$ and $E$ such that there is a point $Y$ on $AD$ satisfying $XY\parallel AO$ and $YO\perp AX$. Determine the length of $BX$.

Let the circle $\Omega$ and the line $\ell$ intersect at two different points $A{}$ and $B{}$. For different and non-points. Let $X$ and $T$ be points on $\ell$ and $Y$ and $Z$ be points on $\Omega$, all of them different from $A{}$ and $B{}$. Prove the following statements: [list=a] [*]The points $X,Y$ and $Z$ lie on the same line if and only if \[\frac{\overline{AX}}{\overline{BX}}=\pm\frac{AY}{BY}\cdot\frac{AZ}{BZ}.\] [*]The points $X,Y,Z$ and $T$ lie on the same circle if and only if \[\frac{\overline{AX}}{\overline{BX}}\cdot\frac{\overline{AT}}{\overline{BT}}=\pm\frac{AY}{BY}\cdot\frac{AZ}{BZ}.\] [/list] Note: In both points, the sign $+$ is selected in the right parts of the equalities if the points $Y{}$ and $Z{}$ lie on the same arc $AB$ of the circle $\Omega$, and the sign $-$ if $Y{}$ and $Z{}$ lie on different arcs $AB$. By $\overline{AX}/\overline{BX}$, we indicate the ratio of the lengths of $AX$ and $BX$, taken with the sign $+$ or $-$ depending on whether the $AX$ and $BX$ vectors are co-directed or oppositely directed. [i]Proposed by M. Skopenkov[/i]

Choose terms of the harmonic series so that the sum of the chosen terms be finite. Prove that the sequence of these terms is of density zero in the sequence $ 1,\frac12,\frac13,\dots,\frac1n,\dots$

For $n$ an odd positive integer, the unit squares of an $n\times n$ chessboard are coloured alternately black and white, with the four corners coloured black. A it tromino is an $L$-shape formed by three connected unit squares. For which values of $n$ is it possible to cover all the black squares with non-overlapping trominos? When it is possible, what is the minimum number of trominos needed?

The point $M$ varies on the segment $AB$ that measures $2$ m. a) Find the equation and the graphical representation of the locus of the points of the plane whose coordinates, $x$, and $y$, are, respectively, the areas of the squares of sides $AM$ and $MB$ . b) Find out what kind of curve it is. (Suggestion: make a $45^o$ axis rotation). c) Find the area of the enclosure between the curve obtained and the coordinate axes.

Compute \[\lim_{h\to 0}\dfrac{\sin(\frac{\pi}{3}+4h)-4\sin(\frac{\pi}{3}+3h)+6\sin(\frac{\pi}{3}+2h)-4\sin(\frac{\pi}{3}+h)+\sin(\frac{\pi}{3})}{h^4}.\]

Determine all polynomials $P (x)$ with real coefficients that apply $P (x^2) + 2P (x) = P (x)^2 + 2$.

Let $f: \mathbb{Z}_{>0} \rightarrow \mathbb{Z}$ be a function with the following properties: (i) $f(1) = 0$ (ii) $f(p) = 1$ for all prime numbers $p$ (iii) $f(xy) = y \cdot f(x) + x \cdot f(y)$ for all $x,y$ in $\mathbb{Z}_{>0}$ Determine the smallest integer $n \ge 2015$ that satisfies $f(n) = n$. (Gerhard J. Woeginger)

Suppose that $x^{10} + x + 1 = 0$ and $x^100 = a_0 + a_1x +... + a_9x^9$. Find $a_5$.

Let $P(x) = x^4 + a_1x^3 + a_2x^2 + a_3x + a_4$ be a polynomial with rational coefficients. Show that if $P(x)$ has exactly one real root $\xi$, then $\xi$ is a rational number.

If $x + y = 3$ and $x^2 + y^2 = 7$, compute $x^3 + y^3 + x^4 + y^4$.

Let $a_1, a_2, a_3$ be three distinct real numbers. Define $$\begin{cases} b_1=\left(1+\dfrac{a_1a_2}{a_1-a_2}\right)\left(1+\dfrac{a_1a_3}{a_1-a_3}\right) \\ \\ b_2=\left(1+\dfrac{a_2a_3}{a_2-a_3}\right)\left(1+\dfrac{a_2a_1}{a_2-a_1}\right) \\ \\ b_3=\left(1+\dfrac{a_3a_1}{a_3-a_1}\right)\left(1+\dfrac{a_3a_2}{a_3-a_2}\right) \end {cases}$$ Prove that $$1 + |a_1b_1+a_2b_2+a_3b_3| \le (1+|a_1|) (1+|a_2|)(1+|a_3|)$$ When does equality hold?

Find the sum of first two integers $n > 1$ such that $3^n$ is divisible by $n$ and $3^n - 1$ is divisible by $n - 1$.

We have some cards that have the same look, but at the back of some of them is written $0$ and for the others $1$.(We can't see the back of a card so we can't know what's the number on it's back). we have a machine. we give it two cards and it gives us the product of the numbers on the back of the cards. if we have $m$ cards with $0$ on their back and $n$ cards with $1$ on their back, at least how many times we must use the machine to be sure that we get the number $1$? (15 points)

Suppose 2017 points in a plane are given such that no three points are collinear. Among the triangles formed by any three of these 2017 points, those triangles having the largest area are said to be [i]good[/i]. Prove that there cannot be more than 2017 good triangles.

Suppose that $ 4^a \equal{} 5$, $ 5^b \equal{} 6$, $ 6^c \equal{} 7$, and $ 7^d \equal{} 8$. What is $ a\cdot b\cdot c\cdot d$? $ \textbf{(A)}\ 1\qquad \textbf{(B)}\ \frac{3}{2}\qquad \textbf{(C)}\ 2\qquad \textbf{(D)}\ \frac{5}{2}\qquad \textbf{(E)}\ 3$

Triangle $ABC$ has sides $AB=9,BC = 5\sqrt{3},$ and $AC=12$. Points $A=P_0, P_1, P_2, \dots, P_{2450} = B$ are on segment $\overline{AB}$ with $P_k$ between $P_{k-1}$ and $P_{k+1}$ for $k=1,2,\dots,2449$, and points $A=Q_0, Q_1, Q_2, \dots ,Q_{2450} = C$ for $k=1,2,\dots,2449$. Furthermore, each segment $\overline{P_kQ_k}, k=1,2,\dots,2449$, is parallel to $\overline{BC}$. The segments cut the triangle into $2450$ regions, consisting of $2449$ trapezoids and $1$ triangle. Each of the $2450$ regions have the same area. Find the number of segments $\overline{P_kQ_k}, k=1,2 ,\dots,2450$, that have rational length.