## anonymous one year ago 6 13 38 ? 532 2675

• This Question is Open
1. dan815

|dw:1435053690269:dw|

2. dan815

|dw:1435054001940:dw|

3. dan815

kind of like a brute force method

4. dan815

|dw:1435054432140:dw|

5. dan815

or u can write out the diferences and see if you can find a solution to x, such that all the differences are equal, and if the that solves the terms u want

6. ganeshie8

does this recurrence relation work\[a_0 = 6,\\~\\a_{n}=(a_{n-1}+8-n)*n\]

7. dan815

ya that works -.- how did u see that

8. dan815

wait no it doesnt

9. dan815

thaat works though

10. welshfella

no it doesen't

11. dan815

u prolly typoed but.. how did u find it?

12. ganeshie8

oh which term is it failing ?

13. dan815

the brackets were wrong thats all

14. welshfella

is it correct for second term?

15. dan815

oh wait no its fine actually nothing is wrong

16. welshfella

6 + (8-2)*2

17. dan815

|dw:1435055099574:dw|

18. ganeshie8

Ahh that looks much better than the recurrence relation @welshfella index starts with 0 :)

19. welshfella

oh - right - i see

20. ganeshie8

|dw:1435055237602:dw|

21. dan815

right

22. dan815

is ther closed form for this recurrence

23. ganeshie8

yes but you don't wanto see it

24. ganeshie8

\[a(n) = -e n^2 \Gamma(n, 1)+6 \Gamma(n+1)+7 e n \Gamma(n, 1)+e n \Gamma(n+1, 1)-e \Gamma(n+1, 1)+1 \]

25. ganeshie8
26. dan815

haha whaat

27. welshfella

wow!