Re: fibonacci programme

Article View: comp.lang.pascal.borland

Article #333

Back to comp.lang.pascal.borland Previous Next

#333

From: Horst Kraemer
Date: Mon, 19 Apr 1999 00:00

15 lines
1024 bytes

On Mon, 19 Apr 1999 19:50:39 +0100, Dr John Stockton
<jrs@merlyn.demon.co.uk> wrote:

> From memory, that formula cannot be far from one I have known of, which
> is exact.  IIRC, one only needs the first term if one rounds to the
> nearest integer; that *might* not work for VERY small N, but I think it
> does.

It works for every n from 1 up:

fib(n) = round ( (1+sqrt(5))^n / sqrt(5) )


Regards
Horst

Technical Details

Message-ID: <371bb94c.24097000@news.snafu.de>

Path: arc1-ca.pugleaf.net!unknown!not-for-mail

References: <371B0391.E3122AD7@central.ntua.gr> <7ffeoa$avs$1@nnrp1.dejanews.com> <ASxepZA$r3G3EwEI@merlyn.demon.co.uk>

Show Full Headers

Complete Article Headers

X-Google-Language: ENGLISH,ASCII-7-bit
X-Google-Thread: 111659,97274d7edc98e09c
X-Google-Attributes: gid111659,public
X-Google-Thread: 108ebd,b2211ec9fb6b496
X-Google-Attributes: gid108ebd,public
From: horst.kraemer@snafu.de (Horst Kraemer)
Subject: Re: fibonacci programme
Date: 1999/04/19
Message-ID: <371bb94c.24097000@news.snafu.de>
X-Deja-AN: 468511183
References: <371B0391.E3122AD7@central.ntua.gr> <7ffeoa$avs$1@nnrp1.dejanews.com> <ASxepZA$r3G3EwEI@merlyn.demon.co.uk>
Organization: [Posted via] Interactive Networx
Newsgroups: comp.lang.pascal.borland,borland.public.turbopascal

Reply to Parent Message