Hi,(adsbygoogle = window.adsbygoogle || []).push({});

1. The problem statement, all variables and given/known data

Just having some troubles with a proof i have been asked to do, (sorry for not knowing the math code)

basically, f(1)=0, f(2)=1/3 and f(n)= ((n-1)/(n+1))*f(n-2)

and i've come up with the conjecture that f(n) = 0 when n is odd, and = 1/(n+1) when n is even.

and i have to prove my conjecture, this is where i'm stuck,

2. Relevant equations

anyone care to point me in the right direction?

3. The attempt at a solution

not really sure what method to use, induction?

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

# You are subscribed to this thread Proving conjecture for recursive function

Know someone interested in this topic? Share a link to this question via email,
Google+,
Twitter, or
Facebook

Have something to add?

- Similar discussions for: You are subscribed to this thread Proving conjecture for recursive function

Loading...

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