Question: Let T = {0, 1, 2}. A string x T n is said to be balanced if the sum of the digits is an integer
Let T = {0, 1, 2}. A string x Tn is said to be balanced if the sum of the digits is an integer multiple of 3.
(a)
Show a bijection between the set of strings in T6 that are balanced and T5. Explain why your function is a bijection.
(b)
How many strings in T6 are balanced?
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
