Sam wants to make a special "game of darts". He has an dart board which is an infinitely big 2D plane. On this plane he throws 7 red darts and blue darts. Once he has placed the darts, he draws a red line segment between every single red dart. Similarly, he draws a blue line segment between every single blue dart. Where two blue lines intersect he places a green dart. Similarly, where two red lines intersect, he places a green dart as well. Then, he collects all the green darts he placed and clears the dart board.
Afterwards, he throws the green darts he collected and then he draws a green line segment between every single green dart. Finally, he counts the number of intersections between all the lines and that is his final score. If he wants the maximum score to be less than 1,000,000,000 , what is the maximum amount of blue darts he can have?
Details and assumptions :
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.
Let T be the final score.
Since we can choose how the darts are arranged and there is an infinitely sized plane, assume that no three darts of the same colour are collinear and no three lines are concurrent.
If you chose any 4 of the darts of the same colour you would be able to form one convex quadrilateral. If you join the 2 diagonals of this convex quadrilateral you get 1 intersection. Therefore, for every convex quadrilateral, you get 1 intersection. Therefore, we have to find the number of ways that you can make a convex quadrilateral. To make a quadrilateral you need to choose four points from all the points available. However, to ensure no concave quadrilaterals are made, arrange all the darts of the same colour in a circle so that no three lines are concurrent.
Therefore, the number of intersections with n darts is ( n 4 ) .
Therefore, the number of intersections between 7 darts is ( 7 4 ) = 3 5 and the number of intersections between x darts is ( x 4 ) . Thus the sum of these intersections and the number of green darts is 3 5 + ( x 4 ) .
Therefore, T (the number of green intersections) = ⎝ ⎛ 3 5 + ( x 4 ) 4 ⎠ ⎞ .
Now we can plug in values where x ≥ 4 because that is the number of darts you need for 1 intersection.
When x = 4 , T = 5 8 9 0 5 .
When x = 5 , T = 9 1 3 0 0 .
When x = 6 , T = 2 3 0 3 0 0 .
...
When x = 1 0 , T = 1 4 6 4 7 5 9 4 5 .
When x = 1 1 , T = 7 2 7 4 4 1 7 1 5 .
When x = 1 2 , T = 3 2 5 0 6 0 9 7 8 0 .
7 2 7 4 4 1 7 1 5 < 1 0 0 0 0 0 0 0 0 0 < 3 2 5 0 6 0 9 7 8 0
f ( 1 1 ) < 1 , 0 0 0 , 0 0 0 , 0 0 0 < f ( 1 2 )
Therefore the maximum amount of blue darts he can have is 1 1 .