II. Let and αi=2i−1,βi=201−αi(i=1,2,⋯,100)Ei={αi,βi},
Then when i=j, Ei∩Ej=∅, and ⋃i=1100Ei=E.
From i) we know that for any 1⩽i⩽100, it cannot be that Ei⊂G.
Furthermore, since the number of elements in G is exactly equal to the number of sets Ei, which is 100, G must necessarily contain exactly one element from each Ei.
Now suppose G contains k odd numbers, and for
1⩽i1<i2<⋯<ik⩽100,
we have
ait=αit(1⩽t⩽k),
Thus, for j=ii(1⩽t⩽k), it must be that aj=βj
From ii)
t=1∑kαit+j=it∑βj=10080
On the other hand
j=1∑100βj=2j=1∑100j=10100
Subtracting (1) from (2)
∑t=1k(βit−αii)=20k⋅201−2∑t=1kαii=20∑t=1kαit=21(k⋅201−20)
From (4), we first deduce that k must be a positive even number. Let k=2k′, then ∑k=12k′αit=k′⋅201−10. Noting that the left side of this equation is even, k′ must be a positive even number. Let k′=2⋅k′′, then k=4k′′, which proves that the number of odd numbers in G must be a multiple of 4.
Now we calculate the sum of the squares of the numbers in G. The following calculation uses (3):
i=1∑100αi2=t=1∑kαit2+j=it∑kβj2=j=1∑100βj2−t=1∑kβii2+t=1∑kαit2=j=1∑100(2j)2−t=1∑k(βit+αit)(βit−αit)=4j=1∑100j2−201×20=4×6100(100+1)(200+1)−4020=1353400−4020=1349380.