From: <HIDDEN>
Newsgroups: comp.soft-sys.matlab
Subject: Re: fibonacci numbers
Date: Wed, 19 Nov 2008 01:22:01 +0000 (UTC)
Organization: The MathWorks, Inc.
Lines: 16
Message-ID: <gfvpnp$6tp$>
References: <gfv1n2$r4j$> <gfvi5t$39q$> <gfvju6$8er$> <gfvltu$qpd$> <gfvmfc$89e$> <gfvn5a$edd$> <gfvno1$mhd$>
Reply-To: <HIDDEN>
Content-Type: text/plain; charset="ISO-8859-1"
Content-Transfer-Encoding: 8bit
X-Trace: 1227057721 7097 (19 Nov 2008 01:22:01 GMT)
NNTP-Posting-Date: Wed, 19 Nov 2008 01:22:01 +0000 (UTC)
X-Newsreader: MATLAB Central Newsreader 1187260
Xref: comp.soft-sys.matlab:501620

"Matt" <> wrote in message <gfvno1$mhd$>...
> .........
> OK. Well, the left hand tail of the sequence obeys the difference equation
> F(-k)=F(-k+2)-F(-k+1), k=0,1,...
> You must solve this difference equation with boundary conditions
> F(0)=0, F(1)=1
> to get that half of the sequence.

  Matt, I think you will find that the same Binet formula works for negative values of n, so the use of difference equations can be avoided altogether.

Roger Stafford