Explanation Given information: m and n, are integers. Proof: Let m and n be integers. Necessary condition: Let us assume m ≡ n (mod 3). By the definition of m being congruent to n modulo 3: 3 | ( m − n ) By the definition of divides, there exists an integer k such that: m − n = 3 k Add n to each side: m = n + 3 k Take modulo 3 of each side of the previous equation: m mod 3 = ( n + 3 k ) mod 3 We can simplify the right side, since ( 3 k ) To determine (b) To prove: For all integers m and n and any positive integer d, m = n (mod d ) if, and only if, m mod d = n mod d.

5th Edition

ISBN: 9780357540244

Author: EPP

Publisher: CENGAGE L

See similar textbooks

Videos

Question

Chapter 8.3, Problem 17ES

To determine

(a)

To prove:

For all integers m and n, m = n ( mod 3 ) if, and only if, m mod 3 = n mod 3.

To determine

(b)

To prove:

For all integers m and n and any positive integer d, m = n (mod d ) if, and only if, m mod d = n mod d.

Expert Solution & Answer

Want to see the full answer?

Check out a sample textbook solution

See solution

Chapter 8.3, Problem 16ES

Chapter 8.3, Problem 18ES

Students have asked these similar questions

A smallish urn contains 25 small plastic bunnies – 7 of which are pink and 18 of which are white. 10 bunnies are drawn from the urn at random with replacement, and X is the number of pink bunnies that are drawn. (a) P(X = 5) ≈ (b) P(X<6) ≈ The Whoville small urn contains 100 marbles – 60 blue and 40 orange. The Grinch sneaks in one night and grabs a simple random sample (without replacement) of 15 marbles. (a) The probability that the Grinch gets exactly 6 blue marbles is [ Select ] ["≈ 0.054", "≈ 0.043", "≈ 0.061"] . (b) The probability that the Grinch gets at least 7 blue marbles is [ Select ] ["≈ 0.922", "≈ 0.905", "≈ 0.893"] . (c) The probability that the Grinch gets between 8 and 12 blue marbles (inclusive) is [ Select ] ["≈ 0.801", "≈ 0.760", "≈ 0.786"] . The Whoville small urn contains 100 marbles – 60 blue and 40 orange. The Grinch sneaks in one night and grabs a simple random sample (without replacement) of 15 marbles. (a)…

Using Karnaugh maps and Gray coding, reduce the following circuit represented as a table and write the final circuit in simplest form (first in terms of number of gates then in terms of fan-in of those gates).

Consider the alphabet {a, b, c}.• Design a regular expression that recognizes all strings over {a, b, c} that have at least three nonconsec-utive c characters (two characters are non-consecutive if there is at least one character between them)and at least one a character.• Explain how your regular expression recognizes the string cbbcccac by clearly identifying which partsof the string match to the components of your regular expression

Chapter 8 Solutions

WEBASSIGN F/EPPS DISCRETE MATHEMATICS

Ch. 8.1 - If R is a relation from A to B, xA , and yB , the...Ch. 8.1 - Prob. 2TY Ch. 8.1 - Prob. 3TY Ch. 8.1 - Prob. 4TY Ch. 8.1 - If R is a relation on a set A, the directed graph...Ch. 8.1 - As in Example 8.1.2, the congruence modulo 2...Ch. 8.1 - Prove that for all integers m and n,m-n is even...Ch. 8.1 - The congruence modulo 3 relation, T, is defined...Ch. 8.1 - Define a relation P on Z as follows: For every...Ch. 8.1 - Prob. 5ES

Knowledge Booster

Learn more about

Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, subject and related others by exploring similar questions and additional content below.

(a) To prove: For all integers m and n, m = n ( mod 3 ) if, and only if, m mod 3 = n mod 3.

Solution Summary: The author explains that if m and n are integers, they can be proved.