Home Online Manual
Top
Back: toddE
Forward: tdCf
FastBack:
FastForward:
Up: chern_lib
Top: Singular Manual
Contents: Table of Contents
Index: Index
About: About this document

D.15.3.36 Bern

Procedure from library chern.lib (see chern_lib).

Usage:
Bern(n); n non-negative integer

Return:
list of numbers

Purpose:
computes the list of (second) Bernoulli numbers from B(0) to B(n)

Note:
needs a base ring to be defined, returns an empty list if n is negative, uses the Akiyama-Tanigawa algorithm

Example:
 
LIB "chern.lib";
// first 10 Bernoulli numbers: B(0), ..., B(9)
ring r=0,(t), dp;
print( Bern(9) );
==> [1]:
==> 1
==> [2]:
==> 1/2
==> [3]:
==> 1/6
==> [4]:
==> 0
==> [5]:
==> -1/30
==> [6]:
==> 0
==> [7]:
==> 1/42
==> [8]:
==> 0
==> [9]:
==> -1/30
==> [10]:
==> 0