Proof on the divisibility of integers

Click For Summary
SUMMARY

The discussion centers on proving that for integers a and b, if a divides b and b divides a, then it must follow that a equals b or a equals negative b. The initial approach involves expressing b as aj and a as bk, where j and k are integers. The next logical step is to substitute one expression into the other to derive a conclusive proof.

PREREQUISITES
  • Understanding of integer divisibility
  • Familiarity with algebraic manipulation
  • Knowledge of mathematical proofs
  • Basic concepts of number theory
NEXT STEPS
  • Study integer divisibility rules in number theory
  • Learn about algebraic substitution techniques
  • Explore formal proof techniques in mathematics
  • Review examples of divisibility proofs
USEFUL FOR

Students studying number theory, mathematics enthusiasts, and anyone interested in formal proof techniques related to integer properties.

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?
 

Similar threads

  • · Replies 5 ·
Replies
5
Views
2K
  • · Replies 3 ·
Replies
3
Views
2K
  • · Replies 2 ·
Replies
2
Views
1K
Replies
1
Views
3K
Replies
27
Views
4K
Replies
9
Views
4K
  • · Replies 2 ·
Replies
2
Views
2K
  • · Replies 7 ·
Replies
7
Views
2K
Replies
17
Views
3K
Replies
6
Views
2K