Question

Consider the word uncopyrightable.

1. (a) (1 point) Did you know that it is the longest word without any repeated letters? (Y/N)

2. (b) (1 point) Did you know that such words are called isograms? (Y/N)

3. (c) (1 point) Now that we have learned enough about linguistics, let’s do some math. (Y/N)

4. (d) (5 points) What is the number of permutations of all 15 letters in uncopyrightable? The permutations you count may not have any meaning.

5. (e) (5 points) In how many of the permutations in part (d) does copy appear?

6. (f) (5 points) In how many of the permutations in part (d) copy does not appear?

7. (g) (5 points) In how many of the permutations in part (d) able does not appear?

8. (h) (5 points) Compare your answers in parts (f) and (g). Which one is larger/smaller?

   Justify why these two numbers are compared this way.

9. (i) (5 points) In how many of the permutations in part (d) do both copy and able appear?

10. (j) (8 points) In how many of the permutations in part (d) does at least one of copy and able appear?

11. (k) (5 points) In how many of the permutations in part (d) do all three of copy, right, and able appear?

12. (l) (8 points) In how many of the permutations in part (d) does at least one of copy, right, and able

    appear?

Answer 1

a) Yes, uncopyrightable is the longest word without any repeated letters.

b) Yes, An isogram is a term in recreational linguistics

c) The Math is done as shown