how to find the recursive rule for 3,4,1,-3,-4...?
do you see any kind of pattern?
It's neither arithmetic or geometric
like how can you get 1 from the first two numbers? how can you get -3 from the previous two numbers?
I couldn't find a common difference or a common rate, so i couldn't find the rule
there is no common difference or ratio
could somebody help me?
do you know that 4-3=1? and that 1-4=-3?
Yes, I did that. so it's +1,-3,-4, -1
3,4,1,-3,-4 notice 4-3=1 1-4=-3 -3-1=-4 and so on... notice you are taking the second term in every pair and subtracting the first number from that pair
so you have term-previous term=next term
try setting up the recurrence relation from there
so I find the rule for 1, -3, and -4 first?
i don't know what you mean i already gave you the recurrence relation you just have to put the appropriate math symbols in
\[\text{ notice you have } \\ a_2-a_1=a_3 \\ a_3-a_2=a_4 \\ \\ \cdots \]
so ... \[a_n-?=?\] what are the question marks in this equation
ohh, so its the previous term subtracted from the previous previous term
it is what I said earlier term-previous term=next term
a(n)=a(n-2)-a(n-1)
Thanks! I thought it was going to be a quadratic recursive rule, so i was confused.
your equation says term=previous previous term-previous term so testing... plug in n=3 \[a_3=a_{3-2}-a_{3-1} \\ a_3=a_1-a_2 \\ 1=3-4 \\ 1=-1 \\ \text{ but this is \not true }\] maybe you meant term=previous term-previous previous term
if you have a term a(n) then the previous term is a(n-1) and the previous previous term is a(n-2)
and if you wanted to use my equation you would need to find the next term to a(n) which would be a(n+1)
a(n)=a(n-1)-a(n-2)?
yes that looks better
Thank you again for your help!
np I think I see what you were trying to do. You were trying to look at first maybe even second differences.
The first thing I thought of and since it say recurrence relation (and since it had no common ratio or common difference) I try to look for a pattern in terms of previous or next or both types of terms since that is how you write a recurrence relation. could you write a recurrence relation for the following? 1,1,2,3,5,8,...
a(n)=a(n-2)+a(n-1)
oops sorry my notifications didn't work
that is right lol did you know that was the Fibonacci sequence when you answered?
lol yep.
such a famous sequence :p
would you mind helping me with another sequence?
sure i can try
(thanks!) 1, 1, 1/3, 1/4, 1/15...
i'm thinking
@Kainui @ganeshie8
I guess there are no hints?
No
are there any limits on how many terms can be in the recurrence relation?
It's an infinite sequence
It just says to write a recursive rule for the sequence
Here's my recurrence relation: \[\frac{1}{3(a_0+a_1+3a_2+4a_3+1)}=a_4\]
\[a_n = \dfrac{a_{n-2}}{n}\\~\\a_1 = a_2=1\]
that's very groovy @ganeshie8
I don't think I would have seen that
like ever
Ohhh, so that's how you do it. Thanks! Is there a way to calculate it or is it just guess and check?
There is no unique answer as we can cookup infinitely many sequences having the first few terms as common one boring, but systematic way is to find a polynomial fit of the given terms...
Oh ok. Thank you very much for your help.
Join our real-time social learning platform and learn together with your friends!