Mathematics
Divisibility definition/proof

### Question Description

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.

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.

repet22 (1096)
New York University
Review

Anonymous
I was on a very tight deadline but thanks to Studypool I was able to deliver my assignment on time.

Anonymous
The tutor was pretty knowledgeable, efficient and polite. Great service!

Anonymous
I did not know how to approach this question, Studypool helped me a lot.

Studypool
4.7
Trustpilot
4.5
Sitejabber
4.4

Brown University

1271 Tutors

California Institute of Technology

2131 Tutors

Carnegie Mellon University

982 Tutors

Columbia University

1256 Tutors

Dartmouth University

2113 Tutors

Emory University

2279 Tutors

Harvard University

599 Tutors

Massachusetts Institute of Technology

2319 Tutors

New York University

1645 Tutors

Notre Dam University

1911 Tutors

Oklahoma University

2122 Tutors

Pennsylvania State University

932 Tutors

Princeton University

1211 Tutors

Stanford University

983 Tutors

University of California

1282 Tutors

Oxford University

123 Tutors

Yale University

2325 Tutors