A sequence of real numbers is defined by the formula here is an arbitrary real number, denotes the greatest integer not exceeding , and . Prove that for sufficiently large. (Estonia)
ISL 2006
IMO Shortlist 2006.
Other problems
The sequence of real numbers is defined recursively by Show that for . (Poland)
The sequence is defined by and for . Consider the set of ordered pairs for which there is a finite set of positive integers such that . Prove that there exist real numbers and with the following property: An ordered pair of nonnegative integers satisfies the inequality if and only if . N. B. A sum over the elements of the empty set is assumed to be 0 . (Russia)
Prove the inequality for positive real numbers . (Serbia)
Let be the sides of a triangle. Prove that (Korea)
Determine the smallest number such that the inequality holds for all real numbers . (Ireland)
We have lamps in a row, each of them being either on or off. Every second we simultaneously modify the state of each lamp as follows: - if the lamp and its neighbours (only one neighbour for or , two neighbours for other ) are in the same state, then is switched off; - otherwise, is switched on. Initially all the lamps are off except the leftmost one which is on. (a) Prove that there are infinitely many integers for which all the lamps will eventually be off. (b) Prove that there are infinitely many integers for which the lamps will never be all off. (France)
A diagonal of a regular 2006-gon is called odd if its endpoints divide the boundary into two parts, each composed of an odd number of sides. Sides are also regarded as odd diagonals. Suppose the 2006-gon has been dissected into triangles by 2003 nonintersecting diagonals. Find the maximum possible number of isosceles triangles with two odd sides. (Serbia)
Let be a finite set of points in the plane such that no three of them are on a line. For each convex polygon whose vertices are in , let be the number of vertices of , and let be the number of points of which are outside . Prove that for every real number where the sum is taken over all convex polygons with vertices in . NB. A line segment, a point and the empty set are considered as convex polygons of 2,1 and 0 vertices, respectively. (Colombia)
A cake has the form of an square composed of unit squares. Strawberries lie on some of the unit squares so that each row or column contains exactly one strawberry; call this arrangement . Let be another such arrangement. Suppose that every grid rectangle with one vertex at the top left corner of the cake contains no fewer strawberries of arrangement than of arrangement . Prove that arrangement can be obtained from by performing a number of switches, defined as follows: A switch consists in selecting a grid rectangle with only two strawberries, situated at its top right corner and bottom left corner, and moving these two strawberries to the other two corners of that rectangle. (Taiwan)
An -tournament is a contest with players held in rounds such that: (i) Each player plays in each round, and every two players meet at most once. (ii) If player meets player in round , player meets player in round , and player meets player in round , then player meets player in round . Determine all pairs for which there exists an -tournament. (Argentina)
A holey triangle is an upward equilateral triangle of side length with upward unit triangular holes cut out. A diamond is a unit rhombus. Prove that a holey triangle can be tiled with diamonds if and only if the following condition holds: Every upward equilateral triangle of side length in contains at most holes, for . (Colombia)
Consider a convex polyhedron without parallel edges and without an edge parallel to any face other than the two faces adjacent to it. Call a pair of points of the polyhedron antipodal if there exist two parallel planes passing through these points and such that the polyhedron is contained between these planes. Let be the number of antipodal pairs of vertices, and let be the number of antipodal pairs of midpoints of edges. Determine the difference in terms of the numbers of vertices, edges and faces. (Japan)
Let be a triangle with incentre . A point in the interior of the triangle satisfies Show that and that equality holds if and only if coincides with . (Korea)
Let be a trapezoid with parallel sides . Points and lie on the line segments and , respectively, so that . Suppose that there are points and on the line segment satisfying Prove that the points and are concyclic. (Ukraine)
Let be a convex pentagon such that The diagonals and meet at . Prove that the line bisects the side .
A point is chosen on the side of a triangle with in such a way that . The incircle of is tangent to and at points and , respectively. Let be the incentre of triangle . Prove that the line intersects the line segment at its midpoint. (Russia)
In triangle , let be the centre of the excircle tangent to side at and to the extensions of sides and at and , respectively. Suppose that the lines and are perpendicular and intersect at . Let be the foot of the perpendicular from to line . Determine the angles and . (Greece)
Circles and with centres and are externally tangent at point and internally tangent to a circle at points and , respectively. Line is the common tangent of and at . Let be the diameter of perpendicular to , so that and are on the same side of . Prove that lines and are concurrent. (Brasil)
In a triangle , let be respectively the midpoints of the sides , and be the midpoints of the of the circumcircle of , not containing the opposite vertices. For , let be the circle with as diameter. Let be the common external tangent to such that lies on the opposite side of than do. Prove that the lines form a triangle similar to and find the ratio of similitude. (Slovakia)
Let be a convex quadrilateral. A circle passing through the points and and a circle passing through the points and are externally tangent at a point inside the quadrilateral. Suppose that Prove that . (Poland)
Points are chosen on the sides of a triangle , respectively. The circumcircles of triangles intersect the circumcircle of triangle again at points , respectively . Points are symmetric to with respect to the midpoints of the sides respectively. Prove that the triangles and are similar. (Russia)
To each side of a convex polygon we assign the maximum area of a triangle contained in the polygon and having as one of its sides. Show that the sum of the areas assigned to all sides of the polygon is not less than twice the area of the polygon. (Serbia)
Determine all pairs of integers satisfying the equation
For let be the number whose th digit after the decimal point is the th digit after the decimal point of . Show that if is rational then so is . (Canada)
The sequence is defined by where denotes the integer part of . (a) Prove that infinitely often. (b) Prove that infinitely often. (South Africa)
Let be a polynomial of degree with integer coefficients and let be any positive integer. Consider the polynomial , with pairs of parentheses. Prove that has no more than integer fixed points, i.e. integers satisfying the equation . (Romania)
Find all integer solutions of the equation (Russia)
Let be relatively prime positive integers. Define the weight of an integer , denoted by , to be the minimal possible value of taken over all pairs of integers and such that An integer is called a local champion if and . Find all local champions and determine their number.
Prove that, for every positive integer , there exists an integer such that is divisible by . (Estonia)