Proof on the divisibility of integers


by kolley
Tags: divisibility, integers, proof
kolley
kolley is offline
#1
Feb16-10, 12:33 PM
P: 17
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
Phys.Org News Partner Science news on Phys.org
SensaBubble: It's a bubble, but not as we know it (w/ video)
The hemihelix: Scientists discover a new shape using rubber bands (w/ video)
Microbes provide insights into evolution of human language
Mark44
Mark44 is online now
#2
Feb16-10, 12:57 PM
Mentor
P: 21,068
Substitute the expression for a or b into the other equation. What do you get?


Register to reply

Related Discussions
11 divisibility proof Calculus & Beyond Homework 2
Proof: divisibility of 5 Linear & Abstract Algebra 5
Proof: integers divisibility property Linear & Abstract Algebra 2
Divisibility proof Precalculus Mathematics Homework 5