Let X_n be the set of all words of the length 2𝑛 over the alphabet {𝐴,𝐵} which contain as many A's as B's. The number of elements in X_n is (2n n), but why?

abelynybco

abelynybco

Answered question

2022-10-03

Let X n be the set of all words of the length 2𝑛 over the alphabet {𝐴,𝐵} which contain as many A's as B's.
The number of elements in X n is ( 2 n n ) , but why?

Answer & Explanation

Shane Middleton

Shane Middleton

Beginner2022-10-04Added 7 answers

There are 2 n positions to be filled in a word of length 2 n. Once you know which n positions are filled with A's, the other 𝑛 positions must contain B's, so the word is completely determined. There are ( 2 n n ) ways to choose which n positions get the A's, so there are ( 2 n n ) such words.

Do you have a similar question?

Recalculate according to your conditions!

Ask your question.
Get an expert answer.

Let our experts help you. Answer in as fast as 15 minutes.

Didn't find what you were looking for?