document.write( "Question 668552: Please help!\r
\n" ); document.write( "\n" ); document.write( "
\n" ); document.write( " Use a tree diagram showing all possible results when four fair coins are tossed. then list the ways of getting exactly two tails.
\n" ); document.write( "
\n" ); document.write( "
\n" ); document.write( "

Algebra.Com's Answer #415662 by swincher4391(1107)\"\" \"About 
You can put this solution on YOUR website!
Start with your two possibilities {H,T}\r
\n" ); document.write( "\n" ); document.write( "From each node in your tree sprout another two branches {H,T} until you've done this process 4 times. As a check, you should have 16 end possibilities. As 2^4 = 16.\r
\n" ); document.write( "\n" ); document.write( "Then, find the paths in your tree such that T only appears twice. You should get (from top to bottom:\r
\n" ); document.write( "\n" ); document.write( "{HHTT}
\n" ); document.write( "{HTHT}
\n" ); document.write( "{HTTH}
\n" ); document.write( "{THHT}
\n" ); document.write( "{THTH}
\n" ); document.write( "{TTHH}\r
\n" ); document.write( "\n" ); document.write( "6 possibilities.\r
\n" ); document.write( "\n" ); document.write( "This makes sense because if we have 4 slots to choose from and we need 2 to be tails, there are exactly (4 choose 2) = 4!/2!*2! = 24/4 = 6 ways to do that.
\n" ); document.write( "
\n" );