A rectangular floor measures $ a$ by $ b$ feet, where $ a$ and $ b$ are positive integers with $ b > a$. An artist paints a rectangle on the floor with the sides of the rectangle parallel to the sides of the floor. The unpainted part of the floor forms a border of width $ 1$ foot around the painted rectangle and occupies half of the area of the entire floor. How many possibilities are there for the ordered pair $ (a,b)$? $ \textbf{(A)}\ 1\qquad\textbf{(B)}\ 2\qquad\textbf{(C)}\ 3\qquad\textbf{(D)}\ 4\qquad\textbf{(E)}\ 5$

The integer number $n > 1$ is given and a set $S \subset \{0, 1, 2, \ldots, n-1\}$ with $|S| > \frac{3}{4} n$. Prove that there exist integer numbers $a, b, c$ such that the remainders after the division by $n$ of the numbers: \[a, b, c, a+b, b+c, c+a, a+b+c\] belong to $S$.

Let $ABC$ be an acute-angled triangle in which $\angle BAC = 60^o$ and $AB> AC$. Let $H$ and $I$ denote the points of intersection of the altitudes and angle bisectors of this triangle, respectively. Find the ratio $\angle ABC: \angle AHI$.

Consider a regular $n$-gon $A_1A_2\ldots A_n$ with area $S$. Let us draw the lines $l_1,l_2,\ldots,l_n$ perpendicular to the plane of the $n$-gon at $A_1,A_2,\ldots,A_n$ respectively. Points $B_1,B_2,\ldots,B_n$ are selected on lines $l_1,l_2,\ldots,l_n$ respectively so that: (i) $B_1,B_2,\ldots,B_n$ are all on the same side of the plane of the $n$-gon; (ii) Points $B_1,B_2,\ldots,B_n$ lie on a single plane; (iii) $A_1B_1=h_1,A_2B_2=h_2,\ldots,A_nB_n=h_n$. Express the volume of polyhedron $A_1A_2\ldots A_nB_1B_2\ldots B_n$ as a function in $S,h_1,\ldots,h_n$.

Let $ F $ be the primitive of a continuous function $ f:\mathbb{R}\longrightarrow (0,\infty ), $ with $ F(0)=0. $ Determine for which values of $ \lambda \in (0,1) $ the function $ \left( F^{-1}\circ \lambda F \right)/\text{id.} $ has limit at $ 0, $ and calculate it.

Prove that for all $a,b,c \in \mathbb{R}^+_0$ we have \[\frac{a}{bc}+\frac{b}{ac}+\frac{c}{ab} \ge \frac2a+\frac2b-\frac2c\] and determine when equality occurs.

Let $n>2$ be a positive integer. Masha writes down $n$ natural numbers along a circle. Next, Taya performs the following operation: Between any two adjacent numbers $a$ and $b$, she writes a divisor of the number $a+b$ greater than $1$, then Taya erases the original numbers and obtains a new set of $n$ numbers along the circle. Can Taya always perform these operations in such a way that after some number of operations, all the numbers are equal? [i]Proposed by T. Korotchenko[/i]

A circle touches the side $AB$ of the triangle $ABC$ at $A$, touches the side $BC$ at $P$ and intersects the side $AC$ at $Q$. The line symmetrical to $PQ$ with respect to $AC$ meets the line $AP$ at $X$. Prove that $PC=CX$. [i]Proposed by S. Berlov[/i]

Let $ A \equal{} (a_{ij})$, where $ i,j \equal{} 1,2,\ldots,n$, be a square matrix with all $ a_{ij}$ non-negative integers. For each $ i,j$ such that $ a_{ij} \equal{} 0$, the sum of the elements in the $ i$th row and the $ j$th column is at least $ n$. Prove that the sum of all the elements in the matrix is at least $ \frac {n^2}{2}$.

$n$ is a fixed natural number. Find the least $k$ such that for every set $A$ of $k$ natural numbers, there exists a subset of $A$ with an even number of elements which the sum of it's members is divisible by $n$.

The lengths of the three sides of a $ \triangle ABC $ are rational. The altitude $ CD $ determines on the side $AB$ two segments $ AD $ and $ DB $. Prove that $ AD, DB $ are rational.

[b]5.[/b] Find the continuous solutions of the functional equation $f(xyz)= f(x)+f(y)+f(z)$ in the following cases: (a) $x,y,z$ are arbitrary non-zero real numbers; (b) $a<x,y,z<b (1<a^{3}<b)$. [b](R. 13)[/b]

Greater or less than one is the number $0.99999^{1.00001} \cdot 1.00001^{0.99999}$?

Let $n$ be a positive integer, and denote by $\mathbb{Z}_n$ the ring of integers modulo $n$. Suppose that there exists a function $f:\mathbb{Z}_n\to\mathbb{Z}_n$ satisfying the following three properties: (i) $f(x)\neq x$, (ii) $f(f(x))=x$, (iii) $f(f(f(x+1)+1)+1)=x$ for all $x\in\mathbb{Z}_n$. Prove that $n\equiv 2 \pmod4$. (Proposed by Ander Lamaison Vidarte, Berlin Mathematical School, Germany)

Let $a, b$ and $c$ be positive real numbers. Show that $\frac{a+b}{c^2}+ \frac{c+a}{b^2}+ \frac{b+c}{a^2}\ge \frac{9}{a+b+c}+\frac{1}{a}+\frac{1}{b}+\frac{1}{c}$

A sequence of pairwise distinct positive integers is called averaging if each term after the first two is the average of the previous two terms. Let $M$ be the maximum possible number of terms in an averaging sequence in which every term is less than or equal to $2022$ and let $N$ be the number of such distinct sequences (every term less than or equal to $2022$) with exactly $M$ terms. What is $M+N?$ (Two sequences $a_1, a_2, \cdots, a_n$ and $b_1, b_2, \cdots, b_n$ are said to be distinct if $a_i \neq b_i$ for some integer $1 \leq i \leq n$). [i]Proposed by Kyle Lee[/i]

Every point with integer coordinates in the plane is the center of a disk with radius $1/1000$. (1) Prove that there exists an equilateral triangle whose vertices lie in different discs. (2) Prove that every equilateral triangle with vertices in different discs has side-length greater than $96$. [i]Radu Gologan, Romania[/i] [hide="Remark"] The "> 96" in [b](b)[/b] can be strengthened to "> 124". By the way, part [b](a)[/b] of this problem is the place where I used [url=http://mathlinks.ro/viewtopic.php?t=5537]the well-known "Dedekind" theorem[/url]. [/hide]

A grasshopper jumps either $364$ or $715$ units on the real number line. If it starts from the point $0$, what is the smallest distance that the grasshoper can be away from the point $2010$? $ \textbf{(A)}\ 5 \qquad\textbf{(B)}\ 8 \qquad\textbf{(C)}\ 18 \qquad\textbf{(D)}\ 34 \qquad\textbf{(E)}\ 164 $

On a circular table sit $\displaystyle {n> 2}$ students. First, each student has just one candy. At each step, each student chooses one of the following actions: (A) Gives a candy to the student sitting on his left or to the student sitting on his right. (B) Separates all its candies in two, possibly empty, sets and gives one set to the student sitting on his left and the other to the student sitting on his right. At each step, students perform the actions they have chosen at the same time. A distribution of candy is called legitimate if it can occur after a finite number of steps. Find the number of legitimate distributions. (Two distributions are different if there is a student who has a different number of candy in each of these distributions.) （Forgive my poor English）

$ABCD$ is a cyclic quadrilateral and $AC$ intersects $BD$ at $E$. $M, N$ are the midpoints of $AB, CD$, respectively. $\odot(AMN)$ meets $\odot(ABCD)$ again at $P$. $\odot(CMN)$ meets $\odot(ABCD)$ again at $Q$. $\odot(PEQ)$ meets $BD$ again at $T$. Prove that $M,N,T$ are colinear. [i]Proposed by chengbilly[/i]

The solution of the equations \begin{align*} 2x-3y&=7 \\ 4x-6y &=20 \\ \end{align*} is: $ \textbf{(A)}\ x=18, y=12 \qquad \textbf{(B)}\ x=0, y=0 \qquad \textbf{(C)}\ \text{There is no solution} \\ \textbf{(D)}\ \text{There are an unlimited number of solutions} \qquad \textbf{(E)}\ x=8, y=5$

Let $SABC$ is pyramid, such that $SA\le 4$, $SB\ge 7$, $SC\ge 9$, $AB=5$, $BC\le 6$ and $AC\le 8$. Find max value capacity(volume) of the pyramid $SABC$.

We are given an $18\times 18$ table, all of whose cells may be black or white. Initially all the cells are coloured white. We may perform the following operation: choose one column or one row and change the colour of all cells in this column or row. Is it possible by repeating the operation to obtain a table with exactly $16$ black cells?

For a sequence $a_1<a_2<\cdots<a_n$ of integers, a pair $(a_i,a_j)$ with $1\leq i<j\leq n$ is called [i]interesting[/i] if there exists a pair $(a_k,a_l)$ of integers with $1\leq k<l\leq n$ such that $$\frac{a_l-a_k}{a_j-a_i}=2.$$ For each $n\geq 3$, find the largest possible number of interesting pairs in a sequence of length $n$.

Given points $A, M, M_1$ and rational number $\lambda \neq -1$. Construct the triangle $ABC$, such that $M$ lies on $BC$ and $M_1$ lies on $B_1C_1$ ($B_1, C_1$ are the projections of $B, C$ on $AC, AB$ respectively), and $\frac{BM}{MC}=\frac{B_1M_1}{M_1C_1}=\lambda.$