Results 1 to 4 of 4

Math Help - Discrete Math, URGENT please :(

  1. #1
    Newbie
    Joined
    Feb 2013
    From
    australia
    Posts
    22
    Thanks
    1

    Discrete Math, URGENT please :(

    I am stuck on these 2 questions I have absolutely NO CLUE I need help Its questions 2 and 3. Can anyone help me please
    Last edited by juliie; February 3rd 2013 at 04:39 AM.
    Follow Math Help Forum on Facebook and Google+

  2. #2
    MHF Contributor

    Joined
    Aug 2006
    Posts
    18,922
    Thanks
    1762
    Awards
    1

    Re: Discrete Math, URGENT please :(

    Quote Originally Posted by juliie View Post
    I am stuck on these 2 questions I have absolutely NO CLUE I need help Its questions 2 and 3. Can anyone help me please
    Please post the two questions. We cannot help with what cannot see.
    Follow Math Help Forum on Facebook and Google+

  3. #3
    Newbie
    Joined
    Feb 2013
    From
    australia
    Posts
    22
    Thanks
    1

    Re: Discrete Math, URGENT please :(

    sorry I didn't know how to use this at first I thought I posted the question anyway ill post the question now I hope you can help me!

    Let m ≥ n and let A = {1,2,...,m} and let B = {1,2,...,n}. In this exercise you will determine a formula for the number of surjective functions from A to B. For each i ∈ B, let Ai denote the set of all functions f : A → B such that i is not in the image of f, that is, for all x ∈ A we have f(x) 6= i. Thus the set of all functions from A to B which are not surjective is
    A1 ∪ A2 ∪ иии ∪ An.

    1. a) Let 1 ≤ k ≤ n. In how many ways can we choose integers i1,i2,...,ik such that 1 ≤ i1 < i2 < иии < ik ≤ n?

    b) Let 1 ≤ i1 < i2 < иии < ik ≤ n. Show that |Ai1 ∩ Ai2∩ иии ∩ Aik| = (n − k)^m.
    Follow Math Help Forum on Facebook and Google+

  4. #4
    MHF Contributor

    Joined
    Aug 2006
    Posts
    18,922
    Thanks
    1762
    Awards
    1

    Re: Discrete Math, URGENT please :(

    Quote Originally Posted by juliie View Post
    sorry I didn't know how to use this at first I thought I posted the question anyway ill post the question now I hope you can help me!

    Let m ≥ n and let A = {1,2,...,m} and let B = {1,2,...,n}. In this exercise you will determine a formula for the number of surjective functions from A to B. For each i ∈ B, let Ai denote the set of all functions f : A → B such that i is not in the image of f, that is, for all x ∈ A we have f(x) 6= i. Thus the set of all functions from A to B which are not surjective is
    A1 ∪ A2 ∪ иии ∪ An.

    1. a) Let 1 ≤ k ≤ n. In how many ways can we choose integers i1,i2,...,ik such that 1 ≤ i1 < i2 < иии < ik ≤ n?

    b) Let 1 ≤ i1 < i2 < иии < ik ≤ n. Show that |Ai1 ∩ Ai2∩ иии ∩ Aik| = (n − k)^m.
    NEVER, never post the same question more than once.
    Follow Math Help Forum on Facebook and Google+

Similar Math Help Forum Discussions

  1. Urgent: Problem with Discrete Fourier transform
    Posted in the New Users Forum
    Replies: 1
    Last Post: June 28th 2012, 04:43 AM
  2. Discrete Math. Urgent help please.
    Posted in the Discrete Math Forum
    Replies: 1
    Last Post: April 29th 2009, 11:30 PM
  3. Replies: 0
    Last Post: March 27th 2008, 07:37 PM
  4. Test Tommorow, Urgent Discrete Math advice needed.
    Posted in the Discrete Math Forum
    Replies: 7
    Last Post: February 20th 2008, 08:09 PM
  5. urgent hw trees-discrete maths!
    Posted in the Discrete Math Forum
    Replies: 0
    Last Post: November 13th 2007, 11:45 PM

Search Tags


/mathhelpforum @mathhelpforum