- A Balanced Ternary String Of Length N Is A Function F N 1 0 1 The Weight Of Such A String Is The Sum F 1 1 (48.33 KiB) Viewed 43 times
A balanced ternary string of length n is a function f : [n] → {−1, 0, 1}. The weight of such a string is the sum f(1) +
-
answerhappygod
- Site Admin
- Posts: 899604
- Joined: Mon Aug 02, 2021 8:13 am
A balanced ternary string of length n is a function f : [n] → {−1, 0, 1}. The weight of such a string is the sum f(1) +
A balanced ternary string of length n is a function f : [n] → {−1, 0, 1}. The weight of such a string is the sum f(1) + ƒ(2) + + f(n). Show that the number of balanced ternary strings with weight 0 is 2k ak k where ak = (21) if 2k ≤n, and 0 otherwise. 2k k>0
Join a community of subject matter experts. Register for FREE to view solutions, replies, and use search function. Request answer by replying!