We are given a family of discs in the plane, with pairwise disjoint interiors. Each disc is tangent to at least six other discs of the family. Show that the family is infinite.

Let $c$ be a positive real and $a_1, a_2, \dots$ be a sequence of nonnegative integers satisfying the following conditions for every positive integer $n$: [b](i)[/b]$\frac{2^{a_1}+2^{a_2}+\cdots+2^{a_n}}{n}$ is an integer; [b](ii)[/b]$\textbullet 2^{a_n}\leq cn$. Prove that the sequence $a_1, a_2, \dots$ is eventually constant.

What is the value of the gravitational potential energy of the two star system? (A) $-\frac{GM^2}{d}$ (B) $\frac{3GM^2}{d}$ (C) $-\frac{GM^2}{d^2}$ (D) $-\frac{3GM^2}{d}$ (E) $-\frac{3GM^2}{d^2}$

Tsrutsuna starts in the bottom left cell of a 7 × 7 square table, while Tsuna is in the upper right cell. The center cell of the table contains cheese. Tsrutsuna wants to reach Tsuna and bring a piece of cheese with him. From a cell Tsrutsuna can only move to the right or the top neighboring cell. Determine the number of different paths Tsrutsuna can take from the lower left cell to the upper right cell, such that he passes through the center cell. [i]Proposed by Giorgi Arabidze, Georgia[/i]

The sum of three numbers is $ 98$. The ratio of the first to the second is $ \frac {2}{3}$, and the ratio of the second to the third is $ \frac {5}{8}$. The second number is: $ \textbf{(A)}\ 15 \qquad\textbf{(B)}\ 20 \qquad\textbf{(C)}\ 30 \qquad\textbf{(D)}\ 32 \qquad\textbf{(E)}\ 33$

How many ways are there (in terms of power) to represent the number 1 as a finite number or an infinite sum of some subset of the set: {$\phi^{-n} | n \in Z^+$} $\phi=\frac{1+\sqrt5}{2}$

Find all pairs $(p,q)$ of prime numbers, such that $2p-1$, $2q-1$, $2pq-1$ are perfect square. F. Petrov, A. Smirnov

Find all positive integers $n, n>1$ for wich holds : If $a_1, a_2 ,\dots ,a_k$ are all numbers less than $n$ and relatively prime to $n$ , and holds $a_1<a_2<\dots <a_k $, then none of sums $a_i+a_{i+1}$ for $i=1,2,3,\dots k-1 $ are divisible by $3$.

Assume : $x,y,z>0$ , $ x^2+y^2+z^2 = 3 $ . Prove the following inequality : $${\frac{x^{2009}-2008(x-1)}{y+z}+\frac{y^{2009}-2008(y-1)}{x+z}+\frac{z^{2009}-2008(z-1)}{x+y}\ge\frac{1}{2}(x+y+z)}$$

Let $A$, $B$, $C$, $D$ be four points on a line in this order. Suppose that $AC = 25$, $BD = 40$, and $AD = 57$. Compute $AB \cdot CD + AD \cdot BC$. [i]Proposed by Evan Chen[/i]

Mr. Harman needs to know the combined weight in pounds of three boxes he wants to mail. However, the only available scale is not accurate for weights less than $100$ pounds or more than $150$ pounds. So the boxes are weighed in pairs in every possible way. The results are $122$, $125$ and $127$ pounds. What is the combined weight in pounds of the three boxes? $\textbf{(A)}\ 160\qquad \textbf{(B)}\ 170\qquad \textbf{(C)}\ 187\qquad \textbf{(D)}\ 195\qquad \textbf{(E)}\ 354$

Find all the functions $f:R \to R$ satisfying $$(x + y)(f (x)-f (y)) = f (x^2) - f (y^2),\, \forall x, y \in R$$

The second and fourth terms of a geometric sequence are $ 2$ and $ 6$. Which of the following is a possible first term? $ \textbf{(A)}\ \minus{}\!\sqrt3 \qquad \textbf{(B)}\ \minus{}\!\frac{2\sqrt3}{3} \qquad \textbf{(C)}\ \minus{}\!\frac{\sqrt3}{3} \qquad \textbf{(D)}\ \sqrt3 \qquad \textbf{(E)}\ 3$

Prove that $$ \sin^2 \alpha + \sin^2 \beta \geq \sin \alpha \sin \beta + \sin \alpha + \sin \beta - 1.$$

The edges of a cube are numbered from $1$ to $12$, then is calculated for each vertex the sum of the numbers of the edges going out from it. a) Prove that these sums cannot all be the same. b) Can eight equal sums result after one of the edge numbers is replaced by the number $13$ ?

Given is a triangle $ABC$. Let the points $P$ and $Q$ be on the sides $AB, AC$, respectively, so that $AP=AQ$, and $PQ$ passes through the incenter $I$. Let $(BPI)$ meet $(CQI)$ at $M$, $PM$ meets $BI$ at $D$ and $QM$ meets $CI$ at $E$. Prove that the line $MI$ passes through the midpoint of $DE$.

The Queen of Hearts rules a kingdom with $n$ (distinguishable) cities. Each pair of cities is either connected with a bridge or not connected with a bridge. Each day, the Queen of Hearts visits $2021$ cities. For every pair of cities, if she sees a bridge she gets angry and destroys it; otherwise she feels nice and constructs a bridge between them. We call two configurations of bridges [i]equivalent[/i] if one can be reached from the other after a finite number of days. Show that there is some integer $M$ such that if $n>M$, two configurations are equivalent if both of the following conditions hold: [list] [*] The parity of the total number of bridges is the same in both configurations [*] For every city, the parity of the number of bridges going out of that city is the same in both configurations. [/list]

Let $ ABC$ be a triangle, and let the angle bisectors of its angles $ CAB$ and $ ABC$ meet the sides $ BC$ and $ CA$ at the points $ D$ and $ F$, respectively. The lines $ AD$ and $ BF$ meet the line through the point $ C$ parallel to $ AB$ at the points $ E$ and $ G$ respectively, and we have $ FG \equal{} DE$. Prove that $ CA \equal{} CB$. [i]Original formulation:[/i] Let $ ABC$ be a triangle and $ L$ the line through $ C$ parallel to the side $ AB.$ Let the internal bisector of the angle at $ A$ meet the side $ BC$ at $ D$ and the line $ L$ at $ E$ and let the internal bisector of the angle at $ B$ meet the side $ AC$ at $ F$ and the line $ L$ at $ G.$ If $ GF \equal{} DE,$ prove that $ AC \equal{} BC.$

Two different $3$ digit numbers are picked and then for every of them is calculated sum of all $5$ numbers which are getting when digits of picked number change place (etc. if one of the number is $707$, the sum is $2401=770+77+77+770+707$). Do the given results must be different?

a) A lamp of a lighthouse enlights an angle of $90$ degrees. Prove that you can turn the lamps of four arbitrary posed lighthouses so, that all the plane will be enlightened. b) There are eight lamps in eight points of the space. Each can enlighten an octant (three-faced space polygon with three mutually orthogonal edges). Prove that you can turn them so, that all the space will be enlightened.

We have placed some red and blue points along a circle. The following operations are permitted: (a) we may add a red point somewhere and switch the color of its neighbors, (b) we may take off a red point from somewhere and switch the color of its neighbors (if there are at least $3$ points on the circle and there is a red one too). Initially, there are two blue points on the circle. Using a number of these operations, can we reach a state with exactly two red point?

Find all functions $f : Z \to Z$ such that $f (2m + f (m) + f (m)f (n)) = nf (m) + m$ for any integers $m, n$

Consider the dark square in an array of unit squares, part of which is shown. The first ring of squares around this center square contains $ 8$ unit squares. The second ring contains $ 16$ unit squares. If we continue this process, the number of unit squares in the $ 100^\text{th}$ ring is $ \textbf{(A)}\ 396 \qquad \textbf{(B)}\ 404 \qquad \textbf{(C)}\ 800 \qquad \textbf{(D)}\ 10,\!000 \qquad \textbf{(E)}\ 10,\!404$ [asy]unitsize(3mm); defaultpen(linewidth(1pt)); fill((2,2)--(2,7)--(7,7)--(7,2)--cycle, mediumgray); fill((3,3)--(6,3)--(6,6)--(3,6)--cycle, gray); fill((4,4)--(5,4)--(5,5)--(4,5)--cycle, black); for(real i=0; i<=9; ++i) { draw((i,0)--(i,9)); draw((0,i)--(9,i)); }[/asy]

Determine all integer triplets $(x,y,z)$ such that \[x^4+x^2=7^zy^2\mbox{.}\]

Denote by $d(n)$ be the biggest prime divisor of $|n|>1$. Find all polynomials with integer coefficients satisfy; $$P(n+d(n))=n+d(P(n)) $$ for the all $|n|>1$ integers such that $P(n)>1$ and $d(P(n))$ can be defined.