Results 1 to 3 of 3

Math Help - Proving an "onto" function..

  1. #1
    Newbie
    Joined
    Apr 2013
    From
    Tokyo
    Posts
    8

    Proving an "onto" function..

    I have to prove that f(n) = 2n is not an onto function when the domain and co-domain are a set of all of the integers.

    I graph it and see it isn't an onto function. However, everytime I do the math, it says it is. Can someone step through how to solve this one for me?

    This is what I get.

    First substitute m for f(n)

    m = 2m

    Solve for one side

    (2/m) = m

    If f(n) = m then,

    f(n) = f(2/m) = 2(2/m) = m

    therefore, f(n) = m.

    What am I doing wrong. Thanks...
    Follow Math Help Forum on Facebook and Google+

  2. #2
    MHF Contributor
    Joined
    Oct 2009
    Posts
    5,502
    Thanks
    765

    Re: Proving an "onto" function..

    Suppose you have a group of children numbered 1, 2, 3, ... Suppose also that you are distributing candies to them. If your function from the set of candies to the set of kids' numbers is not onto, you will immediately know this by indignant screams, "What about me? I did not get any!". Now assume you are giving candies only to every other kid starting from 2, i.e., to even-numbered children. Is this function onto? You only have to find just one upset kid to know it's not.

    Quote Originally Posted by RatchetTheLombax View Post
    I have to prove that f(n) = 2n is not an onto function when the domain and co-domain are a set of all of the integers.

    I graph it and see it isn't an onto function. However, everytime I do the math, it says it is. Can someone step through how to solve this one for me?

    This is what I get.

    First substitute m for f(n)

    m = 2m
    I assume you want to find the inverse of f. Then you need to solve the equation f(n) = m. If you can solve it for every m, i.e., for every m there exists an n such that f(n) = m, then the function is onto. This equation is 2n = m, not 2m = m.
    Follow Math Help Forum on Facebook and Google+

  3. #3
    MHF Contributor

    Joined
    Aug 2006
    Posts
    18,605
    Thanks
    1573
    Awards
    1

    Re: Proving an "onto" function..

    Quote Originally Posted by RatchetTheLombax View Post
    I have to prove that f(n) = 2n is not an onto function when the domain and co-domain are a set of all of the integers.

    I think that you may have missunderstood onto.
    For \forall n\in\mathbb{Z} the image 2n is even.

    The problem says "the domain and co-domain are a set of all of the integers". That includes odd integers.

    It maybe I am reading co-domain correctly. But the image of that function has no odd integers.
    Follow Math Help Forum on Facebook and Google+

Similar Math Help Forum Discussions

  1. Replies: 2
    Last Post: April 2nd 2012, 07:06 PM
  2. Replies: 2
    Last Post: April 24th 2011, 07:01 AM
  3. Replies: 1
    Last Post: October 25th 2010, 04:45 AM
  4. Replies: 0
    Last Post: September 12th 2010, 09:43 PM
  5. Replies: 1
    Last Post: June 4th 2010, 10:26 PM

Search Tags


/mathhelpforum @mathhelpforum