Prove <munderover> &#x2211;<!-- ∑ --> <mrow class="MJX-TeXAtom-ORD"> n =

groupweird40

groupweird40

Answered question

2022-05-29

Prove n = 0 1 x n a n 1 < for 0 a < 1 and 1 < x n + 1 x n n

Answer & Explanation

xxsailojaixxv5

xxsailojaixxv5

Beginner2022-05-30Added 10 answers

For any a < 1 there is an integer n 0 ( a ) such that a n 1 2 for each n n o ( a ). Thus:
n = 0 ( a n x n a n )     n = 0 n 0 ( a ) 1 ( a n x n a n ) + n = n 0 ( a ) ( a n x n a n )
Then using a n 1 2 for all n, gives a n x n a n 2 a n for all n n 0 ( a ), which in turn gives:
n = 0 n 0 ( a ) 1 ( a n x n a n ) + n = n 0 ( a ) ( a n x n a n )
  n = 0 n 0 ( a ) 1 ( a n x n a n ) + n = n 0 ( a ) 2 a n .
As each x n satisfies x n > 1, it follows that n = 0 n 0 ( a ) 1 ( a n x n a n ) is a finite number of terms each finite, and so this is finite for each a < 1. Also, as n = n 0 ( a ) 2 a n is a geometric series, it follws that n = n 0 ( a ) 2 a n is bounded for a < 1. Thus, it follows that n = 0 n 0 ( a ) ( a n x n a n ) + n = n 0 ( a ) 2 a n is bounded, and thus, so is n = 0 ( a n x n a n )

Do you have a similar question?

Recalculate according to your conditions!

Ask your question.
Get an expert answer.

Let our experts help you. Answer in as fast as 15 minutes.

Didn't find what you were looking for?