The best solution went as follows:
The sequence of weights is given by the recursive formula:
and then
for
.
If we assume that the limit exists (big assumption), then we can let
.
Now it will also be the case that
.
So
But then
,
so L2+L-2=0 and
(L+2)(L-1)=0. So L=1.
By the same logic: Consider the sequence defined by the recursive formula:
A quick check on your calculator shows that this sequence diverges. Or you
may simply show that
bn>2bn-1, so the sequence diverges.
Let us assume that the limit exists (bad assumption), and let
.
So
.
Then
So
,
M2-2M+1=0, and (M-1)2=0. So M=1 which is
obviously not true.
So what is wrong with the first argument?
We never checked that the sequence converges!
A few people observed (based upon calculator/computer simulations?) that the
terms with even subscripts decrease monotonically to 1, while the terms with
odd subscripts increased monotonically to 1.
Can we prove this?
The subsequence with even subscripts is given by the recursive formula:
while the subsequence with odd subscripts is given by the recursive formula:
In any case, we are interested in the formula
an-2=2-(an2-2)2. In
particular we would like to show that
for odd n, while
for even n (the odd subsequence is increasing while the
even subsequence is decreasing). In other words, we would like to show that
while
In other words we would like to show that
f(x)=x4-4x2+x+2
is greater than 0 for
,
while f(x) is less
than 0 for
.
This is a pre-calculus problem. Note that
So
for
,
while
for
.
All this is much more than we need, but at least it tells us that odd
subsequence is increasing while the even subsequence is decreasing.
To know that they converge we prove that the subsequences are bounded. To do
this we need to show that the odd terms are smaller than the even
terms. Start with
an-1=2-an2. We need to show that
an-1>an if
,
while
an-1<an if
.
In other words, we need to show that
while
Alternatively, we need to show that
g(x)=x2+x-2=(x+2)(x-1)
is positive for
and negative for
.
But using pre-calculus, this is obvious. So
each odd term is smaller than the next term (necessarily even). Even terms
are smaller than
,
so the odd subsequence is increasing, bounded
and so converges. each even term is larger than the next term (necessarily
odd). Odd terms are larger than
.
So the even subsequence
is decreasing, bounded and so converges.
Just for fun, let N be the limit of the even terms. So for n be even,
,
and also
.
Using
,
we find that
So f(N)=0. We determined the roots of f(x) above, and the only root in
is 1. So the even terms converge to
1. Similarly the odd terms also converge to 1.
Uncle ?
Questions and/or comments should be directed to
Judy Downey
or Griff Elder
BACK
Last modified: Fri Nov 17 12:53:39 CST 2000