Question: A ternary string is a sequence of 0's, 1's and 2's where order matters. For example 2021011 is a ternary string of length 8

A ternary string is a sequence of 0's, 1's and 2's where

A ternary string is a sequence of 0's, 1's and 2's where order matters. For example 2021011 is a ternary string of length 8 and it is different from 0011122 since the 0's, 1's and 2's appear in different places. In general, how many ternary strings are there of length n? In general, how many ternary strings of length n have exactly k twos in them? In general, how many ternary strings of length n have exactly k twos and jones? (This last number is sometimes called a "trionomial" coefficient.)

Step by Step Solution

3.28 Rating (160 Votes )

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock

1 The number of possible ternary strings of length n is 3n For each of the n positions in the string ... View full answer

blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Mathematics Questions!