You are on page 1of 3

Discrete Mathematics and Its Applications - 9780073383095 - Exercise 1... https://quizlet.com/explanations/textbook-solutions/discrete-mathematic...

Math Discrete Math Discrete Mathematics and Its Applications (7th Edition)

Exercise 13
Chapter 6, Section 6.1, Page 396

Discrete Mathematics and Its Applications

ISBN: 9780073383095

Table of contents

Solution Verified 4.3 (8 ratings)

Step 1 1 of 4

DEFINITIONS

Product rule If one event can occur in m ways AND a second event can occur in
n ways, the number of ways the two events can occur in sequence is then m ⋅ n.

Sum rule If an event can occur either in m ways OR in n ways (non-overlapping),


the number of ways the event can occur is then m + n.

Subtraction rule If an event can occur either in m ways OR in n ways


(overlapping), the number of ways the event can occur is then m + n decreased by

the number of ways that the event can occur commonly to the two different ways.

1 of 3 3/26/2024, 11:46 AM
Discrete Mathematics and Its Applications - 9780073383095 - Exercise 1... https://quizlet.com/explanations/textbook-solutions/discrete-mathematic...

Step 2 2 of 4

SOLUTION

Bit strings of length n There is exactly 1 bit string with length n consisting of
only 1's: 111111...111

...

Bit strings of length 2 There is exactly 1 bit string with length 2 consisting of only
1's: 11

Bit strings of length 1 There is exactly 1 bit string with length 1 consisting of only
1's: 1

Step 3 3 of 4

$\textbf{String bits of length n or less}$ We need to use the sum rule, since the bit
string has length 1, or length 2, or ... or length n:

1 + 1 + .... + 1 = n

Result 4 of 4

n bit strings (excluding the empty string)

2 of 3 3/26/2024, 11:46 AM
Discrete Mathematics and Its Applications - 9780073383095 - Exercise 1... https://quizlet.com/explanations/textbook-solutions/discrete-mathematic...

Rate this solution


Exercise 12 Exercise 14

Privacy Terms English (USA)

3 of 3 3/26/2024, 11:46 AM

You might also like