Dismiss Notice
Join Physics Forums Today!
The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

Proof on the divisibility of integers

  1. Feb 16, 2010 #1
    1. The problem statement, all variables and given/known data

    Let a,b be integers where a doesn't =0. Prove that if a divides b, and b divides a, then a=b or a=-b


    3. The attempt at a solution

    I started out with b=aj and a=bk, where j,k are integers. Don't quite know how to proceed
     
  2. jcsd
  3. Feb 16, 2010 #2

    Mark44

    User Avatar
    Insights Author

    Staff: Mentor

    Substitute the expression for a or b into the other equation. What do you get?
     
Know someone interested in this topic? Share this thread via Reddit, Google+, Twitter, or Facebook

Have something to add?
Similar Discussions: Proof on the divisibility of integers
  1. Proof - Divisibility (Replies: 24)

  2. Divisibility Proofs (Replies: 2)

  3. Divisibility Proof (Replies: 10)

  4. Proof of divisibility (Replies: 3)

Loading...