0 votes 0 votes How many different bit strings can be formed using six $1s$ and eight $0s?$ Combinatory kenneth-rosen discrete-mathematics counting combinatory descriptive + – admin asked May 1, 2020 admin 441 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
0 votes 0 votes Here number of ones=6 number of zeros=8,so total n=(6+8)=14 n1=6 ,n2=8 and n=14 number of string possible =14!/(6!8!)=3003 _aurelius_ answered May 1, 2020 _aurelius_ comment Share Follow See all 0 reply Please log in or register to add a comment.
