jeffceth
- 40
- 0
Sorry, I don't know what category to put this in.
Here's my problem:
I have some corresponding values for two variables a and b.
I also know that
a_n = 2a_{n-1} + b_{n-1}
and
b_n = b_{n-1} + a_n
for all a and b.
I need to find functions f_1 and f_2 in terms of n so that f_1(n) = a_n and f_2(n) = b_n
I don't really know where to start. I tried recombining the first two equations in myriad ways but I didn't get anywhere there. I have figured out that this would be pretty tough without the sample values to generate the others, and that the answers will be in general form because n = 1 could refer to any of the pairs of values, although all of them can be generated from a single pair. What do I do?
Here's my problem:
I have some corresponding values for two variables a and b.
I also know that
a_n = 2a_{n-1} + b_{n-1}
and
b_n = b_{n-1} + a_n
for all a and b.
I need to find functions f_1 and f_2 in terms of n so that f_1(n) = a_n and f_2(n) = b_n
I don't really know where to start. I tried recombining the first two equations in myriad ways but I didn't get anywhere there. I have figured out that this would be pretty tough without the sample values to generate the others, and that the answers will be in general form because n = 1 could refer to any of the pairs of values, although all of them can be generated from a single pair. What do I do?