   Chapter 9.3, Problem 1ES ### 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 bit string consist of from one through four digits? (Strings of different length are considered distinct. Thus 10 an 0010 are distinct strings.) (b) How many bit strings consist of from five through eight digits?

To determine

(a)

To find how many bit strings consist of from one through four digits. (Strings of different lengths are considered distinct. Thus 10 and 0010 are distinct strings.)

Explanation

Given information:

The number of bit strings of length one is 1_ or 0_, i.e. 2 ways.

Concept used:

P(n,r)=n!nr!

Calculation:

The number of bit strings of length 2 is 4.

0 1, 0 0, 1 0, 1 1

The other way of explaining is that there are two places and each place has two.

The total number of possibilities is 22=4

To determine

(b)

To find how many bit strings consist of from five throgh eight digits.

### 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 