Saturday, 14 February 2015

discrete mathematics - Find closed form for a1=2,an=an1+n+6



I have determined that a2=10,a3=19,a4=29,a5=40,a6=52, and a7=65. I can see that there is a pattern in that each value increases by 8, then 9, then 10, then 11, then 12, etc. but I am having difficulty making an equation for it.



I thought I had it when I realized that a2=9+1,a3=16+4,a4=25+4,a5=36+4, and so on, but then I realized it was not very consistent. Also, the difference between an(n1)2 starts to get smaller as the value of n increases, and then begins to increase again later.



Am I going about this completely wrong? Is there a way to find a closed form for an=an1+n+6 when a1=2?


Answer



Hint:




reorder the terms:



a1=2
a2=a1+2+6=2+2+6
a3=a2+3+6=2+2+6+3+6=2+(2+3)+26
a4=a3+4+6=2+(2+3)+26+4+6=2+(2+3+4)+36



this suggests:



an=2+(n1)(2+n)2+6(n1)




Now prove that it works giving an=an1+n+6


No comments:

Post a Comment

real analysis - How to find limhrightarrow0fracsin(ha)h

How to find lim without lhopital rule? I know when I use lhopital I easy get $$ \lim_{h\rightarrow 0}...