# Thread:

1. ## How many bit strings of length 27 are there...?

How many bit strings of length 27 are there such that:

a. the bit string corresponding to the last twelve positions contain exactly seven 0

b. the bit string has at least fifteen 0 and at least ten 1, also must have the bit string corresponding to the first nine positions contains six 1and the bit string corresponding to the last twelve positions contain a maximum of ten 0.

c. the bit string corresponding to the first ten positions contain exactly eight 1 and a bit string corresponding to the last fifteen positions contains (or does not contain) the string as a sub-string 1011101

2. Hi,

I will attempt a.

For the last 12 positions there are $\binom{12}{7}$ ways to pick the 0's, once the 0's are fixed, the 1's fall naturally into position.

Then for the first 15 positions there are 2 choices for each positions, either a 1 or 0, thus there are $2^{15}$ choices for the 1st 15 positions.

Thus in total we have $\left(2^{15}\right)\binom{12}{7}$ bit strings.

I would really like to know if this is correct though, could someone confirm? Thanks.
{"extraction_info": {"found_math": true, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 0, "mathjax_tag": 0, "mathjax_inline_tex": 0, "mathjax_display_tex": 0, "mathjax_asciimath": 0, "img_math": 0, "codecogs_latex": 3, "wp_latex": 0, "mimetex.cgi": 0, "/images/math/codecogs": 0, "mathtex.cgi": 0}, "config": {"markdown_headings": true, "markdown_code": true, "boilerplate_config": {"ratio_threshold": 0.18, "absolute_threshold": 10, "end_threshold": 15, "enable": true}, "remove_buttons": true, "remove_image_figures": true, "remove_link_clusters": true, "table_config": {"min_rows": 2, "min_cols": 3, "format": "github"}, "remove_chinese": true, "remove_edit_buttons": true, "extract_latex": true}, "english_confidence": 0.9162333607673645, "perplexity_flag": "head"}