SOLUTION: I need to prove: if a divides b then a divides bx for any integer x

SOLUTION: I need to prove: if a divides b then a divides bx for any integer x

Algebra.Com

Question 425529: I need to prove:
if a divides b then a divides bx for any integer x
Answer by richard1234(7193) (Show Source): You can put this solution on YOUR website!
We need to use the fact that if a,b are nonzero integers, then is an integer if and only if a|b. Since is an integer we can multiply by x and say that is also an integer. This implies that a|bx.

RELATED QUESTIONS
Prove or Disprove: For all integers a and n, if (a divides n�) and a < n, then (a divides (answered by richard1234)

1. Whenever we encounter a new proposition, it is a good idea to explore the proposition (answered by richard1234)

Dealing with contradiction: Show that for any positive integer a and any prime p, if p... (answered by venugopalramana)

Prove: If a/b, then a/(bc) This is a proof that you would have to prove through steps.... (answered by richwmiller)

Prove or disprove: i divides n^3(in otherwords n^3/i is an integer), then i divides... (answered by richard1234)

I am having a lot of trouble with these proofs; I get so far and alskdjfl.... prove or (answered by khwang)

Write the contrapositive of the statement. Then use the contrapositive to determine... (answered by richard1234)

Prove that for any integer n, 5 divides... (answered by solver91311,ikleyn)

Define a relation R on the set of integers by mRn if and only if 3 divides m - n. Prove (answered by jim_thompson5910)