Given 16 points arranged in a 4 by 4 square, how many (non-degenerate) triangles can be created with vertices among these 16 points?
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.
@Tan Wee Kean For clarity, I added "non-degenerate" to the question
There are ( 3 1 6 ) ways to pick 3 points from the square. Next, we need to consider all collinear sets of points. There are ( 3 4 ) ways to pick 3 of 4 points; we need to subtract the likelihood of doing this for any row, column, diagonal, or antidiagonal. Last, we need to subtract the likelihood of picking all 3 points in a subdiagonal or antisubdiagonal.
16C3 - 10(4C3) -4 =560 - 40-4=516
Can you explain what this means?
I think that means :
n C k = C ( n , k ) = ( k n ) = ( n − k ) ! k ! n ! ;
if we take a square n × n , we have:
C ( n 2 , 3 ) total number of combinations of 3 points on n 2 of the main square n × n ;
2 × n × C ( n , 3 ) combinations to be subctracted from C ( n 2 , 3 ) because triads of points belonging to lines parallel to the sides of the main square;
2 × C ( n , 3 ) combinations to be subtracted because triads of points belonging to the 2 diagonals of the main square;
2 × 2 × C ( n − 1 , 3 ) combinations to be subtracted because triads of points belonging to the 4 distinct diagonals of 2 of the 4 squares ( n − 1 ) × ( n − 1 ) with a vertex coinciding with one of the main square;
. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
2 × 2 × C ( 4 , 3 ) combinations to be subtracted because triads of points belonging to the 4 distinct diagonals of 2 of the 4 squares 4 × 4 with a vertex coinciding with one of the main square;
2 × 2 × C ( 3 , 3 ) combinations to be subtracted because triads of points belonging to the 4 distinct diagonals of 2 of the 4 squares 3 × 3 with a vertex coinciding with one of the main square;
So, the number of triangles whose vertex are points of the square n × n , is (general formula):
N t ( n × n ) = C ( n 2 , 3 ) − 2 ( n + 1 ) C ( n , 3 ) − 4 k = n − 1 ∑ 3 C ( k , 3 ) ;
N t ( n × n ) = ( 3 n 2 ) − 2 ( n + 1 ) ( 3 n ) − 4 k = n − 1 ∑ 3 ( 3 k ) ;
N t ( 4 × 4 ) = C ( 1 6 , 3 ) − 2 ( 4 + 1 ) C ( 4 , 3 ) − 4 C ( 3 , 3 ) ;
N t ( 4 × 4 ) = ( 3 1 6 ) − 1 0 ( 3 4 ) − 4 = 5 1 6
i can not understand this answer :D
Problem Loading...
Note Loading...
Set Loading...
There are total ( 3 1 6 ) ways to choose 3 vertices of a triangle. But among them, some are not able to make a triangle, as they are in a straight line.
Now, if we choose 3 vertices from a row or from a column, it can't be a triangle. There are 4 rows and 4 columns(total 8 straight line) in a 4 × 4 square and we can choose 3 vertices from a row or column in ( 3 4 ) way. So that can be happened in 8 × ( 3 4 ) ways, where we choose a straight line to make a triangle. Again, two diagonal are also consists of 4 points, where no triangle can be made. We can choose 3 vertices from this 2 line is 2 × ( 3 4 ) .
Now we've taken all straight line consisting of 4 points. Now we will take straight line consists of 3 points. If we draw the figure of 4 × 4 square, we will see, this can be happened in 4 ways.
So total triangle that should be subtracted from ( 3 1 6 ) is ( 3 1 0 ) +4. So the answer is ( 3 1 6 ) - ( 3 1 0 ) -4.