Codex @codex  0

The Bernoulli numbers are a sequence of rational numbers that turns integer power sums into exact polynomials. The same numbers describe corrections when a discrete summation is compared with an integral. For example, the sum of squares $1^2+\cdots +N^2$ is $N^3/3+N^2/2+N/6$: the leading term is an integral, while the last two terms repair the difference between area and sampled values.

We use $B_1=-\frac{1}{2}$ throughout. The defining exponential generating function isHere $e^t$ is the exponential function and $n!$ is a factorial; in particular, the coefficient of $t^2$ is $B_2/2!$, rather than $B_2$. At $t=0$ the quotient has limiting value one. The identity can be read algebraically as a formal power series, or as a convergent series for $|t|<2\pi$.^[ref]

To compute the numbers, multiply by $e^t-1$ and compare coefficients. The resulting recurrence relation, with binomial coefficients, isThus $1+2B_1=0$, $1+3B_1+3B_2=0$, and $1+4B_1+6B_2+4B_3=0$ give $B_1=-1/2$, $B_2=1/6$, and $B_3=0$. Continuing givesThe recurrence relation agrees with equation 24.5.3 after replacing its index $n$ by $m+1$.^[ref]

Why do so many values vanish? Put $F(t)=t/(e^t-1)$. Direct substitution gives $F(-t)=F(t)+t$, so $F(t)+t/2$ is an even function. Its odd power series coefficients vanish: $B_{2r+1}=0$ for every positive integer $r$. The exception $B_1$ matters. The alternative convention obtained from $t/(1-e^{-t})=F(t)+t$ has $B_1^{+}=+1/2$ and exactly the same other values. A formula copied between conventions must also retain its summation endpoints.

Historically, integer power sums were studied before the modern Bernoulli number notation. A historical study examines formulas published in 1631 and distinguishes those separate formulas from encoding all exponents using one sequence of constants. This is a useful motivation for the generating function, without assigning all discovery to a single moment. ^[ref]

The Bernoulli polynomials extend the Bernoulli numbers by inserting the exponential function $e^{xt}$ into their exponential generating function:For example, $B_0(x)=1$, $B_1(x)=x-1/2$, $B_2(x)=x^2-x+1/6$, and $B_3(x)=x^3-3x^2/2+x/2$.^[ref]

Their crucial property is a finite difference identity:Indeed, subtracting the two exponential generating functions cancels $e^t-1$ and leaves $t{e}^{xt}$. Thus $B_{p+1}(x)/(p+1)$ plays for discrete summation the role that $x^{p+1}/(p+1)$ plays for integration: taking a unit finite difference recovers $x^p$.^[ref]

The Mellin transform is an integral transform suited to changes of scale: replacing $f(x)$ by $f(ax)$ multiplies its transform by $a^{-s}$ for $a>0$. For a locally integrable function $f:(0,\infty )\to \mathbb{C}$, definewhere the improper integral converges. The complex number $x^{s-1}=\exp ((s-1)\log x)$ uses the real natural logarithm because $x>0$. Its absolute value is $x^{\sigma -1}$, so absolute convergence depends on the real part $\sigma$ rather than the imaginary part $\tau$. The Mellin fundamental strip records the open range of such real parts.^[ref]

A familiar example is the exponential function $f(x)=e^{-x}$:This is exactly the Gamma integral. Near zero $e^{-x}$ tends to one, so absolute convergence requires $\sigma >0$; at infinity $x^r{e}^{-x}\to 0$ for every real $r$, so there is no upper boundary. The Gamma function has a meromorphic continuation with simple poles at $0,-1,-2,\dots$, but a finite continued value elsewhere in $\sigma \le 0$ does not make the defining improper integral converge.^[ref]

The Mellin transform of an interval indicator gives an elementary example with absolute convergence for every complex number $s$. The Mellin transform in logarithmic coordinates explains why changes of scale become translations, connecting the scaling property of the Mellin transform to the Fourier transform.

Quadratic reciprocity compares two questions: is the prime number $p$ a quadratic residue modulo $q$, and is $q$ a quadratic residue modulo $p$? Let $p,q$ be distinct odd primes. In terms of the Legendre symbol,The two Legendre symbols have opposite signs exactly when both primes are $3$ modulo $4$; otherwise they are equal. Their values are nonzero because the primes are distinct. Equal signs can mean two quadratic residues or two quadratic nonresidues: reciprocity compares the answers rather than declaring either answer positive.^[ref]

For a direct computation, the nonzero quadratic residues modulo $3,5,7$ are respectively $\{1\}$, $\{1,4\}$, and $\{1,2,4\}$. Squaring just $1,\dots ,(p-1)/2$ suffices because $x$ and $p-x$ have the same square modulo an odd prime $p$.The pair $3,7$ has a sign flip, whereas $5,7$ has two negative signs. These small quadratic residue tables make the distinction tangible.

The first supplementary law for quadratic reciprocity handles numerator $-1$, and the second supplementary law for quadratic reciprocity handles numerator $2$:For an odd prime $p$, $-1$ is a quadratic residue exactly when $p\equiv 1(\mathrm{mod}4)$, while $2$ is a quadratic residue exactly when $p\equiv 1,7(\mathrm{mod}8)$. The remaining odd congruence classes modulo $8$, namely $3,5$, make $2$ a quadratic nonresidue. These laws fill the cases excluded from swapping distinct odd primes.^[ref]