Register to reply

Recurrence relations and sequences

by naav
Tags: recurrence, relations, sequences
Share this thread:
naav
#1
Jul6-04, 06:58 AM
P: 18
Hi...

1. so can i say that a recurrence relation is a description of the operation(s) involved in a sequence...???...

2. is the formula for an arithmetic sequence, a recurrence relation...???...

and is the formula for a geometric sequence,
a recurrence relation...???...
Phys.Org News Partner Mathematics news on Phys.org
'Moral victories' might spare you from losing again
Fair cake cutting gets its own algorithm
Effort to model Facebook yields key to famous math problem (and a prize)
tomkeus
#2
Jul6-04, 07:12 AM
P: 79
1.Say rather that it is a rule which forms sequence.
2.If you mean [tex]a_{n+1}=a_n+d[/tex], then it is.
3.If you mean [tex]a_{n+1}=qa_n[/tex], then it is.

Any form like this:
[tex]a_1=x[/tex]
[tex]a_{n+1}=f(a_n...a_1)[/tex]
is a recurrence relation.
matt grime
#3
Jul6-04, 07:33 AM
Sci Advisor
HW Helper
P: 9,398
It needn't be just a function of the previous term in the sequence. that is a first order recurrence relation, for want of a better term (think first order differential equation). things such as the fibonacci numbers satisfy a degree two difference equation (recurrence relation):

a_1=1, a_2=1, a_n=a_{n-1}=a_{n-2} for n>2,

for example

naav
#4
Jul7-04, 12:13 PM
P: 18
Recurrence relations and sequences

Hi...thanks...

i was told that a recurrence relation expresses a term in the sequence with regards to other terms in the sequence...whereas the formulae for the arithmetic and geometric sequences don't...

...???...
Gokul43201
#5
Jul7-04, 12:53 PM
Emeritus
Sci Advisor
PF Gold
Gokul43201's Avatar
P: 11,155
Quote Quote by naav
Hi...thanks...

i was told that a recurrence relation expresses a term in the sequence with regards to other terms in the sequence...whereas the formulae for the arithmetic and geometric sequences don't...

...???...
Yes, for an arithmetic sequence, you would say that

[tex] a_n = a_{n-1} + d,~~ n = 1,2,3,... [/tex]

This is how an AS is defined. But it's not hard to figure from here, that

[tex] a_n = a_1 + (n-1)d , ~~for~~ n=1,2,3,...[/tex]
naav
#6
Jul7-04, 03:05 PM
P: 18
Hi...thanks...

1. so i guess there's a similar recurrence relation for a geometric sequence...???...

2. so then why have a recurrence relation when you can express the SAME sequence by a formula...???...
Gokul43201
#7
Jul7-04, 03:32 PM
Emeritus
Sci Advisor
PF Gold
Gokul43201's Avatar
P: 11,155
Quote Quote by naav
Hi...thanks...

1. so i guess there's a similar recurrence relation for a geometric sequence...???...

2. so then why have a recurrence relation when you can express the SAME sequence by a formula...???...
Yes, for a Geometric Sequence,

[tex]a_n=r*a_{n-1}, ~n=1,2,3,...[/tex]
[tex] ~~~ = a_1*r^{n-1}[/tex]

Sometimes, it hard (or impossible ) to find a formula for the n'th term, but you can describe the entire series by a recurrence relation. For the Fibonacci Sequence (decribed by matt, above) it's hard to find such a formula (though there is a good approximation that works well for the large terms ).
e(ho0n3
#8
Jul7-04, 04:20 PM
P: 1,370
Quote Quote by Gokul43201
For the Fibonacci Sequence (decribed by matt, above) it's hard to find such a formula (though there is a good approximation that works well for the large terms ).
I'm going to disagree here. The Fibonacci recurrence is a simple second-order linear homogenous recurrence relation with constant coefficients (both of them being 1). These types of recurrences are easily 'solvable'. The explicit formula for the Fibonacci sequence involves the Golden Ration by the way, which I find extremely curious.


Register to reply

Related Discussions
Recurrence Relations Calculus & Beyond Homework 7
Another on recurrence sequences Linear & Abstract Algebra 2
Help with linear homogeneous recurrence relations Calculus & Beyond Homework 4
Recurrence relations Calculus & Beyond Homework 0
[Discrete Math] Recurrence Relations Calculus & Beyond Homework 9