Bourbaki marks this one as harder than the rest.
Let G be a p-group (I, p. 72, def. 9). Put d(G)=dimFpH1(G,Fp) and r(G)=dimFpH2(G,Fp) (cf. exercise 15). a) Show that d(G) is the minimal number of generators of G (proving that H1(G,Fp) is isomorphic to the dual of G/GpD(G), and use I, p. 140, exercise 32). b) If Card (G) = pn, show that one has d(G)≤n and r(G)≤21n(n+1) (prove by induction on n that there exists a presentation of G with n generators and 21n(n+1) relations). If G=(Z/pZ)n, show that one has d(G)=n and r(G)=21n(n+1). c) If G is nontrivial, prove the inequality r(G)>41(d(G))2 (« Golod-Chafarevich theorem »: use exercise 15, p. 182, and exercise 22 of VIII, § 8). d) Prove that one has r(G)−d(G)=dimFp(H3(G,Z)⊗ZFp).