Let ai=(aij) (1≤i≤m,1≤j≤n) be m points of Rn and let q be an integer > o. For each point k=(ki) (1≤i≤m) of Rm with integer coordinates, not all zero, satisfying the inequalities 0≤ki≤q, consider the point xk=(xj,k) (1≤j≤n) of Rn, all of whose coordinates belong to [0,1[ and which is congruent mod Zn to ∑i=1mkiai, i.e., the point with coordinates
xj,k=i=1∑mkiaij−[i=1∑mkiaij].
If p is the smallest integer such that q+1≥pn/m, show that there are two distinct points k,k′ such that xk and xk′ both belong to the same cube of side 1/p (same method as Exercise 10). Deduce that there exist m integers pi, not all zero, and n integers rj (1≤j≤n) such that 0≤pi≤q for 1≤i≤m, and
i=1∑mpiaij−rj≤p1(1≤j≤n).
Use this result to give another proof of Proposition 2 of no. 1 (the "pigeon-hole principle").