Discussion about math, puzzles, games and fun. Useful symbols: ÷ × ½ √ ∞ ≠ ≤ ≥ ≈ ⇒ ± ∈ Δ θ ∴ ∑ ∫ π -¹ ² ³ °

You are not logged in.

- Topics: Active | Unanswered

Pages: **1**

**Catatonic****Member**- Registered: 2005-09-21
- Posts: 1

Hi!

I have a recursive formula like this:

a0 = 0

a3 = 1

a4 = 3

a5 = 6

a6 = 10

an+1 = an + (n-1) n >= 3

I need to find a formula for this recursion and prove it by induction. How would i do this?

Offline

**John E. Franklin****Member**- Registered: 2005-08-29
- Posts: 3,562

I don't see what your asking. Something seems jumbled.

All I see is that your example keeps increasing by an amount that goes up by one each time.

*Last edited by John E. Franklin (2005-09-27 07:48:00)*

**igloo** **myrtilles** **fourmis**

Offline

Pages: **1**