Results 1 to 2 of 2

Thread: Proof of equality in the Natural Numbers

  1. February 15th 2011, 12:24 AM #1
    jstarks44444
    jstarks44444 is offline
    Member
    Joined
    Nov 2010
    Posts
    86

    Proof of equality in the Natural Numbers

    Let m,n be elements of the Integers. If m <= n <= m then m = n.

    Seems obvious but I'm not sure of how to word this in a proof. Any help would be appreciated!
    Follow Math Help Forum on Facebook and Google+
  2. February 15th 2011, 02:39 AM #2
    tonio
    tonio is offline
    Banned
    Joined
    Oct 2009
    Posts
    4,261
    Quote Originally Posted by jstarks44444 View Post
    Let m,n be elements of the Integers. If m <= n <= m then m = n.

    Seems obvious but I'm not sure of how to word this in a proof. Any help would be appreciated!


    For example: suppose m<n\Longrightarrow \exists\,0<k\in\mathbb{N}\,\,s.t.\,\,m+k=n . Develop and get a contradiction.

    Tonio
    Follow Math Help Forum on Facebook and Google+
« Integer Inequality Proofs | Modular Arithmetic »

Similar Math Help Forum Discussions

  1. Multiplication of Natural Numbers proof
    Posted in the Number Theory Forum
    Replies: 1
    Last Post: February 17th 2011, 02:32 PM
  2. Proof of m > n in the Natural Numbers
    Posted in the Number Theory Forum
    Replies: 5
    Last Post: February 17th 2011, 09:32 AM
  3. Proof that 1 is in the Natural Numbers
    Posted in the Number Theory Forum
    Replies: 5
    Last Post: February 16th 2011, 11:12 AM
  4. Bound on Natural Numbers proof
    Posted in the Number Theory Forum
    Replies: 2
    Last Post: November 17th 2010, 08:16 AM
  5. Proof help: equality of natural numbers
    Posted in the Discrete Math Forum
    Replies: 1
    Last Post: February 16th 2009, 09:03 PM

Search Tags


/mathhelpforum @mathhelpforum