Results 1 to 2 of 2

Math Help - [SOLVED] Combinations

  1. #1
    Junior Member
    Joined
    Mar 2009
    Posts
    44

    [SOLVED] Combinations

    How many binary strings of length 10 starts with 0 bit and ends with two 11 bits.


    So, This is what ive done thus far.

    0XXXXXXX11.

    X can be either 1 or 0.

    So, because first digit and last 2 cant change, my n = 7, is this correct?

    Since we can have 2 different characters in each position (0 or 1), we have 2^7 different strings that start with 0 and end with 11.

    Can somebody tell me if im right path here please!
    Last edited by kurac; May 29th 2009 at 05:59 PM.
    Follow Math Help Forum on Facebook and Google+

  2. #2
    Junior Member
    Joined
    May 2009
    Posts
    27
    You are correct.
    Follow Math Help Forum on Facebook and Google+

Similar Math Help Forum Discussions

  1. [SOLVED] Proving Combinations
    Posted in the Discrete Math Forum
    Replies: 1
    Last Post: March 25th 2009, 03:55 PM
  2. [SOLVED] Card Combinations
    Posted in the Discrete Math Forum
    Replies: 1
    Last Post: February 19th 2009, 08:38 PM
  3. [SOLVED] Permutations and combinations question..
    Posted in the Discrete Math Forum
    Replies: 3
    Last Post: February 16th 2009, 08:11 AM
  4. [SOLVED] Permutations and Combinations problem
    Posted in the Discrete Math Forum
    Replies: 1
    Last Post: February 13th 2009, 05:13 AM
  5. [SOLVED] Premutations and Combinations
    Posted in the Advanced Statistics Forum
    Replies: 3
    Last Post: June 3rd 2008, 03:45 AM

Search Tags


/mathhelpforum @mathhelpforum