Interesting...
I agree that there will be 10 intersection points. This is similar to questions like..."how many hand shakes in the room" or "how many games are played between X teams if each one plays the other once"...etc...
so the formula is essentially sum of all the integers from 1 to (n-1). In this case we have 4+3+2+1 = 10.
Now for the second half of the question. How many triangles, this translates to how many different ways are there to choose 3 points out of the 10 points. Since each unique combination of 3 points leads to a different triangle. But 10choose3 gives us 120. This is not one of the answers so dont know..
It could be that i just have the wrong approach...but would like to know what everyone else thinks.
What is the source of this question? How reliable is it?
Thanks.
Attempt 1: 710, 92% (Q 42, 63%; V 44, 97%)
Attempt 2: Coming soon!