Prove: Let a, b, and c be integers. If (a - b) | c, then a | c. Suppose a, b, c are integers with (a - b) | c. Then c = | (a b) for some integer k, so c = a, so a c.

Operations Research : Applications and Algorithms
4th Edition
ISBN:9780534380588
Author:Wayne L. Winston
Publisher:Wayne L. Winston
Chapter2: Basic Linear Algebra
Section: Chapter Questions
Problem 15RP
icon
Related questions
Question
Prove:
Let a, b, and c be integers. If
Suppose a, b, c are integers with (a
(a - b) | c, then a | c.
b) | c. Then c =
(a b) for some integer k, so c =
]a, ·
so a c.
Transcribed Image Text:Prove: Let a, b, and c be integers. If Suppose a, b, c are integers with (a (a - b) | c, then a | c. b) | c. Then c = (a b) for some integer k, so c = ]a, · so a c.
Expert Solution
steps

Step by step

Solved in 2 steps with 2 images

Blurred answer
Knowledge Booster
Problems on numbers
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.
Similar questions
  • SEE MORE QUESTIONS
Recommended textbooks for you
Operations Research : Applications and Algorithms
Operations Research : Applications and Algorithms
Computer Science
ISBN:
9780534380588
Author:
Wayne L. Winston
Publisher:
Brooks Cole