Results 1 to 3 of 3

Thread: Integer inequality proof

  1. #1
    Member
    Joined
    Oct 2008
    Posts
    124

    Integer inequality proof

    Prove that if m and n are integers, then either m<n or n<m, but not both.
    Follow Math Help Forum on Facebook and Google+

  2. #2
    Newbie Chief65's Avatar
    Joined
    Sep 2008
    From
    Denver
    Posts
    18
    Law of Trichotomy
    Follow Math Help Forum on Facebook and Google+

  3. #3
    Global Moderator

    Joined
    Nov 2005
    From
    New York City
    Posts
    10,616
    Thanks
    10
    Quote Originally Posted by noles2188 View Post
    Prove that if m and n are integers, then either m<n or n<m, but not both.
    For $\displaystyle x,y\in \mathbb{N}$ we define $\displaystyle x<y$ if and only if $\displaystyle x\in y$. What you are basically asking is to prove that $\displaystyle <$ is a linear ordering of $\displaystyle \mathbb{N}$. This should be proved by induction. Define the statement, "$\displaystyle x<n$ or $\displaystyle n<x$" for $\displaystyle n$. Assume it hold for $\displaystyle n$ and prove it holds for $\displaystyle n+1$.
    Follow Math Help Forum on Facebook and Google+

Similar Math Help Forum Discussions

  1. Integer Inequality Proofs
    Posted in the Number Theory Forum
    Replies: 1
    Last Post: Feb 15th 2011, 02:37 AM
  2. Integer Proof
    Posted in the Discrete Math Forum
    Replies: 1
    Last Post: Jul 2nd 2010, 01:53 AM
  3. Integer proof
    Posted in the Number Theory Forum
    Replies: 9
    Last Post: May 1st 2010, 02:00 PM
  4. Replies: 1
    Last Post: Feb 13th 2009, 02:32 AM
  5. smallest integer inequality
    Posted in the Algebra Forum
    Replies: 4
    Last Post: Jul 27th 2007, 12:05 PM

Search tags for this page

Click on a term to search for related topics.

Search Tags


/mathhelpforum @mathhelpforum