Proof on the divisibility of integers

AI Thread Summary
To prove that if integer a divides integer b and b divides a, then a must equal b or a must equal -b, start by expressing b as aj and a as bk, where j and k are integers. Substituting these expressions into each other leads to the equations a = ajk and b = bkj. Analyzing these relationships reveals that the only integer solutions occur when either a equals b or a equals -b. This conclusion is supported by the properties of divisibility and integer multiplication. The proof ultimately confirms the stated divisibility condition.
kolley
Messages
16
Reaction score
0

Homework Statement



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

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
 
Physics news on Phys.org
Substitute the expression for a or b into the other equation. What do you get?
 
I tried to combine those 2 formulas but it didn't work. I tried using another case where there are 2 red balls and 2 blue balls only so when combining the formula I got ##\frac{(4-1)!}{2!2!}=\frac{3}{2}## which does not make sense. Is there any formula to calculate cyclic permutation of identical objects or I have to do it by listing all the possibilities? Thanks
Since ##px^9+q## is the factor, then ##x^9=\frac{-q}{p}## will be one of the roots. Let ##f(x)=27x^{18}+bx^9+70##, then: $$27\left(\frac{-q}{p}\right)^2+b\left(\frac{-q}{p}\right)+70=0$$ $$b=27 \frac{q}{p}+70 \frac{p}{q}$$ $$b=\frac{27q^2+70p^2}{pq}$$ From this expression, it looks like there is no greatest value of ##b## because increasing the value of ##p## and ##q## will also increase the value of ##b##. How to find the greatest value of ##b##? Thanks
Back
Top