discrete mathematics - Simple combinatorics -


im having trouble understanding combinatorics , how "choose" works. have homework problem think understand want make sure im not off.

the question is...

"we wish make 6 letter string such every letter in position vowel (no constraints on odd letters) how many possible strings can make?" have access 26 letters , repeats allowed , distinct orderings different strings.

the answer coming is...

(26 choose 1) x (5 choose 1) x (26 choose 1) x (5 choose 1) x (26 choose 1) x (5 choose 1)

am on right track?

yes, should exact answer unless teacher counting 'y' vowel jerk


Comments

Popular posts from this blog

linux - Does gcc have any options to add version info in ELF binary file? -

android - send complex objects as post php java -

charts - What graph/dashboard product is facebook using in Dashboard: PUE & WUE -