Graeme's YAnswers Question: The effect of changing values in sequences?

  • Context: MHB 
  • Thread starter Thread starter CaptainBlack
  • Start date Start date
  • Tags Tags
    Sequences
Click For Summary
SUMMARY

The discussion focuses on the mathematical sequence defined by the recurrence relation \(u_{n+1}=2u_{n}+2\) and the impact of varying the initial value \(u_{0}\). It is established that the sequence expands to \(u_{n} = 2^n u_{0} + 2^{n+1} - 2\), demonstrating that the behavior of the sequence is heavily influenced by the initial value. Notably, when \(u_{0}\) is a high negative number, the sequence exhibits a significant change in direction, flipping upside down. The discussion also mentions the potential use of generating functions as an alternative approach for analysis.

PREREQUISITES
  • Understanding of recurrence relations in mathematics
  • Familiarity with mathematical induction
  • Knowledge of generating functions
  • Basic algebraic manipulation skills
NEXT STEPS
  • Study the properties of recurrence relations in depth
  • Learn about mathematical induction techniques
  • Explore generating functions and their applications in sequences
  • Investigate the behavior of sequences with varying initial conditions
USEFUL FOR

Students studying mathematics, particularly those focusing on sequences and series, educators teaching mathematical concepts, and anyone interested in advanced algebraic techniques.

CaptainBlack
Messages
801
Reaction score
0
The effect of changing values in sequences??

I have been given a maths assignment and have been given equations \(u_{n+1}=2u_{n}+2\) and asked what is the effect if the value \(u_{0}\) is changed? I used multiple values both positive and negative and have only noticed taht when it is a high negative number it flips up side down?

.
 
Physics news on Phys.org
Look at what happens as you expand the sequence:

\(u_{1} = 2 u_{0}+2\)
\(u_{2} = 2( 2 u_{0}+2 ) + 2 =2^2 u_{0} + 2^2 + 2\)
\(u_{3} = 2( 2^2 u_{0} + 2^2 + 2 ) + 2 = 2^3 u_{0} + 2^3 + 2^2 + 2\)
:
:
\(u_{n} = 2^n u_{0} + 2^n + 2^{n-1} + ... + 2^2 + 2\)

The earlier terms in the sequence above suggest the last one, which can be easily proven by induction.

The last term can now be simplified to:

\(u_{n} = 2^n u_{0} + 2^{n+1} - 2\)

So you now have all the information you need to answer questions about how the sequence depends on \(u_{0}\).
 
An alternative would be generating functions (which I'm quite fond of). (Inlove)
 

Similar threads

  • · Replies 7 ·
Replies
7
Views
2K
  • · Replies 6 ·
Replies
6
Views
2K
Replies
29
Views
5K
  • · Replies 9 ·
Replies
9
Views
4K
  • · Replies 78 ·
3
Replies
78
Views
6K
  • · Replies 13 ·
Replies
13
Views
4K
Replies
4
Views
2K
  • · Replies 5 ·
Replies
5
Views
3K
  • · Replies 11 ·
Replies
11
Views
2K
  • · Replies 1 ·
Replies
1
Views
2K