32. Let f(x)=(x−a1)2+(x−a2)2+⋯+(x−an)2
Then □
f(x)=n(x−an)2+f(bn)
Now we prove Cn⩽Dn⩽2Cn by mathematical induction.
When n=1, C1⩽D1, so C1⩽D1⩽2C1.
Assume that when n, the inequality holds. When adding a number an+1 to a1,a2,⋯,an, Cn increases by (an+1−bn+1)2, and Dn increases by (an+1−bn+1)2+f(bn+1)−f(bn).
In equation (1), let x=bn+1, we get
0⩽f(bn+1)−f(bn)=n(bn+1−bn)2=n1(an+1−bn+1)2⩽(an+1−bn+1)2
Thus, the value by which Dn increases, (an+1−bn+1)2+f(bn+1)−f(bn), lies between (an+1−bn+1)2 and 2(an+1−bn+1)2. Therefore, for n+1, we also have Cn+1⩽Dn+1⩽2Cn+1.
Hence, for all positive integers n, Cn⩽Dn⩽2Cn.