Google 翻译生成的粗略草稿,质量较低。术语依照术语表,但句子可能有误;之后会由仔细的译文取代。
令ai=(aij) (1≤i≤m,1≤j≤n) 为Rn 的m 点,并令q 为整数 > o。 For each 点 k=(ki) (1≤i≤m) of Rm with 整数 coordinates, not all 零, 满足 the inequalities 0≤ki≤q, consider 点 xk=(xj,k) (1≤j≤n) of Rn,所有坐标属于到[0,1[,并且与模Zn到∑i=1mkiai全等,即点与坐标
xj,k=i=1∑mkiaij−[i=1∑mkiaij].
If p is 最小的整数 such that q+1≥pn/m, show that there are two distinct 点 k,k′ such that xk and xk′ both 属于 to the same cube of side 1/p (same 方法为习题 10)。 Deduce that there exist m 整数 pi, not all 零, and n 整数 rj (1≤j≤n) such that 0≤pi≤q for 1≤i≤m, and