Def: An interger "m" divides an integer "n" if there is an integer "q" such that n=mq.

?Suppose a, b, and c are integers such that a divides b and b divides c. Prove that a divides c.

1 answer

If b is an integer factor of b, and b is an integer factor of x, then

b = ma and c = nb, where m and n are both integers.

It follows that c = m n a. Since m and n are both integers, so is mn. Therefore a is an integer factor of c, or, in other words, "a divides c".
Similar Questions
  1. The square of an integer is 30 more than the integer. Find the integer.Is there some sort of equation to use to solve this? And
    1. answers icon 1 answer
  2. Disprove: For every integer a, if 8 divides a, then 6 divides a.im still stuck. i wrote: Disproof. Suppose 8|a. by definition of
    1. answers icon 2 answers
  3. We need to show that 4 divides 1-n2 whenever n is an odd positive integer.If n is an odd positive integer then by definition n =
    1. answers icon 0 answers
    1. answers icon 0 answers
more similar questions