You are not logged in.
#1 2012-11-07 01:20:34
- steewan
- Guest
Recurrence Relations and Backtracking
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?
#2 2012-11-07 01:44:55
- anonimnystefy
- Real Member
Offline
Re: Recurrence Relations and Backtracking
What does j=2 mean?
The limit operator is just an excuse for doing something you know you can't.
“It's the subject that nobody knows anything about that we can all talk about!” ― Richard Feynman
“A secret's worth depends on the people from whom it must be kept.” ― Carlos Ruiz Zafón
#3 2012-11-07 01:56:04
- bobbym
- Administrator
Offline
Re: Recurrence Relations and Backtracking
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?
In mathematics, you don't understand things. You just get used to them.
90% of mathematicians do not understand 90% of currently published mathematics.
I am willing to wager that over 75% of the new words that appeared were nothing more than spelling errors that caught on.
#4 2012-11-07 10:12:12
- scientia
- Full Member
Offline
Re: Recurrence Relations and Backtracking
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.
Last edited by scientia (2012-11-07 10:12:49)