Darken-Sol: what you are thinking is actually kind of on the right track. See if you can understand the following:
The generalization of a triangle (2d) and a tetrahedron (3d) is the simplex:
http://en.wikipedia.org/wiki/Simplex
In n-dimensional space, the n-simplex is the simplest polytope. It will always have n+1 vertices.
Now, the n-simplex (with n+1 vertices) actually does define a coordinate system. Let v
1, v
2, ... v
n+1 denote the vertices of some n-simplex.
Consider ordered (n+1)-tuples of non-negative real numbers (a
1,a
2, ... a
n+1) such that a
1 + a
2 + ... + a
n+1 = 1.
Then for every point p inside the simplex, there is a UNIQUE such (n+1)-tuple such that p = a
1v
1 + a
2v
2 + ... a
n+1v
n+1.
Now, there is one interpretation where these v
1, ... v
n+1 are considered "vectors", but don't worry about that for now if you don't know what vectors are. It's just a way of expressing geometric ideas more algebraically.
Really, these numbers a
i are just representing how much you are moving in the direction of the point v
i. If a
i = 1, then we are choosing a point as close to v
i as possible - namely v
i itself. If a
i = 0, then we are choosing a point far away from v
i - namely, one lying in the face opposite v
i.
Just notice how we had the condition that a
1 + a
2 + ... + a
n+1 = 1. This condition means that once we know a
1, a
2, ... a
n, we can determine a
n+1 by a
n+1 = 1 - a
1 - a
2 - ... - a
n.
In other words, we really only need n "numbers" to describe a point inside this n-simplex (in n-dimensional space).
But contrary to what DaveC is saying, we really DO need n+1 points to make sense of a coordinate system for n-dimensional space.
I'll give you the intuitive idea. Suppose we are looking at just a line (1-dimensional space).
Suppose I give you the task of being able to uniquely locate every point on this line from its number by some mechanical method. e.g., I give you the number "12.6" and you have to pick out the unique point on the line corresponding to that number. The problem is, every time you turn your back, I keep moving the line about, or scaling the line by 1/2.
So your first problem is, "How do I know, each time I look at the line, that I am looking at the same section of the line?"
You solve this by putting a big red "0" on the line, to mark the origin. Then if I shift the line left or right, you won't get confused.
But this is not enough. If I were to rescale the line, you would have no idea where "12.6" is. Maybe it's very close to the origin, or maybe it's very far from the origin, depending on whether I scaled the line longer or shorter.
But if you add another point and call it 1, then you will know exactly how much I've rescaled it. If 1 is half the distance to 0 as it was before, then you know that "12.6" is also half as far as it was from 0 as it was before.
And this is all you need to know!
For higher dimensions, you still need an origin, and then one point for each direction you can travel away from the origin. So overall, you need n+1 points when you count the origin.
And if you think about it, this is really just the same as the simplex case, where you designate one of the vertices of the simplex as the origin.
You always need n+1 points, but people just forget it when they do all this stuff with linear algebra.