Let $ABCD$ be a cyclic quadrilateral such that $AC =56, BD = 65, BC>DA$ and $AB: BC =CD: DA$. Find the ratio of areas $S (ABC): S (ADC)$.

There is child camp with some rooms. Call room as $4-$room, if $4$ children live here. Not less then half of all rooms are $4-$rooms , other rooms are $3-$rooms. Not less than $2/3$ girls live in $3-$rooms. Prove that not less than $35\%$ of all children are boys.

Suppose that $f : \mathbb R^+ \to \mathbb R^+$ is a decreasing function such that \[f(x+y)+f(f(x)+f(y))=f(f(x+f(y))+f(y+f(x)), \quad \forall x,y \in \mathbb R^+.\] Prove that $f(x) = f^{-1}(x).$

Prove that for any finite graph G there is a constant c(G)>0 such that for every n-point graph that does not have an induced subgraph isomorphic to G, there are two disjoint sets of vertices, each with at least $n^{c(G)}$ elements, between which either all edges are connected, or none of the edges are.

Let $a,b,c$ be reals and \[f(a, b, c) = \left| \frac{ |b-a|}{|ab|} +\frac{b+a}{ab} -\frac 2c \right| +\frac{ |b-a|}{|ab|} +\frac{b+a}{ab} +\frac 2c\] Prove that $f(a, b, c) = 4 \max \{\frac 1a, \frac 1b,\frac 1c \}.$

Two 10-digit integers are called neighbours if they differ in exactly one digit (for example, integers $1234567890$ and $1234507890$ are neighbours). Find the maximal number of elements in the set of 10-digit integers with no two integers being neighbours.

Cities $A$ and $B$ are $45$ miles apart. Alicia lives in $A$ and Beth lives in $B$. Alicia bikes towards $B$ at 18 miles per hour. Leaving at the same time, Beth bikes toward $A$ at 12 miles per hour. How many miles from City $A$ will they be when they meet? $\textbf{(A) }20\qquad\textbf{(B) }24\qquad\textbf{(C) }25\qquad\textbf{(D) }26\qquad\textbf{(E) }27$

Let $A$ be a point outside the circle $\omega$. Two points $B, C$ lie on $\omega$ such that $AB, AC$ are tangent to $\omega$. Let $D$ be any point on $\omega$ ($D$ is neither $B$ nor $C$) and $M$ the foot of perpendicular from $B$ to $CD$. The line through $D$ and the midpoint of $BM$ meets $\omega$ again at $P$. Prove that $AP \perp CP$

A grasshopper is sitting at an integer point in the Euclidean plane. Each second it jumps to another integer point in such a way that the jump vector is constant. A hunter that knows neither the starting point of the grasshopper nor the jump vector (but knows that the jump vector for each second is constant) wants to catch the grasshopper. Each second the hunter can choose one integer point in the plane and, if the grasshopper is there, he catches it. Can the hunter always catch the grasshopper in a finite amount of time?

Find the largest $p_n$ such that $p_n+\sqrt{p_{n-1}+\sqrt{p_{n-2}+\sqrt{\ldots+\sqrt{p_1}}}}\leq 100$, where $p_n$ denotes the $n^{\text{th}}$ prime number.

An $ 8$-foot by $ 10$-foot floor is tiled with square tiles of size $ 1$ foot by $ 1$ foot. Each tile has a pattern consisting of four white quarter circles of radius $ 1/2$ foot centered at each corner of the tile. The remaining portion of the tile is shaded. How many square feet of the floor are shaded? [asy]unitsize(2cm); defaultpen(linewidth(.8pt)); fill(unitsquare,gray); filldraw(Arc((0,0),.5,0,90)--(0,0)--cycle,white,black); filldraw(Arc((1,0),.5,90,180)--(1,0)--cycle,white,black); filldraw(Arc((1,1),.5,180,270)--(1,1)--cycle,white,black); filldraw(Arc((0,1),.5,270,360)--(0,1)--cycle,white,black);[/asy]$ \textbf{(A)}\ 80\minus{}20\pi \qquad \textbf{(B)}\ 60\minus{}10\pi \qquad \textbf{(C)}\ 80\minus{}10\pi \qquad \textbf{(D)}\ 60\plus{}10\pi \qquad \textbf{(E)}\ 80\plus{}10\pi$

Given a triangle $PQX$ in the plane, with $PQ = 3, PX = 2.6$ and $QX = 3.8$. Construct a right-angled triangle $ABC$ such that the incircle of $\vartriangle ABC$ touches $AB$ at $P$ and $BC$ at $Q$, and point $X$ lies on the line $AC$.

Stoyan and Nikolai have two $100\times 100$ chess boards. Both of them number each cell with the numbers $1$ to $10000$ in some way. Is it possible that for every two numbers $a$ and $b$, which share a common side in Nikolai's board, these two numbers are at a knight's move distance in Stoyan's board (that is, a knight can move from one of the cells to the other one with a move)? [i]Nikolai Beluhov[/i]

A finite set $\mathcal{S}$ of distinct real numbers has the following properties: the mean of $\mathcal{S}\cup\{1\}$ is 13 less than the mean of $\mathcal{S}$, and the mean of $\mathcal{S}\cup\{2001\}$ is 27 more than the mean of $\mathcal{S}.$ Find the mean of $\mathcal{S}.$

Consider the set of points that are inside or within one unit of a rectangular parallelepiped (box) that measures 3 by 4 by 5 units. Given that the volume of this set is $(m + n \pi)/p$, where $m$, $n$, and $p$ are positive integers, and $n$ and $p$ are relatively prime, find $m + n + p$.

Consider the parabola consisting of the points $(x, y)$ in the real plane satisfying $$(y + x) = (y - x)^2 + 3(y - x) + 3.$$ Find the minimum possible value of $y$.

In triangle $ ABC$, $ M$ is the midpoint of side $ BC$ and $ G$ is the centroid of triangle $ ABC$. A line $ l$ passes through $ G$, intersecting line $ AB$ at $ P$ and line $ AC$ at $ Q$, where $ P\ne B$ and $ Q\ne C$. If $ [XYZ]$ denotes the area of triangle $ XYZ$, show that $ \frac{[BGM]}{[PAG]}\plus{}\frac{[CMG]}{[QGA]}\equal{}\frac32$.

Ali has $100$ cards with numbers $1,2,\ldots,100$. Ali and Amin play a game together. In each step, first Ali chooses a card from the remaining cards and Amin decides to pick that card for himself or throw it away. In the case that he picks the card, he can't pick the next card chosen by Amin, and he has to throw it away. This action repeats until when there is no remaining card for Ali. Amin wants to pick cards in a way that the sum of the number of his cards is maximized and Ali wants to choose cards in a way that the sum of the number of Amin's cards is minimized. Find the most value of $k$ such that Amin can play in a way that is sure the sum of the number of his cards will be at least equal to $k$.

Find all values of real parameter $a$ for which equation $2{\sin}^4(x)+{\cos}^4(x)=a$ has real solutions

Michael is celebrating his fifteenth birthday today. How many Sundays have there been in his lifetime?

Let $A_1, A_2, \ldots, A_n$ be an $n$ -sided regular polygon. If $\frac{1}{A_1 A_2} = \frac{1}{A_1 A_3} + \frac{1}{A_1A_4}$, find $n$.

A line, which passes through the incentre $I$ of the triangle $ABC$, meets its sides $AB$ and $BC$ at the points $M$ and $N$ respectively. The triangle $BMN$ is acute. The points $K,L$ are chosen on the side $AC$ such that $\angle ILA=\angle IMB$ and $\angle KC=\angle INB$. Prove that $AM+KL+CN=AC$. [i]S. Berlov[/i]

Seven different positive integers are written on a sheet of paper. The result of the multiplication of the seven numbers is the cube of a whole number. If the largest of the numbers written on the sheet is $N$, determine the smallest possible value of $N$. Show an example for that value of $N$ and explain why $N$ cannot be smaller.

Determine all functions $f:\mathbb{Z}^+\to \mathbb{Z}$ which satisfy the following condition for all pairs $(x,y)$ of [i]relatively prime[/i] positive integers: \[f(x+y) = f(x+1) + f(y+1).\]

The ratio of the length to the width of a rectangle is $4:3$. If the rectangle has diagonal of length $d$, then the area may be expressed as $kd^2$ for some constant $k$. What is $k$? $\textbf{(A) }\dfrac27\qquad\textbf{(B) }\dfrac37\qquad\textbf{(C) }\dfrac{12}{25}\qquad\textbf{(D) }\dfrac{16}{25}\qquad\textbf{(E) }\dfrac34$