If the sum of the first $3n$ positive integers is $150$ more than the sum of the first $n$ positive integers, then the sum of the first $4n$ positive integers is $\textbf{(A) }300\qquad\textbf{(B) }350\qquad\textbf{(C) }400\qquad\textbf{(D) }450\qquad \textbf{(E) }600$

Determine the length of $BC$ in an acute triangle $ABC$ with $\angle ABC = 45^{\circ}$, $OG = 1$ and $OG \parallel BC$. (As usual $O$ is the circumcenter and $G$ is the centroid.)

An $n\times n$ square is divided into $n^2$ unit cells. Is it possible to cover this square with some layers of 4-cell figures of the following shape [img]https://cdn.artofproblemsolving.com/attachments/5/7/d42a8011ec4c5c91c337296d8033d412fade5c.png[/img](i.e. each cell of the square must be covered with the same number of these figures) if a) $n=6$? b) $n=7$? (The sides of each figure must coincide with the sides of the cells; the figures may be rotated and turned over, but none of them can go beyond the bounds of the square.)

It is known that each vertex of the convex polyhedron $P$ belongs to three different faces, and each vertex of $P$ can be dyed black and white, so that the two endpoints of each edge of $P$ are different colors. Proof: The interior of each edge of $P$ can be dyed red, yellow, and blue, so that the colors of the three edges connected to each vertex are different, and each face contains two colors of edges. [i]Created by Liang Xiao[/i]

The natural numbers are written in succession, forming a sequence of digits$$12345678910111213141516171819202122232425262728293031\ldots$$Determine how many digits the natural number has that contributes to this sequence with the digit in position $10^{2000}$. Clarification: The natural number that contributes to the sequence with the digit in position $10$ has $2$ digits, because it is $10$; The natural number that contributes to the sequence with the digit at position $10^2$ has $2$ digits, because it is $55$.

Given an initial integer $ n_0 > 1$, two players, $ {\mathcal A}$ and $ {\mathcal B}$, choose integers $ n_1$, $ n_2$, $ n_3$, $ \ldots$ alternately according to the following rules : [b]I.)[/b] Knowing $ n_{2k}$, $ {\mathcal A}$ chooses any integer $ n_{2k \plus{} 1}$ such that \[ n_{2k} \leq n_{2k \plus{} 1} \leq n_{2k}^2. \] [b]II.)[/b] Knowing $ n_{2k \plus{} 1}$, $ {\mathcal B}$ chooses any integer $ n_{2k \plus{} 2}$ such that \[ \frac {n_{2k \plus{} 1}}{n_{2k \plus{} 2}} \] is a prime raised to a positive integer power. Player $ {\mathcal A}$ wins the game by choosing the number 1990; player $ {\mathcal B}$ wins by choosing the number 1. For which $ n_0$ does : [b]a.)[/b] $ {\mathcal A}$ have a winning strategy? [b]b.)[/b] $ {\mathcal B}$ have a winning strategy? [b]c.)[/b] Neither player have a winning strategy?

Let $ABCD$ be a convex quadrilateral with the property that $AB$ extended and $CD$ extended intersect at a right angle. Prove that $AC\cdot BD>AD\cdot BC$.

Let us say that the pair $(m, n)$ of two positive different integers m and n is [i]nice [/i] if $mn$ and $(m + 1)(n + 1)$ are perfect squares. Prove that for each positive integer m there exists at least one $n > m$ such that the pair $(m, n)$ is nice. (Yury Markelov)

For $a,b,c$ positive real numbers such that $ab+bc+ca=3$, prove: $ \frac{a}{\sqrt{a^3+5}}+\frac{b}{\sqrt{b^3+5}}+\frac{c}{\sqrt{c^3+5}} \leq \frac{\sqrt{6}}{2}$ [i]Proposed by Dorlir Ahmeti, Albania[/i]

Prove that one can always mark $50$ points inside of any convex $100$-gon, so that each its vertix is on a straight line connecting some two marked points. (4)

Phoenix is counting positive integers starting from $1$. When he counts a perfect square greater than $1$, he restarts at $1$, skipping that square the next time. For example, the first $10$ numbers Phoenix counts are $1$, $2$, $3$, $4$, $1$, $2$, $3$, $5$, $6$, $7$, $...$ How many numbers will Phoenix have counted after counting 1$00$ for the first time?

Starting from an equilateral triangle with perimeter $P_0$, we carry out the following iterations: the first iteration consists of dividing each side of the triangle into three segments of equal length, construct an exterior equilateral triangle on each of the middle segments, and then remove these segments (bases of each new equilateral triangle formed). The second iteration consists of apply the same process of the first iteration on each segment of the resulting figure after the first iteration. Successively, follow the other iterations. Let $A_n$ be the area of the figure after the $n$- th iteration, and let $P_n$ the perimeter of the same figure. If $A_n = P_n$, find the value of $P_0$ (in its simplest form).

Let $BD$ and $CE$ be the bisectors of the interior angles $\angle B$ and $\angle C$, respectively ($D\in AC$, $E\in AB$). Consider the circumcircle of $ABC$ with center $O$ and the excircle corresponding to the side $BC$ with center $I_a$. These two circles intersect at points $P$ and $Q$. (a) Prove that $PQ$ is parallel to $DE$. (b) Prove that $I_aO$ is perpendicular to $DE$.

Let $k\ge2$ be an integer. Find the smallest integer $n \ge k+1$ with the property that there exists a set of $n$ distinct real numbers such that each of its elements can be written as a sum of $k$ other distinct elements of the set.

Let $ A$ and $ B$ be fixed distinct points on the $ X$ axis, none of which coincides with the origin $ O(0, 0),$ and let $ C$ be a point on the $ Y$ axis of an orthogonal Cartesian coordinate system. Let $ g$ be a line through the origin $ O(0, 0)$ and perpendicular to the line $ AC.$ Find the locus of the point of intersection of the lines $ g$ and $ BC$ if $ C$ varies along the $ Y$ axis. Give an equation and a description of the locus.

Consider the cube $ABCDEFGH$ and denote by, respectively, $M$ and $N$ the midpoints of $[AB]$ and $[CD]$. Let $P$ be a point on the line defined by $[AE]$ and $Q$ the point of intersection of the lines defined by $[PM]$ and $[BF]$. Prove that the triangle $[PQN]$ is isosceles. [img]https://cdn.artofproblemsolving.com/attachments/0/0/57559efbad87903d087c738df279b055b4aefd.png[/img]