Prove that there are exactly three right-angled triangles whose sides are integers while the area is numerically equal to twice the perimeter.

Maria has a board of size $n \times n$, initially with all the houses painted white. Maria decides to paint black some houses on the board, forming a mosaic, as shown in the figure below, as follows: she paints black all the houses from the edge of the board, and then leaves white the houses that have not yet been painted. Then she paints the houses on the edge of the next remaining board again black, and so on. a) Determine a value of $n$ so that the number of black houses equals $200$. b) Determine the smallest value of $n$ so that the number of black houses is greater than $2012$.

Find all pairs of positive integers $(m,n)$, for which $$(m^n-n)^m=n!+m$$ [i]D. Volkovets[/i]

100 people from 50 countries, two from each countries, stay on a circle. Prove that one may partition them onto 2 groups in such way that neither no two countrymen, nor three consecutive people on a circle, are in the same group.

The 9 members of a baseball team went to an ice-cream parlor after their game. Each player had a singlescoop cone of chocolate, vanilla, or strawberry ice cream. At least one player chose each flavor, and the number of players who chose chocolate was greater than the number of players who chose vanilla, which was greater than the number of players who chose strawberry. Let $N$ be the number of different assignments of flavors to players that meet these conditions. Find the remainder when $N$ is divided by $1000.$

Let $\{a_n\}_{n\geq 1}$ be a sequence with $a_1=1$, $a_2=4$ and for all $n>1$, \[ a_{n} = \sqrt{ a_{n-1}a_{n+1} + 1 } . \] a) Prove that all the terms of the sequence are positive integers. b) Prove that $2a_na_{n+1}+1$ is a perfect square for all positive integers $n$. [i]Valentin Vornicu[/i]

A round table has radius $ 4$. Six rectangular place mats are placed on the table. Each place mat has width $ 1$ and length $ x$ as shown. They are positioned so that each mat has two corners on the edge of the table, these two corners being end points of the same side of length $ x$. Further, the mats are positioned so that the inner corners each touch an inner corner of an adjacent mat. What is $ x$? [asy]unitsize(4mm); defaultpen(linewidth(.8)+fontsize(8)); draw(Circle((0,0),4)); path mat=(-2.687,-1.5513)--(-2.687,1.5513)--(-3.687,1.5513)--(-3.687,-1.5513)--cycle; draw(mat); draw(rotate(60)*mat); draw(rotate(120)*mat); draw(rotate(180)*mat); draw(rotate(240)*mat); draw(rotate(300)*mat); label("$x$",(-2.687,0),E); label("$1$",(-3.187,1.5513),S);[/asy]$ \textbf{(A)}\ 2\sqrt {5} \minus{} \sqrt {3} \qquad \textbf{(B)}\ 3 \qquad \textbf{(C)}\ \frac {3\sqrt {7} \minus{} \sqrt {3}}{2} \qquad \textbf{(D)}\ 2\sqrt {3} \qquad \textbf{(E)}\ \frac {5 \plus{} 2\sqrt {3}}{2}$

Let ABC be an acute-angle triangle with BC > CA. Let O, H and F be the circumcenter, orthocentre and the foot of its altitude CH, respectively. Suppose that the perpendicular to OF at F meet the side CA at P. Prove FHP = BAC.

Let $n$ be a fixed positive integer. Compute over $\mathbb{R}$ the minimum of the following polynomial: \[f(x)=\sum_{t=0}^{2n}(2n+1-t)x^t.\]

Archipelago consists of $ n$ islands : $ I_1,I_2,...,I_n$ and $ a_1,a_2,...,a_n$ - number of the roads on each island. $ a_1 \equal{} 55$, $ a_k \equal{} a_{k \minus{} 1} \plus{} (k \minus{} 1)$, ($ k \equal{} 2,3,...,n$) a) Does there exist an island with 2008 roads? b) Calculate $ a_1 \plus{} a_2 \plus{} ... \plus{} a_n.$

Natural numbers from $1$ to $200$ were divided into $50$ sets. Prove that one of them contains three numbers that are the lengths of the sides of some triangle

Let $ABC$ be a triangle with $AB=5$, $BC=7$, and $CA=8$. Let $D$ be a point on $BC$, and define points $B'$ and $C'$ on line $AD$ (or its extension) such that $BB'\perp AD$ and $CC'\perp AD$. If $B'A=B'C'$, then the ratio $BD:DC$ can be expressed in the form $m:n$, where $m$ and $n$ are relatively prime positive integers. Compute $100m+n$. [i]Proposed by Michael Ren[/i]

You have a set of five weights, together with a balance that allows you to compare the weight of two things. The weights are known to be $10$, $20$,$30$,$40$ and $50$ grams, but are otherwise identical except for their labels. The $10$ and $50$ gram weights are clearly labelled, but the labels have been erased on the remaining weights. Using the balance exactly once, is it possible to determine what one of the three unlabelled weights is? If so, explain how, and if not, explain why not.

Let $n$ and $k$ be positive integers. Prove that for $a_1, \dots, a_n \in [1,2^k]$ one has \[ \sum_{i = 1}^n \frac{a_i}{\sqrt{a_1^2 + \dots + a_i^2}} \le 4 \sqrt{kn}. \]

The sides of a triangle have lengths $6.5$, $10$, and $s$, where $s$ is a whole number. What is the smallest possible value of $s$? [asy] pair A,B,C; A=origin; B=(10,0); C=6.5*dir(15); dot(A); dot(B); dot(C); draw(B--A--C); draw(B--C,dashed); label("$6.5$",3.25*dir(15),NNW); label("$10$",(5,0),S); label("$s$",(8,1),NE); [/asy] $\text{(A)}\ 3 \qquad \text{(B)}\ 4 \qquad \text{(C)}\ 5 \qquad \text{(D)}\ 6 \qquad \text{(E)}\ 7$

A program works as follows. If the input is given a natural number $n$ ($n \ge 2$), then the program consecutively performs the following procedure: it determines the greatest proper divisor of the number $ n$ (that is, different from $1$ and $n$) and subtracts it from the number $n$, then applies again the same procedure to the obtained result and so on. If the program cannot find any proper divisor of the given number at a step, then it stops and outputs the total number $m$ of procedures performed (this number can be equal to $0$). The input was given the number $n = 13^{13}$. Determine the respective number $m$ at the output.

A store prices an item in dollars and cents so that when 4% sales tax is added, no rounding is necessary because the result is exactly $n$ dollars where $n$ is a positive integer. The smallest value of $n$ is $\text{(A)} \ 1 \qquad \text{(B)} \ 13 \qquad \text{(C)} \ 25 \qquad \text{(D)} \ 26 \qquad \text{(E)} \ 100$

Random sequences $a_1, a_2, . . .$ and $b_1, b_2, . . .$ are chosen so that every element in each sequence is chosen independently and uniformly from the set $\{0, 1, 2, 3, . . . , 100\}$. Compute the expected value of the smallest nonnegative integer $s$ such that there exist positive integers $m$ and $n$ with $$s =\sum^m_{i=1} a_i =\sum^n_{j=1}b_j .$$

Define the two sequences $a_0, a_1, a_2, \cdots$ and $b_0, b_1, b_2, \cdots$ by $a_0 = 3$ and $b_0 = 1$ with the recurrence relations $a_{n+1} = 3a_n + b_n$ and $b_{n+1} = 3b_n - a_n$ for all nonnegative integers $n.$ Let $r$ and $s$ be the remainders when $a_{32}$ and $b_{32}$ are divided by $31,$ respectively. Compute $100r + s.$

$(CZS 5)$ A convex quadrilateral $ABCD$ with sides $AB = a, BC = b, CD = c, DA = d$ and angles $\alpha = \angle DAB, \beta = \angle ABC, \gamma = \angle BCD,$ and $\delta = \angle CDA$ is given. Let $s = \frac{a + b + c +d}{2}$ and $P$ be the area of the quadrilateral. Prove that $P^2 = (s - a)(s - b)(s - c)(s - d) - abcd \cos^2\frac{\alpha +\gamma}{2}$

Find all positive integers $k>1$, such that there exist positive integer $n$, such that the number $A=17^{18n}+4.17^{2n}+7.19^{5n}$ is product of $k$ consecutive positive integers.

For breakfast, Mihir always eats a bowl of Lucky Charms cereal, which consists of oat pieces and marshmallow pieces. He denes the luckiness of a bowl of cereal to be the ratio of the number of marshmallow pieces to the total number of pieces. One day, Mihir notices that his breakfast cereal has exactly $90$ oat pieces and $9$ marshmallow pieces, and exclaims, "This is such an unlucky bowl!" How many marshmallow pieces does Mihir need to add to his bowl to double its luckiness?

Segment $\overline{PQ}$ is drawn and squares $ABPQ$ and $CDQP$ are constructed in the plane such that they lie on opposite sides of segment $\overline{PQ}.$ If $PQ=1,$ find $BD.$

Let $ABC$ be the triangle in which $AB> AC$. Circle $\omega_a$ touches the segment of the $BC$ at point $D$, the extension of the segment $AB$ towards point $B$ at the point $F$, and the extension of the segment $AC$ towards point $C$ at the point $E$. The ray $AD$ intersects circle $\omega_a$ for second time at point $M$. Denote the circle circumscribed around the triangle $CDM$ by $\omega$. Circle $\omega$ intersects the segment $DF$ at N. Prove that $FN > ND$.

Find integer $n$ such that both $n-86$ and $n + 86$ are perfect squares.