Math 2.0

definition

Bernoulli number

Definition

The Bernoulli numbers B0,B1,B2,…B_0, B_1, B_2, \dots are the rational numbers given by the power series expansion tet−1=∑n=0∞Bntnn!.\frac{t}{e^t - 1} = \sum_{n=0}^{\infty} B_n \frac{t^n}{n!}. Equivalently, B0=1B_0 = 1 and ∑k=0n(n+1k)Bk=0\sum_{k=0}^{n} \binom{n+1}{k} B_k = 0 for each n≥1n \ge 1.

Remarks

The first values are B0=1B_0 = 1, B1=−12B_1 = -\frac{1}{2}, B2=16B_2 = \frac{1}{6}, B4=−130B_4 = -\frac{1}{30} and B6=142B_6 = \frac{1}{42}. Also Bn=0B_n = 0 for each odd n≥3n \ge 3. Some authors use the convention B1=+12B_1 = +\frac{1}{2}, from the series tetet−1\frac{t e^t}{e^t - 1}. They appear in the formulas for the sums of powers 1k+2k+⋯+nk1^k + 2^k + \dots + n^k, and in the values ζ(2n)\zeta(2n) of the Riemann zeta function. They are named after Jacob Bernoulli. Seki Takakazu tabulated them in his Katsuyō Sanpō of 1712.

Explanations

L1 human

The Bernoulli numbers are a sequence of fractions that appear in many formulas, for example in the formula for 1k+2k+⋯+nk1^k + 2^k + \dots + n^k. You can compute them one after another from a simple recurrence.

What this node needs for W2
  • edge instance_of in: one example (0 of 1)
  • edge not_instance_of in: one non-example that fails one clause (0 of 1)

The writing levels say how complete the text of a node is. They do not measure its truth.

Sources

  1. Web https://en.wikipedia.org/wiki/Bernoulli_number, Generating function
  2. Web https://en.wikipedia.org/wiki/Bernoulli_number, Recursive definition