- Day 1
- Difficulty band 6
Find all integers a, b, c satisfying 1 < a < b < c such that (a - 1)(b -1)(c - 1) is a divisor of abc - 1.
International Mathematical Olympiad 1992.
Find all integers a, b, c satisfying 1 < a < b < c such that (a - 1)(b -1)(c - 1) is a divisor of abc - 1.
Let denote the set of all real numbers. Find all functions such that
Consider points in space, no four of which are coplanar. Each pair of points is joined by an edge (that is, a line segment) and each edge is either colored blue or red or left uncolored. Find the smallest value of such that whenever exactly edges are colored, the set of colored edges necessarily contains a triangle all of whose edges have the same color.
L is a tangent to the circle C and M is a point on L. Find the locus of all points P such that there exist points Q and R on L equidistant from M with C the incircle of the triangle PQR.
Let S be a finite set of points in three-dimensional space. Let , , be the sets consisting of the orthogonal projections of the points of S onto the yz-plane, zx-plane, xy-plane respectively. Prove that: ≤ | | |, where |A| denotes the number of points in the set A. [The orthogonal projection of a point onto a plane is the foot of the perpendicular from the point to the plane.]
For each positive integer n, S(n) is defined as the greatest integer such that for every positive integer k ≤ S(n), can be written as the sum of k positive squares. (a) Prove that S(n) ≤ - 14 for each n ≥ 4. (b) Find an integer n such that S(n) = - 14. (c) Prove that there are infinitely many integers n such that S(n) = - 14.