Planes

Geometry Level 5

In 3-dimensional space, what is the number of planes that are equidistant from four non-coplanar points?


The answer is 7.

This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try refreshing the page, (b) enabling javascript if it is disabled on your browser and, finally, (c) loading the non-javascript version of this page . We're sorry about the hassle.

8 solutions

Sandeep Bhardwaj
Feb 11, 2015

Let the points be A , B , C a n d D A,B,C \ and \ D .

No. of planes which have 3 points on one side and the fourth point on the other side=4

No. of planes which have two points on each side of plane =3

Hence, total no. of the required planes=4+3= 7 \boxed{7}

Nice question. It was trickier than I initially thought it would be :)

Calvin Lin Staff - 6 years, 4 months ago

This is the shortest Level 5 problem I have ever seen! nice 1

Nihar Mahajan - 6 years, 3 months ago

I would have thought there are "4 choose 2"=6 ways of two points on each side why is it 3, pardon me for not putting in much thought, just asking if there are any simple explanation why this way of thinking is wrong?

Cheng Wei Chang - 5 years, 5 months ago

Log in to reply

I thought this at first too, but for each of the (4 choose 2) you're picking only 2 points, but the other two show up on the other side of the plane. Those other two would be picked also, so you count every combo of 2 lines twice.

M M - 5 years, 3 months ago

Exactly! I did the same..........

Upvoted!

Sravanth C. - 6 years, 4 months ago

The solution by the author is very good, but I felt that it doesn't explain much and leaves a lot of room for doubt. So, here goes:

Observe that for points to be equidistant from a plane, all of them have to lie on either of the two planes which are parallel to the said plane.

Now, we can see that if we take any 3 3 points, then we can always find a plane P 2 P2 parallel to the plane of these points such that the distance between the plane of these points and P 2 P2 is same as distance between P 2 P2 and the fourth point. So this configuration gives us 4 4 planes, which is the number of distinct ways of selecting 3 3 points from the given 4 4 .

It is known that, when there are two vectors in 3 D 3-D space, one can always find a plane P P such that this plane is parallel to both vectors(using cross product). Now, if we are to divide the 4 4 given points into two pairs and join(exclusively) the points of a pair, we end up with two non co-planar vectors. We can always find a plane which is parallel to these vectors. If we shift the said plane parallel along its normal, it's obvious that in a certain configuration, the plane will be equidistant from all the four points. So, this configuration gives us 3 3 more planes, which is the number of ways of selecting two distinct pairs from 4 4 .

Thus, the answer is 4 + 3 = 7 4+3=\boxed{7}

Thanks for providing the proof that these planes actually exist :)

Calvin Lin Staff - 6 years, 3 months ago

Nice problem. I don't think my method is different enough to need to be posted, but let me ask what nobody has asked yet: since we're assuming restriction to 3D space, should that be in the problem statement? I'm inclined to say yes, but I'm open to hearing other opinions.

Peter Byers - 6 years ago

Wow! Great explaination! Thanks

Kishore S. Shenoy - 5 years, 9 months ago
Michael Mendrin
May 25, 2015

Let me try my hand in offering an intuitive "proof". First, given that 4 4 non-colinear points forms an irregular tetrahedron, it's easy to see that no such plane can exist outside it. Next, any 3 3 points forms a plane which is parallel to a plane that is halfway to the 4 4 th point, so we have 4 4 such planes. Now, the tricky step. There are 3 3 pairs of points of the tetrahedron between which there could exist such a plane. To prove that there will always be one such plane, imagine that the lines through each pair of points are replaced with cylinders of the same radius, and we let the radius expand until the cylinders touch. There's your plane, tangent to both cylinders where they touch, and so we have 3 + 4 3+4 or 7 7 planes in all.

Another way to get those last three: given two opposite (not sharing a vertex) edges of the tetrahedron, consider the plane midway between them that contains lines parallel to the edges.

Maggie Miller - 5 years, 10 months ago
Ww Margera
May 27, 2015

Finding a plane that is equidistant from the four points A, B, C, D is equivalent to finding a pair of parallel planes such that all of the points lie on one of the planes. Suppose we find such a pair of planes. One of them must contain A. Call it 1. Call the other one as 0. B, C and D must each lie on either of these planes, but the one where all lie on 1 is ruled out as the points are non-coplanar.

Hence, number of planes is 2^3 - 1 = 7.

Nice solution! This is different from other solutions and is easier to compute.

Pranshu Gaba - 5 years, 9 months ago
Cleres Cupertino
Aug 14, 2015

There are 4 planes that contains three points. And there are 3 planes that separate these four points in two pairs.

Lu Chee Ket
Dec 22, 2015

4 C 3 1 + 4 C 2 2 \frac{_4 C_3}{1} + \frac{_4 C_2}{2} = 4 + 6 2 \frac62 = 7

There are 0 for 4 + 0;

There are 4 for 3 + 1;

There are 3 for 2 + 2;

For 2 + 2, they shall always form skewed lines in 3 dimensional space which are equivalent to two parallel lines being twisted with an angle which is not zero onto its "H" shape. Certain views from proper orientations allow us to see this.

Answer: 7 \boxed{7}

Deepak Kumar
Jul 25, 2015

Found the same question in 'Problem solving strategies'

Subh Mandal
Jan 23, 2017

Imagine a cube for ease, place points on daigonal ends of opposite face to get 4 points non coplanar, center of cube as (0,0,0), there are 3 planes which has 2 points on one side , make tetrahedron by choosing any 3 as base given by 4C3 to get 4 tetrahedron => 4+3=7.

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...