# Thread:

1. ## Induction Sequence

an = 1 + 2an-1
a1 = 1
a)Guess what an is based on inspection of this sequence
b) Prove the expression in (a) using induction

edit: ah my subscript got messed up, dunno how to post it on forums

suppose to be a subscript n = 1 + 2a subscript n-1
a subscript 1 = 1

2. Originally Posted by kentwoods
an = 1 + 2an-1
a1 = 1
a)Guess what an is based on inspection of this sequence
b) Prove the expression in (a) using induction

edit: ah my subscript got messed up, dunno how to post it on forums

suppose to be a subscript n = 1 + 2a subscript n-1
a subscript 1 = 1
$a_n = \{1,3,7,15,31,63,...\}$

Can you see the general pattern in the difference of every two successive elements?

3. yea looks like 2n + 1 ?

How would I show this by induction tho?

4. Originally Posted by kentwoods
yea looks like 2n + 1 ?

How would I show this by induction tho?
How is it 2n+1?

You have odd numbers there, yes, but the nth number is definitely not 2n+1...

Look at it this way:

$3-1 = 2$
$7-3 = 4$
$15-7 = 8$
$31-15 = 16$

What do 2,4,8,16 have in common?

Or, look at it this way:

$1= 2-1$
$3 = 4-1$
$7 = 8-1$
$15 = 16-1$
.
.
.

5. hmm

$2^n -1$

i think thats what you were trying to show me, im really bad when it comes to this

I cannot visualize it easily

6. Originally Posted by kentwoods
hmm

$2^n -1$

i think thats what you were trying to show me, im really bad when it comes to this

I cannot visualize it easily
Yes, that is correct. Now, we need to prove that $a_n = 2^n -1$ by induction.

Basis: n=1: $a_1 = 1, 2^1-1 = 1 = a_1 \Rightarrow$ correct.

Assume that it holds for n (that is, $a_n = 2^n-1$), and now we need to prove that it is correct for $n+1$, that is, we need to prove that $a_{n+1} = 2^{n+1}-1$.

$a_{n+1} = 1+2a_{n} \overbrace{=}^{\text{By the assumption for n}} 1+ 2\cdot (2^n-1) = 1 + 2 \cdot 2^n - 2 = 2 \cdot 2^n - 1 =$ $2^{n+1}-1 \Rightarrow a_{n+1} = 2^{n+1}-1$ which is what we wanted to prove, therefore the assumption holds for any $n \in \mathbb{N}$ and we are done.

7. Thanks mate, that actually makes a lot of sense when i go through it slowly

Just a quick question though, when we went over examples in class we always proved n-1 instead of n+1. Basically if one is true the one before it is true as well. I'm assuming this works the same way.

8. Originally Posted by kentwoods
Thanks mate, that actually makes a lot of sense when i go through it slowly

Just a quick question though, when we went over examples in class we always proved n-1 instead of n+1. Basically if one is true the one before it is true as well. I'm assuming this works the same way.
I don't think I follow. Did you assume that it is correct for n and prove for n-1? Or assume correct for n-1 and prove for n? If the latter, then that is equivalent to what I did. Otherwise, that is not the way to use induction (it is not correct).

9. no I meant the latter, i meant assume for n-1 and prove for n
{"extraction_info": {"found_math": true, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 0, "mathjax_tag": 0, "mathjax_inline_tex": 0, "mathjax_display_tex": 0, "mathjax_asciimath": 0, "img_math": 0, "codecogs_latex": 19, "wp_latex": 0, "mimetex.cgi": 0, "/images/math/codecogs": 0, "mathtex.cgi": 0}, "config": {"markdown_headings": true, "markdown_code": true, "boilerplate_config": {"ratio_threshold": 0.18, "absolute_threshold": 10, "end_threshold": 15, "enable": true}, "remove_buttons": true, "remove_image_figures": true, "remove_link_clusters": true, "table_config": {"min_rows": 2, "min_cols": 3, "format": "github"}, "remove_chinese": true, "remove_edit_buttons": true, "extract_latex": true}, "english_confidence": 0.957744836807251, "perplexity_flag": "middle"}