$n$ balls are placed independently uniformly at random into $n$ boxes. One box is selected at random, and is found to contain $b$ balls. Let $e_n$ be the expected value of $b^4$. Find $$\lim_{n \to \infty}e_n.$$

Find the remainder when $2^{2019}$ is divided by $7$.

Two players play the following game. The first player starts by writing either $0$ or $1$ and then, on his every move, chooses either $0$ or $1$ and writes it to the right of the existing digits until there are $1999$ digits. Each time the first player puts down a digit (except the first one) , the second player chooses two digits among those already written and swaps them. Can the second player guarantee that after his last move the line of digits will be symmetrical about the middle digit? (I Izmestiev)

For positive intenger $n$, define $f(n)$: the smallest positive intenger that does not divide $n$. Consider sequence $(a_n): a_1=a_2=1, a_n=a_{f(n)}+1(n\geq3)$. For example, $a_3=a_2+1=2,a_4=a_3+1=3$. [b](a)[/b] Prove that there exists a positive intenger $C$, for any positive intenger $n$, $a_n\leq C$. [b](b)[/b] Are there positive intengers $M$ and $T$, satisfying that for any positive intenger $n\geq M$, $a_n=a_{n+T}$.

An acute angle with the vertex $O$ and the rays $Op_1$ and $Op_2$ is given in a plane. Let $k_1$ be a circle with the center on $Op_1$ which is tangent to $Op_2$. Let $k_2$ be the circle that is tangent to both rays $Op_1$ and $Op_2$ and to the circle $k_1$ from outside. Find the locus of tangency points of $k_1$ and $k_2$ when center of $k_1$ moves along the ray $Op_1$.

Some checkers placed on an $n \times n$ checkerboard satisfy the following conditions: (a) every square that does not contain a checker shares a side with one that does; (b) given any pair of squares that contain checkers, there is a sequence of squares containing checkers, starting and ending with the given squares, such that every two consecutive squares of the sequence share a side. Prove that at least $(n^{2}-2)/3$ checkers have been placed on the board.

A pawn is a chess piece which attacks the two squares diagonally in front if it. What is the maximum number of pawns which can be placed on an $n \times n$ chessboard such that no two pawns attack each other?

Function $f : \mathbb{R^+} \rightarrow \mathbb{R^+}$ satisfies the following condition. (Condition) For each positive real number $x$, there exists a positive real number $y$ such that $(x + f(y))(y + f(x)) \leq 4$, and the number of $y$ is finite. Prove $f(x) > f(y)$ for any positive real numbers $x < y$. ($\mathbb{R^+}$ is a set for all positive real numbers.)

Let $n \geq 3$ be an odd number and suppose that each square in a $n \times n$ chessboard is colored either black or white. Two squares are considered adjacent if they are of the same color and share a common vertex and two squares $a,b$ are considered connected if there exists a sequence of squares $c_1,\ldots,c_k$ with $c_1 = a, c_k = b$ such that $c_i, c_{i+1}$ are adjacent for $i=1,2,\ldots,k-1$. \\ \\ Find the maximal number $M$ such that there exists a coloring admitting $M$ pairwise disconnected squares.

For the several values of the parameter $m\in \mathbb{N^{*}}$,find the pairs of integers $(a,b)$ that satisfy the relation $\ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \frac{[a,m]+[b,m]}{(a+b)m}=\frac{10}{11}$, and,moreover,on the Cartesian plane $Oxy$ the lie in the square $D=\{(x,y):1\leq x\leq 36,1\leq y\leq 36\}$. [i][u]Note:[/u]$[k,l]$ denotes the least common multiple of the positive integers $k,l$.[/i]

Prove that the number of nilpotent elements of a commutative ring with an order greater than $ 8 $ and congruent to $ 3 $ modulo $ 6 $ is at most a third of the order of the ring.

Real numbers $a, b, c$ are such that $$a^2+c-bc = b^2+a-ca = c^2+b-ab$$ Does it follow that $a=b=c$? [i]Proposed by Mykhailo Shtandenko[/i]

Given a positive integer $c$, we construct a sequence of fractions $a_1, a_2, a_3,...$ as follows: $\bullet$ $a_1 =\frac{c}{c+1} $ $\bullet$ to get $a_n$, we take $a_{n-1}$ (in its most simplified form, with both the numerator and denominator chosen to be positive) and we add $2$ to the numerator and $3$ to the denominator. Then we simplify the result again as much as possible, with positive numerator and denominator. For example, if we take $c = 20$, then $a_1 =\frac{20}{21}$ and $a_2 =\frac{22}{24} = \frac{11}{12}$ . Then we find that $a_3 =\frac{13}{15}$ (which is already simplified) and $a_4 =\frac{15}{18} =\frac{5}{6}$. (a) Let $c = 10$, hence $a_1 =\frac{10}{11}$ . Determine the largest $n$ for which a simplification is needed in the construction of $a_n$. (b) Let $c = 99$, hence $a_1 =\frac{99}{100}$ . Determine whether a simplification is needed somewhere in the sequence. (c) Find two values of $c$ for which in the first step of the construction of $a_5$ (before simplification) the numerator and denominator are divisible by $5$.

Let $a,b,c,d$ be the areas of the triangular faces of a tetrahedron, and let $h_a, h_b, h_c, h_d$ be the corresponding altitudes of the tetrahedron. If $V$ denotes the volume of tetrahedron, prove that \[ (a+b+c+d)(h_a+h_b+h_c+h_d) \geq 48V \]

Find all values of the parameter $a$ for which the inequality \[\sqrt{x-x^2-a}+\sqrt{6a-2x-x^2}\leq \sqrt{10a-2x-4x^2}\] has a unique solution.

Let $ABC$ be a triangle with incenter $I$. The line through $I$, perpendicular to $AI$, intersects the circumcircle of $ABC$ at points $P$ and $Q$. It turns out there exists a point $T$ on the side $BC$ such that $AB + BT = AC + CT$ and $AT^2 = AB \cdot AC$. Determine all possible values of the ratio $IP/IQ$.

[b]9.[/b] Let $X_0, X_1, \dots $ be independent, indentically distributed, nondegenerate random variables, and let $0<\alpha <1$ be a real number. Assume that the series $\sum_{k=1}^{\infty} \alpha^{k} X_k$ is convergent with probability one. Prove that the distribution function of the sum is continuous. ([b]P. 23[/b]) [T. F. Móri]

Let $n,k$ be given natural numbers. Find the smallest possible cardinality of a set $A$ with the following property: There exist subsets $A_1,A_2,\ldots,A_n$ of $A$ such that the union of any $k$ of them is $A$, but the union of any $k-1$ of them is never $A$.

For which real numbers $a$ is the set of all solutions of the inequality $$(x^2 + ax + 4)(x^2 - 5x + 6) < 0$$ an interval?

Given $ 12$ points in a plane no three of which are collinear, the number of lines they determine is: $ \textbf{(A)}\ 24 \qquad\textbf{(B)}\ 54 \qquad\textbf{(C)}\ 120 \qquad\textbf{(D)}\ 66 \qquad\textbf{(E)}\ \text{none of these}$

An $8\times8$ chessboard is completely tiled by $2\times1$ dominoes. Prove that we can place positive integers in all cells of the table in such a way that the sums of numbers in every domino are equal and the numbers placed in two adjacent cells are coprime if and only if they belong to the same domino. (Two cells are called adjacent if they have a common side.) Well this can belong to number theory as well...

Find all natural numbers $m$ and $n$ such that $3^m+n!-1$ is the square of a natural number.

Alice and Bob play the following "point guessing game." First, Alice marks an equilateral triangle $ABC$ and a point $D$ on segment $BC$ satisfying $BD=3$ and $CD=5$. Then, Alice chooses a point $P$ on line $AD$ and challenges Bob to mark a point $Q\neq P$ on line $AD$ such that $\frac{BQ}{QC}=\frac{BP}{PC}$. Alice wins if and only if Bob is unable to choose such a point. If Alice wins, what are the possible values of $\frac{BP}{PC}$ for the $P$ she chose?

A set of five-digit numbers $\{N_1, ...,N_k\}$ is such that any five-digit number, all of whose digits are in non-decreasing order, coincides in at least one digit with at least one of the numbers $N_1$, $...$ , $N_k$. Find the smallest possible value of $k$.

Given a chord $PQ$ of a circle and $M$ the midpoint of the chord, let $AB$ and $CD$ be two chords that pass through $M$. $AC$ and $BD$ are drawn until $PQ$ is intersected at points $X$ and $Y$ respectively. Show that $X$ and $Y$ are equidistant from $M$.