Is there a number in the decimal notation of the square which has a sequence of digits "$2018$"?

How many pairs of integers $(a,b)$ are there such that $0\leq a < b \leq 100$ and such that $\tfrac{2^b-2^a}{2016}$ is an integer?

Find all positive integers $n\geq1$ such that there exists a pair $(a,b)$ of positive integers, such that $a^2+b+3$ is not divisible by the cube of any prime, and $$n=\frac{ab+3b+8}{a^2+b+3}.$$

If $ x < 0$, then which of the following must be positive? $ \textbf{(A)}\ \frac{x}{|x|}\qquad \textbf{(B)}\ \minus{}x^2\qquad \textbf{(C)}\ \minus{}2^x\qquad \textbf{(D)}\ \minus{}x^{\minus{}1}\qquad \textbf{(E)}\ \sqrt[3]{x}$

(1) Evaluate $ \int_0^{\frac{\pi}{2}} (x\cos x\plus{}\sin ^ 2 x)\sin x\ dx$. (2) For $ f(x)\equal{}\int_0^x e^t\sin (x\minus{}t)\ dt$, find $ f''(x)\plus{}f(x)$.

Determine the real values of $x$ such that the triangle with sides $5$, $8$, and $x$ is obtuse.

Let $A'$ and $B'$ be feet of altitudes from $A$ and $B$, respectively, in acute-angled triangle $ABC$ ($AC\not = BC$). Circle $k$ contains points $A'$ and $B'$ and touches segment $AB$ in $D$. If triangles $ADA'$ and $BDB'$ have the same area, prove that \[\angle A'DB'= \angle ACB.\]

In a triangle $ABC, L$ and $K$ are the points of intersections of the angle bisectors of $\angle ABC$ and $\angle BAC$ with the segments $AC$ and $BC$, respectively. The segment $KL$ is angle bisector of $\angle AKC$, determine $\angle BAC$.

Given is $\triangle ABC$ such that $\angle A = 57^o, \angle B = 61^o$ and $\angle C = 62^o$. Which segment is longer: the angle bisector through $A$ or the median through $B$? (N.Beluhov)

Evaluate $ \int_0^1 \frac{x\minus{}e^{2x}}{x^2\minus{}e^{2x}}dx$.

Find the triangle of the least area which can cover any triangle with sides not exceeding $1$.

Players $A$ and $B$ play a "paintful" game on the real line. Player $A$ has a pot of paint with four units of black ink. A quantity $p$ of this ink suffices to blacken a (closed) real interval of length $p$. In every round, player $A$ picks some positive integer $m$ and provides $1/2^m $ units of ink from the pot. Player $B$ then picks an integer $k$ and blackens the interval from $k/2^m$ to $(k+1)/2^m$ (some parts of this interval may have been blackened before). The goal of player $A$ is to reach a situation where the pot is empty and the interval $[0,1]$ is not completely blackened. Decide whether there exists a strategy for player $A$ to win in a finite number of moves.

William is thinking of an integer between 1 and 50, inclusive. Victor can choose a positive integer $m$ and ask William: "does $m$ divide your number?", to which William must answer truthfully. Victor continues asking these questions until he determines William's number. What is the minimum number of questions that Victor needs to guarantee this?

Yuri and Vlad are playing a game on the table $4 \times 100$. Firstly, Yuri chooses $73$ squares $2 \times 2$ (squares can intersect, but cannot be equal). Then Vlad colours the cells of the table in $4$ colours such that in any row and in any column, and in any square chosen by Yuri, there were cells of all 4 colours. After that Vlad pays 2 rubles for every square $2 \times 2$, not chosen by Yuri, which cells of all 4 colours. What is the maximum possible number of rubles Yuri can get regardless of Vlad's actions [i]M. Shutro[/i]

Find the maximal possible $n$, where $A_1, \dots, A_n \subseteq \{1, 2, \dots, 2016\}$ satisfy the following properties. - For each $1 \le i \le n$, $\lvert A_i \rvert = 4$. - For each $1 \le i < j \le n$, $\lvert A_i \cap A_j \rvert$ is even.

A lightly damaged rook moves around on a $m \times n$ chessboard by taking turns moves to a horizontal or vertical field. For which $m$ and $n$, is it possible for him to have visited each field exactly once? The starting field counts as visited, squares skipped during a move, however, are not.

A "domino" is made up of two small squares: [asy] unitsize(10); draw((0,0) -- (2,0) -- (2,1) -- (0,1) -- cycle); fill((0,0) -- (1,0) -- (1,1) -- (0,1) -- cycle); [/asy] Which of the "checkerboards" illustrated below CANNOT be covered exactly and completely by a whole number of non-overlapping dominoes? [diagram requires in-line asy]

Let $f, g:\mathbb{N}\to\mathbb{N}$ be functions that satisfy the following equation: \[f(f(n))+g(f(n)) = n,\ \forall\ n\in\mathbb{N}\ .\] Prove that $g$ is the zero function on $\mathbb{N}$.

Let $n$ be a positive integer. A \emph{pseudo-Gangnam Style} is a dance competition between players $A$ and $B$. At time $0$, both players face to the north. For every $k\ge 1$, at time $2k-1$, player $A$ can either choose to stay stationary, or turn $90^{\circ}$ clockwise, and player $B$ is forced to follow him; at time $2k$, player $B$ can either choose to stay stationary, or turn $90^{\circ}$ clockwise, and player $A$ is forced to follow him. After time $n$, the music stops and the competition is over. If the final position of both players is north or east, $A$ wins. If the final position of both players is south or west, $B$ wins. Determine who has a winning strategy when: (a) $n=2013^{2012}$ (b) $n=2013^{2013}$

Let $\xi_1 , \xi_2 , ...$ be a series of independent, zero-expected-value random variables for which $\lim_{n\to\infty} E(\xi_n ^ 2) = 0$, and $S_n = \sum_{j = 1}^n \xi_j$ . Denote by I(A) the indicator function of event A. Prove that $$\frac{1}{\log n} \sum_{k = 1}^n \frac1k I\bigg(\max_{1\leq j\leq k} |S_j|>\sqrt k\bigg) \to 0$$ with probability 1 if $n\to\infty$ .

Michael plays catcher for his school's baseball team. He has always been a great player behind the plate, but this year as a junior, Michael's offense is really improving. His batting average is $.417$ after six games, and the team is $6-0$ (six wins and no losses). They are off to their best start in years. On the way home from their sixth game, Michael notes to his father that the attendance seems to be increasing due to the team's great start, "There were $181$ people at the first game, then $197$ at the second, $203$ the third, $204$ the fourth, $212$ at the fifth, and there were $227$ at today's game." Just then, Michael's genius younger brother Tony, just seven-years-old, computes the average attendance of the six games. What is their average?

What minimum number of colours is sufficient to colour all positive real numbers so that every two numbers whose ratio is 4 or 8 have different colours?

A pair of standard 6-sided fair dice is rolled once. The sum of the numbers rolled determines the diameter of a circle. What is the probability that the numerical value of the area of the circle is less than the numerical value of the circle's circumference? $ \textbf{(A)}\ \frac{1}{36} \qquad \textbf{(B)}\ \frac{1}{12} \qquad \textbf{(C)}\ \frac{1}{6} \qquad \textbf{(D)}\ \frac{1}{4} \qquad \textbf{(E)}\ \frac{5}{18} $

Natural numbers from $1$ to $99$ (not necessarily distinct) are written on $99$ cards. It is given that the sum of the numbers on any subset of cards (including the set of all cards) is not divisible by $100$. Show that all the cards contain the same number.

$\boxed{\text{A4}}$ Let $x,y$ be positive reals satisfying the condition $x^3+y^3\leq x^2+y^2$.Find the maximum value of $xy$.