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

You are not logged in.

|
Options

scientia
2012-11-07 10:12:12

#### steewan wrote:

My teacher gave me this problem and I can't figure it out.

Jn= J(n-1) + n, j1=2

I've gotten:
j1 = 2
j2 = 2 + 2
j3 = 2+3+2
j4 = 2+4+3+2
J5 = 2+5+4+3+2

Did I do this right so far and is if so, where do I go from here?

It's quite obvious that
. Try verifying it by mathematical induction.

bobbym
2012-11-07 01:56:04

Hi steewan;

Every recurrence must always have an initial condition. It appears that yours is J(0)=1. In which case J(2) is incorrect.

Also you are not computing that recurrence correctly.

where do I go from here?

Depends on what you are being asked to do. Were you asked to solve the recurrence? To plot it? To determine it's limit?

anonimnystefy
2012-11-07 01:44:55

What does j=2 mean?

steewan
2012-11-07 01:20:34

My teacher gave me this problem and I can't figure it out.

Jn= J(n-1) + n, j=2

I've gotten:
j1 = 1
j2 = 2 + 2
j3 = 2+3+2
j4 = 2+4+3+2
J5 = 2+5+4+3+2

Did I do this right so far and is if so, where do I go from here?