A polygon can be dissected into $100$ rectangles, but it cannot be dissected into $99$ rectangles. Prove that this polygon cannot be dissected into $100$ triangles.

Let $h_1$ and $h_2$ be the altitudes of a triangle drawn to the sides with length $5$ and $2\sqrt 6$, respectively. If $5+h_1 \leq 2\sqrt 6 + h_2$, what is the third side of the triangle? $ \textbf{(A)}\ 5 \qquad\textbf{(B)}\ 7 \qquad\textbf{(C)}\ 2\sqrt 6 \qquad\textbf{(D)}\ 3\sqrt 6 \qquad\textbf{(E)}\ 5\sqrt 3 $

A student concentrates on solving quadratic equations in $\mathbb{R}$. He starts with a first quadratic equation $x^2 + ax + b = 0$ where $a$ and $b$ are both different from 0. If this first equation has solutions $p$ and $q$ with $p \leq q$, he forms a second quadratic equation $x^2 + px + q = 0$. If this second equation has solutions, he forms a third quadratic equation in an identical way. He continues this process as long as possible. Prove that he will not obtain more than five equations.

1) Prove that there are infinitely many positive integers $n$ such that there exists a permutation of $1, 2, 3, . . . , n$ with the property that the difference between any two adjacent numbers is equal to either $2015$ or $2016$. 2) Let $k$ be a positive integer. Is the statement in 1) still true if we replace the numbers $2015$ and $2016$ by $k$ and $k + 2016$, respectively?

Find the largest prime $p$ such that $p$ divides $2^{p+1} + 3^{p+1} + 5^{p+1} + 7^{p+1}$.

Find all sequences $\left(a_0,a_1,a_2,a_3\right)$, where for each $k$, $0\leq k\leq3$, $a_k$ is the number of times that the number $k$ appears in the sequence $\left(a_0,a_1,a_2,a_3\right)$.

Sides $AB,BC,CD$ and $DA$ of convex polygon $ABCD$ have lengths 3,4,12, and 13, respectively, and $\measuredangle CBA$ is a right angle. The area of the quadrilateral is [asy] size(200); defaultpen(linewidth(0.7)+fontsize(10)); real r=degrees((12,5)), s=degrees((3,4)); pair D=origin, A=(13,0), C=D+12*dir(r), B=A+3*dir(180-(90-r+s)); draw(A--B--C--D--cycle); markscalefactor=0.05; draw(rightanglemark(A,B,C)); pair point=incenter(A,C,D); label("$A$", A, dir(point--A)); label("$B$", B, dir(point--B)); label("$C$", C, dir(point--C)); label("$D$", D, dir(point--D)); label("$3$", A--B, dir(A--B)*dir(-90)); label("$4$", B--C, dir(B--C)*dir(-90)); label("$12$", C--D, dir(C--D)*dir(-90)); label("$13$", D--A, dir(D--A)*dir(-90));[/asy] $\text{(A)} \ 32 \qquad \text{(B)} \ 36 \qquad \text{(C)} \ 39 \qquad \text{(D)} \ 42 \qquad \text{(E)} \ 48$

Triangles $ABC$ and $ABD$ are isosceles with $AB =AC = BD$, and $BD$ intersects $AC$ at $E$. If $BD$ is perpendicular to $AC$, then $\angle C + \angle D$ is [asy] size(130); defaultpen(linewidth(0.8) + fontsize(11pt)); pair A, B, C, D, E; real angle = 70; B = origin; A = dir(angle); D = dir(90-angle); C = rotate(2*(90-angle), A) * B; draw(A--B--C--cycle); draw(B--D--A); E = extension(B, D, C, A); draw(rightanglemark(B, E, A, 1.5)); label("$A$", A, dir(90)); label("$B$", B, dir(210)); label("$C$", C, dir(330)); label("$D$", D, dir(0)); label("$E$", E, 1.5*dir(340)); [/asy] $\textbf{(A)}\ 115^\circ \qquad \textbf{(B)}\ 120^\circ \qquad \textbf{(C)}\ 130^\circ \qquad \textbf{(D)}\ 135^\circ \qquad \textbf{(E)}\ \text{not uniquely determined}$

Let $a_1, ... ,a_5$ be real numbers such that at least $N$ of the sums $a_i+a_j$ ($i < j$) are integers. Find the greatest value of $N$ for which it is possible that not all of the sums $a_i+a_j$ are integers.

We call a set of squares with sides parallel to the coordinate axes and vertices with integer coordinates friendly if any two of them have exactly two points in common. We consider friendly sets in which each of the squares has sides of length $n$. Determine the largest possible number of squares in such a friendly set.

Let $ABCD$ be a unit square. For any interior points $M,N$ such that the line $MN$ does not contain a vertex of the square, we denote by $s(M,N)$ the least area of the triangles having their vertices in the set of points $\{ A,B,C,D,M,N\}$. Find the least number $k$ such that $s(M,N)\le k$, for all points $M,N$. [i]Dinu Șerbănescu[/i]

Given that three roots of $f(x)=x^4+ax^2+bx+c$ are $2$, $-3$, and $5$, what is the value of $a+b+c$?

Let $a,b,c$ be positive integers such that $a|b^4, b|c^4$ and $c|a^4$. Prove that $abc|(a+b+c)^{21}$

A triangle $ABC$ is given. Let $D$ be a point on the extension of the segment $AB$ beyond $A$ such that $AD=BC,$ and $E$ be a point on the extension of the segment $BC$ beyond $B$ such that $BE=AC.$ Prove that the circumcircle of the triangle $DEB$ passes through the incenter of the triangle $ABC.$

$f,g:\mathbb{R}\rightarrow\mathbb{R}$ find all $f,g$ satisfying $\forall x,y\in \mathbb{R}$: \[g(f(x)-y)=f(g(y))+x.\]

Let $n\ge 3$ be a fixed integer. There are $m\ge n+1$ beads on a circular necklace. You wish to paint the beads using $n$ colors, such that among any $n+1$ consecutive beads every color appears at least once. Find the largest value of $m$ for which this task is $\emph{not}$ possible. [i]Carl Schildkraut, USA[/i]

Find all functions $ f: \mathbb{R}\to\mathbb{R}$ such that we have $f(x + y) = f(x) + f(y) + f(xy)$ for all $ x,y\in \mathbb{R}$

A small airplane has $4$ rows of seats with $3$ seats in each row. Eight passengers have boarded the plane and are distributed randomly among the seats. A married couple is next to board. What is the probability there will be 2 adjacent seats in the same row for the couple?

What is the minimum number of squares that is necessary to draw on a white sheet to obtain a square grid of side $n$?

Let $ ABCD$ be a convex quadrilateral such that the sides $ AB, AD, BC$ satisfy $ AB \equal{} AD \plus{} BC.$ There exists a point $ P$ inside the quadrilateral at a distance $ h$ from the line $ CD$ such that $ AP \equal{} h \plus{} AD$ and $ BP \equal{} h \plus{} BC.$ Show that: \[ \frac {1}{\sqrt {h}} \geq \frac {1}{\sqrt {AD}} \plus{} \frac {1}{\sqrt {BC}} \]

For each non-negative $a$, consider the equation $$x^3 + ax - a^3 - 29 = 0.$$ Let $x_o$ be the positive root of this equation. Prove that for all $a > 0$ such a root exists. What is the smallest value of $x_o$?

Let $a, b, c$ be positive integers such that no number divides some other number. If $ab-b+1 \mid abc+1$, prove that $c \geq b$.

How many polynomials of degree exactly $5$ with real coefficients send the set $\{1, 2, 3, 4, 5, 6\}$ to a permutation of itself?

Let $\mathcal{F}$ be the set of continuous functions $f : [0, 1]\to\mathbb{R}$ satisfying $\max_{0\le x\le 1} |f(x)| = 1$ and let $I : \mathcal{F} \to \mathbb{R}$, \[I(f) = \int_0^1 f(x)\, \text{d}x - f(0) + f(1).\] a) Show that $I(f) < 3$, for any $f \in \mathcal{F}$. b) Determine $\sup\{I(f) \mid f \in \mathcal{F}\}$.

A set of $61$ coins that look alike is given. Two coins (whose weights are equal) are counterfeit. The other $59$ (genuine) coins also have the same weight, but a different weight from that of the counterfeit coins. However it is not known whether it is the genuine coins or the counterfeit coins which are heavier. How can this question be resolved by three weighings on the one balance? (It is not required to separate the counterfeit coins from the genuine ones.) (D. Fomin, Leningrad)