Hi I'm doing a project in math and seem to be stuck on one part.(adsbygoogle = window.adsbygoogle || []).push({});

I come to trying to solve this recursion equation given by....

f(x) = -f(x-1) + g(x) where g(x) is known.

Would anyone mind showing me how to go around solving for f(x)?

In this case i have g(x)=x[tex]^{2}[/tex] and f(0)=0 and f(1)=1

but will need to solve for any g(x) later on.

Thank You!

**Physics Forums - The Fusion of Science and Community**

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

# Simple recursion

Loading...

Similar Threads - Simple recursion | Date |
---|---|

B Simple question about compactness | Feb 22, 2018 |

B Simple Question About Term(s) re: Fermat | Jan 19, 2018 |

B A rather simple question | Dec 13, 2017 |

B How do you solve this simple problem: (-2)^(n-1) = 2^8 | Apr 14, 2017 |

I Formula involving polynomial sequences + recursive reps | Nov 8, 2016 |

**Physics Forums - The Fusion of Science and Community**