[b]p1.[/b] There are $5$ weights of masses $1,2,3,5$, and $10$ grams. One of the weights is counterfeit (its weight is different from what is written, it is unknown if the weight is heavier or lighter). How to find the counterfeit weight using simple balance scales only twice? [b]p2.[/b] There are $998$ candies and chocolate bars and $499$ bags. Each bag may contain two items (either two candies, or two chocolate bars, or one candy and one chocolate bar). Ann distributed candies and chocolate bars in such a way that half of the candies share a bag with a chocolate bar. Helen wants to redistribute items in the same bags in such a way that half of the chocolate bars would share a bag with a candy. Is it possible to achieve that? [b]p3.[/b] Insert in sequence $2222222222$ arithmetic operations and brackets to get the number $999$ (For instance, from the sequence $22222$ one can get the number $45$: $22*2+2/2 = 45$). [b]p4.[/b] Put numbers from $15$ to $23$ in a $ 3\times 3$ table in such a way to make all sums of numbers in two neighboring cells distinct (neighboring cells share one common side). [b]p5.[/b] All integers from $1$ to $200$ are colored in white and black colors. Integers $1$ and $200$ are black, $11$ and $20$ are white. Prove that there are two black and two white numbers whose sums are equal. [b]p6.[/b] Show that $38$ is the sum of few positive integers (not necessarily, distinct), the sum of whose reciprocals is equal to $1$. (For instance, $11=6+3+2$, $1/16+1/13+1/12=1$.) PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

The natural numbers $a$ and $b$ are such that $a^a$ is divisible by $b^b$. Can we say that then $a$ is divisible by $b$?

A sequence of positive reals $\{ a_n \}$ is defined below. $$a_0 = 1, a_1 = 3, a_{n+2} = \frac{a_{n+1}^2+2}{a_n}$$ Show that for all nonnegative integer $n$, $a_n$ is a positive integer.

Let $ABCC_1B_1A_1$ be a convex hexagon such that $AB=BC$, and suppose that the line segments $AA_1, BB_1$, and $CC_1$ have the same perpendicular bisector. Let the diagonals $AC_1$ and $A_1C$ meet at $D$, and denote by $\omega$ the circle $ABC$. Let $\omega$ intersect the circle $A_1BC_1$ again at $E \neq B$. Prove that the lines $BB_1$ and $DE$ intersect on $\omega$.

Let $n\geqslant 2$ be a positive integer. Paul has a $1\times n^2$ rectangular strip consisting of $n^2$ unit squares, where the $i^{\text{th}}$ square is labelled with $i$ for all $1\leqslant i\leqslant n^2$. He wishes to cut the strip into several pieces, where each piece consists of a number of consecutive unit squares, and then [i]translate[/i] (without rotating or flipping) the pieces to obtain an $n\times n$ square satisfying the following property: if the unit square in the $i^{\text{th}}$ row and $j^{\text{th}}$ column is labelled with $a_{ij}$, then $a_{ij}-(i+j-1)$ is divisible by $n$. Determine the smallest number of pieces Paul needs to make in order to accomplish this.

Let $\omega$ be a semicircle and $AB$ its diameter. $\omega_1$ and $\omega_2$ are two different circles, both tangent to $\omega$ and to $AB$, and $\omega_1$ is also tangent to $\omega_2$. Let $P,Q$ be the tangent points of $\omega_1$ and $\omega_2$ to $AB$ respectively, and $P$ is between $A$ and $Q$. Let $C$ be the tangent point of $\omega_1$ and $\omega$. Find $\tan\angle ACQ$.

Let $n$ be a positive integer. A \emph{pseudo-Gangnam Style} is a dance competition between players $A$ and $B$. At time $0$, both players face to the north. For every $k\ge 1$, at time $2k-1$, player $A$ can either choose to stay stationary, or turn $90^{\circ}$ clockwise, and player $B$ is forced to follow him; at time $2k$, player $B$ can either choose to stay stationary, or turn $90^{\circ}$ clockwise, and player $A$ is forced to follow him. After time $n$, the music stops and the competition is over. If the final position of both players is north or east, $A$ wins. If the final position of both players is south or west, $B$ wins. Determine who has a winning strategy when: (a) $n=2013^{2012}$ (b) $n=2013^{2013}$

Consider a triangle $ABC$, inscribed in $O$ and $\angle A < \angle B$. Some point $P$ outside the circle satisfies $$\angle A=\angle PBA =180^{\circ}- \angle PCB$$ Let $D$ be the intersection of line $PB$ and $O$(different from $B$), and $Q$ the intersection of the tangent line of $O$ passing through $A$ and line $CD$. Show that $CQ : AB=AQ^2:AD^2$.

It is given the function $f:\left( \mathbb{R} - \{0\} \right) \times \left( \mathbb{R}-\{0\} \right) \to \mathbb{R}$ such that $f(a,b)= \left| \frac{|b-a|}{|ab|}+\frac{b+a}{ab}-1 \right|+ \frac{|b-a|}{|ab|}+ \frac{b+a}{ab}+1$ where $a,b \not=0$. Prove that: \[ f(a,b)=4 \cdot \text{max} \left\{\frac{1}{a},\frac{1}{b},\frac{1}{2} \right\}\]

Find all functions $f: \mathbb{R}^+\to\mathbb{R}$ such that $f(x+y)=f(x^2)+f(y^2)$ for any $x,y \in\mathbb{R}^+$

In a plane there is an ellipse $E$ with semiaxis $a,b$. Consider all the triangles inscribed in $E$ such that at least one of its sides is parallel to one of the axis of $E$. Find both the locus of the centroid of all such triangles and its area.

Let be two natural numbers $ n\ge 2, k, $ and $ k\quad n\times n $ symmetric real matrices $ A_1,A_2,\ldots ,A_k. $ Then, the following relations are equivalent: $ 1)\quad \left| \sum_{i=1}^k A_i^2 \right| =0 $ $ 2)\quad \left| \sum_{i=1}^k A_iB_i \right| =0,\quad\forall B_1,B_2,\ldots ,B_k\in \mathcal{M}_n\left( \mathbb{R} \right) $ $ || $ [i]denotes the determinant.[/i]

Let $a, b, c$ be positive reals with $abc = 1$. Prove the inequality $$\frac{a^5}{a^3 + 1}+\frac{b^5}{b^3 + 1}+\frac{c^5}{c^3 + 1} \ge \frac32$$ and determine all values of a, b, c for which equality is attained

Determine the integers $x$ such that $2^x + x^2 + 25$ is the cube of a prime number

Given two convex polygons, $A_1A_2...A_n$ and $B_1B_2...B_n$ such that $A_1A_2 = B_1B_2$, $A_2A_3 = B_2B_3$,$ ...$, $A_nA_1 = B_nB_1$ and $n - 3$ angles of one polygon are equal to the respective angles of the other. Find whether these polygons are equal.

Let $n$ points be given inside a rectangle $R$ such that no two of them lie on a line parallel to one of the sides of $R$. The rectangle $R$ is to be dissected into smaller rectangles with sides parallel to the sides of $R$ in such a way that none of these rectangles contains any of the given points in its interior. Prove that we have to dissect $R$ into at least $n + 1$ smaller rectangles. [i]Proposed by Serbia[/i]