Let $n,m$ be natural numbers, with $n\gt 1$. Find the least positive integer $k$ with the following property: among any $k$ integers $a_1,a_2,\ldots,a_k$ such that $a_i-a_j$ is not divisible by $n$ whenever $i\ne j$, there are two terms $a_p,a_s$, $p\ne s$, such that $m+a_p-a_s$ is divisible by $n$.
The supplied PDF does not state a time limit. This edition uses the user-approved 240 minutes per session, 480 minutes total for both sessions; this is an editorial convention. The supplied source has no question point values. Each problem uses 1 editorial point for import compatibility; this is not an official scoring scale.
Dates 19–20 May 1992 are printed; the split into questions 1–3 and 4–6 is editorial because the source has no explicit day divider. All essay rubrics are editorial, and assessment is manual. Importer multipliers are correct 1, incorrect 0, blank 0.
Let $f(x)$ be a real polynomial of degree at least one. Prove that for every $c\gt 0$ there is a positive integer $n_0$ such that, for every monic real polynomial $P(x)$ of degree at least $n_0$, the number of integers $x$ satisfying $|f(P(x))|\le c$ is at most the degree of $P(x)$.
Let $ABC$ be a triangle with $BC=a,CA=b,AB=c$ and $a\ne b\ne c$. In its plane choose $A',B',C'$ so that:
1. The pairs $A,A'$; $B,B'$; $C,C'$ are either all on the same side, or all on opposite sides, of $BC,CA,AB$, respectively.
2. The triangles $A'BC,B'CA,C'AB$ are similar isosceles triangles.
Determine $\angle A'BC$ in terms of $a,b,c$ so that the lengths $AA',BB',CC'$ are not the side lengths of a triangle. A triangle is understood in the ordinary nondegenerate sense: its three vertices are not collinear.
In the plane there is a finite family of disks. Any two are externally disjoint or externally tangent, and no disk touches more than six other disks. Suppose a real number has been assigned to every disk that does not touch six other disks. Prove that there is at most one assignment of real numbers to the remaining disks such that the number on each remaining disk is the arithmetic mean of the six numbers on its six touching disks.
At a scientific conference the delegates collectively know $2n$ languages, where $n\ge2$. Each delegate knows exactly two languages, and any two delegates have at most one language in common. For each integer $k$ with $1\le k\le n-1$, there are at most $k-1$ languages each known by at most $k$ delegates. Prove that one can select a group of $2n$ delegates who collectively know all $2n$ languages, with exactly two members of the group knowing each language.
Let $ABCD$ be a tetrahedron such that the sums of the three face angles at $A$ and at $B$ are both $180^\circ$. The two face angles $\angle ACD$ and $\angle BCD$ at $C$ have sum $180^\circ$. Determine the sum of the areas of its four faces in terms of $k=AC+CB$ and $\angle ACB=x$.
For every positive integer $n$, let $f(n)$ be the number of positive divisors of $n$ congruent to $\pm1$ modulo $10$, and let $g(n)$ be the number of positive divisors of $n$ congruent to $\pm3$ modulo $10$. Prove that $f(n)\ge g(n)$.
Let $a,b,c$ be positive numbers. Define sequences $\{a_n\},\{b_n\},\{c_n\}$ by $a_0=a$, $b_0=b$, $c_0=c$, and
$$a_{n+1}=a_n+\frac2{b_n+c_n},\quad b_{n+1}=\frac2{c_n+a_n},\quad c_{n+1}=c_n+\frac2{a_n+b_n}$$
for every $n\in\mathbb Z_+$. Prove that $a_n$ tends to infinity as $n$ tends to infinity.
A $1991\times1992$ rectangle is divided into unit squares, indexed by $(m,n)$ with $1\le m\le1991$, $1\le n\le1992$ (row $m$, column $n$). Initially the squares $(m,n)$, $(m+1,n+1)$ and $(m+2,n+2)$ are colored, where $m\lt 1989$, $n\lt 1991$. Each subsequent move colors three uncolored squares lying in one row or one column. Can all the squares of the rectangle be colored in this way?
Let $ABCD$ be a rectangle with center $O$ and $\angle AOB\le45^\circ$. Rotate it about $O$ through an angle $x$ with $0^\circ\lt x\lt 360^\circ$. Determine the values of $x$ for which the intersection of the rotated rectangle and the original rectangle has the smallest possible area.