Consider n disks C1;C2;...;Cn in a plane such that for each 1≤i<n, the center of Ci is on the circumference of Ci+1, and the center of Cn is on the circumference of C1. Define the score of such an arrangement of n disks to be the number of pairs (i;j) for which Ci properly contains Cj . Determine the maximum possible score. inductioncombinatorics unsolvedcombinatorics