SOLUTION: In mathematics, a word is a list of letters which may or may not form an actual word in English ( or any other language). For example, aa, at, zz, so, ia, and pq are all 2 letter m

Algebra ->  Probability-and-statistics -> SOLUTION: In mathematics, a word is a list of letters which may or may not form an actual word in English ( or any other language). For example, aa, at, zz, so, ia, and pq are all 2 letter m      Log On


   

Question 527436: In mathematics, a word is a list of letters which may or may not form an actual word in English ( or any other language). For example, aa, at, zz, so, ia, and pq are all 2 letter mathematical words. Suppose we wanted to count the total number of 4-letter mathematical words which have no repeating letters.

Which method listed should we use? Combinations, Permutations, n(factor)k, Benford's Law
Answer by Edwin McCravy(20056) About Me  (Show Source):
You can put this solution on YOUR website!
I'm not sure what you mean by "n(factor)k" 

I would answer "permutations", for the number of 4-letter 
"words" is P(26,4) or on

the TI-84, it's 

26 nPr 4 

And it is calculated by

26×25×24×23 = 358800

Maybe that's what you mean by n(factor)k.  I am not familiar with
"n(factor)k", but maybe you call that "26(factor)4".  I'm only familiar
with calling it "The number of permutations of 26 things taken 4 at
a time".

Regardless of what people call it, the number of 4-letter "words" 
without repeating letters is:

26×25×24×23 = 358800

Edwin