You are not currently logged in.
Access JSTOR through your library or other institution:
If You Use a Screen ReaderThis content is available through Read Online (Free) program, which relies on page scans. Since scans are not currently available to screen readers, please contact JSTOR User Support for access. We'll provide a PDF copy for your screen reader.
Optimizing the Arrangement of Points on the Unit Sphere
Joel Berman and Kit Hanes
Mathematics of Computation
Vol. 31, No. 140 (Oct., 1977), pp. 1006-1008
Published by: American Mathematical Society
Stable URL: http://www.jstor.org/stable/2006132
Page Count: 3
You can always find the topics here!Topics: Mathematical problems, Mathematics, Information search, Mathematical inequalities, Spheres, Triangles
Were these topics helpful?See something inaccurate? Let us know!
Select the topics that are inaccurate.
Since scans are not currently available to screen readers, please contact JSTOR User Support for access. We'll provide a PDF copy for your screen reader.
Preview not available
This paper is concerned with the problem of placing $N$ points on the unit sphere in $E^3$ so as to maximize the sum of their mutual distances. A necessary condition is proved which led to a computer algorithm. This in turn led to the apparent best arrangements for values of $N$ from 5 to 10 inclusive.
Mathematics of Computation © 1977 American Mathematical Society