Safe Haskell | None |
---|---|
Language | Haskell2010 |
Bernoulli and Euler polynomials
Synopsis
- bernoulliB :: (Field c, KnownSymbol v) => Int -> Univariate c v
- eulerE :: (Field c, KnownSymbol v) => Int -> Univariate c v
- rationalBernoulliB :: Int -> Univariate Rational "x"
- rationalEulerE :: Int -> Univariate Rational "x"
- bernoulliNumber :: Integral a => a -> Rational
- signedEulerNumber :: Int -> Integer
- unsignedEulerNumber :: Int -> Integer
- eulerianPolynomial :: Int -> Univariate Integer "x"
Documentation
bernoulliB :: (Field c, KnownSymbol v) => Int -> Univariate c v Source #
Bernoulli polynomials
eulerE :: (Field c, KnownSymbol v) => Int -> Univariate c v Source #
Euler polynomials (not to be confused with the related Eulerian polynomials!)
rationalBernoulliB :: Int -> Univariate Rational "x" Source #
rationalEulerE :: Int -> Univariate Rational "x" Source #
bernoulliNumber :: Integral a => a -> Rational Source #
Bernoulli numbers. bernoulli 1 == -1%2
and bernoulli k == 0
for
k>2 and odd. This function uses the formula involving Stirling numbers
of the second kind. Numerators: A027641, denominators: A027642.
signedEulerNumber :: Int -> Integer Source #
Signed Euler numbers (unsigned version: A000364)
See https://en.wikipedia.org/wiki/Euler_number
NOTE: we skip the zeros (every other index)
unsignedEulerNumber :: Int -> Integer Source #
unsigned Euler numbers (A000364)
NOTE: we skip the zeros (every other index)
eulerianPolynomial :: Int -> Univariate Integer "x" Source #
Eulerian polynomials (row polynomials of A060187)