Converging Means
Here is another excellent solution from Andrei Lazanu, age 12, School no. 205, Bucharest, ROMANIA. Well done Andrei.
I started with a1 = 9 and b1 = 3, and I used the recursive relations from the problem. I obtained the following values (to three decimal places):
| a 1 =9.000 | b 1 =3.000 |
| arithmetic means | geometric means |
| a 2 =6.000 | b 2 =5.196 |
| a 3 =5.598 | b 3 =5.584 |
| a 4 =5.591 | b 4 =5.591 |
| a 5 =5.591 | b 5 =5.591 |
| a 6 =5.591 | b 6 =5.591 |
| a 7 =5.591 | b 7 =5.591 |
I represented the successive "a" terms and "b" terms on a number line and I saw that both of them go toward the same value. Using 3 decimals, practically, after the 3-rd iteration (a4 and b4) the same value is reached.
[Note that each time the geometric mean is less than the arithmetic mean. The arithmetic means are decreasing (can you explain why?) and the geometric means are increasing (why?) so they must converge.]
Now, I choose my numbers, and I looked for more distant numbers to see how fast they arrive at the same value: a1 = 2 and b1 = 15000.
I wrote the following programme in Matlab, to generate the terms of the sequences "a" and "b":
% arithmetic and geometric means
%a(1)=9;b(1)=3;
a(1)=15000;b(1)=2
for i=1:6
a(i+1)=(a(i)+b(i))/2;
b(i+1)=sqrt(a(i)*b(i));
end
I obtained the following values: for the "a" (left column) and "b" (right column) sequences respectively (all values must be multiplied by 104).
| 1.5000 | 0.0002 |
| arithmetic means | geometric means |
| 0.7501 | 0.0173 |
| 0.3837 | 0.1140 |
| 0.2488 | 0.2091 |
| 0.2290 | 0.2281 |
| 0.2286 | 0.2286 |
| 0.2286 | 0.2286 |
I saw that after the 5-th iteration, to the precision used, the two sequences arrived at the same value.
[You may like to use a spreadsheet to do this investigation.]
You may also like
Polycircles
Show that for any triangle it is always possible to construct 3 touching circles with centres at the vertices. Is it possible to construct touching circles centred at the vertices of any polygon?
Nim
Start with any number of counters in any number of piles. 2 players take it in turns to remove any number of counters from a single pile. The loser is the player who takes the last counter.
Loopy
Investigate sequences given by $a_n = \frac{1+a_{n-1}}{a_{n-2}}$ for different choices of the first two terms. Make a conjecture about the behaviour of these sequences. Can you prove your conjecture?