Place 4 integers on a circle. Proceed in iterations. At every step, compute all differences of pairs of consecutive numbers. Place the absolute values of these differences between the corresponding numbers and remove the numbers themselves.
Whatever 4 integers you start with, you'll reach the sequence of four zeros after a (very) finite number of iterations. So it may appear surprising that with the removal of the absolute value, the terms of the sequence grow without bound.
Place 4 integers on a circle. Proceed in iterations. At every step, compute all differences of pairs of consecutive numbers. Place the absolute values of these differences between the corresponding numbers and remove the numbers themselves.
Whatever 4 integers you start with, you'll reach the sequence of four zeros after a (very) finite number of iterations. So it may appear surprising that with the removal of the absolute value, the terms of the sequence grow without bound.
Let a, b, c, d be the numbers originally placed on the circle. These are replaced with a - b, b - c, c - d, and d - a. Obviously, starting with the first iteration, at any step the sum of the four numbers is zero. We may assume that this is true to start with:
a + b + c + d = 0.
Let α = a - b, β = b - c, γ = c - d, and δ = d - a.
One way of thinking of the magnitude of the four numbers is to consider them as components of a 4-dimensional vector. Indeed, the norm of such a vector grows without bound only if the same happens to at least one of its components; for the norm measures the distance of the vector's end point to the origin. We'll use the Euclidean norm:
meaning that the square of the norm at least doubles with each iteration.
