A house has an even number of lamps distributed among its rooms in such a way that there are at least three lamps in every room. Each lamp shares a switch with exactly one other lamp, not necessarily from the same room. Each change in the switch shared by two lamps changes their states simultaneously. Prove that for every initial state of the lamps there exists a sequence of changes in some of the switches at the end of which each room contains lamps which are on as well as lamps which are off. [i]Proposed by Australia[/i]

In tetrahedron $ABCD$, edge $AB$ has length 3 cm. The area of face $ABC$ is 15 $\text{cm}^2$ and the area of face $ABD$ is 12 $\text{cm}^2$. These two faces meet each other at a $30^\circ$ angle. Find the volume of the tetrahedron in $\text{cm}^3$.

Find the maximal value of $c>0$ such that for any $n\ge 1$, and for any $n$ real numbers $x_1, \cdots, x_n$ there exists real numbers $a ,b$ such that $$\{x_i-a\}+\{x_{i+1}-b\}\le \frac{1}{2024}$$ for at least $cn$ indices $i$. Here, $x_{n+1}=x_1$ and $\{x\}$ denotes the fractional part of $x$. [i]Proposed by Wong Jer Ren[/i]

There are $n \ge 2$ houses on the northern side of a street. Going from the west to the east, the houses are numbered from 1 to $n$. The number of each house is shown on a plate. One day the inhabitants of the street make fun of the postman by shuffling their number plates in the following way: for each pair of neighbouring houses, the currnet number plates are swapped exactly once during the day. How many different sequences of number plates are possible at the end of the day?

On the diagonal $AC$ of the rhombus $ABCD$, a point $E$ is taken, which is different from points $A$ and $C$, and on the lines $AB$ and $BC$ are points $N$ and $M$, respectively, with $AE = NE$ and $CE = ME$. Let $K$ be the intersection point of lines $AM$ and $CN$. Prove that points $K, E$ and $D$ are collinear.

Find all the finite sets $A$ of real positive numbers having at least two elements, with the property that $a^2 + b^2 \in A$ for every $a, b \in A$ with $a \ne b$

There are several equal (possibly overlapping) square-shaped napkins on a rectangular table, with sides parallel to the sides of the table. Prove that it is possible to nail some of them to the table in such a way that every napkin is nailed exactly once.

A polynomial $ P(x)$ with integer coefficients is called good,if it can be represented as a sum of cubes of several polynomials (in variable $ x$) with integer coefficients.For example,the polynomials $ x^3 \minus{} 1$ and $ 9x^3 \minus{} 3x^2 \plus{} 3x \plus{} 7 \equal{} (x \minus{} 1)^3 \plus{} (2x)^3 \plus{} 2^3$ are good. a)Is the polynomial $ P(x) \equal{} 3x \plus{} 3x^7$ good? b)Is the polynomial $ P(x) \equal{} 3x \plus{} 3x^7 \plus{} 3x^{2008}$ good? Justify your answers.

Let $n$ be a positive integer and $p$ be a prime number such that $np+1$ is a perfect square. Prove that $n+1$ can be written as the sum of $p$ perfect squares.

$ f: \mathbb N \times \mathbb Z \rightarrow \mathbb Z$ satisfy the given conditions $ a)$ $ f(0,0)\equal{}1$ , $ f(0,1)\equal{}1$ , $ b)$ $ \forall k \notin \left\{0,1\right\}$ $ f(0,k)\equal{}0$ and $ c)$ $ \forall n \geq 1$ and $ k$ , $ f(n,k)\equal{}f(n\minus{}1,k)\plus{}f(n\minus{}1,k\minus{}2n)$ find the sum $ \displaystyle\sum_{k\equal{}0}^{\binom{2009}{2}}f(2008,k)$

Let $a,b, c$ be real numbers with $a+b+c = 2018$. Suppose $x, y$, and $z$ are the distinct positive real numbers which are satisfied $a = x^2 - yz - 2018, b = y^2 - zx - 2018$ , and $c = z^2 - xy - 2018$. Compute the value of the following expression $P = \frac{\sqrt{a^3 + b^3 + c^3 - 3abc}}{x^3 + y^3 + z^3 - 3xyz}$

For a non-isosceles $ABC$ we have that $2AC = AB + BC$. Point $I$ is the center of the circle inscribed in $\triangle ABC$, point $K$ is the middle of the arc $\widehat{AC}$ that includes point $B$, and point $T$ is from the line $AC$, such that $\angle TIB = 90^\circ$. Prove that the line $TB$ is tangent to the circumscribed circle of $\triangle KBI$.

Let $n > k$ be positive integers and let $F$ be a family of finite sets with the following properties: i. $F$ contains at least $\binom{n}{k}+ 1$ distinct sets containing exactly $k$ elements; ii. For any two sets $A, B \in F$ their union, i.e., $A \cup B$ also belongs to $F$. Prove that $F$ contains at least three sets with at least $n$ elements.

Markers in the colors violet, cyan, octarine and gamma were placed on all fields of a $41\times 5$ chessboard. Show that there are four squares of the same color that form the vertices of a rectangle whose edges are parallel to those of the board.

There are $36$ cards in a deck arranged in the sequence spades, clubs, hearts, diamonds, spades, clubs, hearts, diamonds, etc. Somebody took part of this deck off the top, turned it upside down, and cut this part into the remaining part of the deck (i.e. inserted it between two consecutive cards). Then four cards were taken off the top, then another four, etc. Prove that in any of these sets of four cards, all the cards are of different suits. (A Merkov, Moscow)

Let $k$ be a positive integer with the following property: For every subset $A$ of $\{1,2,\ldots, 25\}$ with $|A|=k$, we can find distinct elements $x$ and $y$ of $A$ such that $\tfrac23\leq\tfrac xy\leq\tfrac 32$. Find the smallest possible value of $k$.

Calculate the volume $ V $ of tetrahedron $ ABCD $ given the length $ d $ of edge $ AB $ and the area $ S $ of the projection of the tetrahedron on the plane perpendicular to the line $ AB $.

Let $P(x)=a_d x^d+\dots+a_1 x+a_0$ be a non-constant polynomial with non-negative integer coefficients having $d$ rational roots.Prove that $$\text{lcm} \left(P(m),P(m+1),\dots,P(n) \right)\geq m \dbinom{n}{m}$$ for all $n>m$ [i](Navid Safaei, Iran)[/i]

Let $n$ be a positive integer. $n$ letters are written around a circle, each $A$, $B$, or $C$. When the letters are read in clockwise order, the sequence $AB$ appears $100$ times, the sequence $BA$ appears $99$ times, and the sequence $BC$ appears $17$ times. How many times does the sequence $CB$ appear?

Let $\vartriangle ABC$ be a triangle with $\angle ABC > \angle BCA \ge 30^o$ . The angle bisectors of $\angle ABC$ and $\angle BCA$ intersect $CA$ and $AB$ at $D$ and $E$ respectively, and $BD$ and $CE$ intersect at $P$. Suppose that $P D = P E$ and the incircle of $\vartriangle ABC$ has unit radius. What is the maximum possible length of $BC$?

Let $n$ be a positive integer. Ana and Banana are playing the following game: First, Ana arranges $2n$ cups in a row on a table, each facing upside-down. She then places a ball under a cup and makes a hole in the table under some other cup. Banana then gives a finite sequence of commands to Ana, where each command consists of swapping two adjacent cups in the row. Her goal is to achieve that the ball has fallen into the hole during the game. Assuming Banana has no information about the position of the hole and the position of the ball at any point, what is the smallest number of commands she has to give in order to achieve her goal?

Let $ABC$ be an acute-angled triangle with height intersection $H$. Let $G$ be the intersection of parallel of $AB$ through $H$ with the parallel of $AH$ through $B$. Let $I$ be the point on the line $GH$, so that $AC$ bisects segment $HI$. Let $J$ be the second intersection of $AC$ and the circumcircle of the triangle $CGI$. Show that $IJ = AH$

The diagram shows a $20$ by $20$ square $ABCD$. The points $E$, $F$, and $G$ are equally spaced on side $BC$. The points $H$, $I$, $J$, and $K$ on side $DA$ are placed so that the triangles $BKE$, $EJF$, $FIG$, and $GHC$ are isosceles. Points $L$ and $M$ are midpoints of the sides $AB$ and $CD$, respectively. Find the total area of the shaded regions. [asy] size(175); defaultpen(linewidth(0.8)); real r=20/8; pair x[]; draw(origin--(0,20)--(20,20)--(20,0)--cycle); string label[]={"B","K","E","J","F","I","G","H","C"}; for(int i=1;i<=7;i=i+1) { if(floor(i/2)==i/2) { x[i]=(i*r,0); label("$"+label[i]+"$",x[i],S); } else { x[i]=(i*r,20); label("$"+label[i]+"$",x[i],N); } } filldraw(origin--x[1]--x[2]--x[3]--x[4]--x[5]--x[6]--x[7]--(20,0)--(20,10)--(0,10)--cycle,gray); label("$B$",origin,SW); label("$C$",(20,0),SE); label("$A$",(0,20),NW); label("$D$",(20,20),NE); label("$M$",(20,10),E); label("$L$",(0,10),W); [/asy]

Let $ABC$ be a triangle and $D$ point on side $BC$ such that $AD$ is angle bisector of angle $\angle BAC$. Let $E$ be the intersection of the side $AB$ with circle $\omega_1$ which has diameter $CD$ and let $F$ be the intersection of the side $AC$ with circle $\omega_2$ which has diameter $BD$. Suppose that there exist points $P\in\omega_1$ and $Q\in\omega_2$ such that $E, P, Q$ and $F$ are collinear and on this order. Prove that $AD, BQ$ and $CP$ are concurrent. [i]Proposed by Dorlir Ahmeti, Kosovo and Noah Walsh, U.S.A.[/i]

In an acute traingle $ABC$ with $AB< BC$ let $BH_b$ be its altitude, and let $O$ be the circumcenter. A line through $H_b$ parallel to $CO$ meets $BO$ at $X$. Prove that $X$ and the midpoints of $AB$ and $AC$ are collinear.