There are eight points in the plane such that no three of them are collinear. Albert was asked to find the maximum number of triangles formed out of these points, with the special property that no two triangles have more than one vertex in common.
Help Albert by finding the maximum number of such triangles.
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.
Its somewhat unclear from the problem description that one can have 123, 145, 258 without (as a result) also constructing a triangle 125. Otherwise, good solution.
Log in to reply
Well they asked for "triangles formed" not draw a line connecting those points
i hv a doubt... see if we label all the points from 1-8 and selecting 1 we need to select two more point from 7.. so the answer shuld be 7c2+6c2+5c2+...+1
I did it differently but I got it wrong. What did I do wrong? Consider 8 choose 2 = 28 bins, each corresponding to a pair of points eg. an 12 bin, a 13 bin, etc. Then for each triangle we have 3 balls: if its vertices are i, j, k then they are in the IJ, JK, and KJ bins. We place them in the corresponding bins. We want each bin to have at most 1 bin or else 2 trinagles would share a pair of vertices. So we want 28/3=9 and a third triangles, but that doesnt make sense so you round down to 9 triangles. What was wrong?
Here's a solution with 8 triangles: Number the vertices n m o d 8 and draw a triangle with vertices n , n + 1 , n + 3 ( m o d 8 ) for each n m o d 8 . To show that at most 8 triangles can be drawn, let T be the total number of triangles, let V be the vertex set and let t ( v ) denote the number of triangles incident on vertex v . Observe that t ( v ) ≤ 3 so that
T = 3 1 v ∈ V ∑ t ( v ) ≤ 3 1 ⋅ 8 ⋅ 3 = 8 .
.
Oh, the number-theoretic selection scheme has just outperformed the topological one :) Very nice.
I imagined to take K 8 and choosing a triple of vertices at a time. Two triples, or triangles, cannot share a side. Since there are ( 2 8 ) = 2 8 edges in K 8 and every choice of a triple removes three edges, it is possible to take at most eight triangles. Eight triangles are indeed possible to arrange: consider a cube in which the vertices on the top face are numbered 2 , 4 , 6 , 8 and the vertices on the bottom face are numbered 1 , 3 , 5 , 7 , in order that vertex 2 is just above vertex 1 and vertex 4 is just above vertex 3. The triangles 187,765,534,312 lie on the boundary of the cube and share at most one vertex in the bottom face. In a similar way, the triangles 285,247,461,683 share at most one vertex in the top face; every one of them has a side which belongs to the interior of the cube and a side that is the diagonal of a face, with the opposite orientation of the sides of 187,765,534,312 being diagonals of a face, too. This means that the choice 187,765,534,312,285,247,461,683 is just fine.
I didn't understand 8*3/3?Can someone explain
Problem Loading...
Note Loading...
Set Loading...
Let us arbitrarily label the points 1 through 8. Consider any point. If this point were in 4 triangles then there are ( 3 − 1 ) × 4 = 8 vertices which are not this point in these 4 triangles. No 2 of these 8 vertices can be the same point since this would mean that at least 2 of the 4 triangles shared 2 vertices. So we need to choose 8 distinct points from the remaining 7 points, but this is evidently impossible. So the maximum number of triangles that any point can be in is 3. If each point is indeed in 3 triangles then there will be 3 8 × 3 = 8 triangles, so this is our theoretical maximum. We will now show that this can be done:
1 2 3
1 4 5
1 6 7
2 5 8
4 7 8
3 6 8
2 4 6
3 5 7
So the answer is 8