Home Online Manual
Top
Back: factorial
Forward: kmemory
FastBack:
FastForward:
Up: general_lib
Top: Singular Manual
Contents: Table of Contents
Index: Index
About: About this document

D.2.3.7 fibonacci

Procedure from library general.lib (see general_lib).

Usage:
fibonacci(n); n,p integers

Return:
fibonacci(n): nth Fibonacci number, f(0)=f(1)=1, f(i+1)=f(i-1)+f(i)
- computed in characteristic 0, of type bigint

Example:
 
LIB "general.lib";
fibonacci(42);
==> 267914296
See also: prime.