- #1
erogol
- 14
- 0
a "codeword" from the alphabet A={0,1,2,3) is said to be legitimate if it contains even number of zeros. Thus for instance the codeword 31020 is legitimated and 0002 is not. How many n - letter codewords are legitimated ?
erogol said:a "codeword" from the alphabet A={0,1,2,3) is said to be legitimate if it contains even number of zeros. Thus for instance the codeword 31020 is legitimated and 0002 is not. How many n - letter codewords are legitimated ?
erogol said:i have no sense to solve it i just know answer is 2^(2n-1) + 2^n -1
HallsofIvy said:So you are not even going to try?
Combinatorial question refers to a type of mathematical problem that involves counting or arranging objects, where the order of the objects matters.
To solve a combinatorial question, you first need to identify the type of problem it is (permutations, combinations, etc.). Then, use the appropriate formula or method to calculate the number of possible outcomes.
Some common examples of combinatorial questions include: how many ways can you arrange a deck of cards, how many possible license plate combinations are there, and how many different pizza toppings can you choose from a menu.
Yes, there are different strategies and methods that can be used to solve combinatorial questions, such as using the fundamental principle of counting, using combinations or permutations, and using tree diagrams.
Combinatorial questions have many real-world applications, such as in probability and statistics, computer science, and decision-making processes. They are used to solve problems involving arranging objects, selecting options, and analyzing outcomes.