document.write( "Question 1150912: Find the number of ways a coin can be tossed:
\n" ); document.write( "(a) 6 times so that there is exactly 3 heads and no two heads occur in a row.
\n" ); document.write( "(b) 2n times so that there is exactly n heads and no two heads occur in a row. \n" ); document.write( "
Algebra.Com's Answer #772484 by math_helper(2461)\"\" \"About 
You can put this solution on YOUR website!
Hope this helps you reason out the answer:
\r
\n" ); document.write( "\n" ); document.write( "if 2n=2: HT and TH are the only ways to get 1 head --> n=1 so this is n+1 ways
\r
\n" ); document.write( "\n" ); document.write( "if 2n=4: HTHT, HTTH, and THTH --> 3 ways to get 2 nonadjacent heads --> and since n=2, this is also n+1 ways
\r
\n" ); document.write( "\n" ); document.write( "(a) if 2n=6: HTHTHT, HTTHTH, HTHTTH, and THTHTH --> 4 ways to get 3 nonadjacent heads, n=3 so this is yet again n+1 ways
\r
\n" ); document.write( "\n" ); document.write( "(b) This implies that in general for 2n tosses, there are ____ ways to get n nonadjacent heads

\n" ); document.write( "----\r
\n" ); document.write( "\n" ); document.write( "There is one way to toss HTHTHT...HT, and one way to toss THTHTH...TH and for cases HT....TH (starting and ending with H) there are always n-1 places to put TT between two of the H's: 1+1+(n-1) = n+1\r
\n" ); document.write( "\n" ); document.write( " \n" ); document.write( "
\n" );