• Support PF! Buy your school textbooks, materials and every day products Here!

Combinatorics back-substitution Question

  • Thread starter Askhwhelp
  • Start date
  • #1
86
0
1) an = an-1 + 2n with a0 = 2
The question is Use back-substitution to find a closed formula for the recurrence relations.
I have an-4 + 2(n-3)+2(n-2)+2(n-1)+2n
Then I have a1 + ... +2(n-5)+2(n-4)+2(n-3)+2(n-2)+2(n-1)+2n
First of all, is my way right? If so, could you please help me find the recurrence relations?
If no, could you tell I have done wrong and point me to the right direction?

2) Find and solve a recurrence relation for pn the value of a stock market indicator that obeys the rule that the change this year from the previous year (that is, pn - pn-1) equals twice last year's
change. Let p0 = 1; p1 = 4.
I have a trouble to translate " the rule that the change this year from the previous year (that is, pn - pn-1) equals twice last year's" into recurrence relation. Can someone please help?
 

Answers and Replies

  • #2
LCKurtz
Science Advisor
Homework Helper
Insights Author
Gold Member
9,535
751
1) an = an-1 + 2n with a0 = 2
The question is Use back-substitution to find a closed formula for the recurrence relations.
I have an-4 + 2(n-3)+2(n-2)+2(n-1)+2n
Then I have a1 + ... +2(n-5)+2(n-4)+2(n-3)+2(n-2)+2(n-1)+2n
First of all, is my way right? If so, could you please help me find the recurrence relations?
If no, could you tell I have done wrong and point me to the right direction?
I presume you mean ##a_n = a_{n-1} +2n## with ##a_0=2##. I would write out the first few, taking care not to simplify, which might hide any patterns:

##a_1 = 2 + 2\cdot 1##
##a_2 = 2 + 2\cdot 1 + 2\cdot 2##
##a_3 = 2 + 2\cdot 1 + 2\cdot 2 + 2\cdot 3##

Do you see any patterns or useful expressions you can use to get a nice closed formula for ##a_n##?
 
  • #3
86
0
The answer should be 2+n+n^2?

Thanks
 
Last edited:
  • #4
768
4
2) Find and solve a recurrence relation for pn the value of a stock market indicator that obeys the rule that the change this year from the previous year (that is, pn - pn-1) equals twice last year's
change. Let p0 = 1; p1 = 4.
I have a trouble to translate " the rule that the change this year from the previous year (that is, pn - pn-1) equals twice last year's" into recurrence relation. Can someone please help?
Sounds to me like: [itex] (p_2-p_1)=2(p_1-p_0) [/itex] so, [itex] p_n-p_{n-1}=2(p_{n-1}-p_{n-2}) [/itex].
 
  • Like
Likes 1 person
  • #5
LCKurtz
Science Advisor
Homework Helper
Insights Author
Gold Member
9,535
751
The answer should be 2+n+n^2?

Thanks
Can't you check it for yourself?
 

Related Threads on Combinatorics back-substitution Question

  • Last Post
Replies
1
Views
456
  • Last Post
Replies
2
Views
842
  • Last Post
Replies
2
Views
921
  • Last Post
Replies
2
Views
697
  • Last Post
Replies
2
Views
2K
  • Last Post
Replies
2
Views
1K
  • Last Post
Replies
2
Views
2K
  • Last Post
Replies
6
Views
1K
  • Last Post
Replies
2
Views
2K
  • Last Post
Replies
3
Views
512
Top