The Bank of Bath issues coins with an $H$ on one side and a $T$ on the other. Harry has $n$ of these coins arranged in a line from left to right. He repeatedly performs the following operation: if there are exactly $k>0$ coins showing $H$, then he turns over the $k$th coin from the left; otherwise, all coins show $T$ and he stops. For example, if $n=3$ the process starting with the configuration $THT$ would be $THT \to HHT \to HTT \to TTT$, which stops after three operations. (a) Show that, for each initial configuration, Harry stops after a finite number of operations. (b) For each initial configuration $C$, let $L(C)$ be the number of operations before Harry stops. For example, $L(THT) = 3$ and $L(TTT) = 0$. Determine the average value of $L(C)$ over all $2^n$ possible initial configurations $C$. [i]Proposed by David Altizio, USA[/i]

a) Find the value of $\sum_{n=1}^{\infty}\frac{\phi(n)}{2^n-1}$; b) Show that $\sum_k {m\choose k}{{n+k}\choose m}=\sum_k {m\choose k} {n\choose k} 2^k$ for $m,n\geq 0$; c) Using the identity $(1-x)^{-\frac 12}(1-x)^{-\frac 12}=(1-x)^{-1}$ derive a combinatorial identity! d) Express the value of $\sum (2^{a_1}-1)\ldots (2^{a_k}-1)$ where the sum is over all $2^{n-1}$ ways of choosing $(a_1,a_2,\ldots,a_k)$ such that $a_1+a_2+\ldots +a_k=n$, as a function of some Fibonacci term.

Let $\omega$ be the unit circle in the $xy$-plane in $3$-dimensional space. Find all points $P$ not on the $xy$-plane that satisfy the following condition: There exist points $A,B,C$ on $\omega$ such that $$ \angle APB = \angle APC = \angle BPC = 90^\circ.$$

Are there infinitely many different natural numbers $a_1,a_2, a_3,...$ so that for every integer $k$ only finitely many of the numbers $a_1 + k$,$a_2 + k$,$a_3 + k$,$...$ are numbers prime?

Sasha has $10$ cards with numbers $1, 2, 4, 8,\ldots, 512$. He writes the number $0$ on the board and invites Dima to play a game. Dima tells the integer $0 < p < 10, p$ can vary from round to round. Sasha chooses $p$ cards before which he puts a “$+$” sign, and before the other cards he puts a “$-$" sign. The obtained number is calculated and added to the number on the board. Find the greatest absolute value of the number on the board Dima can get on the board after several rounds regardless Sasha’s moves.

Prove The Following identity: $ \sum_{j \equal{} 0}^n \left ({3n \plus{} 2 \minus{} j \choose j}2^j \minus{} {3n \plus{} 1 \minus{} j \choose j \minus{} 1}2^{j \minus{} 1}\right ) \equal{} 2^{3n}$. The Second term on left hand side is to be regarded zero for j=0.

Prove that for every prime number $p$ and positive integer $a$, there exists a natural number $n$ such that $p^n$ contains $a$ consecutive equal digits.

A fixed circle $k$ and collinear points $E,F$ and $G$ are given such that the points $E$ and $G$ lie outside the circle $k$ and $F$ lies inside the circle $k$. Prove that, if $ABCD$ is an arbitrary quadrilateral inscribed in the circle $k$ such that the points $E,F$ and $G$ lie on lines $AB,AD$ and $DC$ respectively, then the side $BC$ passes through a fixed point collinear with $E,F$ and $G$, independent of the quadrilateral $ABCD$.

Let $f:[0,1] \to [0,1]$ a increasing continuous function, diferentiable in $(0,1)$ and with derivative smaller than 1 in every point. The sequence of sets $A_1,A_2,A_3,\dots$ is define as: $A_1 = f([0,1])$, and for $n \geq 2, A_n = f(A_{n-1}).$ Prove that $\displaystyle \lim_{n\to+\infty} d(A_n) = 0$, where $d(A)$ is the diameter of the set $A$. Note: The diameter of a set $X$ is define as $d(X) = \sup_{x,y\in X} |x-y|.$

Let $p$ be an odd prime. Determine the number of nonempty subsets from $\{1, 2, \dots, p - 1\}$ for which the sum of its elements is divisible by $p$.

In the figure, there is a circle of radius $1$ such that the segment $AG$ is diameter and that line $AF$ is perpendicular to line $DC$. There are also two squares $ABDC$ and $DEGF$, where $B$ and $E$ are points on the circle, and the points $A$, $D$ and $E$ are collinear. What is the area of square $DEGF$? [img]https://cdn.artofproblemsolving.com/attachments/1/e/794da3bc38096ef5d5daaa01d9c0f8c41a6f84.png[/img]

Let $m$ be an odd positive integer greater than $1$. Let $S_m$ be the set of all non-negative integers less than $m$ which are of the form $x+y$, where $xy-1$ is divisible by $m$. Let $f(m)$ be the number of elements of $S_m$. [b](a)[/b] Prove that $f(mn)=f(m)f(n)$ if $m$, $n$ are relatively prime odd integers greater than $1$. [b](b)[/b] Find a closed form for $f(p^k)$, where $k>0$ is an integer and $p$ is an odd prime.

Consider the set of all polynomials of degree less than or equal to $4$ with rational coefficients. a) Prove that it has a vector space structure over the field of numbers rational. b) Prove that the polynomials $1, x - 2, (x -2)^2, (x - 2)^3$ and $(x -2)^4$ form a base of this space. c) Express the polynomial $7 + 2x - 45x^2 + 3x^4$ in the previous base.

If the area of $\triangle ABC$ is $64$ square units and the geometric mean (mean proportional) between sides $AB$ and $AC$ is $12$ inches, then $\sin A$ is equal to $\textbf{(A) }\dfrac{\sqrt{3}}{2}\qquad\textbf{(B) }\frac{3}{5}\qquad\textbf{(C) }\frac{4}{5}\qquad\textbf{(D) }\frac{8}{9}\qquad \textbf{(E) }\frac{15}{17}$

Prove that there exists a function $f : \mathbb{N} \rightarrow \mathbb{N}$ that satisfies the following (1) $\{f(n) : n\in\mathbb{N}\}$ is a finite set; and (2) For nonzero integers $x_1, x_2, \ldots, x_{1000}$ that satisfy $f(\left|x_1\right|)=f(\left|x_2\right|)=\cdots=f(\left|x_{1000}\right|)$, then $x_1+2x_2+2^2x_3+2^3x_4+2^4x_5+\cdots+2^{999}x_{1000}\ne 0$.

A $12 \times 12$ board is divided into $144$ unit squares by drawing lines parallel to the sides. Two rooks placed on two unit squares are said to be non-attacking if they are not in the same column or same row. Find the least number $N$ such that if $N$ rooks are placed on the unit squares, one rook per square, we can always find $7$ rooks such that no two are attacking each other.

The triangle $ABC$ has $O$ as its circumcenter, and $H$ as its orthocenter. The line $AH$ and $BH$ intersect the circumcircle of $ABC$ for the second time at points $D$ and $E$, respectively. Let $A'$ and $B'$ be the circumcenters of triangle $AHE$ and $BHD$ respectively. If $A', B', O, H$ are [b]not[/b] collinear, prove that $OH$ intersects the midpoint of segment $A'B'$.

Let $a,b,c,d$ be positive real numbers such that $ 2(a+b+c+d)\ge abcd $. Prove that \[ a^2+b^2+c^2+d^2 \ge abcd .\]

Find all polynomilals $P$ with real coefficients, such that $(x+1)P(x-1)+(x-1)P(x+1)=2xP(x)$

This questions comprises two independent parts. (i) Let \(g:\mathbb{R}\to\mathbb{R}\) be continuous and such that \(g(0)=0\) and \(g(x)g(-x)>0\) for any \(x > 0\). Find all solutions \(f : \mathbb{R}\to\mathbb{R}\) to the functional equation \[g(f(x+y))=g(f(x))+g(f(y)),\ x,y\in\mathbb{R}\] (ii) Find all continuously differentiable functions \(\phi : [a, \infty) \to \mathbb{R}\), where \(a > 0\), that satisfies the equation \[(\phi(x))^2=\int_a^x \left(\left|\phi(y)\right|\right)^2+\left(\left|\phi'(y)\right|\right)^2\mathrm{d}y -(x-a)^3,\ \forall x\geq a.\]

There is a complete graph $G$ with $4027$ vertices drawn on the whiteboard. Ivan paints all the edges by red or blue colour. Find all ordered pairs $(r, b)$ such that Ivan can paint the edges so that every vertex is connected to exactly $r$ red edges and $b$ blue edges.

Let $X$ be an arbitrary set and $f$ a bijection from $X$ to $X$. Show that there exist bijections $g,\ g':X\to X$ s.t. $f=g\circ g',\ g\circ g=g'\circ g'=1_X$.

Given a polygon, a [i]triangulation[/i] is a division of the polygon into triangles whose vertices are the vertices of the polygon. Determine the values of $n$ for which the regular polygon with $n$ sides has a triangulation with all its triangles being isosceles.

On the two sides of the road two lines of trees are planted. On every tree, the number of oaks among itself and its neighbors is written. (For the first and last trees, this is the number of oaks among itself and its only neighbor). Prove that if the two sequences of numbers on the trees are equal, then sequnces of trees on the two sides of the road are equal [I]Proposed by A. Khrabrov, D. Rostovski[/i]

We say that a rectangle and a triangle are [i]similar[/i], if they have the same area and the same perimeter. Let $P$ be a rectangle for which the ratio of the longer to the shorter side is at least $\lambda -1+\sqrt{\lambda (\lambda -2)}$ where $\lambda =\frac{3\sqrt{3}}{2}$. Prove that there exists a tringle that is [i]similar[/i] to $P$.