In a lecture hall some chairs are placed in rows and columns, forming a rectangle. In each row there are $6$ boys sitting and in each column there are $8$ girls sitting, whereas $15$ places are not taken. What can be said about the number of rows and that of columns?

A parabola $p$ is drawn on the coordinate plane — the graph of the equation $y =-x^2$, and a point $A$ is marked that does not lie on the parabola $p$. All possible parabolas $q$ of the form $y = x^2+ax+b$ are drawn through point $A$, intersecting $p$ at two points $X$ and $Y$ . Prove that all possible $XY$ lines pass through a fixed point in the plane. [i]P.A.Kozhevnikov[/i]

Put $P = m^{2003}n^{2017} - m^{2017}n^{2003}$ , where $m, n \in N$. a) Is $P$ divisible by $24$? b) Do there exist $m, n \in N$ such that $P$ is not divisible by $7$?

Denote by $R_{>0}$ the set of all positive real numbers. Find all functions $f: R_{>0} \to R_{>0}$ such that for all $x,y \in R_{>0}$ the following equation holds $$f(y)f(x+f(y))=f(1+xy)$$

In triangle $\triangle ABC$, the angle $\angle BAC$ is less than $90^o$. The perpendiculars from $C$ on $AB$ and from $B$ on $AC$ intersect the circumcircle of $\triangle ABC$ again at $D$ and $E$ respectively. If $|DE| =|BC|$, find the measure of the angle $\angle BAC$.

Juri and Mari play the following game. Juri starts by drawing a random triangle on a piece of paper. Mari then draws a line on the same paper that goes through the midpoint of one of the midsegments of the triangle. Then Juri adds another line that also goes through the midpoint of the same midsegment. These two lines divide the triangle into four pieces. Juri gets the piece with maximum area (or one of those with maximum area) and the piece with minimum area (or one of those with minimum area), while Mari gets the other two pieces. The player whose total area is bigger wins. Does either of the players have a winning strategy, and if so, who has it?

A group of $n{}$ $(n>1)$ people each visited $k{}$ $(k>1)$ citites. Each person makes a list of these $k$ cities in the order they want to visit them. A permutation $(a_1,a_2,\ldots,a_k)$ is called $m-prefered$ $(m\in\mathbb{N})$, if for every $i=1,2,\ldots,k$ there are at least $m$ people that would prefer to visit the city $a_i$ before the city $a_{i+1}$, $(a_{k+1}=a_1)$. Prove that there exists an m-prefered permutation if and only if $km\leq n(k-1)$.

Let $k$ be a positive integer. Some of the $2k$-element subsets of a given set are marked. Suppose that for any subset of cardinality less than or equal to $(k+1)^2$ all the marked subsets contained in it (if any) have a common element. Show that all the marked subsets have a common element.

In $\vartriangle ABC$, $AB = 2019$, $BC = 2020$, and $CA = 2021$. Yannick draws three regular $n$-gons in the plane of $\vartriangle ABC$ so that each $n$-gon shares a side with a distinct side of $\vartriangle ABC$ and no two of the $n$-gons overlap. What is the maximum possible value of $n$?

Prove that for each positive integer $ n$ there exist $ n$ consecutive positive integers none of which is an integral power of a prime number.

Circles $\mathcal{C}_1$, $\mathcal{C}_2$, and $\mathcal{C}_3$ have their centers at (0,0), (12,0), and (24,0), and have radii 1, 2, and 4, respectively. Line $t_1$ is a common internal tangent to $\mathcal{C}_1$ and $\mathcal{C}_2$ and has a positive slope, and line $t_2$ is a common internal tangent to $\mathcal{C}_2$ and $\mathcal{C}_3$ and has a negative slope. Given that lines $t_1$ and $t_2$ intersect at $(x,y)$, and that $x=p-q\sqrt{r}$, where $p$, $q$, and $r$ are positive integers and $r$ is not divisible by the square of any prime, find $p+q+r$.

Let the sequence $\{a_i\}^\infty_{i=0}$ be defined by $a_0 =\frac12$ and $a_n = 1 + (a_{n-1} - 1)^2$. Find the product $$\prod_{i=0}^\infty a_i=a_0a_1a_2\ldots$$

The grid on the right has $12$ boxes and $15$ edges connecting boxes. In each box, place one of the six integers from $1$ to $6$ such that the following conditions hold: [list] [*]For each possible pair of distinct numbers from $1$ to $6$, there is exactly one edge connecting two boxes with that pair of numbers. [*]If an edge has an arrow, then it points from a box with a smaller number to a box with a larger number.[/list] You do not need to prove that your conguration is the only one possible; you merely need to find a conguration that satises the constraints above. (Note: In any other USAMTS problem, you need to provide a full proof. Only in this problem is an answer without justication acceptable.) [asy] size(200); defaultpen(linewidth(0.8)); int i,j; for(i=0;i<4;i=i+1) { for(j=0;j<3;j=j+1) { draw((i,j)--(i,j+1/2)--(i+1/2,j+1/2)--(i+1/2,j)--cycle); } } draw((1/2,1/4)--(1,1/4)^^(1/2,5/4)--(1,5/4)^^(3/2,5/4)--(2,5/4)^^(5/2,5/4)--(3,5/4)^^(5/2,9/4)--(3,9/4)); draw((1/4,1)--(1/4,1/2),Arrow(5)); draw((5/4,1)--(5/4,1/2),Arrow(5)); draw((1/4,2)--(1/4,3/2),Arrow(5)); draw((9/4,2)--(9/4,3/2),Arrow(5)); draw((13/4,2)--(13/4,3/2),Arrow(5)); draw((13/4,1)--(13/4,1/2),Arrow(5)); draw((2,1/4)--(3/2,1/4),Arrow(5)); draw((1,9/4)--(1/2,9/4),Arrow(5)); draw((5/2,1/4)--(3,1/4),Arrow(5)); draw((3/2,9/4)--(2,9/4),Arrow(5)); [/asy]

Maisy and Jeff are playing a game with a deck of cards with $4$ $0$’s, $4$ $1$’s, $4$ $2$’s, all the way up to $4$ $9$’s. You cannot tell apart cards of the same number. After shuffling the deck, Maisy and Jeff each take $4$ cards, make the largest $4$-digit integer they can, and then compare. The person with the larger $4$-digit integer wins. Jeff goes first and draws the cards $2,0,2,1$ from the deck. Find the number of hands Maisy can draw to beat that, if the order in which she draws the cards matters. [i]Proposed by Richard Chen[/i]

Prove that the arithmetic progression $3,7,11,15,...$. contains infinitely many prime numbers.

Let $\mathcal{R}$ be the region in the plane bounded by the graphs of $y=x$ and $y=x^2$. Compute the volume of the region formed by revolving $\mathcal{R}$ around the line $y=x$.

We are given six points in space with distinct distances, no three of them collinear. Consider all triangles with vertices among these points. Show that among these triangles there is one such that its longest side is the shortest side in one of the other triangles.

Let $C$ and $D$ be points on the semicircle with center $O$ and diameter $AB$ such that $ABCD$ is a convex quadrilateral. Let $Q$ be the intersection of the diagonals $[AC]$ and $[BD]$, and $P$ be the intersection of the lines tangent to the semicircle at $C$ and $D$. If $m(\widehat{AQB})=2m(\widehat{COD})$ and $|AB|=2$, then what is $|PO|$? $ \textbf{(A)}\ \sqrt 2 \qquad\textbf{(B)}\ \sqrt 3 \qquad\textbf{(C)}\ \frac{1+\sqrt 3} 2 \qquad\textbf{(D)}\ \frac{1+\sqrt 3}{2\sqrt 2} \qquad\textbf{(E)}\ \frac{2\sqrt 3} 3 $

A museum wants to protect its most valuable piece by maintaining constant surveillance. To do this, he wants to place guards to watch the place, in shifts of $7$ consecutive hours. Each guard starts his shift at the same time every day. A guard is essential if there is any time during the day when you are alone to watch the item. Indicates all possibilities for the number of guards guarding the piece, so that everyone is indispensable.

Let $a, b, c $ be positive real numbers such that $abc = \frac {2} {3}. $ Prove that: $$\frac {ab}{a + b} + \frac {bc} {b + c} + \frac {ca} {c + a} \geqslant \frac {a+b+c} {a^3+b ^ 3 + c ^ 3}.$$

Let $ABCD$ be a parallelogram and a circle $k$ passes through $A, C$ and meets rays $AB, AD$ at $E, F$. If $BD, EF$ and the tangent at $C$ concur, show that $AC$ is diameter of $k$.

Find the smallest possible value of the expression $$\frac{(a+b) (b + c)}{a + 2b+c}$$ where $a, b, c$ are arbitrary numbers from the interval $[1,2]$.

Each segment whose endpoints are the vertices of a given regular $100$-gon is colored red, if the number of vertices between its endpoints is even, and blue otherwise. (For example, all sides of the $100$-gon are red.) A number is placed in every vertex so that the sum of their squares is equal to $1$. On each segment the product of the numbers at its endpoints is written. The sum of the numbers on the blue segments is subtracted from the sum of the numbers on the red segments. What is the greatest possible result? (Ilya Bogdanov)

Smallville is populated by unmarried men and women, some of them are acquainted. Two city’s matchmakers are aware of all acquaintances. Once, one of matchmakers claimed: “I could arrange that every brunette man would marry a woman he was acquainted with”. The other matchmaker claimed “I could arrange that every blonde woman would marry a man she was acquainted with”. An amateur mathematician overheard their conversation and said “Then both arrangements could be done at the same time! ” Is he right?

$60$ children participate in a summer camp. Among any $10$ of the children there are three or more who live in the same block. Prove that there must be $15$ or more children from the same block. (Folklore)