Let $n,s,$ and $t$ be positive integers and $0<\lambda<1.$ A simple graph on $n$ vertices with at least $\lambda n^2$ edges is given. We say that $(x_1,\ldots,x_s,y_1,\ldots,y_t)$ is a [i]good intersection[/i] if letters $x_i$ and $y_j$ denote not necessarily distinct vertices and every $x_iy_j$ is an edge of the graph $(1\leq i\leq s,$ $1\leq j\leq t).$ Prove that the number of good insertions is at least $\lambda^{st}n^{s+t}.$ [i]Proposed by Kada Williams, Cambridge[/i]

If $ n$ is a real number, then the simultaneous system $ nx \plus{} y \equal{} 1$ $ ny \plus{} z \equal{} 1$ $ x \plus{} nz \equal{} 1$ has no solution if and only if $ n$ is equal to $ \textbf{(A)}\ \minus{}1 \qquad \textbf{(B)}\ 0 \qquad \textbf{(C)}\ 1 \qquad \textbf{(D)}\ 0 \text{ or } 1 \qquad \textbf{(E)}\ \frac12$

Show that if $2 + 2\sqrt{28n^2 + 1}$ is an integer, then it is a square (for $n$ an integer).

Find all $f(x)\in \mathbb Z (x)$ that satisfies the following condition, with the lowest degree. [b]Condition[/b]: There exists $g(x),h(x)\in \mathbb Z (x)$ such that $$f(x)^4+2f(x)+2=(x^4+2x^2+2)g(x)+3h(x)$$.

At Andover, $35\%$ of students are lowerclassmen and the rest are upperclassmen. Given that $26\%$ of lowerclassmen and $6\%$ of upperclassmen take Latin, what percentage of all students take Latin? [i]Proposed by Anthony Yang[/i]

Calculate the area of the intersection of the interior of the ellipse $\frac{x^2}{16}+ \frac{y^2}{4}= 1$ with the circle bounded by the circumference $(x -2)^2 + (y - 1)^2 = 5$.

A set consisting of $n$ points of a plane is called an isosceles $n$-point if any three of its points are located in vertices of an isosceles triangle. Find all natural numbers for which there exist isosceles $n$-points.

Investigate whether a chess knight can traverse a $4 \times 4$ mini-chessboard so that it reaches each of the $16$ squares only once. Note: the drawing below shows the endpoints of the eight possible moves of the knight $(C)$ on a chessboard of size $8 \times 8$. [asy] unitsize(0.4 cm); int i; fill(shift((2,2))*((0,0)--(1,0)--(1,1)--(0,1)--cycle), gray(0.7)); fill(shift((4,2))*((0,0)--(1,0)--(1,1)--(0,1)--cycle), gray(0.7)); fill(shift((1,3))*((0,0)--(1,0)--(1,1)--(0,1)--cycle), gray(0.7)); fill(shift((5,3))*((0,0)--(1,0)--(1,1)--(0,1)--cycle), gray(0.7)); fill(shift((1,5))*((0,0)--(1,0)--(1,1)--(0,1)--cycle), gray(0.7)); fill(shift((5,5))*((0,0)--(1,0)--(1,1)--(0,1)--cycle), gray(0.7)); fill(shift((2,6))*((0,0)--(1,0)--(1,1)--(0,1)--cycle), gray(0.7)); fill(shift((4,6))*((0,0)--(1,0)--(1,1)--(0,1)--cycle), gray(0.7)); for (i = 0; i <= 8; ++i) { draw((i,0)--(i,8)); draw((0,i)--(8,i)); } label("C", (3.5,4.5), fontsize(8)); [/asy]

A board $n$×$n$ is coloured black and white like a chessboard. The following steps are permitted: Choose a rectangle inside the board (consisting of entire cells)whose side lengths are both odd or both even, but not both equal to $1$, and invert the colours of all cells inside the rectangle. Determine the values of $n$ for which it is possible to make all the cells have the same colour in a finite number of such steps.

Ali and Shayan are playing a turn-based game on an infinite grid. Initially, all cells are white. Ali starts the game, and in the first turn, he colors one unit square black. In the following turns, each player must color a white square that shares at least one side with a black square. The game continues for exactly 2808 turns, after which each player has made 1404 moves. Let $A$ be the set of black cells at the end of the game. Ali and Shayan respectively aim to minimize and maximise the perimeter of the shape $A$ by playing optimally. (The perimeter of shape $A$ is defined as the total length of the boundary segments between a black and a white cell.) What are the possible values of the perimeter of $A$, assuming both players play optimally?

[b]rolling cube[/b] $a$,$b$ and $c$ are natural numbers. we have a $(2a+1)\times (2b+1)\times (2c+1)$ cube. this cube is on an infinite plane with unit squares. you call roll the cube to every side you want. faces of the cube are divided to unit squares and the square in the middle of each face is coloured (it means that if this square goes on a square of the plane, then that square will be coloured.) prove that if any two of lengths of sides of the cube are relatively prime, then we can colour every square in plane. time allowed for this question was 1 hour.

Let $n$ be a natural number and let $P (t) = 1 + t + t^2 + ... + t^{2n}$. If $x \in R$ such that $P (x)$ and $P (x^2)$ are rational numbers, prove that $x$ is rational number.

Let $ABC$ be an acute, non-isosceles triangle with circumcenter $O$, incenter $I$ and $(I)$ tangent to $BC$, $CA$, $AB$ at $D, E, F$ respectively. Suppose that $EF$ cuts $(O)$ at $P, Q$. Prove that $(PQD)$ bisects segment $BC$.

Find the number of ten-digit natural numbers (which do not start with zero) containing no block $ 1991$.

Consider a regular 2n-gon $ P$,$A_1,A_2,\cdots ,A_{2n}$ in the plane ,where $n$ is a positive integer . We say that a point $S$ on one of the sides of $P$ can be seen from a point $E$ that is external to $P$ , if the line segment $SE$ contains no other points that lie on the sides of $P$ except $S$ .We color the sides of $P$ in 3 different colors (ignore the vertices of $P$,we consider them colorless), such that every side is colored in exactly one color, and each color is used at least once . Moreover ,from every point in the plane external to $P$ , points of most 2 different colors on $P$ can be seen .Find the number of distinct such colorings of $P$ (two colorings are considered distinct if at least one of sides is colored differently). [i]Proposed by Viktor Simjanoski, Macedonia[/i] JBMO 2017, Q4

Let $A$, $B$ and $C$ be equidistant points on the circumference of a circle of unit radius centered at $O$, and let $P$ be any point in the circle's interior. Let $a$, $b$, $c$ be the distances from $P$ to $A$, $B$, $C$ respectively. Show that there is a triangle with side lengths $a$, $b$, $c$, and that the area of this triangle depends only on the distance from $P$ to $O$.

Which of the numbers $2^{2002}$ and $2000^{200}$ is bigger?

The sum of the areas of all triangles whose vertices are also vertices of a $1\times 1 \times 1$ cube is $m+\sqrt{n}+\sqrt{p}$, where $m$, $n$, and $p$ are integers. Find $m+n+p$.

Is it possible to place $1965$ points in a square with side $1$ so that any rectangle of area $1/200$ with sides parallel to the sides of the square contains at least one of these points inside?

Let $a_j$, $b_j$, $c_j$ be integers for $1 \le j \le N$. Assume for each $j$, at least one of $a_j$, $b_j$, $c_j$ is odd. Show that there exists integers $r, s, t$ such that $ra_j+sb_j+tc_j$ is odd for at least $\tfrac{4N}{7}$ values of $j$, $1 \le j \le N$.

The $120$ permutations of the word BORIS are arranged in alphabetical order, from BIORS to SROIB. What is the $60$th word in this list?

The sum of the numerical coefficients of all the terms in the expansion of $(x-2y)^{18}$ is: $ \textbf{(A)}\ 0\qquad\textbf{(B)}\ 1\qquad\textbf{(C)}\ 19\qquad\textbf{(D)}\ -1\qquad\textbf{(E)}\ -19 $

Let $\alpha, c > 0$, define $x_1 = c$ and let $x_{n + 1} = x_n e^{-x_n^\alpha}$ for $n \geq 1$. For which values of $\beta$ does $\sum_{i = 1}^{\infty} x_n^\beta$ converge?

Source: Lusophon MO 2016 Prove that any positive power of $2$ can be written as: $$5xy-x^2-2y^2$$ where $x$ and $y$ are odd numbers.

Consider a semicircle with center $M$ and diameter $AB$. Let $P$ be a point in the semicircle, different from $A$ and $B$, and let $Q$ be the midpoint of the arc $AP$. The line parallel to $QP$ through $M$ intersects $PB$ at the point $S$. Prove that the triangle $PMS$ is isosceles.