The numbers $2,4,\ldots,2^{100}$ are written on a board. At a move, one may erase the numbers $a,b$ from the board and replace them with $ab/(a+b).$ Prove that the last numer on the board will be greater than 1. [i]From the folklore[/i]

Find all monic polynomials $P,Q$ which are non-constant, have real coefficients and they satisfy $2P(x)=Q(\frac{(x+1)^2}{2})-Q(\frac{(x-1)^2}{2})$ and $P(1)=1$ for all real $x$.

A "labyrinth" is an $8 \times 8$ chessboard with walls between some neighboring squares. If a rook can traverse the entire board without jumping over the walls, the labyrinth is "good" ; otherwise it is "bad" . Are there more good labyrinths or bad labyrinths? (A Shapovalov)

Determine all pairs of $(a,b)$ of non negative integers such that: $$\dfrac{a+b}{2} - \sqrt{ab}~=~1$$

The real numbers $a$, $b$, and $c$ are such that the quadratic trinomials $ax^2 + bx + c$ and $cx^2 + bx + a$ each have two strictly positive real roots. Show that the sum of all these roots is at least $4$.

Given a positive integer $ n$, for all positive integers $ a_1, a_2, \cdots, a_n$ that satisfy $ a_1 \equal{} 1$, $ a_{i \plus{} 1} \leq a_i \plus{} 1$, find $ \displaystyle \sum_{i \equal{} 1}^{n} a_1a_2 \cdots a_i$.

Determine on which side is the steering wheel disposed in the car depicted in the figure. [img]https://4.bp.blogspot.com/-s2rjZw-d4UY/XMg5BXCE9SI/AAAAAAAAKHc/WOpvqjWw7lAciDEiNj_TX7io6sfItSPnQCK4BGAYYCw/s320/Sharygin%2Bfinal%2B2007%2B8.1.png[/img]

Let $n \geq 1$ be an integer, and $a_0, a_1, \dots, a_{n-1}$ be real numbers such that \[ 1 \geq a_{n-1} \geq a_{n-2} \geq \dots \geq a_1 \geq a_0 \geq 0. \] We assume that $\lambda$ is a real root of the polynomial \[ x^n + a_{n-1} x^{n-1} + \dots + a_1 x + a_0. \] Prove that $|\lambda| \leq 1$.

Two equal circles intersect at points $A$ and $B$. $P$ is the point of one of the circles that is different from $A$ and $B, X$ and $Y$ are the second intersection points of the lines of $PA, PB$ with the other circle. Prove that the line passing through $P$ and perpendicular to $AB$ divides one of the arcs $XY$ in half.

The pages of a notebook are numbered consecutively so that the numbers $1$ and $2$ are on the second sheet, numbers $3$ and $4$, and so on. A sheet is torn out of this notebook. All of the remaining page numbers are addedand have sum $2021$. (a) How many pages could the notebook originally have been? (b) What page numbers can be on the torn sheet? (Walther Janous)

In a regular polygon with $134$ sides, $67$ diagonals are drawn so that exactly one diagonal emerges from each vertex. We call the [i]length[/i] of a diagonal the number of sides of the polygon included between the vertices of the diagonal and which is less than or equal to $67$. If we order the [i]lengths [/i] of the diagonals in ascending order, we obtain a succession of $67$ numbers $(d_1,d_2,...,d_{67})$. It will be possible to draw diagonals such that a) $(d_1,d_2,...,d_{67})=\underbrace{2 ... 2}_{6},\underbrace{3 ... 3}_{61}$ ? b) $(d_1,d_2,...,d_{67}) =\underbrace{3 ... 3}_{8},\underbrace{6 ... 6}_{55}.\underbrace{8 ... 8}_{4} $ ?

Three natural numbers $ a,b,c $ with $ \gcd (a,b) =1 $ define in the Diophantine plane a line $ d: ax+by-c=0. $ Prove that: [b]a)[/b] the distance between any two points from $ d $ is at least $ \sqrt{a^2+b^2} . $ [b]b)[/b] the restriction of $ d $ to the first quadrant of the Diophantine plane is a finite line having at most $ 1+\frac{c}{ab} $ elements.

$f(x)=x^3-6x^2+17x$. If $f(a)=16, f(b)=20$, find $a+b$.

Two circles that are not equal are tangent externally at point $R$. Suppose point $P$ is the intersection of the external common tangents of the two circles. Let $A$ and $B$ are two points on different circles so that $RA$ is perpendicular to $RB$. Show that the line $AB$ passes through $P$.

Two straight lines are given on a plane, intersecting at point $O$ at an angle $a$. Let $A$, $B$ and $C $ be three points on one of the lines, located on one side of$ O$ and following in the indicated order, $M$ be an arbitrary point on another line, different from $O$, Let $\angle AMB=\gamma$, $\angle BMC = \phi$. Consider the function $F(M) = ctg \gamma + ctg \phi$ . Prove that$ F(M)$ takes the smallest value on each of the rays into which $O$ divides the second straight line. (Each has its own.) Let us denote one of these smallest values by $q$, and the other by $p$. Prove that the exprseeion $\frac{p}{q}$ is independent of choice of points $A$, $B$ and $C$. Express this relationship in terms of $a$.

Suppose $ABCD$ is a cyclic quadrilateral inscribed in a circle of radius one unit. If $AB \cdot BC \cdot CD \cdot DA \geq 4$, prove that $ABCD$ is a square.

There are $15$ lights on the ceiling of a room, numbered from $1$ to $15$. All lights are turned off. In another room, there are $15$ switches: a switch for lights $1$ and $2$, a switch for lights $2$ and $3$, a switch for lights $3$ en $4$, etcetera, including a sqitch for lights $15$ and $1$. When the switch for such a pair of lights is turned, both of the lights change their state (from on to off, or vice versa). The switches are put in a random order and all look identical. Raymond wants to find out which switch belongs which pair of lights. From the room with the switches, he cannot see the lights. He can, however, flip a number of switches, and then go to the other room to see which lights are turned on. He can do this multiple times. What is the minimum number of visits to the other room that he has to take to determine for each switch with certainty which pair of lights it corresponds to?

Consider the equation $$FORTY + TEN + TEN = SIXTY$$ , where each of the ten letters represents a distinct digit from $0$ to $9$. Find all possible values of $SIXTY$ .

Let $ABCD$ be a trapezoid inscribed in a unit circle with diameter $AB$. If $DC = 4AD$, compute $AD$.

For every integer $ n \geq 2$ determine the minimum value that the sum $ \sum^n_{i\equal{}0} a_i$ can take for nonnegative numbers $ a_0, a_1, \ldots, a_n$ satisfying the condition $ a_0 \equal{} 1,$ $ a_i \leq a_{i\plus{}1} \plus{} a_{i\plus{}2}$ for $ i \equal{} 0, \ldots, n \minus{} 2.$

* A shipment of $13.5$ tons is packed in a number of weightless containers. Each loaded container weighs not more than $350$ kg. Prove that $11$ trucks each of which is capable of carrying · $1.5$ ton can carry this load.

You have a large number of congruent equilateral triangular tiles on a table and you want to fit $n$ of them together to ma€ke a convex equiangular hexagon (i.e. one whose interior angles are $120^o$) . Obviously, $n$ cannot be any positive integer. The first three feasible $n$ are $6, 10$ and $13$. Determine if $19$ and $20$ are feasible .

Each of the digits 3, 5, 6, 7, and 8 is placed one to a box in the diagram. If the two digit number is subtracted from the three digit number, what is the smallest difference? $\textbf{(A)}\ 269 \qquad \textbf{(B)}\ 278 \qquad \textbf{(C)}\ 484 \qquad \textbf{(D)}\ 271 \qquad \textbf{(E)}\ 261$

Solve the following system of equations in integer numbers: $$\begin{cases} x^2 = yz + 1 \\ y^2 = zx + 1 \\ z^2 = xy + 1 \end{cases}$$

A time is chosen randomly and uniformly in an 24-hour day. The probability that at that time, the (non-reflex) angle between the hour hand and minute hand on a clock is less than $\frac{360}{11}$ degrees is $\frac{m}{n}$ for coprime positive integers $m$ and $n$. Find $100m + n$. [i]Proposed by Yannick Yao[/i]