MathLabs

Problem 2

Let nn be positive and let A1,…,A2n+1A_1,\ldots,A_{2n+1} be subsets of BB. Suppose each AiA_i has exactly 2n2n elements, every two distinct AiA_i have exactly one common element, and every element of BB belongs to at least two AiA_i. For which nn can one label each element 0 or 1 so that each AiA_i has 0 on exactly nn elements?
Step 4 of 5: Step 4
j−i∈{−n/2,…,−1,1,…,n/2}(mod2n+1)j-i\in\{-n/2,\ldots,-1,1,\ldots,n/2\}\pmod{2n+1}
Detailed analysis

For even n, index sets cyclically modulo 2n+1 and label (i,j) by 0 when j−i is one of the n residues −n/2,...,−1,1,...,n/2; label all other pairs 1. Each A_i then has exactly n zeros.