Maths Olympiad Prep

Library / /73 of 520

Combinatorics Difficulty 6.4 National olympiad Find the answer

2020 points with no three collinear are given. How many obtuse triangles can be formed by these points?

(A) 6\textbf{(A)}\ 6(B) 20\textbf{(B)}\ 20(C) 2(103)\textbf{(C)}\ 2{{10}\choose{3}}(D) 3(103)\textbf{(D)}\ 3{{10}\choose{3}}(E) (203)\textbf{(E)}\ {{20}\choose{3}}

Multiple choice: answer with the letter of the option you want.

Solution

1. We are given 20 points with no three collinear and need to determine how many obtuse triangles can be formed by these points.
2. To solve this, we need to understand the conditions under which a triangle is obtuse. A triangle is obtuse if one of its angles is greater than 90 degrees.
3. Consider the construction of points such that every set of three points forms an obtuse triangle. We can construct the points from left to right, labeling them A1,A2,,A20 A_1, A_2, \ldots, A_{20} .
4. For points Am A_m and An A_n with m>n m > n , denote the perpendicular at Am A_m to AmAn A_mA_n by P(m,n) P_{(m,n)} . Denote the set of points to the right of P(m,n) P_{(m,n)} by R(m,n) R_{(m,n)} .
5. A3 A_3 must lie in R(1,2) R_{(1,2)} . Then A4 A_4 must lie in the intersection of R(1,2) R_{(1,2)} , R(1,3) R_{(1,3)} , and R(2,3) R_{(2,3)} . Continue in this way for the remaining points: Ak A_k must lie in the intersection of R(m,n) R_{(m,n)} ranging over all pairs (m,n) (m,n) with 1n<m<k 1 \le n < m < k .
6. It is clear that you can choose points such that this region is always nonempty. Therefore, every set of three points forms an obtuse triangle.
7. The number of ways to choose 3 points from 20 is given by the binomial coefficient (203) \binom{20}{3} .

(203)=20×19×183×2×1=1140 \binom{20}{3} = \frac{20 \times 19 \times 18}{3 \times 2 \times 1} = 1140

8. Therefore, the number of obtuse triangles that can be formed is (203) \binom{20}{3} .

The final answer is (203) \boxed{\binom{20}{3}} .

Want a route through all this instead of an archive? The track puts 2,000 problems in a working order, from AMC 10 level to the IMO shortlist.

Source: NuminaMath-1.5, licensed Apache-2.0. Statement and solution reproduced as published; topic and difficulty added by this site.