1. The problem statement, all variables and given/known data Michelle knows that there are 8!/2!2! permutations of her name when ALL the letters are used. She would like to know how many permutations there are if ANY NUMBER OF LETTERS in her name are used. Explain your procedure. 3. The attempt at a solution this is what i figured out, i dont think i'm right though. if your using all 8 letters there are 8! ways, but if only 7 letters are used than there are 8x7x6x5x4x3x2 ways,and if 6 letters are used than there are 8x7x6x5x4x3 and if 5 letters 8x7x6x5x4 ways all the way down to 1 letter. than the product of each are added since they are mutually exclusive.