4. Consider bit strings with lenght 1 and weight k (so strings of 1 0's and 1's, including k 1's). We know how to count the number of these for a fixed 1 and k. Now, we will count the number of strings for which the sum of the length and the weight is fixed. For example, let's count all the bit strings for which 1+ k = 11. (a) Find examples of these strings of different lengths. What is the longest string possible? What is the shortest? (b) How many strings are there of each of these lengths. Use this to count the total number of strings (with sum 11). (c) The other approach: Let n = 1+ k vary. How many strings have sum n = 1? How many have n = 2? And so on. Find and explain a recurrence relation for the sequence (an) which gives the sumnumber of strings with sum n. (d) Describe what you have found above in terms of Pascal's Triangle. What patter have you discovered?

Linear Algebra: A Modern Introduction
4th Edition
ISBN:9781285463247
Author:David Poole
Publisher:David Poole
Chapter2: Systems Of Linear Equations
Section2.4: Applications
Problem 33EQ
icon
Related questions
Question
4. Consider bit strings with lenght 1 and weight k (so strings of 1 0's and 1's, including k 1's). We know how to count
the number of these for a fixed 1 and k. Now, we will count the number of strings for which the sum of the length and
the weight is fixed. For example, let's count all the bit strings for which
1+ k = 11.
(a) Find examples of these strings of different lengths. What is the longest string possible? What is
the shortest?
(b) How many strings are there of each of these lengths. Use this to count the total number of strings
(with sum 11).
(c) The other approach: Let n = 1+ k vary. How many strings have sum n = 1? How many have
n = 2? And so on. Find and explain a recurrence relation for the sequence (an) which gives the
sum number of strings with sum n.
(d) Describe what you have found above in terms of Pascal's Triangle. What patter have you discovered?
Transcribed Image Text:4. Consider bit strings with lenght 1 and weight k (so strings of 1 0's and 1's, including k 1's). We know how to count the number of these for a fixed 1 and k. Now, we will count the number of strings for which the sum of the length and the weight is fixed. For example, let's count all the bit strings for which 1+ k = 11. (a) Find examples of these strings of different lengths. What is the longest string possible? What is the shortest? (b) How many strings are there of each of these lengths. Use this to count the total number of strings (with sum 11). (c) The other approach: Let n = 1+ k vary. How many strings have sum n = 1? How many have n = 2? And so on. Find and explain a recurrence relation for the sequence (an) which gives the sum number of strings with sum n. (d) Describe what you have found above in terms of Pascal's Triangle. What patter have you discovered?
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 3 steps with 3 images

Blurred answer
Recommended textbooks for you
Linear Algebra: A Modern Introduction
Linear Algebra: A Modern Introduction
Algebra
ISBN:
9781285463247
Author:
David Poole
Publisher:
Cengage Learning
Elements Of Modern Algebra
Elements Of Modern Algebra
Algebra
ISBN:
9781285463230
Author:
Gilbert, Linda, Jimmie
Publisher:
Cengage Learning,
Algebra & Trigonometry with Analytic Geometry
Algebra & Trigonometry with Analytic Geometry
Algebra
ISBN:
9781133382119
Author:
Swokowski
Publisher:
Cengage