组合部分1.考虑平面上边平行于坐标轴的矩形(长和宽均大于0),并称这样的一个矩形为一个“箱子”.如果两个箱子有公共点(包括箱子的内部或边界上的公共点),则称两个箱子“相交”.求最大的正整数n,使得存在n个箱子B1,B2,…,Bn,满足Bi与Bj相交当且仅当i j±1(modn).2.对每个正整数 Combinations Section 1. Consider rectangles that are parallel to the coordinate axis above the plane (both longer and width are greater than 0) and claim that such a rectangle is a “box.” If two boxes have a common point (including the box’s interior or border Common point), then the two boxes are “intersected.” Find the largest positive integer n such that there are n boxes B1, B2, ..., Bn that satisfy Bi and Bj if and only if ij ± 1 (modn) For each positive integer