document.write( "Question 1187405: https://imgur.com/HQvOuKW In the triangle, each vertex is joined to four points on the opposite side of the triangle, with no three lines intersecting at one point. How many non-overlapping regions are formed in the triangle? \n" ); document.write( "
Algebra.Com's Answer #818424 by greenestamps(13200)\"\" \"About 
You can put this solution on YOUR website!


\n" ); document.write( "There might be some fancy mathematical formula for finding the answer to a problem like this, but it's probably more complicated than finding the answer by just counting.

\n" ); document.write( "What is required is a systematic method for counting the regions so that each region gets counted exactly once. Here is what I suggest.

\n" ); document.write( "(1) Pick one vertex of the big triangle and consider the 6 lines from that vertex to the opposite side (2 lines to the other two vertices, and 4 lines to the opposite side). Those lines divide the big triangle into 5 triangular regions.
\n" ); document.write( "(2) Count (carefully, and perhaps at least twice) the number of regions in each of those 5 triangular regions. As a check on your counting, note that, by symmetry, the numbers of regions in the 1st and 5th triangular regions should be the same, as should the numbers of regions in the 2nd and 4th.

\n" ); document.write( "Happy counting!


\n" ); document.write( "NOTE: My count was 61

\n" ); document.write( "
\n" ); document.write( "
\n" );