Advanced Math
posted by Stephanie
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.

drwls
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".
Respond to this Question
Similar Questions

maths plse help me..
Let a,b,c be positive integers such that a divides b^2 , b divides c^2 and c divides a^2 . Prove that abc divides (a + b + c)7 . 
urgent plsee
Let a,b,c be positive integers such that a divides b^2 , b divides c^2 and c divides a^2 . Prove that abc divides (a + b + c)7 . 
maths plse help me..
Let a,b,c be positive integers such that a divides b^2 , b divides c^2 and c divides a^2 . Prove that abc divides (a + b + c)^7 . 
maths
Let a,b,c be positive integers such that a divides b^2 , b divides c^2 and c divides a^2 . Prove that abc divides (a + b + c)^7 . 
maths
Let a,b,c be positive integers such that a divides b^2 , b divides c^2 and c divides a^2 . Prove that abc divides (a + b + c)^7 . 
Math
Find the sum of all primes q<1000 such that for some prime p<q , both q divides p^3 1 and p divides q^3 1 
mathno.theory
Find the sum of all primes q<1000 such that for some prime p<q , both q divides p^31 and p divides q^31 
math analysis
Disprove: For every integer a, if 8 divides a, then 6 divides a. im still stuck. i wrote: Disproof. Suppose 8a. by definition of divisibility, we know 8a means there is an integer b with a=8b. There is not value of y. 
DISCRETE MATHS
We need to show that 4 divides 1n2 whenever n is an odd positive integer. If n is an odd positive integer then by definition n = 2k+1 for some non negative integer, k. Now 1  n2 = 1  (2k+1)2 = 4k24k = 4 (k24k). k is a nonnegative … 
math
Suppose n, a are integers. If n divides a, then n divides a^2.