Let an be the recurrence defined by (for all n > 0)

Prove using strong induction that (for all n greater than or equal to 0)

Any help is appreciated!

Printable View

- May 3rd 2009, 09:09 AMtshare1Strong Induction Problem using Summations
Let an be the recurrence defined by (for all n > 0)

Prove using strong induction that (for all n greater than or equal to 0)

Any help is appreciated! - May 3rd 2009, 09:10 AMTheEmptySet
- May 3rd 2009, 09:12 AMtshare1
Sorry, I was figuring out the latex thing.