Discrete Mathematics with Applications 4th Edition

Published by Cengage Learning
ISBN 10: 0-49539-132-8
ISBN 13: 978-0-49539-132-6

Chapter 8 - Relations - Exercise Set 8.4 - Page 496: 3

Answer

See below

Work Step by Step

a. To verify 3 | (25 - 19 ), we need to check whether the difference between 25 and 19 is divisible by 3. 25 − 19 = 6 and 3 | 6 since 6 = 3 * 2. Therefore, 3 is indeed a divisor of ( 25−19 ) So, 3 | ( 25 − 19 ) is true. b. 25 ≡ 19 ( mod 3 ) We have : 25 = 3 * 8 + 1 => gcd(25, 3) = 1 19 = 3 * 6 + 1 => gcd(19, 3) = 1 So, both 25 and 19 leave a remainder of 1 when divided by 3, therefore, we can say that 25 and 19 are congruent modulo 3: 25 ≡ 19 (mod 3) c. 25 = 19 + 3k? We have : 25 – 19 = 6 = 3 * 2 25 = 19 + 3 * 2 So value of k = 2 has the property that 25 = 19 + 3k.
Update this answer!

You can help us out by revising, improving and updating this answer.

Update this answer

After you claim an answer you’ll have 24 hours to send in a draft. An editor will review the submission and either publish your submission or provide feedback.