How many bit strings of length 5 contain at least two 1s?

Advanced Engineering Mathematics
10th Edition
ISBN:9780470458365
Author:Erwin Kreyszig
Publisher:Erwin Kreyszig
Chapter2: Second-order Linear Odes
Section: Chapter Questions
Problem 1RQ
icon
Related questions
Question

Discrete Math:

How many bit strings of length 5 contain at least two 1s?

Expert Solution
Step 1

We first find number of bit strings of length 5 that  contain less than two 1s.

(1) When there is no 1s in bit strings of length 5. (contain only zero)

Number of such string = C05 = 5!0!(5-0)! = 5!5! = 1            Crn = n!r!(n-r)!

(2) When there is only one 1s in the bit strings of length 5.

Number of such strings = C15 = 5!1!(5-4)! = 5

Hence we have 6 strings ( from (1) and (2) ) that contain less than two 1s. The rest of the strings contain at least two 1s.

Also

the total number of bit strings of length 5  = 25 =32

steps

Step by step

Solved in 2 steps

Blurred answer
Similar questions
Recommended textbooks for you
Advanced Engineering Mathematics
Advanced Engineering Mathematics
Advanced Math
ISBN:
9780470458365
Author:
Erwin Kreyszig
Publisher:
Wiley, John & Sons, Incorporated
Numerical Methods for Engineers
Numerical Methods for Engineers
Advanced Math
ISBN:
9780073397924
Author:
Steven C. Chapra Dr., Raymond P. Canale
Publisher:
McGraw-Hill Education
Introductory Mathematics for Engineering Applicat…
Introductory Mathematics for Engineering Applicat…
Advanced Math
ISBN:
9781118141809
Author:
Nathan Klingbeil
Publisher:
WILEY
Mathematics For Machine Technology
Mathematics For Machine Technology
Advanced Math
ISBN:
9781337798310
Author:
Peterson, John.
Publisher:
Cengage Learning,
Basic Technical Mathematics
Basic Technical Mathematics
Advanced Math
ISBN:
9780134437705
Author:
Washington
Publisher:
PEARSON
Topology
Topology
Advanced Math
ISBN:
9780134689517
Author:
Munkres, James R.
Publisher:
Pearson,