(adsbygoogle = window.adsbygoogle || []).push({}); Code (Text):

This is the question I must solve;

Solve the given recurrence relation for the given inital conditions.

(This means give a formula in terms of n, not in terms of previous entries)

a[sub]n[/sub] = 7a[sub]n-1[/sub] - 12a[sub]n-2[/sub]

a[sub]0[/sub] = 3 a[sub]1[/sub] = 10

Now I am not sure what that means but I think this will solve the question

let me know if I am not even close;

Input = n

Output = X(n)

procdure find(n)

if n = 3 or n = 10 then

return (n)

return(find(n-1)+find(n-2))

end find(n)

**Physics Forums | Science Articles, Homework Help, Discussion**

Dismiss Notice

Join Physics Forums Today!

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

# Homework Help: Recursie Algorithms. Is my solution ok?

**Physics Forums | Science Articles, Homework Help, Discussion**