Divisibility definition/proof

Algebra
Tutor: None Selected Time limit: 1 Day

Let a, b (= N (so, a not= 0) and x, r (= Z. Using only the definition of divisibility along with the

Axioms of Integers

If a | b and a | (bx + r), then a | r. 

Mar 19th, 2015

According to the definition,  a | b means that b = a*p for some integer p. Similarly, a | (bx + r) implies that b*x + r = a*q for some integer q. 

Next, r = (b*x + r) - b*x = a*q - a*p*x - use associative and commutative axioms of addition and multiplication for integers.

Then r = a(q - p*x) - use distributive axiom.

Finally, by the definition of divisibility, a | r. 

Mar 19th, 2015

Studypool's Notebank makes it easy to buy and sell old notes, study guides, reviews, etc.
Click to visit
The Notebank
...
Mar 19th, 2015
...
Mar 19th, 2015
May 30th, 2017
check_circle
Mark as Final Answer
check_circle
Unmark as Final Answer
check_circle
Final Answer

Secure Information

Content will be erased after question is completed.

check_circle
Final Answer