Bourbaki

Exercise 30, § 6

Algebra, I, p. 140

Bourbaki marks this one as harder than the rest.

Let pp be a prime number, rr and tt integers ⩾0\geqslant 0, S a cyclic group of order pr+tp^{r+t} and T the subgroup of order ptp^t of S. a) If S operates on a finite set E, now prove that one has

Card⁡(E)≡Card⁡(ET)(modpr+1), \operatorname{Card}(E) \equiv \operatorname{Card}(E^T) \pmod{p^{r+1}},
where ETE^T denotes the set of elements of E invariant under T. b) Let m,nm, n be integers ⩾0\geqslant 0. Now prove that one has
(pr+tmptn)≡(prmn)(modpr+1). \binom{p^{r+t}m}{p^tn} \equiv \binom{p^rm}{n} \pmod{p^{r+1}}.
(Let M be a set with mm elements, and let E be the set of subsets of S×MS \times M having ptnp^t n elements. Define an operation of S on S×MS \times M such that there exists a bijection of ETE^T onto the set of subsets of (S/T)×M(S/T) \times M having nn elements; apply a).)

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.