Find all functions $f:(0,+\infty) \to (0,+\infty)$ that satisfy $(i)$ $f(xf(y))=yf(x), \forall x,y > 0,$ $(ii)$ $\displaystyle\lim_{x\to+\infty} f(x) = 0.$

Reimu has a wooden cube. In each step, she creates a new polyhedron from the previous one by cutting off a pyramid from each vertex of the polyhedron along a plane through the trisection point on each adjacent edge that is closer to the vertex. For example, the polyhedron after the first step has six octagonal faces and eight equilateral triangular faces. How many faces are on the polyhedron after the fifth step?

There are $n$ blocks placed on the unit squares of a $n \times n$ chessboard such that there is exactly one block in each row and each column. Find the maximum value $k$, in terms of $n$, such that however the blocks are arranged, we can place $k$ rooks on the board without any two of them threatening each other. (Two rooks are not threatening each other if there is a block lying between them.)

Equilateral $\triangle ABC$ is inscribed in a circle of radius 2. Extend $\overline{AB}$ through $B$ to point $D$ so that $AD=13$, and extend $\overline{AC}$ through $C$ to point $E$ so that $AE=11$. Through $D$, draw a line $l_1$ parallel to $\overline{AE}$, and through $E$, draw a line ${l}_2$ parallel to $\overline{AD}$. Let $F$ be the intersection of ${l}_1$ and ${l}_2$. Let $G$ be the point on the circle that is collinear with $A$ and $F$ and distinct from $A$. Given that the area of $\triangle CBG$ can be expressed in the form $\frac{p\sqrt{q}}{r}$, where $p$, $q$, and $r$ are positive integers, $p$ and $r$ are relatively prime, and $q$ is not divisible by the square of any prime, find $p+q+r$.

$a$ and $b$ are positive integers. When written in binary, $a$ has $2004$ $1$'s, and $b$ has $2005$ $1$'s (not necessarily consecutive). What is the smallest number of $1$'s $a + b$ could possibly have?

(a) In how many ways can $1003$ distinct integers be chosen from the set $\{1, 2, ... , 2003\}$ so that no two of the chosen integers differ by $10?$ (b) Show that there are $(3(5151) + 7(1700)) 101^7$ ways to choose $1002$ distinct integers from the set $\{1, 2, ... , 2003\}$ so that no two of the chosen integers differ by $10.$

Find the largest natural number $n$ for which the product of the numbers $n, n+1, n+2, \ldots, n+20$ is divisible by the square of one of them.

Prove that in an isosceles triangle $ \triangle ABC$ with $ AC\equal{}BC\equal{}b$ following inequality holds $ b> \pi r$, where $ r$ is inradius.

Let $a,b$ and $c$ be positive real numbers . Prove that\[\left | \frac{4(b^3-c^3)}{b+c}+ \frac{4(c^3-a^3)}{c+a}+ \frac{4(a^3-b^3)}{a+b} \right |\leq (b-c)^2+(c-a)^2+(a-b)^2.\]

Let $ n>1$ be an odd integer and define: \[ N\equal{}\{\minus{}n,\minus{}(n\minus{}1),\dots,\minus{}1,0,1,\dots,(n\minus{}1),n\}.\] A subset $ P$ of $ N$ is called [i]basis[/i] if we can express every element of $ N$ as the sum of $ n$ different elements of $ P$. Find the smallest positive integer $ k$ such that every $ k\minus{}$elements subset of $ N$ is basis.

Let $ABC$ be a triangle with interior angle bisectors $AA_1, BB_1, CC_1$ and incenter $I$. If $\sigma[IA_1B] + \sigma[IB_1C] + \sigma[IC_1A] = \frac{1}{2}\sigma[ABC]$, where $\sigma[ABC]$ denotes the area of $ABC$, show that $ABC$ is isosceles.

5. $A$ and $B$ play alternating turns on a $2012 \times 2013$ board with enough pieces of the following types: Type $1$: Piece like Type $2$ but with one square at the right of the bottom square. Type $2$: Piece of $2$ consecutive squares, one over another. Type $3$: Piece of $1$ square. At his turn, $A$ must put a piece of the type $1$ on available squares of the board. $B$, at his turn, must put exactly one piece of each type on available squares of the board. The player that cannot do more movements loses. If $A$ starts playing, decide who has a winning strategy. Note: The pieces can be rotated but cannot overlap; they cannot be out of the board. The pieces of the types $1$, $2$ and $3$ can be put on exactly $3$, $2$ and $1$ squares of the board respectively.

Let $ABCD$ be an isosceles trapezoid with bases $AB$ and $CD$. Prove that the centroid of triangle $ABD$ lies on $CF$ where $F$ is the projection of $D$ to $AB$.

Given a positive integer $n$, determine the maximal constant $C_n$ satisfying the following condition: for any partition of the set $\{1,2,\ldots,2n \}$ into two $n$-element subsets $A$ and $B$, there exist labellings $a_1,a_2,\ldots,a_n$ and $b_1,b_2,\ldots,b_n$ of $A$ and $B$, respectively, such that $$ (a_1-b_1)^2+(a_2-b_2)^2+\ldots+(a_n-b_n)^2\ge C_n. $$ [i](B. Serankou, M. Karpuk)[/i]

In a certain year, January had exactly four Tuesdays and four Saturdays. On what day did January $ 1$ fall that year? \[ \textbf{(A)}\ \text{Monday} \qquad \textbf{(B)}\ \text{Tuesday} \qquad \textbf{(C)}\ \text{Wednesday} \qquad \textbf{(D)}\ \text{Friday} \qquad \textbf{(E)}\ \text{Saturday} \]

[b]p1.[/b] We say that integers $a$ and $b$ are [i]friends [/i] if their product is a perfect square. Prove that if $a$ is a friend of $b$, then $a$ is a friend of $gcd (a, b)$. [b]p2.[/b] On the island of knights and liars, a traveler visited his friend, a knight, and saw him sitting at a round table with five guests. "I wonder how many knights are among you?" he asked. " Ask everyone a question and find out yourself" advised him one of the guests. "Okay. Tell me one: Who are your neighbors?" asked the traveler. This question was answered the same way by all the guests. "This information is not enough!" said the traveler. "But today is my birthday, do not forget it!" said one of the guests. "Yes, today is his birthday!" said his neighbor. Now the traveler was able to find out how many knights were at the table. Indeed, how many of them were there if [i]knights always tell the truth and liars always lie[/i]? [b]p3.[/b] A rope is folded in half, then in half again, then in half yet again. Then all the layers of the rope were cut in the same place. What is the length of the rope if you know that one of the pieces obtained has length of $9$ meters and another has length $4$ meters? [b]p4.[/b] The floor plan of the palace of the Shah is a square of dimensions $6 \times 6$, divided into rooms of dimensions $1 \times 1$. In the middle of each wall between rooms is a door. The Shah orders his architect to eliminate some of the walls so that all rooms have dimensions $2 \times 1$, no new doors are created, and a path between any two rooms has no more than $N$ doors. What is the smallest value of $N$ such that the order could be executed? [b]p5.[/b] There are $10$ consecutive positive integers written on a blackboard. One number is erased. The sum of remaining nine integers is $2011$. Which number was erased? PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].