document.write( "Question 1206342: (a) How many different ways can 2 letters from the word SELECT be arranged?
\n" ); document.write( "(b) How many different ways can 3 letters from the word SELECT be arranged?
\n" ); document.write( "

Algebra.Com's Answer #843739 by math_tutor2020(3817)\"\" \"About 
You can put this solution on YOUR website!

\n" ); document.write( "Answers:
\n" ); document.write( "(a) 21
\n" ); document.write( "(b) 72\r
\n" ); document.write( "
\n" ); document.write( "\n" ); document.write( "--------------------------------------------------------------------------
\n" ); document.write( "--------------------------------------------------------------------------\r
\n" ); document.write( "
\n" ); document.write( "\n" ); document.write( "Explanation for part (a)\r
\n" ); document.write( "
\n" ); document.write( "\n" ); document.write( "Break things up into three cases:
\n" ); document.write( "(1) Exactly zero 'E's are chosen
\n" ); document.write( "(2) Exactly one 'E' is chosen
\n" ); document.write( "(3) Exactly two 'E's are chosen\r
\n" ); document.write( "
\n" ); document.write( "\n" ); document.write( "Case (1)
\n" ); document.write( "The letters to pick from are {S,L,C,T}
\n" ); document.write( "There are 4*3 = 12 different two letter words possible where \"E\" isn't chosen.
\n" ); document.write( "Alternatively, you can use the nPr permutation formula with n = 4 and r = 2.
\n" ); document.write( "Of course when I say \"word\", I mean it in quotes because much of these two-letter strings aren't words found in the dictionary.
\n" ); document.write( "An example word of case (1) would be SL.\r
\n" ); document.write( "
\n" ); document.write( "\n" ); document.write( "Case (2)
\n" ); document.write( "Let's say \"E\" is in the first slot. There would be 4 words we can form which are: ES, EL, EC, ET
\n" ); document.write( "We will also have 4 words with \"E\" in the second slot.
\n" ); document.write( "That's 4+4 = 8 different words that have exactly one \"E\".
\n" ); document.write( "An example word of case (2) would be SE.\r
\n" ); document.write( "
\n" ); document.write( "\n" ); document.write( "Case (3)
\n" ); document.write( "This is a trivial case of just one possibility. The word EE.\r
\n" ); document.write( "
\n" ); document.write( "\n" ); document.write( "Add up the results:
\n" ); document.write( "12+8+1 = 21 is the final answer to part (a)\r
\n" ); document.write( "
\n" ); document.write( "\n" ); document.write( "Here is the list of all 21 unique entries (7 rows, 3 columns)
\n" ); document.write( "\n" ); document.write( "\n" ); document.write( "
1SESLSC
2STESEL
3EEECET
4LSLELC
5LTCSCE
6CLCTTS
7TETLTC

\n" ); document.write( "The list was generated using this combinatorics calculator
\n" ); document.write( "https://www.mathsisfun.com/combinatorics/combinations-permutations-calculator.html\r
\n" ); document.write( "
\n" ); document.write( "
\n" ); document.write( "\n" ); document.write( "--------------------------------------------------------------------------\r
\n" ); document.write( "
\n" ); document.write( "\n" ); document.write( "Explanation for part (b)\r
\n" ); document.write( "
\n" ); document.write( "\n" ); document.write( "We'll have three cases:
\n" ); document.write( "Case (1): Exactly 0 'E's are chosen
\n" ); document.write( "Case (2): Exactly 1 'E' is chosen
\n" ); document.write( "Case (3): Exactly 2 'E's are chosen
\n" ); document.write( "We stop here since we cannot select 3 \"E\"s.\r
\n" ); document.write( "
\n" ); document.write( "\n" ); document.write( "Case (1)
\n" ); document.write( "There are 4 items to pick from in the set {S,L,C,T}
\n" ); document.write( "That gives 4*3*2 = 24 ways to form a three-letter word without any \"E\"s in it.
\n" ); document.write( "An example word of case (1) would be SLC.\r
\n" ); document.write( "
\n" ); document.write( "\n" ); document.write( "Case (2)
\n" ); document.write( "We have 3 places to put the \"E\".
\n" ); document.write( "Then we have 4*3 = 12 ways to pick the other letters where order matters.
\n" ); document.write( "3*12 = 36 ways to form a three-letter word with exactly one \"E\" in it.
\n" ); document.write( "An example word of case (2) would be SEL.\r
\n" ); document.write( "
\n" ); document.write( "\n" ); document.write( "Case (3)
\n" ); document.write( "There are 3 slots to choose from for one of these letters {S,L,C,T}
\n" ); document.write( "3*4 = 12 ways to form a three-letter word with exactly two \"E\"s in it.
\n" ); document.write( "An example word of case (3) would be SEE.\r
\n" ); document.write( "
\n" ); document.write( "\n" ); document.write( "Add up the results:
\n" ); document.write( "24+36+12 = 72 is the final answer to part (b)\r
\n" ); document.write( "
\n" ); document.write( "\n" ); document.write( "Below is the list of all 72 unique entries.
\n" ); document.write( "The list was generated with the previously mentioned link.
\n" ); document.write( "The table has 9 rows and 8 columns.
\n" ); document.write( "\n" ); document.write( "\n" ); document.write( "
12345678
1SELSEESECSETSLESLCSLTSCE
2SCLSCTSTESTLSTCESLESEESC
3ESTELSELEELCELTEESEELEEC
4EETECSECLECEECTETSETLETE
5ETCLSELSCLSTLESLEELECLET
6LCSLCELCTLTSLTELTCCSECSL
7CSTCESCELCEECETCLSCLECLT
8CTSCTECTLTSETSLTSCTESTEL
9TEETECTLSTLETLCTCSTCETCL

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