[math-fun] Asimov's correlation problem

The optimal solution was unit vectors that are the N+1 vertices of a regular simplex in N-dimensional space centered at the origin. (N=3 for Asimov's problem, regular tetrahedron.) These are anticorrelated somewhat, dot product of any two is -1/N minimizing correlation by making it maximally negative. My solution with 4 mutually orthogonal 8-vectors was optimal if we want zero correlation, which minimizes correlation if you meant the absolute value of the correlation...