Extreme principle

The extreme principle (or extremal principle) is a problem-solving technique that involves looking at objects with extreme properties, such as the largest or smallest element. For example, consider the following problem:

Example: Imagine an infinite chessboard that contains a positive integer in each square. If the value in each square is equal to the average of its four neighbors to the north, south, west, and east, prove the values in all the squares are equal.

Solution: Consider the square containing the minimal value. Then its four neighbors must all have this minimal value. Similarly, their neighbors must also have this minimal value, and so on ad infinitum.

Thus, every square in the chessboard has the same value.


  1. Suppose you are given a finite set of coins in the plane, all with different diameters. Show that one of the coins is tangent to at most five of the others. (Solution)
  2. A palindrome is a number or word that is the same when read forward and backward, for example, "176671" and "civic." Can the number obtained by writing the numbers from 1 to $n$ in order (for some $n > 1$) be a palindrome? (Russia, 1996)
  3. Place the integers $1, 2, 3, \hdots, n^2$ (without duplication) in any order onto an $n \times n$ chessboard, with one integer per square. Show that there exist two adjacent entries whose difference is at least $n + 1$. (Adjacent means horizontally or vertically or diagonally adjacent.)
  4. There are $n$ points in the plane, not all collinear. Prove that there exists a line passing through exactly $2$ points.
  5. There are $n$ blue points and $n$ red points in the plane (no 3 are collinear). Prove that there are $n$ non-intersecting line segments, each connecting a red point to a blue point (each point is on 1 segment).
  6. There is a set $S$ of points in the plane with the property that any triangle with vertices in $S$ has area at most 1. Prove that there exists a triangle with area 4 containing all the points in $S$. (Korea, 1995)
  7. We are given an $m \times n$ array of real numbers. An operation consists of changing the sign (positive to negative, and vice versa) of all the entries in any row or column. Prove that we can perform a number of such operations such that in the resulting array, the sum of the entries in each row and in each column is nonnegative.