Warning: foreach() argument must be of type array|object, bool given in /var/www/html/web/app/themes/studypress-core-theme/template-parts/header/mobile-offcanvas.php on line 20

How many bit strings of length 12contain

a) exactly three 1s?

b) at most three 1s?

c) at least three 1s?

d) an equal number of 0sand 1s?

Short Answer

Expert verified

a) There are 220 bit strings of length 12 contain exactly three 1s.

b) There are 299 bit strings of length 12 contain at most three 1s.

c) There are 4017 bit strings of length 12 contain at least three 1s.

d) There are 924 bit strings of length 12 contain an equal number of 0s and 1s .

Step by step solution

Achieve better grades quicker with Premium

  • Unlimited AI interaction
  • Study offline
  • Say goodbye to ads
  • Export flashcards

Over 22 million students worldwide already upgrade their learning with Vaia!

01

Given data

Bit strings of length 12

02

Concept of Combination

A combination is a selection of items from a set that has distinct members.

Formula:

nCr=n!r!(nr)!

03

Calculation for the number of bit strings for exactly four 1s

a)

To choose 3 position to 1's out of 12 :

C(12,3)=12!(3!×9!)=(12×11×10)3!=220.

Thus, there 210 are bit strings of length 12 contain exactly three 1s .

04

Calculation for the number of bit strings for at most four 1s

b)

There are zero 1s, one 1s, two 1s, three 1s in the bit strings of length 12:

C(12,0)+C(12,1)+C(12,2)+C(12,3)=12!/(0!×12!)+12!/(1!×11!)+12!/(2!×10!)+12!/(3!×9!)=1+12+66+220=299

Thus, there are 299 bit strings of length 12 contain at most three 1s.

05

Calculation for the number of bit strings for at least four 1s

c)

Subtract the total number of bit strings of length 12 those that have only 0,1,2,3 or 1s :

212[C(10,0)+C(10,1)+C(10,2)]=409611266=4017

Thus, there are 4017 bit strings of length 12 contain at least three 1s.

06

Calculation for the number of bit strings for an equal number 0s and 1s

d)

To choose 6 out of 12 position to place :

C(12,6)=12!(6!×6!)=924

Thus, there are 924 bit strings of length 12 contain an equal number of 0s and 1s .

One App. One Place for Learning.

All the tools & learning materials you need for study success - in one app.

Get started for free

Most popular questions from this chapter

The row of Pascal's triangle containing the binomial coefficients, is:

(10k),0k10, is:

1    10    45    120    210    252    210    120    45    10    1

Use Pascal’s identity to produce the row immediately following

this row in Pascal’s triangle.

In this exercise we will count the number of paths in the\(xy\)plane between the origin \((0,0)\) and point\((m,n)\), where\(m\)and\(n\)are nonnegative integers, such that each path is made up of a series of steps, where each step is a move one unit to the right or a move one unit upward. (No moves to the left or downward are allowed.) Two such paths from\((0,0)\)to\((5,3)\)are illustrated here.

a) Show that each path of the type described can be represented by a bit string consisting of\(m\,\,0\)s and\(n\,\,1\)s, where a\(0\)represents a move one unit to the right and a\(1\)represents a move one unit upward.

b) Conclude from part (a) that there are \(\left( {\begin{array}{*{20}{c}}{m + n}\\n\end{array}} \right)\) paths of the desired type.

Give a combinatorial proof that\(\sum\limits_{k = 1}^n k \cdot {\left( {\begin{array}{*{20}{l}}n\\k\end{array}} \right)^2} = n \cdot \left( {\begin{array}{*{20}{c}}{2n - 1}\\{n - 1}\end{array}} \right)\). (Hint: Count in two ways the number of ways to select a committee, with\(n\)members from a group of\(n\)mathematics professors and\(n\)computer science professors, such that the chairperson of the committee is a mathematics professor.)

Show that a nonempty set has the same number of subsets with an odd number of elements as it does subsets with an even number of elements.

8. How many different ways are there to choose a dozen donuts from the 21 varieties at a donut shop?

See all solutions

Recommended explanations on Math Textbooks

View all explanations

What do you think about this solution?

We value your feedback to improve our textbook solutions.

Study anywhere. Anytime. Across all devices.

Sign-up for free