ILL 1977

A pentagon $ABCDE$ inscribed in a circle for which $BC<CD$ and $AB<DE$ is the base of a pyramid with vertex $S$ . If $AS$ is the longest edge starting from $S$ , prove that $BS>CS$ .

Find all functions $f : \mathbb{N}\rightarrow \mathbb{N}$ satisfying following condition: $$f(n+1)>f(f(n)), \forall n \in \mathbb{N}.$$

In a company of $n$ persons, each person has no more than $d$ acquaintances, and in that company there exists a group of $k$ persons, $k\ge d$ , who are not acquainted with each other. Prove that the number of acquainted pairs is not greater than $\left[ \frac{n^2}{4}\right]$ .

We are given $n$ points in space. Some pairs of these points are connected by line segments so that the number of segments equals $[n^2/4],$ and a connected triangle exists. Prove that any point from which the maximal number of segments starts is a vertex of a connected triangle.

A lattice point in the plane is a point both of whose coordinates are integers. Each lattice point has four neighboring points: upper, lower, left, and right. Let $k$ be a circle with radius $r \geq 2$, that does not pass through any lattice point. An interior boundary point is a lattice point lying inside the circle $k$ that has a neighboring point lying outside $k$. Similarly, an exterior boundary point is a lattice point lying outside the circle $k$ that has a neighboring point lying inside $k$. Prove that there are four more exterior boundary points than interior boundary points.

Let $x_1, x_2, \ldots , x_n \ (n \geq 1)$ be real numbers such that $0 \leq x_j \leq \pi, \ j = 1, 2,\ldots, n.$ Prove that if $\sum_{j=1}^n (\cos x_j +1)$ is an odd integer, then $\sum_{j=1}^n \sin x_j \geq 1.$

Prove the following assertion: If $c_1,c_2,\ldots ,c_n\ (n\ge 2)$ are real numbers such that $$(n-1)(c_1^2+c_2^2+\cdots +c_n^2)=(c_1+c_2+\cdots + c_n)^2,$$ then either all these numbers are nonnegative or all these numbers are nonpositive.

A hexahedron $ABCDE$ is made of two regular congruent tetrahedra $ABCD$ and $ABCE.$ Prove that there exists only one isometry $\mathbf Z$ that maps points $A, B, C, D, E$ onto $B, C, A, E, D,$ respectively. Find all points $X$ on the surface of hexahedron whose distance from $\mathbf Z(X)$ is minimal.

Let $ABCD$ be a regular tetrahedron and $\mathbf{Z}$ an isometry mapping $A,B,C,D$ into $B,C,D,A$ , respectively. Find the set $M$ of all points $X$ of the face $ABC$ whose distance from $\mathbf{Z}(X)$ is equal to a given number $t$ . Find necessary and sufficient conditions for the set $M$ to be nonempty.

Let $n$ and $z$ be integers greater than $1$ and $(n,z)=1$ . Prove: (a) At least one of the numbers $z_i=1+z+z^2+\cdots +z^i,\ i=0,1,\ldots ,n-1,$ is divisible by $n$ . (b) If $(z-1,n)=1$ , then at least one of the numbers $z_i$ is divisible by $n$ .

Let $z$ be an integer $> 1$ and let $M$ be the set of all numbers of the form $z_k = 1+z + \cdots+ z^k, \ k = 0, 1,\ldots$ . Determine the set $T$ of divisors of at least one of the numbers $z_k$ from $M.$

Describe all closed bounded figures $\Phi$ in the plane any two points of which are connectable by a semicircle lying in $\Phi$.

There are $2^n$ words of length $n$ over the alphabet $\{0, 1\}$. Prove that the following algorithm generates the sequence $w_0, w_1, \ldots, w_{2^n-1}$ of all these words such that any two consecutive words differ in exactly one digit.

(1) $w_0 = 00 \ldots 0$ ($n$ zeros).

(2) Suppose $w_{m-1} = a_1a_2 \ldots a_n, a_i \in \{0, 1\}$. Let $e(m)$ be the exponent of $2$ in the representation of $n$ as a product of primes, and let $j = 1 + e(m)$. Replace the digit $a_j$ in the word $w_{m-1}$ by $1 - a_j$. The obtained word is $w_m$.

Let $n$ be an integer greater than $1$ . In the Cartesian coordinate system we consider all squares with integer vertices $(x,y)$ such that $1\le x,y\le n$ . Denote by $p_k\ (k=0,1,2,\ldots )$ the number of pairs of points that are vertices of exactly $k$ such squares. Prove that $\sum_k(k-1)p_k=0$ .

Let $n$ be a positive integer. How many integer solutions $(i, j, k, l) , \ 1 \leq i, j, k, l \leq n$, does the following system of inequalities have:

$$1 \leq -j + k + l \leq n$$ $$1 \leq i - k + l \leq n$$ $$1 \leq i - j + l \leq n$$ $$1 \leq i + j - k \leq n \ ?$$

A ball $K$ of radius $r$ is touched from the outside by mutually equal balls of radius $R$ . Two of these balls are tangent to each other. Moreover, for two balls $K_1$ and $K_2$ tangent to $K$ and tangent to each other there exist two other balls tangent to $K_1,K_2$ and also to $K$ . How many balls are tangent to $K$ ? For a given $r$ determine $R$ .

Given an isosceles triangle $ABC$ with a right angle at $C,$ construct the center $M$ and radius $r$ of a circle cutting on segments $AB, BC, CA$ the segments $DE, FG,$ and $HK,$ respectively, such that $\angle DME + \angle FMG + \angle HMK = 180^\circ$ and $DE : FG : HK = AB : BC : CA.$

Given any integer $m>1$ prove that there exist infinitely many positive integers $n$ such that the last $m$ digits of $5^n$ are a sequence $a_m,a_{m-1},\ldots ,a_1=5\ (0\le a_j<10)$ in which each digit except the last is of opposite parity to its successor (i.e., if $a_i$ is even, then $a_{i-1}$ is odd, and if $a_i$ is odd, then $a_{i-1}$ is even).

Given that $x_1+x_2+x_3=y_1+y_2+y_3=x_1y_1+x_2y_2+x_3y_3=0,$ prove that: $$\frac{x_1^2}{x_1^2+x_2^2+x_3^2}+\frac{y_1^2}{y_1^2+y_2^2+y_3^2}=\frac{2}{3}$$

Let $S$ be a convex quadrilateral $ABCD$ and $O$ a point inside it. The feet of the perpendiculars from $O$ to $AB, BC, CD, DA$ are $A_1, B_1, C_1, D_1$ respectively. The feet of the perpendiculars from $O$ to the sides of $S_i$, the quadrilateral $A_iB_iC_iD_i$, are $A_{i+1}B_{i+1}C_{i+1}D_{i+1}$, where $i = 1, 2, 3.$ Prove that $S_4$ is similar to S.

For which positive integers $n$ do there exist two polynomials $f$ and $g$ with integer coefficients of $n$ variables $x_1, x_2, \ldots , x_n$ such that the following equality is satisfied:

$$\sum_{i=1}^n x_i f(x_1, x_2, \ldots , x_n) = g(x_1^2, x_2^2, \ldots , x_n^2) \ ?$$

Determine all real functions $f(x)$ that are defined and continuous on the interval $(-1, 1)$ and that satisfy the functional equation $$f(x+y)=\frac{f(x)+f(y)}{1-f(x) f(y)} (x, y, x + y \in (-1, 1)).$$

Prove the identity $$(z+a)^n=z^n+a\sum_{k=1}^n\binom{n}{k}(a-kb)^{k-1}(z+kb)^{n-k}$$

Let $p$ be a prime number greater than $5.$ Let $V$ be the collection of all positive integers $n$ that can be written in the form $n = kp + 1$ or $n = kp - 1 \ (k = 1, 2, \ldots).$ A number $n \in V$ is called indecomposable in $V$ if it is impossible to find $k, l \in V$ such that $n = kl.$ Prove that there exists a number $N \in V$ that can be factorized into indecomposable factors in $V$ in more than one way.

Let $n$ be an integer greater than $1$. Define

$$x_1 = n, y_1 = 1, x_{i+1} =\left[ \frac{x_i+y_i}{2}\right] , y_{i+1} = \left[ \frac{n}{x_{i+1}}\right], \text{for }i = 1, 2, \ldots\ ,$$

where $[z]$ denotes the largest integer less than or equal to $z$. Prove that $$\min \{x_1, x_2, \ldots, x_n \} =[ \sqrt n ]$$

A triangle $ABC$ with $\angle A = 30^\circ$ and $\angle C = 54^\circ$ is given. On $BC$ a point $D$ is chosen such that $\angle CAD = 12^\circ.$ On $AB$ a point $E$ is chosen such that $\angle ACE = 6^\circ.$ Let $S$ be the point of intersection of $AD$ and $CE.$ Prove that $BS = BC.$

Let $f$ be a function defined on the set of pairs of nonzero rational numbers whose values are positive real numbers. Suppose that $f$ satisfies the following conditions:(1) $f(ab,c)=f(a,c)f(b,c),\ f(c,ab)=f(c,a)f(c,b);$ (2) $f(a,1-a)=1$ Prove that $f(a,a)=f(a,-a)=1,f(a,b)f(b,a)=1$ .

In a room there are nine men. Among every three of them there are two mutually acquainted. Prove that some four of them are mutually acquainted.

A circle $K$ centered at $(0,0)$ is given. Prove that for every vector $(a_1,a_2)$ there is a positive integer $n$ such that the circle $K$ translated by the vector $n(a_1,a_2)$ contains a lattice point (i.e., a point both of whose coordinates are integers).

Let $B$ be a set of $k$ sequences each having $n$ terms equal to $1$ or $-1$. The product of two such sequences $(a_1, a_2, \ldots , a_n)$ and $(b_1, b_2, \ldots , b_n)$ is defined as $(a_1b_1, a_2b_2, \ldots , a_nb_n)$. Prove that there exists a sequence $(c_1, c_2, \ldots , c_n)$ such that the intersection of $B$ and the set containing all sequences from $B$ multiplied by $(c_1, c_2, \ldots , c_n)$ contains at most $\frac{k^2}{2^n}$ sequences.

Find all numbers $N=\overline{a_1a_2\ldots a_n}$ for which $9\times \overline{a_1a_2\ldots a_n}=\overline{a_n\ldots a_2a_1}$ such that at most one of the digits $a_1,a_2,\ldots ,a_n$ is zero.

Consider a sequence of numbers $(a_1, a_2, \ldots , a_{2^n}).$ Define the operation $$S\biggl((a_1, a_2, \ldots , a_{2^n})\biggr) = (a_1a_2, a_2a_3, \ldots , a_{2^{n-1}a_{2^n}, a_{2^n}a_1).}$$ Prove that whatever the sequence $(a_1, a_2, \ldots , a_{2^n})$ is, with $a_i \in \{-1, 1\}$ for $i = 1, 2, \ldots , 2^n,$ after finitely many applications of the operation we get the sequence $(1, 1, \ldots, 1).$

Let $A_1,A_2,\ldots ,A_{n+1}$ be positive integers such that $(A_i,A_{n+1})=1$ for every $i=1,2,\ldots ,n$ . Show that the equation $$x_1^{A_1}+x_2^{A_2}+\ldots + x_n^{A_n}=x_{n+1}^{A_{n+1} }$$ has an infinite set of solutions $(x_1,x_2,\ldots , x_{n+1})$ in positive integers.

Let $m_j > 0$ for $j = 1, 2,\ldots, n$ and $a_1 \leq \cdots \leq a_n < b_1 \leq \cdots \leq b_n < c_1 \leq \cdots \leq c_n$ be real numbers. Prove that $$\Biggl( \sum_{j=1}^{n} m_j(a_j+b_j+c_j) \Biggr)^2 > 3 \Biggl( \sum_{j=1}^{n} m_j \Biggr) \Biggl( \sum_{j=1}^{n} m_j(a_jb_j+b_jc_j+c_ja_j) \Biggr).$$

Consider $37$ distinct points in space, all with integer coordinates. Prove that we may find among them three distinct points such that their barycentre has integers coordinates.

The numbers $1, 2, 3,\ldots , 64$ are placed on a chessboard, one number in each square. Consider all squares on the chessboard of size $2 \times 2.$ Prove that there are at least three such squares for which the sum of the $4$ numbers contained exceeds $100.$

A wheel consists of a fixed circular disk and a mobile circular ring. On the disk the numbers $1, 2, 3, \ldots ,N$ are marked, and on the ring $N$ integers $a_1,a_2,\ldots ,a_N$ of sum $1$ are marked. The ring can be turned into $N$ different positions in which the numbers on the disk and on the ring match each other. Multiply every number on the ring with the corresponding number on the disk and form the sum of $N$ products. In this way a sum is obtained for every position of the ring. Prove that the $N$ sums are different.

The sequence $a_{n,k} \ , k = 1, 2, 3,\ldots, 2^n \ , n = 0, 1, 2,\ldots,$ is defined by the following recurrence formula: $$a_1 = 2, a_{n,k} = 2a_{n-1,k}^3, , a_{n,k+2^{n-1}} =\frac 12 a_{n-1,k}^3$$$$\text{for} k = 1, 2, 3,\ldots, 2^{n-1} \ , n = 0, 1, 2,\ldots$$ Prove that the numbers $a_{n,k}$ are all different.

Evaluate $$S=\sum_{k=1}^n k(k+1)\ldots (k+p),$$ where $n$ and $p$ are positive integers.

Let $E$ be a finite set of points in space such that $E$ is not contained in a plane and no three points of $E$ are collinear. Show that $E$ contains the vertices of a tetrahedron $T = ABCD$ such that $T \cap E = \{A,B,C,D\}$ (including interior points of $T$ ) and such that the projection of $A$ onto the plane $BCD$ is inside a triangle that is similar to the triangle $BCD$ and whose sides have midpoints $B,C,D.$

Let $E$ be a finite set of points such that $E$ is not contained in a plane and no three points of $E$ are collinear. Show that at least one of the following alternatives holds:

(i) $E$ contains five points that are vertices of a convex pyramid having no other points in common with $E;$

(ii) some plane contains exactly three points from $E.$

Let $f$ be a strictly increasing function defined on the set of real numbers. For $x$ real and $t$ positive, set$$g(x,t)=\frac{f(x+t)-f(x)}{f(x) - f(x - t)}.$$ Assume that the inequalities$$2^{-1} < g(x, t) < 2$$ hold for all positive t if $x = 0$ , and for all $t \leq |x|$ otherwise. Show that$$14^{-1} < g(x, t) < 14$$ for all real $x$ and positive $t.$

A square $ABCD$ is given. A line passing through $A$ intersects $CD$ at $Q$ . Draw a line parallel to $AQ$ that intersects the boundary of the square at points $M$ and $N$ such that the area of the quadrilateral $AMNQ$ is maximal.

The intersection of a plane with a regular tetrahedron with edge $a$ is a quadrilateral with perimeter $P.$ Prove that $2a \leq P \leq 3a.$

Find all pairs of integers $(p,q)$ for which all roots of the trinomials $x^2+px+q$ and $x^2+qx+p$ are integers.

Determine all positive integers $n$ for which there exists a polynomial $P_n(x)$ of degree $n$ with integer coefficients that is equal to $n$ at $n$ different integer points and that equals zero at zero.

Several segments, which we shall call white, are given, and the sum of their lengths is $1$ . Several other segments, which we shall call black, are given, and the sum of their lengths is $1$ . Prove that every such system of segments can be distributed on the segment that is $1.51$ long in the following way: Segments of the same colour are disjoint, and segments of different colours are either disjoint or one is inside the other. Prove that there exists a system that cannot be distributed in that way on the segment that is $1.49$ long.

Two perpendicular chords are drawn through a given interior point $P$ of a circle with radius $R.$ Determine, with proof, the maximum and the minimum of the sum of the lengths of these two chords if the distance from $P$ to the center of the circle is $kR.$

Find all pairs of integers $a$ and $b$ for which $$7a+14b=5a^2+5ab+5b^2$$

If $0 \leq a \leq b \leq c \leq d,$ prove that $$a^bb^cc^dd^a \geq b^ac^bd^ca^d.$$

Through a point $O$ on the diagonal $BD$ of a parallelogram $ABCD$ , segments $MN$ parallel to $AB$ , and $PQ$ parallel to $AD$ , are drawn, with $M$ on $AD$ , and $Q$ on $AB$ . Prove that diagonals $AO,BP,DN$ (extended if necessary) will be concurrent.

The four circumcircles of the four faces of a tetrahedron have equal radii. Prove that the four faces of the tetrahedron are congruent triangles.

Prove that for every triangle the following inequality holds: $$\frac{ab+bc+ca}{4S} \geq \cot \frac{\pi}{6}.$$ where $a, b, c$ are lengths of the sides and $S$ is the area of the triangle.

Let $E$ be a set of $n$ points in the plane $(n \geq 3)$ whose coordinates are integers such that any three points from $E$ are vertices of a nondegenerate triangle whose centroid doesnt have both coordinates integers. Determine the maximal $n.$

Suppose $x_0, x_1, \ldots , x_n$ are integers and $x_0 > x_1 > \cdots > x_n.$ Prove that at least one of the numbers $|F(x_0)|, |F(x_1)|, |F(x_2)|, \ldots, |F(x_n)|,$ where $$F(x) = x^n + a_1x^{n-1} + \cdots+ a_n, a_i \in \mathbb R, i = 1, \ldots , n,$$ is greater than $\frac{n!}{2^n}.$