Problem: The Pell numbers pn are defined by the recurrence relation pn+1=2pn+pn−1 for n≥1, together with p0=0 and p1=1.
Prove with mathematical induction that pn+1pn−1−p2n=(−1)n for every n∈N∖{0}.
Proof: Initial step: for n=1 we have p2p0−p21=(−1) which is true given the initial conditions.
Inductive step: Suppose the above expression is true for n>1. Then we have to show that it is also true for n+1. So we have pn+1pn−1−p2n=(−1)n. I now plugged in the expression for pn+1 given above, and thus got: (2pn+pn−1)pn−1−p2n=(−1)n, or 2pnpn−1+p2n−1−p2n=(−1)n.
I'm not sure if I'm doing this right, and I don't know how to proceed. Any help would be appreciated.
Answer
Look at what you want to show: you want to show that pn+2pn−p2n+1=(−1)n+1. You know that pn+2=2pn+1+pn, so this is equivalent to
(−1)n+1=(2pn+1+pn)pn−p2n+1=p2n+2pnpn+1−p2n+1.
Your induction hypothesis is that pn+1pn−1−p2n=(−1)n; that has a pn−1 that isn’t present in (1), so perhaps we should manipulate the target (1) a bit more to get a pn−1. We might apply pn+1=2pn+pn−1 to one of the factors of pn+1 in p2n+1 to get
p2n+2pn+1−p2n+1=p2n+2pn+1−pn+1(2pn+pn−1)=p2n+2pnpn+1−2pnpn+1−pn−1pn+1=p2n−pn−1pn+1.
Can you finish it from there?
No comments:
Post a Comment