Question

Let n be an even number. How many ternary strings (i.e. strings over the alphabet 10, 1,2]) of length n are there in which the only places that zeroes can appear are in the odd-numbered positions?

0 0
Add a comment Improve this question Transcribed image text
Answer #1

Only 1 and 2 can be placed at even positions, so number of combinations for even positions = n/2*2...........a

and 0,1,2, can be placed at odd positions, so no. of combinations for odd positions= n/2*3............................b

Therefore total no. of combinations= a*b

=n*n*2/3

Add a comment
Know the answer?
Add Answer to:
Let n be an even number. How many ternary strings (i.e. strings over the alphabet 10,...
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. Our experts will answer your question WITHIN MINUTES for Free.
Similar Homework Help Questions
ADVERTISEMENT
Free Homework Help App
Download From Google Play
Scan Your Homework
to Get Instant Free Answers
Need Online Homework Help?
Ask a Question
Get Answers For Free
Most questions answered within 3 hours.
ADVERTISEMENT
ADVERTISEMENT
ADVERTISEMENT