In a triangle $ABC, AB = c, BC = a, CA = b$, and $a < b < c$. Points $B'$ and $A'$ are chosen on the rays $BC$ and $AC$ respectively so that $BB'= AA'= c$. Points $C''$ and $B''$ are chosen on the rays $CA$ and $BA$ so that $CC'' = BB'' = a$. Find the ratio of the segment $A'B'$ to the segment $C'' B''$. (R Zhenodarov)

The number of digits in $4^{16} 5^{25}$ (when written in the usual base 10 form) is A. 31 B. 30 C. 29 D. 28 E. 27

For a natural number $ n, $ a string $ s $ of $ n $ binary digits and a natural number $ k\le n, $ define an $ n,s,k$ [i]-block[/i] as a string of $ k $ consecutive elements from $ s. $ We say that two $ n,s,k\text{-blocks} , $ namely, $ a_1a_2\ldots a_k,b_1b_2\ldots b_k, $ are [i]incompatible[/i] if there exists an $ i\in\{1,2,\ldots ,k\} $ such that $ a_i\neq b_i. $ Also, for two natural numbers $ r\le n, l, $ we say that $ s $ is $ r,l $ [i]-typed[/i] if there are, at most, $ l $ pairwise incompatible $ n,s,r\text{-blocks} . $ Let be a $ 3,7\text{-typed} $ string $ t $ consisting of $ 10000 $ binary digits. Determine the maximum number $ M $ that satisfies the condition that $ t $ is $ 10,M\text{-typed} . $ [i]Cătălin Gherghe[/i]

Complex number $\omega$ satisfies $\omega^5 = 2$. Find the sum of all possible values of $\omega^4 + \omega^3 + \omega^2 + \omega + 1$.

In a certain city, age is reckoned in terms of real numbers rather than integers. Every two citizens $x$ and $x'$ either know each other or do not know each other. Moreover, if they do not, then there exists a chain of citizens $x = x_0, x_1, \ldots, x_n = x'$ for some integer $n \geq 2$ such that $ x_{i-1}$ and $x_i$ know each other. In a census, all male citizens declare their ages, and there is at least one male citizen. Each female citizen provides only the information that her age is the average of the ages of all the citizens she knows. Prove that this is enough to determine uniquely the ages of all the female citizens.

[asy] size(2.5inch); pair A = (-2,0), B = 2dir(150), D = (2,0), C; draw(A..(0,2)..D--cycle); C = intersectionpoint(A..(0,2)..D,Circle(B,arclength(A--B))); draw(A--B--C--D--cycle); label("$A$",A,W); label("$B$",B,NW); label("$C$",C,N); label("$D$",D,E); label("$4$",A--D,S); label("$1$",A--B,E); label("$1$",B--C,SE); //Credit to chezbgone2 for the diagram[/asy] Quadrilateral $ABCD$ is inscribed in a circle with side $AD$, a diameter of length $4$. If sides $AB$ and $BC$ each have length $1$, then side $CD$ has length $\textbf{(A) }\frac{7}{2}\qquad\textbf{(B) }\frac{5\sqrt{2}}{2}\qquad\textbf{(C) }\sqrt{11}\qquad\textbf{(D) }\sqrt{13}\qquad \textbf{(E) }2\sqrt{3}$

In a triangle $ABC$, right in $A$ and isosceles, let $D$ be a point on the side $AC$ ($A \ne D \ne C$) and $E$ be the point on the extension of $BA$ such that the triangle $ADE$ is isosceles. Let $P$ be the midpoint of segment $BD$, $R$ be the midpoint of the segment $CE$ and $Q$ the intersection point of $ED$ and $BC$. Prove that the quadrilateral $ARQP$ is a square.

We say that a positive integer $k$ is tricubic if there are three positive integers $a, b, c,$ not necessarily different, such that $k=a^3+b^3+c^3.$ a) Prove that there are infinitely many positive integers $n$ that satisfy the following condition: exactly one of the three numbers $n, n+2$ and $n+28$ is tricubic. b) Prove that there are infinitely many positive integers $n$ that satisfy the following condition: exactly two of the three numbers $n, n+2$ and $n+28$ are tricubic. c) Prove that there are infinitely many positive integers $n$ that satisfy the following condition: the three numbers $n, n+2$ and $n+28$ are tricubic.

In $\triangle ABC$, $X, Y$, are points on BC such that $BX=XY=YC$, $M , N$ are points on $AC$ such that $AM=MN=NC$. $BM$ and $BN$ intersect $AY$ at $S$ and $R$ and respectively. If the area of $\triangle ABC$ is $1$, find the area of $SMNR$.

A rectangular sheet of paper is folded so that one corner lies on top of the corner diagonally opposite. The resulting shape is a pentagon whose area is $20\%$ one-sheet thick, and $80\%$ two-sheets-thick. Determine the ratio of the two sides of the original sheet of paper.

Let $p> 3$ be a prime number and let $q = \frac{4^p-1}{3}$. Show that $q$ is a composite integer as well is a divisor of $2^{q-1}- 1$.

Let $f(x) = x^3 - 3x + b$ and $g(x) = x^2 + bx -3$, where $b$ is a real number. What is the sum of all possible values of $b$ for which the equations $f(x)$ = 0 and $g(x) = 0$ have a common root?

Find the smallest positive three-digit integer $n$ such that $3^n+4^n$ is divisible by $5$.

Call $A \in \mathbb{N}^0$ be $number of year$ if all digits of $A$ equals $0$, $1$ or $2$ (in decimal representation). Prove that exist infinity $N \in \mathbb{N}$, such that $N$ can't presented as $A^2+B$ where $A \in \mathbb{N}^0 ; B$- $number of year$.

$f(0) = 0$ $f(1) = 1$ $f(2) = 3$ $f(3) = 5$ $f(4) = 9$ $f(5) = 11$ $f(6) = 29$ $f(11) = 31$ $f(20) = ? $

Consider a sequence of numbers $(a_1, a_2, \ldots , a_{2^n}).$ Define the operation \[S\biggl((a_1, a_2, \ldots , a_{2^n})\biggr) = (a_1a_2, a_2a_3, \ldots , a_{2^{n-1}a_{2^n}, a_{2^n}a_1).}\] Prove that whatever the sequence $(a_1, a_2, \ldots , a_{2^n})$ is, with $a_i \in \{-1, 1\}$ for $i = 1, 2, \ldots , 2^n,$ after finitely many applications of the operation we get the sequence $(1, 1, \ldots, 1).$

Let $A_1A_2 ... A_8$ be a convex octagon such that all of its sides are equal and its opposite sides are parallel. For each $i = 1, ... , 8$, define $B_i$ as the intersection between segments $A_iA_{i+4}$ and $A_{i-1}A_{i+1}$, where $A_{j+8} = A_j$ and $B_{j+8} = B_j$ for all $j$. Show some number $i$, amongst 1, 2, 3, and 4 satisfies \[\frac{A_iA_{i+4}}{B_iB_{i+4}} \leq \frac{3}{2}\]

What is the largest amount of elements that can be taken from the set $\{1, 2, ... , 2012, 2013\}$, such that within them there are no distinct three, say $a$, $b$,and $c$, such that $a$ is a divisor or multiple of $b-c$?

We will say that a rearrangement of the letters of a word has no [i]fixed letters[/i] if, when the rearrangement is placed directly below the word, no column has the same letter repeated. For instance $HBRATA$ is a rearragnement with no fixed letter of $BHARAT$. How many distinguishable rearrangements with no fixed letters does $BHARAT$ have? (The two $A$s are considered identical.)

Let $S(k)$ denote the digit-sum of a positive integer $k$(in base $10$). Determine the smallest positive integer $n$ such that \[S(n^2 ) = S(n) - 7\]

Find all polynomials $p(x)$ with real coefficients that satisfy $$4p(x^2) = 4(p(x))^2 + 4p(x)- 1$$

Find all functions $f: \mathbb{Z} \rightarrow \mathbb{Z}$ which satisfy \[ f(m + f(n)) = f(m) + n \] for all $m,n \in \mathbb{Z}$.

Find all natural numbers less than $105$ that are divisible by $1999$ and whose digits sum (in decimal notation) to $25$.

Let $ABCDE$ be a convex pentagon such that $BC \parallel AE,$ $AB = BC + AE,$ and $\angle ABC = \angle CDE.$ Let $M$ be the midpoint of $CE,$ and let $O$ be the circumcenter of triangle $BCD.$ Given that $\angle DMO = 90^{\circ},$ prove that $2 \angle BDA = \angle CDE.$ [i]Proposed by Nazar Serdyuk, Ukraine[/i]

A family wears clothes of three colors: red,blue and green,with a separate,identical laundry bin for each color. At the beginning of the first week,all bins are empty.Each week,the family generates a total of $10 kg $ of laundry(the proportion of each color is subject to variation).The laundry is sorted by color and placed in the bins.Next,the heaviest bin(only one of them,if there are several that are heaviest)is emptied and its content swashed.What is the minimal possible storing capacity required of the laundry bins in order for them never to overflow?