Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. Join them; it only takes a minute:

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

I just want to know how to locate n+1 points in n dimensional real space such that the distance between any two points is 1 e.g. can you guys help me please?

share|cite|improve this question
I think should be able to help you out. – Ian Coley Mar 20 '13 at 17:01
I think this is not what I want.. – user67458 Mar 20 '13 at 17:08
This describes the general format of the solid whose vertices are exactly the set you describe. The edges are of course wrong. Maybe looks better for your purposes? – Ian Coley Mar 20 '13 at 17:11
It's easier to locate the n+1 points in a hyperplane in n+1 dimensional space. – Johannes Mar 20 '13 at 17:42

You might check the proof of

Cartesian coordinates for vertices of a regular 16-simplex?

for a formula for the regular simplex vertices

share|cite|improve this answer

In the Wikipedia article under "Cartesian coordinates for regular n-dimensional simplex in R$^n$" a process is described that results in just this. It works in any dimension.

share|cite|improve this answer

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.