How many total possibilities are there to form a surname from the letters in , using each letter at most once?
Details and assumptions:
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
Let n denote the nonzero number of letters chosen from the first name. Since there are 6 distinct letters, there are ( n 6 ) ways to choose from. Then, there are n ! ways to rearrange the letters for the surname. Thus, n = 1 ∑ 6 n ! ( n 6 ) = 1 9 5 6