Bourbaki

Exercise 9, § 2

Functions of a Real Variable, VI, p. 24

Saying that a rational number rr is a pp-adic integer (TG, III, p. 84, exerc. 23) for a prime number pp means that, when rr is put in the form of an irreducible fraction, its denominator is not divisible by pp; one writes r≡0(modp)r \equiv 0 \pmod{p} to express that r/pr/p is a pp-adic integer, and r≡r′(modp)r \equiv r' \pmod{p} is equivalent by definition to r′−r≡0(modp)r' - r \equiv 0 \pmod{p}. a) Let mm be a rational integer; the function Fm(z)=memx−1−1ex−1F_m(z) = \frac{m}{e^{mx} - 1} - \frac{1}{e^x - 1} is analytic for ∣z∣|z| sufficiently small and can therefore be written in the form of a convergent power series in a neighbourhood of 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)!}.

Now prove that one also has in a neighbourhood of 0

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; moreover one has an+p−1≡an(modp)a_{n+p-1} \equiv a_n \pmod{p}.

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

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

(Kummer congruences). (Take for mm an integer whose class mod. pp is a generator of the multiplicative group of invertible elements of Z/pZ\mathbf{Z}/p\mathbf{Z} (A, VII, § 2, n° 4).)

Solution

No solution has been written yet.

Machine translation of the English, by gpt-5-6-mini. Not checked by a person. That model is a cut down version of the one the rest of this language was written by.