Suppose that we have $n$ events $A_1,\dots, A_n,$ each of which has probability at least $1-a$ of occuring, where $a<1/4.$ Further suppose that $A_i$ and $A_j$ are mutually independent if $|i-j|>1.$ Assume as known that the recurrence $u_{k+1}=u_k-au_{k-1}, u_0=1, u_1=1-a,$ defines positive real numb $u_k$ for $k=0,1,\dots.$ Show that the probability of all of $A_1,\dots, A_n$ occuring is at least $u_n.$

What is the radius of the circle passing through the center of the square $ABCD$ with side length $1$, its corner $A$, and midpoint of its side $[BC]$? $ \textbf{(A)}\ \dfrac {\sqrt 3}4 \qquad\textbf{(B)}\ \dfrac {\sqrt 5}4 \qquad\textbf{(C)}\ \sqrt 2 \qquad\textbf{(D)}\ \sqrt 3 \qquad\textbf{(E)}\ \dfrac {\sqrt {10}}4 $

Consider a flat field on which there exist a valley in the form of an infinite strip with arbitrary width $\omega$. There exist a polyhedron of diameter $d$(Diameter in a polyhedron is the maximum distance from the points on the polyhedron) is in one side and a pit of diameter $d$ on the other side of the valley. We want to roll the polyhedron and put it into the pit such that the polyhedron and the field always meet each other in one point at least while rolling (If the polyhedron and the field meet each other in one point at least then the polyhedron would not fall into the valley). For crossing over the bridge, we have built a rectangular bridge with a width of $\frac{d}{10}$ over the bridge. Prove that we can always put the polyhedron into the pit considering the mentioned conditions. (You will earn a good score if you prove the decision for $\omega = 0$).

Let $ABCD$ be a convex quadrilateral such that $\angle A, \angle B, \angle C$ are acute. $AB$ and $CD$ meet at $E$ and $BC,DA$ meet at $F$. Let $K,L,M,N$ be the midpoints of $AB,BC,CD,DA$ repectively. $KM$ meets $BC,DA$ at $X$ and $Y$, and $LN$ meets $AB,CD$ at $Z$ and $W$. Prove that the line passing $E$ and the midpoint of $ZW$ is parallel to the line passing $F$ and the midpoint of $XY$.

Let $\vartriangle ABC$ be an equilateral triangle with side length $1$ and let $\Gamma$ the circle tangent to $AB$ and $AC$ at $B$ and $C$, respectively. Let $P$ be on side $AB$ and $Q$ be on side $AC$ so that $PQ // BC$, and the circle through $A, P$, and $Q$ is tangent to $\Gamma$ . If the area of $\vartriangle APQ$ can be written in the form $\frac{\sqrt{a}}{b}$ for positive integers $a$ and $b$, where $a$ is not divisible by the square of any prime, find $a + b$.

Prove that for each positive integer $n$ there are at most two pairs $(a, b)$ of positive integers with following two properties: (i) $a^2 + b = n$, (ii) $a+b$ is a power of two, i.e. there is an integer $k \ge 0$ such that $a+b = 2^k$.

A wooden cube has edges of length $3$ meters. Square holes, of side one meter, centered in each face are cut through to the opposite face. The edges of the holes are parallel to the edges of the cube. The entire surface area including the inside, in square meters, is $\textbf {(A) } 54 \qquad \textbf {(B) } 72 \qquad \textbf {(C) } 76 \qquad \textbf {(D) } 84\qquad \textbf {(E) } 86$

Let $\{a_n\}_{n\geq 1}$ be a sequence defined by $a_n=\int_0^1 x^2(1-x)^ndx$. Find the real value of $c$ such that $\sum_{n=1}^{\infty} (n+c)(a_n-a_{n+1})=2.$

I have $8$ unit cubes of different colors, which I want to glue together into a $2\times 2\times 2$ cube. How many distinct $2\times 2\times 2$ cubes can I make? Rotations of the same cube are not considered distinct, but reflections are.

An engineer is designing an engine. Each cycle, it ignites a negligible amount of fuel, releasing $ 2000 \, \text{J} $ of energy into the cubic decimeter of air, which we assume here is gaseous nitrogen at $ 20^\circ \, \text{C} $ at $ 1 \, \text{atm} $ in the engine in a process which we can regard as instantaneous and isochoric. It then expands adiabatically until its pressure once again reaches $ 1 \, \text{atm} $, and shrinks isobarically until it reaches its initial state. What is the efficiency of this engine? [i]Problem proposed by B. Dejean[/i]

Which positive integers are missing in the sequence $ \left\{a_n\right\}$, with $ a_n \equal{} n \plus{} \left[\sqrt n\right] \plus{}\left[\sqrt [3]n\right]$ for all $ n \ge 1$? ($ \left[x\right]$ denotes the largest integer less than or equal to $ x$, i.e. $ g$ with $ g \le x < g \plus{} 1$.)

The PMO Magician has a special party game. There are $n$ chairs, labelled $1$ to $n$. There are $n$ sheets of paper, labelled $1$ to $n$. [list] [*] On each chair, she attaches exactly one sheet whose number does not match the number on the chair. [*] She then asks $n$ party guests to sit on the chairs so that each chair has exactly one occupant. [*] Whenever she claps her hands, each guest looks at the number on the sheet attached to their current chair, and moves to the chair labelled with that number. [/list] Show that if $1 < m \leq n$, where $m$ is not a prime power, it is always possible for the PMO Magician to choose which sheet to attach to each chair so that everyone returns to their original seats after exactly $m$ claps.

Prove that for every positive integer $n,$ the set $\{2,3,4,\ldots,3n+1\}$ can be partitioned into $n$ triples in such a way that the numbers from each triple are the lengths of the sides of some obtuse triangle. [i]Proposed by Canada[/i]

Let $ABC$ be an acute-angled triangle with the circumcenter $O$. Let $D$ be the foot of the altitude from $A$. If $OD\parallel AB$, show that $\sin 2B = \cot C$. [i]Mădălin Mitrofan[/i]

Let $(a_n)_{n\ge 0}$ be the sequence of rational numbers with $a_0 = 2016$ and $a_{n+1} = a_n + \frac{2}{a_n}$ for all $n \ge 0$. Show that the sequence does not contain a square of a rational number. Proposed by Theresia Eisenkölbl

Prove that $$S_n=\frac1{1^2}+\frac1{2^2}+\ldots+\frac1{n^2}<2$$for every $n\in\mathbb N$.

The complete list of the three-digit palindrome numbers is written in ascending order: $$101, 111, 121, 131,... , 979, 989, 999.$$ Then eight consecutive palindrome numbers are eliminated and the numbers that remain in the list are added, obtaining $46.150$. Determine the eight erased palindrome numbers .

$x_1,...,x_n$ are non-negative reals and $n \geq 3$. Prove that at least one of the following inequalities is true: \[ \sum_{i=1} ^n \frac{x_i}{x_{i+1}+x_{i+2}} \geq \frac{n}{2}, \] \[ \sum_{i=1} ^n \frac{x_i}{x_{i-1}+x_{i-2}} \geq \frac{n}{2} . \]

Let $ x$ be a real number such that $ \sec x \minus{} \tan x \equal{} 2$. Then $ \sec x \plus{} \tan x \equal{}$ $ \textbf{(A)}\ 0.1 \qquad \textbf{(B)}\ 0.2 \qquad \textbf{(C)}\ 0.3 \qquad \textbf{(D)}\ 0.4 \qquad \textbf{(E)}\ 0.5$

On a semicircle with diameter $AB$ and centre $S$, points $C$ and $D$ are given such that point $C$ belongs to arc $AD$. Suppose $\angle CSD = 120^\circ$. Let $E$ be the point of intersection of the straight lines $AC$ and $BD$ and $F$ the point of intersection of the straight lines $AD$ and $BC$. Prove that $EF=\sqrt{3}AB$.

Does there exist a positive integer $ n>1$ such that $ n$ is a power of $ 2$ and one of the numbers obtained by permuting its (decimal) digits is a power of $ 3$ ?

Let $ P\subseteq \mathbb{R}^m$ be a non-empty compact convex set and $ f: P\rightarrow \mathbb{R}_{ \plus{} }$ be a concave function. Prove, that for every $ \xi\in \mathbb{R}^m$ \[ \int_{P}\langle \xi,x \rangle f(x)dx\leq \left[\frac {m \plus{} 1}{m \plus{} 2}\sup_{x\in P}{\langle\xi,x\rangle} \plus{} \frac {1}{m \plus{} 2}\inf_{x\in P}{\langle\xi,x\rangle}\right] \cdot\int_{P}f(x)dx.\]

Show that an integer $= 7 \mod 8$ cannot be sum of three squares.

$ABCD$ is a parallelogram, and circle $S$ (with radius $2$) is inscribed insider $ABCD$ such that $S$ is tangent to all four line segments $AB$, $BC$, $CD$, and $DA$. One of the internal angles of the parallelogram is $60^\circ$. What is the maximum possible area of $ABCD$?

There are real numbers $a, b, c, $ and $d$ such that $-20$ is a root of $x^3 + ax + b$ and $-21$ is a root of $x^3 + cx^2 + d.$ These two polynomials share a complex root $m + \sqrt{n} \cdot i, $ where $m$ and $n$ are positive integers and $i = \sqrt{-1}.$ Find $m+n.$