Let $a, b, c,$ and $d$ be real numbers such that $a \geq b \geq c \geq d$ and $$a+b+c+d = 13$$ $$a^2+b^2+c^2+d^2=43.$$ Show that $ab \geq 3 + cd$.

At each integer point of the numerical line a lamp with a toggle button is placed. If the button is pressed, a lit lamp is turned off, an unlit one is turned on. Initially all the lamps are unlit. A stencil with a finite set of fixed holes at integer distances is chosen. The stencil may be moved along the line as a rigid body, and for any fixed position of the stencil, one may push simultaneously all the buttons accessible through the holes. Prove that for any stencil it is possible to get exactly two lit lamps after several such operations. (B Ginsburg)

Find all pairs of positive integers $(x, y)$ such that $(xy+1)(xy+x+2)$ be a perfect square .

Let $ABC$ be a triangle such that $BC=AC+\frac{1}{2}AB$. Let $P$ be a point of $AB$ such that $AP=3PB$. Show that $\widehat{PAC} = 2 \widehat{CPA}.$

Let $a_1, a_2, a_3, a_4, a_5, a_6, a_7, a_8$ be real numbers which satisfy \[ S_3=S_{11}=1, \quad S_7=S_{15}=-1, \quad\text{and}\quad S_5 = S_9 = S_{13} = 0, \quad \text{where}\quad S_n = \sum_{\substack{1 \le i < j \le 8 \\ i+j = n}} a_ia_j. \] (For example, $S_5 = a_1a_4 + a_2a_3$.) Assuming $|a_1|=|a_2|=1$, the maximum possible value of $a_1^2 + a_2^2 + \dots + a_8^2$ can be written as $a+\sqrt{b}$ for integers $a$ and $b$. Compute $a+b$. [i]Based on a proposal by Nathan Soedjak[/i]

In a convex quadrilateral $ABCD$, diagonals $AC$ and $BD$ are equal, and they intersect at $E$. Perpendicular bisectors of $AB$ and $CD$ intersect at point $P$ lying inside triangle $AED$, and perpendicular bisectors of $BC$ and $DA$ intersect at point $Q$ lying inside triangle $CED$. Prove that $\angle PEQ = 90^\circ$.

An equilateral triangle of side $1$ is covered by five congruent equilateral triangles of side $s < 1$ with sides parallel to those of the larger triangle. Show that some four of these smaller triangles also cover the large triangle.

On a board the numbers $(n-1, n, n+1)$ are written where $n$ is positive integer. On a move choose 2 numbers $a$ and $b$, delete them and write $2a-b$ and $2b-a$. After a succession of moves, on the board there are 2 zeros. Find all possible values for $n$. Proposed by Andrei Eckstein

Let $ABCD$ be a square with side length $8$. Let $M$ be the midpoint of $BC$ and let $\omega$ be the circle passing through $M, A$, and $D$. Let $O$ be the center of $\omega, X$ be the intersection point (besides A) of $\omega$ with $AB$, and $Y$ be the intersection point of $OX$ and $AM$. If the length of $OY$ can be written in simplest form as $\frac{m}{n}$ , compute $m + n$.

Trey and his mom stopped at a railroad crossing to let a train pass. As the train began to pass, Trey counted 6 cars in the first 10 seconds. It took the train 2 minutes and 45 seconds to clear the crossing at a constant speed. Which of the following was the most likely number of cars in the train? $\textbf{(A)}\ 60 \qquad \textbf{(B)}\ 80 \qquad \textbf{(C)}\ 100 \qquad \textbf{(D)}\ 120 \qquad \textbf{(E)}\ 140$

Prove that any positive integer can be represented as an aggregate of different powers of $3$, the terms in the aggregate being combined by the signs $+$ and $-$ appropriately chosen.

The numbers, in order, of each row and the numbers, in order, of each column of a $5 \times 5$ array of integers form an arithmetic progression of length $5{.}$ The numbers in positions $(5, 5), \,(2,4),\,(4,3),$ and $(3, 1)$ are $0, 48, 16,$ and $12{,}$ respectively. What number is in position $(1, 2)?$ \[ \begin{bmatrix} . & ? &.&.&. \\ .&.&.&48&.\\ 12&.&.&.&.\\ .&.&16&.&.\\ .&.&.&.&0\end{bmatrix}\] $\textbf{(A) } 19 \qquad \textbf{(B) } 24 \qquad \textbf{(C) } 29 \qquad \textbf{(D) } 34 \qquad \textbf{(E) } 39$

In a right-angled triangle, the sum $a + b$ of the sides enclosing the right angle equals $24$ while the length of the altitude $h_c$ on the hypotenuse $c$ is $7$. Determine the length of the hypotenuse.

Let $-1 < x < 1.$ Show that \[ \sum^{6}_{k=0} \frac{1 - x^2}{1 - 2 \cdot x \cdot \cos \left( \frac{2 \cdot \pi \cdot k }{7} \right) + x^2} = \frac{7 \cdot \left( 1 + x^7 \right)}{\left( 1 - x^7 \right)}. \] Deduce that \[ \csc^2\left( x + \frac{\pi}{7} \right) + \csc^2\left(2 \cdot x + \frac{\pi}{7} \right) + \csc^2\left(3 \cdot x + \frac{\pi}{7} \right) = 8. \]

[b]p4.[/b] For how many three-digit multiples of $11$ in the form $\underline{abc}$ does the quadratic $ax^2 + bx + c$ have real roots? [b]p5.[/b] William draws a triangle $\vartriangle ABC$ with $AB =\sqrt3$, $BC = 1$, and $AC = 2$ on a piece of paper and cuts out $\vartriangle ABC$. Let the angle bisector of $\angle ABC$ meet $AC$ at point $D$. He folds $\vartriangle ABD$ over $BD$. Denote the new location of point $A$ as $A'$. After William folds $\vartriangle A'CD$ over $CD$, what area of the resulting figure is covered by three layers of paper? [b]p6.[/b] Compute $(1)(2)(3) + (2)(3)(4) + ... + (18)(19)(20)$. PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Let $(x_n)_{n\geq 1}$ be an increasing and unbounded sequence of positive integers such that $x_1=1$ and $x_{n+1}\leq 2x_n$ for all $n\geq 1$. Prove that every positive integer can be written as a finite sum of distinct terms of the sequence. [i]Note:[/i] Two terms $x_i$ and $x_j$ of the sequence are considered distinct if $i\neq j$.

Determine all the pairs of positive real numbers $(a, b)$ with $a < b$ such that the following series $$\sum_{k=1}^{\infty} \int_a^b\{x\}^k dx =\int_a^b\{x\} dx + \int_a^b\{x\}^2 dx + \int_a^b\{x\}^3 dx + \cdots$$ is convergent and determine its value in function of $a$ and $b$. [b]Note: [/b] $\{x\} = x - \lfloor x \rfloor$ denotes the fractional part of $x$.

Consider the points of intersection of the graphs $y = \cos x$ and $x = 100 \cos (100y)$ for which both coordinates are positive. Let $a$ be the sum of their $x$-coordinates and $b$ be the sum of their $y$-coordinates. Determine the value of $\frac{a}{b}$.

Let $E$ be a point on the side $AD$ of the square $ABCD$. Find such points $M$ and $K$ on the sides $AB$ and $BC$ respectively, such that the segments $MK$ and $EC$ are parallel, and the quadrilateral $MKCE$ has the largest area.

Prove that $$\frac{x}{\sqrt{1+x^2}}+\frac{y}{\sqrt{1+y^2}}+\frac{z}{\sqrt{1+z^2}} \leq\frac{3\sqrt{3}}{2}$$ for any positive real numbers $x, y,z$ such that $x+y+z = xyz.$ [url=https://artofproblemsolving.com/community/c7h236610p10925499]2008 VTRMC #1[/url] [url=http://www.math.vt.edu/people/plinnell/Vtregional/solutions.pdf]here[/url]

In order to estimate the value of $x-y$ where $x$ and $y$ are real numbers with $x>y>0$, Xiaoli rounded $x$ up by a small amount, rounded $y$ down by the same amount, and then subtracted her values. Which of the following statements is necessarily correct? $ \textbf{(A)}\ \text{Her estimate is larger than }x-y\\ \textbf{(B)}\ \text{Her estimate is smaller than }x-y\\ \textbf{(C)}\ \text{Her estimate equals }x-y\\ \textbf{(D)}\ \text{Her estimate equals }y-x\\ \textbf{(E)}\ \text{Her estimate is }0 $

Given an acute-angled triangle $ABC$. Let $CB$ be the altitude and $E$ a random point on the line $CD$. Finally, let $P, Q, R$ and $S$ are the projections of $D$ on the straight lines $AC, AE, BE$ and $BC$. Prove that the points $P, Q, R$ and $S$ lie either on a circle or on one straight line.

We call a set $ S$ on the real line $ \mathbb{R}$ [i]superinvariant[/i] if for any stretching $ A$ of the set by the transformation taking $ x$ to $ A(x) \equal{} x_0 \plus{} a(x \minus{} x_0), a > 0$ there exists a translation $ B,$ $ B(x) \equal{} x\plus{}b,$ such that the images of $ S$ under $ A$ and $ B$ agree; i.e., for any $ x \in S$ there is a $ y \in S$ such that $ A(x) \equal{} B(y)$ and for any $ t \in S$ there is a $ u \in S$ such that $ B(t) \equal{} A(u).$ Determine all [i]superinvariant[/i] sets.

A $k$-coloring of a graph $G$ is a coloring of its vertices using $k$ possible colors such that the end points of any edge have different colors. We say a graph $G$ is uniquely $k$-colorable if one hand it has a $k$-coloring, on the other hand there do not exist vertices $u$ and $v$ such that $u$ and $v$ have the same color in one $k$-coloring and $u$ and $v$ have different colors in another $k$-coloring. Prove that if a graph $G$ with $n$ vertices $(n \ge 3)$ is uniquely $3$-colorable, then it has at least $2n-3$ edges.

The natural numbers $ a_1 $, $ a_2 $, $ \dots $, $ a_n $ satisfy the condition $ 1 / a_1 + 1 / a_2 + \ldots + 1 / a_n = 1 $. Prove that all these numbers do not exceed $$ n ^ {2 ^ n} $$