Scribd
Upload
122 views2 pages

Exercises On Invariants

The document discusses 20 problems related to invariance principles and transformations. The problems cover a range of mathematical topics including sequences, sets, graphs, permutations, and number theory. Many of the problems involve applying transformations to initial conditions and examining the resulting limits or fixed points.

Uploaded by

Benjamin Benicarlo Juanillo III
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
122 views2 pages

Exercises On Invariants

The document discusses 20 problems related to invariance principles and transformations. The problems cover a range of mathematical topics including sequences, sets, graphs, permutations, and number theory. Many of the problems involve applying transformations to initial conditions and examining the resulting limits or fixed points.

Uploaded by

Benjamin Benicarlo Juanillo III
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

Invariance Principle (May 13, 2000)

1. Given x0 and y0 such that x0 > y0 > 0 . Define, for n = 0,1, 2," ,
xn + yn 2 xn yn
xn +1 = , yn +1 = . Find the limits of {xn } and { yn } .
2 xn + yn
2. Given x0 and y0 such that y0 > x0 > 0 . Define, for n = 0,1, 2," ,
xn + yn
xn +1 = , yn +1 = xn +1 yn . Find the limits of {xn } and { yn } .
2
3. The numbers 1, 2, 3, …, 2n, where n is odd, were originally on the blackboard.
Delete two numbers a, b and replace them by the number | a − b | , show that the
last remaining number is odd.
4. Starting from the set {3, 4, 12}, take any two numbers a and b from them and
replace these two numbers by 0.6a − 0.8b and 0.8a + 0.6b . After finitely many
steps, can we obtain
(a) {4, 6, 12}
1 1 1
(b) the set {x, y, z} such that | x − 4 |< ,| y − 6 |< and | z − 12 |< .
✓3 ✓3 ✓3
5. A circle is divided into 6 equal parts, the numbers 1, 0, 1, 0, 0, 0 are placed into the
parts. Choose any two adjacent parts and add 1 to both of them. Continuing this
process can we eventually obtain 6 equal numbers?
6. In an island there are 13 blue birds, 15 white birds and 17 red birds. When two
birds of different colors encounter, both change into the third color. Can all birds be
changed eventually to one color?
7. Each of the numbers a1 , a2 ," , an equals to 1 or –1, and it is known that
a1a2 + a2 a3 + " + an −1an + an a1 = 0 . Show that n is divisible by 4.
8. Starting from a set of positive real numbers S = {a, b, c, d } , replace the set by
{| a − b |,| b − c |,| c − d |,| d − a |} , and so on. Can we eventually obtain {0, 0, 0, 0} if
(a) the numbers a, b, c and d are natural numbers?
(b) a, b, c and d are positive real numbers?
9. In a committee every member has at most three enemies. Show that one can divide
the members of the committee into two groups, so that each person has at most one
enemy within his group.
10. At the vertices of a regular pentagon are five integers so that their sum exceeds
zero. Suppose x, y and z are three adjacent integers such that y < 0 , then replace x,
y, z by x + y, − y, z + y . Continue until no negative integers remain. Show that the
process will stop after finitely many steps.
11. Let x1 , x2 ," , xn ( n > 2) be n distinct integers. Consider the transformation
x1 + x2 x2 + x3 x +x
T ( x1 , x2 ," , xn ) = ( , ," , n 1 ) .
2 2 2
Is it possible to find k such that the components of T k ( X ), T k +1 ( X ),"are integers?
Here X = ( x1 , x2 ," , xn ) .
12. There are three points A, B and C on the plane. A frog is at point P. In the first step
the frog moves to P1 , which is the reflection point of P with respect to A. In the
second step the frog moves to P2 , which is the reflection point of P1 with respect
to B. In the third step it moves to P3 , which is the reflection point of P2 with
respect to C. The reflections with respect to A, B, and C are taken again, and so on.
Find the distance between P and P2000 .
13. Assume an 8 × 8 chessboard with the usual coloring. You may repaint all squares
(a) of a row or a column,
(b) of a 2 × 2 square.
Can you eventually obtain a chessboard with one black square?
14. The vertices of an n-gon are labeled by real numbers x1 , x2 ," , xn . Let a, b, c, d be
four successive labels. If (a − d )(b − c ) < 0 , then switch b with c. Decide if this
process will go on indefinitely.
15. In the table you may switch the signs of all numbers of a row, column, of a parallel
to one of the diagonals. Show that at least one “-1” remains.

1 1 1 1
1 1 1 1
1 1 1 1
1 -1 1 1

16. Solve the equation ( x 2 − 3 x + 3)2 − 3( x 2 − 3x + 3) + 3 = x .


17. Is it possible to transform f ( x) = x 2 + 4 x + 3 into g ( x ) = x 2 + 10 x + 9 by a
sequence of transformations of the form
1 1
f ( x) → x 2 f ( + 1) or f ( x) → ( x − 1) 2 f ( )?
x x −1
18. Does the sequence of squares contain an infinite arithmetic subsequence?
19. Let d (n) be the digital sum of natural number n.
Solve n + d (n) + d (d (n)) = 2000 .
20. There is a positive integer in each square of a rectangular table. In each move, you
may double each number in a row or subtract 1 from each number of a column.
Show that you can reach a table of zeros after finitely many moves.

You might also like