Ask a New Question

Asked by John

Prove that for all integers a, b, c , if a | c and b | c , then ab | c²
4 years ago

Answers

Answered by oobleck
a = mc
b = nc
ab = mc*nc = mn * c^2
so ab|c^2
4 years ago
There are no AI answers yet. The ability to request AI answers is coming soon!

Submit Your Answer


We prioritize human answers over AI answers.

If you are human, and you can answer this question, please submit your answer.

Related Questions

For all integers n ≥ 1, prove the following statement using mathematical induction. 1+2^1 +2^2 +...+... Prove that for all integers n > or = 1 and all real numbers x subscript 1, x subscript 2,...., x sub... Prove that for all integers a, b, n: if n = a + b, then a < n/2 or b < n/2 . I WANT TO TRY AND USE... If two integers a and b have a product of 34. What is the least sum of a and b How many different integers, n, are there such that the difference between 2 x n squared and 7 is le... Use integers from-3 to 3 to graph the equation. y=1/3|x|-2. Please help me how it would be on a gr... (1) For all integers y, there is an integer x so that x^3 + x = y. (2)For all integers x, x^3 + x... If a,b,c are integers and b²=4(ac+5d²), d €N then roots of the eqn ax²+bx+c=0 are for all integers a, b, c, If a/b - 2c and a/2b + 3c then a/b and a/c Is a question from discrete... For all integers a, b, c, and d, which of the following is a factored from of ab + ac + db + dc...
Submit Your Answer

Question

Prove that for all integers a, b, c , if a | c and b | c , then ab | c²

Ask a New Question
Archives Contact Us Privacy Policy Terms of Use