| Line 2: | Line 2: | ||
'''[[MA 375 Spring 09 HW 7|Back]]''' | '''[[MA 375 Spring 09 HW 7|Back]]''' | ||
| + | [[Catherine Withey|Catherine's solution]] | ||
I have problems with setting up a simple solution to figure out how many bit strings there are with 3 consecutive 0's. I have spent my time counting all the possibilities out, but when it comes to test time I would like to know how to set up this problem with out having to count everything out. Is there an easier way to do this problem? Will someone show me how, or at least give a hint to how to count this easier. | I have problems with setting up a simple solution to figure out how many bit strings there are with 3 consecutive 0's. I have spent my time counting all the possibilities out, but when it comes to test time I would like to know how to set up this problem with out having to count everything out. Is there an easier way to do this problem? Will someone show me how, or at least give a hint to how to count this easier. | ||
Latest revision as of 14:12, 4 March 2009
I have problems with setting up a simple solution to figure out how many bit strings there are with 3 consecutive 0's. I have spent my time counting all the possibilities out, but when it comes to test time I would like to know how to set up this problem with out having to count everything out. Is there an easier way to do this problem? Will someone show me how, or at least give a hint to how to count this easier.
