Question

How many ternary strings (strings of elements taken from the set{0,1,2}) of length2n are there in...

How many ternary strings (strings of elements taken from the set{0,1,2}) of length2n are there in which the zeroes appear only in all odd-numbered positions?

How many ternary strings of length 7 will contain at least one 0?

Homework Answers

Know the answer?
Your Answer:

Post as a guest

Your Name:

What's your source?

Earn Coins

Coins can be redeemed for fabulous gifts.

Not the answer you're looking for?
Ask your own homework help question
Similar Questions
Do each of the following. a) How many ternary strings of length 20 contain at least...
Do each of the following. a) How many ternary strings of length 20 contain at least four 1s? (Hint: A ternary string consists of 0s, 1s, and 2s.) b) How many ternary strings of length 20 contain exactly four 1s?
How many binary strings of length 15 contain the same bit in all the odd numbered...
How many binary strings of length 15 contain the same bit in all the odd numbered positions? The positions are numbered 1, 2, . . . , 15. Show how you arrived at your answer, which rules of counting were used etc. Thank You
How many ternary strings of length 8 begin with 01 or end with 1? (A ternary...
How many ternary strings of length 8 begin with 01 or end with 1? (A ternary string consists of 0s, 1s, and 2s.)
Consider strings of length 8 made up of elements in {0,1}. How many strings contain 000...
Consider strings of length 8 made up of elements in {0,1}. How many strings contain 000 as a substring? How many strings contain more 0’s than 1’s?
This is a Discrete math problem. a. How many bit strings of length 12 are there...
This is a Discrete math problem. a. How many bit strings of length 12 are there in total? b. How many bit strings of length 12 contain an odd number of 1s? c. How many bit strings of length 12 contain “111000” as a substring of 6 consecutive bits in a row?
Answer only a & b thanks A ternary string is a sequence of 0’s,1’s and2’s. Just...
Answer only a & b thanks A ternary string is a sequence of 0’s,1’s and2’s. Just like a bit string, but with three symbols. Let’s call a ternary string good provided it never contains a 2 followed immediately by a 0. Let Gn be the number of good strings of length n. For example, G1= 3, and G2 = 8 (since of the 9 ternary strings of length 2, only one is not good). a. List the set of all...
How many nondecreasing sequences of length 10 can you make from the set {0,1,2,...,100}? An example...
How many nondecreasing sequences of length 10 can you make from the set {0,1,2,...,100}? An example is 0,0,5,10,10,10,15,25,35,92.
(a) How many 12-bit strings contain exactly five 1's? (b) How many 12-bit strings contain at...
(a) How many 12-bit strings contain exactly five 1's? (b) How many 12-bit strings contain at least nine 1's? .(c) How many 12-bit strings contain at least one 1? (d) How many 12-bit strings contain at most one 1?
How many different decimal strings of length 2 (strings of length two where each element of...
How many different decimal strings of length 2 (strings of length two where each element of the string is one of the decimal digits 0-9) are there where no digit can be repeated? How many length 3 decimal strings are there like this. How many length 7 decimal strings are there like this? How many length 11 decimal strings are there like this? Give an example of one of the length 11 strings.
Assume strings contain ONLY the letters: a, b. How many bit strings of length 8 either...
Assume strings contain ONLY the letters: a, b. How many bit strings of length 8 either start with bbb or end with aa ?
ADVERTISEMENT
Need Online Homework Help?

Get Answers For Free
Most questions answered within 1 hours.

Ask a Question
ADVERTISEMENT