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

Transcribed Image Text:

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.) 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.)

Answer rating: 100% (QA)

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