document.write( "Question 446414: In how many ways can a committee of 5 be chosen from 10 candidates so as to
\n" ); document.write( " (a) include the youngest and the eldest
\n" ); document.write( " (b) exclude the youngest if it includes the eldest?
\n" ); document.write( "
\n" ); document.write( "

Algebra.Com's Answer #307442 by rwm(914)\"\" \"About 
You can put this solution on YOUR website!
A-
\n" ); document.write( "There is only one way to include the eldest
\n" ); document.write( "There is only one way to include the youngest.
\n" ); document.write( "That leaves 8 others to choose from for three positions.\r
\n" ); document.write( "\n" ); document.write( "1*1*8*7*6
\n" ); document.write( "B-
\n" ); document.write( "This one I am not sure of.
\n" ); document.write( "How do you know if the eldest is there?
\n" ); document.write( "if the eldest isn't there
\n" ); document.write( "10*9*8*7*6\r
\n" ); document.write( "\n" ); document.write( "if the eldest is there
\n" ); document.write( "we leave out the youngest so there are only 8 ways left
\n" ); document.write( "1*8*7*6*5\r
\n" ); document.write( "\n" ); document.write( "
\n" ); document.write( "
\n" );