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) + f(2) + + f(n). Show that the number of balanced ternary strings with weight 0 is 2k ak k k20 where ak = G) if 2k < n, and 0 otherwise.

Algebra & Trigonometry with Analytic Geometry
13th Edition
ISBN:9781133382119
Author:Swokowski
Publisher:Swokowski
Chapter10: Sequences, Series, And Probability
Section10.8: Probability
Problem 64E
icon
Related questions
Question
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) + f(2) + … + f(n). Show that the number of balanced ternary strings
with weight 0 is
2k
k20
where ak =
G) if 2k < n, and 0 otherwise.
Transcribed Image Text: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) + f(2) + … + f(n). Show that the number of balanced ternary strings with weight 0 is 2k k20 where ak = G) if 2k < n, and 0 otherwise.
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 2 steps with 2 images

Blurred answer
Recommended textbooks for you
Algebra & Trigonometry with Analytic Geometry
Algebra & Trigonometry with Analytic Geometry
Algebra
ISBN:
9781133382119
Author:
Swokowski
Publisher:
Cengage
College Algebra
College Algebra
Algebra
ISBN:
9781938168383
Author:
Jay Abramson
Publisher:
OpenStax
Elements Of Modern Algebra
Elements Of Modern Algebra
Algebra
ISBN:
9781285463230
Author:
Gilbert, Linda, Jimmie
Publisher:
Cengage Learning,