Some towns in a country are connected by two–way roads, so that for any two towns there is a unique path along the roads connecting them. It is known that there is exactly 100 towns which are directly connected to only one town. Prove that we can construct 50 new roads in order to obtain a net in which every two towns will be connected even if one road gets closed.

For any sequence of real numbers $A=(a_1,a_2,a_3,\ldots)$, define $\Delta A$ to be the sequence $(a_2-a_1,a_3-a_2,a_4-a_3,\ldots)$, whose $n^\text{th}$ term is $a_{n+1}-a_n$. Suppose that all of the terms of the sequence $\Delta(\Delta A)$ are $1$, and that $a_{19}=a_{92}=0$. Find $a_1$.

In a circle with center $O$ is inscribed a polygon, which is triangulated. Show that the sum of the squares of the distances from $O$ to the incenters of the formed triangles is independent of the triangulation.

Let $n$ be a positive integer and let $p$ be a prime number. Prove that if $a$, $b$, $c$ are integers (not necessarily positive) satisfying the equations \[ a^n + pb = b^n + pc = c^n + pa\] then $a = b = c$. [i]Proposed by Angelo Di Pasquale, Australia[/i]

Suppose $p,q$ are distinct primes and $S$ is a subset of $\{1,2,\dots ,p-1\}$. Let $N(S)$ denote the number of solutions to the equation $$\sum_{i=1}^{q}x_i\equiv 0\mod p$$ where $x_i\in S$, $i=1,2,\dots ,q$. Prove that $N(S)$ is a multiple of $q$.

Let the integer $n \ge 2$, and the real numbers $x_1,x_2,\cdots,x_n\in \left[0,1\right] $.Prove that\[\sum_{1\le k<j\le n} kx_kx_j\le \frac{n-1}{3}\sum_{k=1}^n kx_k.\]

Let $ \mathbb{R}$ be the set of real numbers. Does there exist a function $ f: \mathbb{R} \mapsto \mathbb{R}$ which simultaneously satisfies the following three conditions? [b](a)[/b] There is a positive number $ M$ such that $ \forall x:$ $ \minus{} M \leq f(x) \leq M.$ [b](b)[/b] The value of $f(1)$ is $1$. [b](c)[/b] If $ x \neq 0,$ then \[ f \left(x \plus{} \frac {1}{x^2} \right) \equal{} f(x) \plus{} \left[ f \left(\frac {1}{x} \right) \right]^2 \]

Let $a$ and $b$ be distinct positive integers. The following infinite process takes place on an initially empty board. [list=i] [*] If there is at least a pair of equal numbers on the board, we choose such a pair and increase one of its components by $a$ and the other by $b$. [*] If no such pair exists, we write two times the number $0$. [/list] Prove that, no matter how we make the choices in $(i)$, operation $(ii)$ will be performed only finitely many times. Proposed by [I]Serbia[/I].

Let $p_1,p_2,\dots ,p_n$ be all prime numbers lesser than $2^{100}$. Prove that $\frac{1}{p_1} +\frac{1}{p_2} +\dots +\frac{1}{p_n} <10$.

Suppose that $m=nq$, where $n$ and $q$ are positive integers. Prove that the sum of binomial coefficients \[\sum_{k=0}^{n-1}{ \gcd(n, k)q \choose \gcd(n, k)}\] is divisible by $m$.

Let $f:\mathbb{N}\rightarrow \mathbb{N}$ be a strictly increasing function such that $f(2)=2$ and $f(mn)=f(m)f(n)$ for every pair of relatively prime positive integers $m$ and $n$. Prove that $f(n)=n$ for every positive integer $n$.

Define a sequence: $x_0=1$ and for all $n\ge 0$, $x_{2n+1}=x_{n}$ and $x_{2n+2}=x_{n}+x_{n+1}$. Prove that for any relatively prime positive integers $a$ and $b$, there is a non-negative integer $n$ such that $a=x_n$ and $b=x_{n+1}$.

The sequence $ (F_n)$ of Fibonacci numbers satisfies $ F_1 \equal{} 1, F_2 \equal{} 1$ and $ F_n \equal{} F_{n\minus{}1} \plus{}F_{n\minus{}2}$ for all $ n \ge 3$. Find all pairs of positive integers $ (m, n)$, such that $ F_m . F_n \equal{} mn$.

The function $f(n)$ is defined on the positive integers and takes non-negative integer values. $f(2)=0,f(3)>0,f(9999)=3333$ and for all $m,n:$ \[ f(m+n)-f(m)-f(n)=0 \text{ or } 1. \] Determine $f(1982)$.

Let $b\geq2$ and $w\geq2$ be fixed integers, and $n=b+w$. Given are $2b$ identical black rods and $2w$ identical white rods, each of side length 1. We assemble a regular $2n-$gon using these rods so that parallel sides are the same color. Then, a convex $2b$-gon $B$ is formed by translating the black rods, and a convex $2w$-gon $W$ is formed by translating the white rods. An example of one way of doing the assembly when $b=3$ and $w=2$ is shown below, as well as the resulting polygons $B$ and $W$. [asy]size(10cm); real w = 2*Sin(18); real h = 0.10 * w; real d = 0.33 * h; picture wht; picture blk; draw(wht, (0,0)--(w,0)--(w+d,h)--(-d,h)--cycle); fill(blk, (0,0)--(w,0)--(w+d,h)--(-d,h)--cycle, black); // draw(unitcircle, blue+dotted); // Original polygon add(shift(dir(108))*blk); add(shift(dir(72))*rotate(324)*blk); add(shift(dir(36))*rotate(288)*wht); add(shift(dir(0))*rotate(252)*blk); add(shift(dir(324))*rotate(216)*wht); add(shift(dir(288))*rotate(180)*blk); add(shift(dir(252))*rotate(144)*blk); add(shift(dir(216))*rotate(108)*wht); add(shift(dir(180))*rotate(72)*blk); add(shift(dir(144))*rotate(36)*wht); // White shifted real Wk = 1.2; pair W1 = (1.8,0.1); pair W2 = W1 + w*dir(36); pair W3 = W2 + w*dir(108); pair W4 = W3 + w*dir(216); path Wgon = W1--W2--W3--W4--cycle; draw(Wgon); pair WO = (W1+W3)/2; transform Wt = shift(WO)*scale(Wk)*shift(-WO); draw(Wt * Wgon); label("$W$", WO); /* draw(W1--Wt*W1); draw(W2--Wt*W2); draw(W3--Wt*W3); draw(W4--Wt*W4); */ // Black shifted real Bk = 1.10; pair B1 = (1.5,-0.1); pair B2 = B1 + w*dir(0); pair B3 = B2 + w*dir(324); pair B4 = B3 + w*dir(252); pair B5 = B4 + w*dir(180); pair B6 = B5 + w*dir(144); path Bgon = B1--B2--B3--B4--B5--B6--cycle; pair BO = (B1+B4)/2; transform Bt = shift(BO)*scale(Bk)*shift(-BO); fill(Bt * Bgon, black); fill(Bgon, white); label("$B$", BO);[/asy] Prove that the difference of the areas of $B$ and $W$ depends only on the numbers $b$ and $w$, and not on how the $2n$-gon was assembled. [i]Proposed by Ankan Bhattacharya[/i]