   Chapter 9.5, Problem 14ES ### Discrete Mathematics With Applicat...

5th Edition
EPP + 1 other
ISBN: 9781337694193

#### Solutions

Chapter
Section ### Discrete Mathematics With Applicat...

5th Edition
EPP + 1 other
ISBN: 9781337694193
Textbook Problem
1 views

# (a) How many 16-bit strings contain exactly seven 1’s? (b)How many 16-bit strings contain at least thirteen 1’s? (c)How many 16-bit strings contain at least one 1? (d)How many 16-bit strings contain at most one 1?

To determine

(a)

The number of 16 -bit strings that contain exactly seven 1's.

Explanation

Calculation:

The number of 16 -bit strings that contain exactly seven 1's mean selecting 7 places for 1's out of 16 places.

So the number 16 -bit strings that contain exactly seven 1's

=( 16 7)=16!7!(16

To determine

(b)

The number of 16 -bit strings that contain at least thirteen 1's.

To determine

(c)

The number of 16 -bit strings that contain at least one 1.

To determine

(d)

The number of 16 -bit strings that contain exactly seven 1's.

### Still sussing out bartleby?

Check out a sample textbook solution.

See a sample solution

#### The Solution to Your Study Problems

Bartleby provides explanations to thousands of textbook problems written by our experts, many with advanced degrees!

Get Started 