Convex quadrilateral $ ABCD$ is inscribed in a circle, $ \angle{A}\equal{}60^o$, $ BC\equal{}CD\equal{}1$, rays $ AB$ and $ DC$ intersect at point $ E$, rays $ BC$ and $ AD$ intersect each other at point $ F$. It is given that the perimeters of triangle $ BCE$ and triangle $ CDF$ are both integers. Find the perimeter of quadrilateral $ ABCD$.

The infinite sequence of 2's and 3's \[\begin{array}{l}2,3,3,2,3,3,3,2,3,3,3,2,3,3,2,3,3, \\ 3,2,3,3,3,2,3,3,3,2,3,3,2,3,3,3,2,\cdots \end{array}\] has the property that, if one forms a second sequence that records the number of 3's between successive 2's, the result is identical to the given sequence. Show that there exists a real number $r$ such that, for any $n$, the $n$th term of the sequence is 2 if and only if $n = 1+\lfloor rm \rfloor$ for some nonnegative integer $m$.

(a) Find the numbers $a_0,. . . , a_{100}$, such that $a_0 = 0, a_{100} = 1$ and for all $k = 1,. . . , 99$ : $$a_k = \frac12 a_{k- 1} + \frac12 a_{k+1 }$$ (b) Find the numbers $a_0,. . . , a_{100}$, such that $a_0 = 0, a_{100} = 1$ and for all $k = 1,. . . , 99$ : $$a_k = 1+\frac12 a_{k- 1} + \frac12 a_{k+1 }$$.

$f: \mathbb R^{n}\longrightarrow\mathbb R^{n}$ is a bijective map, that Image of every $n-1$-dimensional affine space is a $n-1$-dimensional affine space. 1) Prove that Image of every line is a line. 2) Prove that $f$ is an affine map. (i.e. $f=goh$ that $g$ is a translation and $h$ is a linear map.)

In a permutation $(x_1, x_2, \dots , x_n)$ of the set $1, 2, \dots , n$ we call a pair $(x_i, x_j )$ discordant if $i < j$ and $x_i > x_j$. Let $d(n, k)$ be the number of such permutations with exactly $k$ discordant pairs. Find $d(n, 2)$ and $d(n, 3).$

The points $D,E$ and $F$ are chosen on the sides $BC,AC$ and $AB$ of triangle $ABC$, respectively. Prove that triangles $ABC$ and $DEF$ have the same centroid if and only if \[\frac{BD}{DC} = \frac{CE}{EA}=\frac{AF}{FB}\]

Let $\vartriangle ABC$ have sidelengths $BC = 7$, $CA = 8$, and, $AB = 9$, and let $\Omega$ denote the circumcircle of $\vartriangle ABC$. Let circles $\omega_A$, $\omega_B$, $\omega_C$ be internally tangent to the minor arcs $BC$, $CA$, $AB$ of $\Omega$, respectively, and tangent to the segments $BC$, $CA$, $AB$ at points $X$, $Y$, and, $Z$, respectively. Suppose that $\frac{BX}{XC} = \frac{CY}{Y A} = \frac{AZ}{ZB} = \frac12$ . Let $t_{AB}$ be the length of the common external tangent of $\omega_A$ and $\omega_B$, let $t_{BC}$ be the length of the common external tangent of $\omega_B$ and $\omega_C$, and let $t_{CA}$ be the length of the common external tangent of $\omega_C$ and $\omega_A$. If $t_{AB} + t_{BC} + t_{CA}$ can be expressed as $\frac{m}{n}$ for relatively prime positive integers $m, n$, find $m + n$.

All the chairs in a classroom are arranged in a square $n\times n$ array (in other words, $n$ columns and $n$ rows), and every chair is occupied by a student. The teacher decides to rearrange the students according to the following two rules: (a) Every student must move to a new chair. (b) A student can only move to an adjacent chair in the same row or to an adjacent chair in the same column. In other words, each student can move only one chair horizontally or vertically. (Note that the rules above allow two students in adjacent chairs to exchange places.) Show that this procedure can be done if $n$ is even, and cannot be done if $n$ is odd.

Let $a, b,c$ and $d$ be rea] numbers such that $a^2 + b^2 = c^2 + d^2 = 1$ and $ac + bd = 0$. Determine the value of $ab + cd$.

Prove the following: a) If $ABCA'B'C'$ is a right prism and $M \in (BC), N \in (CA), P \in (AB)$ such that $A'M, B'N$ and $C'P$ are perpendicular each other and concurrent, then the prism $ABCA'B'C'$ is regular. b) If $ABCA'B'C'$ is a regular prism and $\frac{AA'}{AB}=\frac{\sqrt6}{4}$ , then there are $M \in (BC), N \in (CA), P \in (AB)$ so that the lines $A'M, B'N$ and $C'P$ are perpendicular each other and concurrent.

How many positive integers less than $1000$ are there such that they cannot be written as sum of $2$ or more successive positive integers? $ \textbf{(A)}\ 6 \qquad\textbf{(B)}\ 10 \qquad\textbf{(C)}\ 26 \qquad\textbf{(D)}\ 68 \qquad\textbf{(E)}\ 72 $

We want to arrange $7$ students to attend $5$ sports events, but students $A$ and $B$ can't take part in the same event, every event has its own participants, and every student can only attend one event. How many arrangements are there?

Find the value of $n$ such that $\frac{2019 + n}{2019 - n}= 5$

Determine all $n$ for which the system with of equations can be solved in $\mathbb{R}$: \[\sum^{n}_{k=1} x_k = 27\] and \[\prod^{n}_{k=1} x_k = \left( \frac{3}{2} \right)^{24}.\]

Let $n\geq 2$ be an integer and consider an array composed of $n$ rows and $2n$ columns. Half of the elements in the array are colored in red. Prove that for each integer $k$, $1<k\leq \dsp \left\lfloor \frac n2\right\rfloor+1$, there exist $k$ rows such that the array of size $k\times 2n$ formed with these $k$ rows has at least \[ \frac { k! (n-2k+2) } {(n-k+1)(n-k+2)\cdots (n-1)} \] columns which contain only red cells.

Let $m>1$ and $n>1$ be integers. Suppose that the product of the solutions for $x$ of the equation \[8(\log_n x)(\log_m x) - 7 \log_n x - 6 \log_m x - 2013 = 0\] is the smallest possible integer. What is $m+n$? ${ \textbf{(A)}\ 12\qquad\textbf{(B)}\ 20\qquad\textbf{(C)}\ 24\qquad\textbf{(D}}\ 48\qquad\textbf{(E)}\ 272 $

Compute \[\sum_{n=1}^\infty \dfrac{1}{n\cdot(n+1)\cdot(n+1)!}.\]

Given a triangle $ABC.$ The incircle $(I)$ of $\triangle ABC$ touch the sides $CA,AB$ at $E,F.$ A point $P$ moving on the segment $EF$. The line $PB$ intersects $CA$ at $M$; the line $MI$ intersects the line passing through $C$ and perpendicular to $AC$ at $N.$ Prove that: if $P$ is moving, the line passing through $N$ and perpendicular to $PC$ always passes a fixed point.

Let $ n>1$ be an odd integer and define: \[ N\equal{}\{\minus{}n,\minus{}(n\minus{}1),\dots,\minus{}1,0,1,\dots,(n\minus{}1),n\}.\] A subset $ P$ of $ N$ is called [i]basis[/i] if we can express every element of $ N$ as the sum of $ n$ different elements of $ P$. Find the smallest positive integer $ k$ such that every $ k\minus{}$elements subset of $ N$ is basis.

Prove that for all $a, b$ and $x_0$ positive integers, in the sequence $x_1, x_2, x_3, \cdots$ defined by $$x_{n+1}=ax_n+b, n\geq 0$$ Exist an $x_i$ that is not prime for some $i\geq 1$

Let $AXYZB$ be a convex pentagon inscribed in a semicircle of diameter $AB$. Denote by $P$, $Q$, $R$, $S$ the feet of the perpendiculars from $Y$ onto lines $AX$, $BX$, $AZ$, $BZ$, respectively. Prove that the acute angle formed by lines $PQ$ and $RS$ is half the size of $\angle XOZ$, where $O$ is the midpoint of segment $AB$.

Jason rolls three fair standard six-sided dice. Then he looks at the rolls and chooses a subset of the dice (possibly empty, possibly all three dice) to reroll. After rerolling, he wins if and only if the sum of the numbers face up on the three dice is exactly $7$. Jason always plays to optimize his chances of winning. What is the probability that he chooses to reroll exactly two of the dice? $\textbf{(A) } \frac{7}{36} \qquad\textbf{(B) } \frac{5}{24} \qquad\textbf{(C) } \frac{2}{9} \qquad\textbf{(D) } \frac{17}{72} \qquad\textbf{(E) } \frac{1}{4}$

$64$ numbers (not necessarily distinct) are placed on the squares of a chessboard such that the sum of the numbers in every $2\times2$ square is $7$. What is the sum of the four numbers in the corners of the board?

Let $x_1,\cdots, x_n$ be nonzero vectors of a vector space $V$ and $\varphi:V\to V$ be a linear transformation such that $\varphi x_1 = x_1$, $\varphi x_k = x_k - x_{k-1}$ for $k = 2, 3,\ldots,n$. Prove that the vectors $x_1,\ldots,x_n$ are linearly independent.

(a) Two players take turns taking $1, 2$ or $3$ stones at random from a given set of $3$ piles, in which initially on $11, 22$ and $33$ stones. If after the move of one of the players in any two groups the same number of stones will remain, this player has won. Who will win with the right game of both players? (b) Two players take turns taking $1$ or $2$ stones from one pile, randomly selected from a given set of $3$ ordered piles, in which at first $100, 200$ and $300$ stones, in order from left to right. Additionally it is forbidden to make a course at which, for some pair of the next handfuls, quantity of stones in the left will be more than the number of stones in the right. If after the move of one of the players of the stones in handfuls will not remain, then this player won. Who will win with the right game of both players? [hide=original wording] 1. Два гравця по черзi беруть 1, 2 чи 3 камiнця довiльним чином з заданого набору з 3 купок, в яких спочатку по 11, 22 i 33 камiнцiв. Якщо пiсля хода одного з гравцiв в якихось двух купках залишиться однакова кiлькiсть камiнцiв, то цей гравець виграв. Хто виграє при правильнiй грi обох гравцiв? 2. Два гравця по черзi беруть 1 чи 2 камiнця з одної купки, довiльної вибраної з заданого набору з 3 впорядкованих купок, в яких спочатку по 100, 200 i 300 камiнцiв, в порядку злiва направо. Додатково забороняется робити ход при якому, для деякої пари сусiднiх купок, кiлькiсть камiнцiв в лiвiй стане бiльше нiж кiлькiсть камiнцiв в правiй. Якщо пiсля ходу одного з гравцiв камiнцiв в купках не залишиться, то цей гравець виграв. Хто виграє при правильнiй грi обох гравцiв?[/hide]