- Day 1
- Difficulty band 6
Let f(x) = + + 3, where n > 1 is an integer. Prove that f(x) cannot be expressed as the product of two non-constant polynomials with integer coefficients.
International Mathematical Olympiad 1993.
Let f(x) = + + 3, where n > 1 is an integer. Prove that f(x) cannot be expressed as the product of two non-constant polynomials with integer coefficients.
Let , , , be four points in the plane, with and on the same side of the line , such that and . Find the ratio and prove that the circumcircles of the triangles and are orthogonal. (Intersecting circles are said to be orthogonal if at either common point their tangents are perpendicuar. Thus, proving that the circumcircles of the triangles and are orthogonal is equivalent to proving that the tangents to the circumcircles of the triangles and at the point are perpendicular.)
On an infinite chessboard a game is played as follows. At the start pieces are arranged in an n x n block of adjoining squares, one piece on each square. A move in the game is a jump in a horizontal or vertical direction over an adjacent occupied square to an unoccupied square immediately beyond. The piece which has been jumped over is removed. Find those values of n for which the game can end with only one piece remaining on the board.
For three points P, Q, R in the plane define m(PQR) as the minimum length of the three altitudes of the triangle PQR (or zero if the points are collinear). Prove that for any points A, B, C, X: m(ABC) ≤ m(ABX) + m(AXC) + m(XBC).
Does there exist a function f from the positive integers to the positive integers such that f(1) = 2, f(f(n)) = f(n) + n for all n, and f(n) < f(n+1) for all n?
There are n > 1 lamps , , ... , in a circle. We use to mean . A lamp is at all times either on or off. Initially they are all on. Perform steps , , ... as follows: at step , if is lit, then switch from on to off or vice versa, otherwise do nothing. Show that: (a) There is a positive integer M(n) such that after M(n) steps all the lamps are on again; (b) If n = , then we can take M(n) = - 1. (c) If n = + 1, then we can take M(n) = - n + 1.