0 votes 0 votes How many bit strings contain exactly eight $0s$ and $10\:\: 1s$ if every $0$ must be immediately followed by a $1?$ Combinatory kenneth-rosen discrete-mathematics counting combinatory descriptive + – admin asked Apr 29, 2020 admin 406 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
0 votes 0 votes Well, you have 8 01s and then 2 1s left over. Say a = 01 and b = 1. You are then basically looking to find the number of unique strings with 8 a's and 2 b's. For example, aaaaaaaabb C(10,8)=10*9/2=45 Mohit Kumar 6 answered Apr 30, 2020 Mohit Kumar 6 comment Share Follow See all 0 reply Please log in or register to add a comment.