document.write( "Question 1158215: The following problems can be solved using the principle of inclusion-exclusion. Give the solutions by
\n" );
document.write( "naming sets A1
\n" );
document.write( ", A2
\n" );
document.write( ", ... , Ak such that either the set or the complement of the set is counted by the
\n" );
document.write( "inclusion-exclusion formula.
\n" );
document.write( "(1) How many n-digit decimal sequences (using the digits 0 − 9) are there in which the digits 1, 2 and
\n" );
document.write( "3 all appear?
\n" );
document.write( "(2) How many ways are there of rolling a sided die 10 times in a sequence such that all 6 faces
\n" );
document.write( "appear?
\n" );
document.write( "(3) How many positive integers less than or equal to 420 are relatively prime to 420 ?
\n" );
document.write( "(hint: 420 = 2 )
\n" );
document.write( "2
\n" );
document.write( "· 3 · 5 · 7
\n" );
document.write( "(4) How many arrangements of 52 letters, 2 A’s, 2 B’s, 2 C’s, etc. with no pair of identical letters
\n" );
document.write( "exist?
\n" );
document.write( "(5) How many ways are there of dealing a 13 card hand with at least one void in a suit?
\n" );
document.write( "(6) How many 13 card hands have at least one picture card (i.e., J, Q, K, A)? \n" );
document.write( "
Algebra.Com's Answer #781164 by ikleyn(52781)![]() ![]() You can put this solution on YOUR website! .\r \n" ); document.write( " \n" ); document.write( "\n" ); document.write( "The RULE, the POLICY and the REQUIREMENT of this forum is\r \n" ); document.write( " \n" ); document.write( "\n" ); document.write( " ONE and ONLY ONE problem per post.\r\n" ); document.write( "\n" ); document.write( "And those who violate this rule, work against their own interests.\r \n" ); document.write( " \n" ); document.write( "\n" ); document.write( "At this forum, I explained it just 2937 times.\r \n" ); document.write( " \n" ); document.write( " \n" ); document.write( "\n" ); document.write( " \n" ); document.write( " |