Here's a variant of a nice, easy problem I found in a Math competition.
We're given 3 non-collinear points in an Euclidean plane. We can make only one triangle. With 4 non-collinear points we can make 4 triangles. How many triangles can we make with 1 0 0 non-collinear 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.
How did you write the binomial coefficient? I can't😅😂
We need 3 points in the plane to make one triangle. Let's suppose we have 6 points: A , B , C , D , E , F
We can rename each point we choose to form the triangle with Y (yes) and all the others with N (no). For example, we can have
(don't care about the numbers down the letters, just look up those ones)
We can form a word putting all the points in a row: Y N N Y Y N . We can just count how many anagrams of the word there are: 3 ! × 3 ! 6 ! = 2 0 total anagrams. We have just to apply the same method with 1 0 0 points: the total number of anagrams of a word with 1 0 0 letters, of wich 9 7 are N and 3 are Y is:
9 7 ! × 3 ! 1 0 0 ! = 6 1 0 0 × 9 9 × 9 8 = 1 6 1 7 0 0
Did you enjoy this problem? The next will be sensibly harder. Ready?
Problem Loading...
Note Loading...
Set Loading...
We can pick 3 of the 100 points to make a triangle, and each of them is distinct, which is equivalent to 100 choose 3.
So the final result is ( 3 1 0 0 ) = 3 × 2 × 1 1 0 0 × 9 9 × 9 8 = 1 6 1 7 0 0