Bourbaki

Exercise 9, § 2

Functions of a Real Variable, VI, 294

To say that a rational number rr is a pp-adic integer (\emph{Gen. Top.}, III, p. 322, exerc. 1) for pp a prime number, means that when rr is expressed as an irreducible fraction its denominator is not divisible by pp; one writes r≡0r \equiv 0 (mod. pp) to express the fact that r/pr / p is a pp-adic integer, and r≡r′r \equiv r' (mod. pp) is equivalent by definition to r−r′≡0r - r' \equiv 0 (mod. pp).

a) Let mm be a rational integer; the function Fm(z)=memz−1−1ez−1F_m(z) = \frac{m}{e^{mz} - 1} - \frac{1}{e^z - 1} is analytic for ∣z∣|z| sufficiently small, so can be written as an entire series convergent on a neighbourhood of z=0z = 0:

Fm(z)=∑n=1∞(mn−1)bnnzn−1(n−1)!. F_m(z) = \sum_{n=1}^\infty (m^n - 1) \frac{b_n}{n} \frac{z^{n-1}}{(n-1)!}.

Show that also on a neighbourhood of 00

Fm(z)=∑n=0∞cn(ez−1)n F_m(z) = \sum_{n=0}^\infty c_n (e^z - 1)^n

where the cnc_n are pp-adic integers; deduce that the numbers an=(mn−1)bnna_n = (m^n - 1) \frac{b_n}{n} are pp-adic integers; further, one has an+p−1≡ana_{n+p-1} \equiv a_n (mod. pp).

b) Deduce from a) that if p−1p - 1 does not divide nn, then bn/nb_n / n is a pp-adic integer and that

bn+p−1n+p−1≡bnn(modp) \frac{b_{n+p-1}}{n+p-1} \equiv \frac{b_n}{n} \pmod{p}

(Kummer’s congruences). (Take for m an integer whose class mod. p is a generator of the multiplicative group of the invertible elements of Z/pZ\mathbf{Z}/p\mathbf{Z} (Alg., VII. 12).)

Solution

No solution has been written yet.

Transcribed from the printed volume. Not translated.