👤
Answered

how many length m words can be formed from an n-letter alphabet, if no letter is used more than once? (b) how many length m words can be formed from an n-letter alphabet, if letters can be reused? (c) how many binary relations are there from set a to set b when jaj d m and jbj d n? (d) how many total injective functions are there from set a to set b, where jaj d m and jbj d n m

Answer :

As per the combination method, there are 120, 5 length m words can be formed from an n-letter alphabet, if no letter is used more than once.

Combination method:

in statistics, mathematical technique that determines the number of possible arrangements in a collection of items where the order of the selection does not matter is known as combination method.

Given,

Here we need to find how many length m words can be formed from an n-letter alphabet, if no letter is used more than once.

Let us consider letters (a,b,c,d,e) how many distinct n length words can be formed.

Here we note that every word can contain same letter m times at most.

So, it can be calculated as,

=> 5 x 4 x 3 x 2 x 1

=> 120

To know more about Combination method here,

https://brainly.com/question/28998705

#SPJ4

Go Teaching: Other Questions