A fisherman has caught a number of fish. The three heaviest together make up $35\%$ of the total weight of the catch. He sells them. After that, the three lightest make up together $5/13$ of the weight of the rest. How many fish did he catch?

Let $ABC$ be a triangle. Circle $\Omega$ passes through points $B$ and $C$. Circle $\omega$ is tangent internally to $\Omega$ and also to sides $AB$ and $AC$ at $T,~ P,$ and $Q$, respectively. Let $M$ be midpoint of arc $\widehat{BC}$ (containing T) of $\Omega$. Prove that lines $P Q,~ BC,$ and $MT$ are concurrent.

How many points does one have to place on a unit square to guarantee that two of them are strictly less than 1/2 unit apart?

In tetrahedron $ABCD$ let $h_a, h_b, h_c$ and $h_d$ be the lengths of the altitudes from each vertex to the opposite side of that vertex. Prove that \[\frac{1}{h_a} <\frac{1}{h_b}+\frac{1}{h_c}+\frac{1}{h_d}.\]

Set $A$ consists of natural numbers such that these numbers can be expressed as $2x^2+3y^2,$ where $x$ and $y$ are integers. $(x^2+y^2\not=0)$ $a)$ Prove that there is no perfect square in the set $A.$ $b)$ Prove that multiple of odd number of elements of the set $A$ cannot be a perfect square.

$n$ balls are placed independently uniformly at random into $n$ boxes. One box is selected at random, and is found to contain $b$ balls. Let $e_n$ be the expected value of $b^4$. Find $$\lim_{n \to \infty}e_n.$$

Four identical squares and one rectangle are placed together to form one large square as shown. The length of the rectangle is how many times as large as its width? [asy]unitsize(8mm); defaultpen(linewidth(.8pt)); draw(scale(4)*unitsquare); draw((0,3)--(4,3)); draw((1,3)--(1,4)); draw((2,3)--(2,4)); draw((3,3)--(3,4));[/asy]$ \textbf{(A)}\ \frac {5}{4} \qquad \textbf{(B)}\ \frac {4}{3} \qquad \textbf{(C)}\ \frac {3}{2} \qquad \textbf{(D)}\ 2 \qquad \textbf{(E)}\ 3$

Find the number of pairs $(a, b)$ of positive integers with the property that the greatest common divisor of $a$ and $ b$ is equal to $1\cdot 2 \cdot 3\cdot ... \cdot50$, and the least common multiple of $a$ and $ b$ is $1^2 \cdot 2^2 \cdot 3^2\cdot ... \cdot 50^2$.

Determine if there exists an infinite sequence of positive integers $a_1,a_2, a_3, ...$ such that (i) each positive integer occurs exactly once in the sequence, and (ii) each positive integer occurs exactly once in the sequence $ |a_1 - a_2|, |a_2 - a_3|, ..., |a+k - a_{k+1}|, ...$

$\displaystyle 2n$ students $\displaystyle (n \geq 5)$ participated at table tennis contest, which took $\displaystyle 4$ days. In every day, every student played a match. (It is possible that the same pair meets twice or more times, in different days) Prove that it is possible that the contest ends like this: - there is only one winner; - there are $\displaystyle 3$ students on the second place; - no student lost all $\displaystyle 4$ matches. How many students won only a single match and how many won exactly $\displaystyle 2$ matches? (In the above conditions)

Let $ A^{\prime}$ be an arbitrary point on the side $ BC$ of a triangle $ ABC$. Denote by $ \mathcal{T}_{A}^{b}$, $ \mathcal{T}_{A}^{c}$ the circles simultanously tangent to $ AA^{\prime}$, $ A^{\prime}B$, $ \Gamma$ and $ AA^{\prime}$, $ A^{\prime}C$, $ \Gamma$, respectively, where $ \Gamma$ is the circumcircle of $ ABC$. Prove that $ \mathcal{T}_{A}^{b}$, $ \mathcal{T}_{A}^{c}$ are congruent if and only if $ AA^{\prime}$ passes through the Nagel point of triangle $ ABC$. ([i]If $ M,N,P$ are the points of tangency of the excircles of the triangle $ ABC$ with the sides of the triangle $ BC$, $ CA$ and $ AB$ respectively, then the Nagel point of the triangle is the intersection point of the lines $ AM$, $ BN$ and $ CP$[/i].)

Let $T$ be the triangle in the coordinate plane with vertices $\left(0,0\right)$, $\left(4,0\right)$, and $\left(0,3\right)$. Consider the following five isometries (rigid transformations) of the plane: rotations of $90^{\circ}$, $180^{\circ}$, and $270^{\circ}$ counterclockwise around the origin, reflection across the $x$-axis, and reflection across the $y$-axis. How many of the $125$ sequences of three of these transformations (not necessarily distinct) will return $T$ to its original position? (For example, a $180^{\circ}$ rotation, followed by a reflection across the $x$-axis, followed by a reflection across the $y$-axis will return $T$ to its original position, but a $90^{\circ}$ rotation, followed by a reflection across the $x$-axis, followed by another reflection across the $x$-axis will not return $T$ to its original position.) $\textbf{(A) } 12\qquad\textbf{(B) } 15\qquad\textbf{(C) }17 \qquad\textbf{(D) }20 \qquad\textbf{(E) }25$

Let $ a$, $ b$, and $ c$ be non-negative real numbers and let $ x$, $ y$, and $ z$ be positive real numbers such that $ a\plus{}b\plus{}c\equal{}x\plus{}y\plus{}z$. Prove that \[ \dfrac{a^3}{x^2}\plus{}\dfrac{b^3}{y^2}\plus{}\dfrac{c^3}{z^2} \ge a\plus{}b\plus{}c.\] [i]Hery Susanto, Malang[/i]

Juan wrote a natural number and Maria added a digit $ 1$ to the left and a digit $ 1$ to the right. Maria's number exceeds to the number of Juan in $14789$. Find the number of Juan.

Find all triples $(a,b,c)$ satisfying the following conditions: (i) $a,b,c$ are prime numbers, where $a<b<c<100$. (ii) $a+1,b+1,c+1$ form a geometric sequence.

A social club has $2k+1$ members, each of whom is fluent in the same $k$ languages. Any pair of members always talk to each other in only one language. Suppose that there were no three members such that they use only one language among them. Let $A$ be the number of three-member subsets such that the three distinct pairs among them use different languages. Find the maximum possible value of $A$.