BuyFind

Discrete Mathematics With Applicat...

5th Edition
EPP + 1 other
Publisher: Cengage Learning,
ISBN: 9781337694193
BuyFind

Discrete Mathematics With Applicat...

5th Edition
EPP + 1 other
Publisher: Cengage Learning,
ISBN: 9781337694193

Solutions

Chapter
Section
Chapter 8.3, Problem 26ES
Textbook Problem

In 19-31,(1) prove that the relation is an equivalence relation, and (2) describe the distinct equivalence dasses of each relation.

D is the relation defined on Z as follows: For every m , n Z

m D n 3 | ( m 2 n 2 ) .

Expert Solution

Want to see this answer and more?

Experts are waiting 24/7 to provide step-by-step solutions in as fast as 30 minutes!*

See Solution

*Response times vary by subject and question complexity. Median response time is 34 minutes and may be longer for new subjects.

Chapter 8 Solutions

Discrete Mathematics With Applications
Show all chapter solutions
Ch. 8.1 - Let X={a,b,c}. Define a relation J on P(X) as...Ch. 8.1 - Define a relation R on Z as follows: For all...Ch. 8.1 - Let A be the set of all string of a’s and b’s of...Ch. 8.1 - Let A be the set of all strings of 0’s, 1’s, and...Ch. 8.1 - Let A={3,4,5} and B={4,5,6} and let R be the “less...Ch. 8.1 - Let A={3,4,5} and B={4,5,6} and let S be the...Ch. 8.1 - Suppose a function F:XY is one-to-one but not...Ch. 8.1 - Draw the directed graphs of the relations defined...Ch. 8.1 - Draw the directed graphs of the relations defined...Ch. 8.1 - Draw the directed graphs of the relations defined...Ch. 8.1 - Draw the directed graphs of the relations defined...Ch. 8.1 - Draw the directed graphs of the relations defined...Ch. 8.1 - Draw the directed graphs of the relations defined...Ch. 8.1 - Exercises 19-20 refer to unions and intersections...Ch. 8.1 - Exercises 19—20 refer to unions and intersections...Ch. 8.1 - Define relation R and S on R as follows:...Ch. 8.1 - Define relations R and S on R as follows:...Ch. 8.1 - Define relations R and S on R as follows:...Ch. 8.1 - In Example 8.17 consider the query SELECT...Ch. 8.2 - For a relation R on a set A to be reflexive means...Ch. 8.2 - For a relation R on a set A to be symmetric means...Ch. 8.2 - For a relation R on a set A to be transitive means...Ch. 8.2 - To show that a relation R on an infinite set A is...Ch. 8.2 - To show that a relation R on an infinite set A is...Ch. 8.2 - To show that a relation R on an infinite set A is...Ch. 8.2 - To show that a relation R on a set A is not...Ch. 8.2 - To show that a relation R on a set not symmentric,...Ch. 8.2 - To show that a relation R on a set A is not...Ch. 8.2 - Given a relation R on a set A, the transitive...Ch. 8.2 - In 1-8, a number of relations are defined on the...Ch. 8.2 - In 1-8, a number of relations are defined on the...Ch. 8.2 - In 1-8, a number of relations are defined on the...Ch. 8.2 - In 1-8, a number of relations are defined on the...Ch. 8.2 - In 1-8, a number of relations are defined on the...Ch. 8.2 - In 1-8, a number of relations are defined on the...Ch. 8.2 - In 1-8, a number of relations are defined on the...Ch. 8.2 - In 1-8, a number of relations are defined on the...Ch. 8.2 - In 9-33, determine whether the given relation is...Ch. 8.2 - In 9—33, determine whether the given relation is...Ch. 8.2 - In 9—33, determine whether the given relation is...Ch. 8.2 - In 9-33, determine whether the given relation is...Ch. 8.2 - In 9-33, determine whether the given relation is...Ch. 8.2 - In 9-33, determine whether the given relation is...Ch. 8.2 - In 9-33, determine whether the given relation is...Ch. 8.2 - In 9-33, determine whether the given relation is...Ch. 8.2 - In 9-33, determine whether the given relation is...Ch. 8.2 - In 9-33, determine whether the given relation is...Ch. 8.2 - In 9-33, determine whether the given relation is...Ch. 8.2 - In 9-33, determine whether the given relation is...Ch. 8.2 - In 9-33, determine whether the given relation is...Ch. 8.2 - In 9-33, determine whether the given relation is...Ch. 8.2 - In 9-33, determine whether the given relation is...Ch. 8.2 - In 9-33, determine whether the given relation is...Ch. 8.2 - In 9-33, determine whether the given is reflexive...Ch. 8.2 - In 9-33, determine whether the given relation is...Ch. 8.2 - In 9-33, determine whether the given relation is...Ch. 8.2 - In 9-33, determine whether the given relation is...Ch. 8.2 - In 9-33, determine whether the given relation is...Ch. 8.2 - In 9-33, determine whether the given relation is...Ch. 8.2 - In 9—33, determine whether the given relation is...Ch. 8.2 - In 9-33, determine whether the given relation is...Ch. 8.2 - In 9-33, determine whether the given relation is...Ch. 8.2 - In 34-36, assume that R is a relation on a et A....Ch. 8.2 - In 34-36, assume that R is a relation on a et A....Ch. 8.2 - In 34-36, assume that R is a relation on a et A....Ch. 8.2 - In 37-42, assume that R and S are relations on set...Ch. 8.2 - In 37-42, assume that R and S are relations on a...Ch. 8.2 - In 37-42, assume that R and S are relations on set...Ch. 8.2 - In 37-42, assume that R and S are relations on set...Ch. 8.2 - In 37-42, assume that R and S are relations on a...Ch. 8.2 - In 37-42, assume that R and S are relations on a...Ch. 8.2 - In 43-50, the following definitions are used: A...Ch. 8.2 - In 43-50, the following definitions are used: A...Ch. 8.2 - In 43-50, the following definitions are used: A...Ch. 8.2 - In 43-50, the following definitions are used: A...Ch. 8.2 - In 43-50, the following definitions are used: A...Ch. 8.2 - In 43-50, the following definitions are used: A...Ch. 8.2 - In 43-50, the following definitions are used: A...Ch. 8.2 - In 43-50, the following definitions are used: A...Ch. 8.2 - In 51—53, R, S, and T are relations defined on...Ch. 8.2 - In 51—53, R, S, and T are relations defined on...Ch. 8.2 - In 51-53, R,S, and T are relations defined...Ch. 8.2 - Write a computer algorithm to test whether a...Ch. 8.2 - Write a computer algorithm to test whether a...Ch. 8.2 - Write a computer algorithm to test whether a...Ch. 8.3 - For a relation on a set to be an equivalence...Ch. 8.3 - The notation m=n(modd) is...Ch. 8.3 - Given an equivalence relation R on a set A and...Ch. 8.3 - If A is a set, R is an equivalence relation A, and...Ch. 8.3 - If A is a set and R is an equivalence relation on...Ch. 8.3 - Let A=Z(Z{0}) , and define a relation R on A by...Ch. 8.3 - Suppose that S={a,b,c,d,e} and R is a relation on...Ch. 8.3 - Each of the following partitions of {0,1,2,3,4}...Ch. 8.3 - In each of 3-6, the relation R is an equivalence...Ch. 8.3 - In each of 3—6, the relation R is an equivalence...Ch. 8.3 - In each of 3-6, the relation R is an equivalence...Ch. 8.3 - In each of 3-6, the relation R is an equivalence...Ch. 8.3 - In each of 7-14, the relation R is an equivalence...Ch. 8.3 - In each of 7-14, the relation R is an equivalence...Ch. 8.3 - In each of 7-14, the relation R is an equivalence...Ch. 8.3 - In each of 7-14, relation R is an equivalence...Ch. 8.3 - In each of 7-14, relation R is an equivalence...Ch. 8.3 - In each of 7-14, relation R is an equivalence...Ch. 8.3 - In each of 7-14, the relation R is an equivalence...Ch. 8.3 - In each of 7—14, the relation R is an equivalence...Ch. 8.3 - Determine which of the following congruence...Ch. 8.3 - Let R be the relation of congruence modulo 3....Ch. 8.3 - Prove that for all integers m and n,m=n (mod 3)...Ch. 8.3 - Give an example of two sets that are distinct but...Ch. 8.3 - In 19-31, (1) prove that the relation is an...Ch. 8.3 - In 19—31, (1) prove that the relation is an...Ch. 8.3 - In 19—31, (1) prove that the relation is an...Ch. 8.3 - In 19-31, (1) prove that the relation is an...Ch. 8.3 - In 19-31, (1) prove that the relation is an...Ch. 8.3 - In 19-31. (1) prove that the relation is an...Ch. 8.3 - In 19-31,(1) prove that the relation is an...Ch. 8.3 - In 19-31,(1) prove that the relation is an...Ch. 8.3 - In 19-31,(1) prove that the relation is an...Ch. 8.3 - In 19-31,(1) prove that the relation is an...Ch. 8.3 - In 19-31, (1) prove that the relation is an...Ch. 8.3 - In 19-31, (1) prove that the relation is an...Ch. 8.3 - In 19—31, (1) prove that the relation is an...Ch. 8.3 - Let A be the set of all straight lines in the...Ch. 8.3 - Let A be the set of points in the rectangle...Ch. 8.3 - The documentation for the computer language Java...Ch. 8.3 - Find an additional representative circuit for the...Ch. 8.3 - Let R be an equivalence relation on a set A. Prove...Ch. 8.3 - Let R be an equivalence relation on a set A. Prove...Ch. 8.3 - Let R be an equivalence relation on a set A. Prove...Ch. 8.3 - Let R be an equivalence relation on a set A. Prove...Ch. 8.3 - Let R be an equivalence relation on a set A. Prove...Ch. 8.3 - Let R be an equivalence relation on s set A. Prove...Ch. 8.3 - Let R be the relation defined in Example 8.3.12....Ch. 8.3 - In Example 8.3.12, define operations of addition...Ch. 8.3 - Let A=Z+Z+ . Define a relation R on A as follows:...Ch. 8.3 - The following argument claims to prove that the...Ch. 8.3 - Let R be a relation on a set A and suppose R is...Ch. 8.3 - Refer to the quote at the beginning of this...Ch. 8.4 - When letters of the alphabet are encrypted using...Ch. 8.4 - If a,b, and n are integers with n1 , all of the...Ch. 8.4 - If a, b. c, d, m, and n arc integers with n1 and...Ch. 8.4 - If a, n, and k are positive integers with n1 , an...Ch. 8.4 - To express a greatest common divisor of two...Ch. 8.4 - To find an inverse for a positive integer a modulo...Ch. 8.4 - TO encrypt a message M using RSA cryptography with...Ch. 8.4 - Euclid’s lemma says that for all integers a, b,...Ch. 8.4 - Fermat’s little theorem says that if p is any...Ch. 8.4 - The crux of the proof that the RSA cipher words is...Ch. 8.4 - Use the Caesar cipher to encrypt the message WHERE...Ch. 8.4 - Use the Caesar cipher to encrypt the message AN...Ch. 8.4 - Let a=25,b=19, and n=3. Verify that 3(2519) ....Ch. 8.4 - Let a=68, b=33, and n=7. Verify that 7|(68-33)....Ch. 8.4 - Prove the transitivity of modular congruence. That...Ch. 8.4 - Prove that the distinct equivalence classes of the...Ch. 8.4 - Verify the following statements. 128=2(mod7) and...Ch. 8.4 - Verify the following statements. 45=3 (mod 6) and...Ch. 8.4 - In 9-11, prove each of the given statements,...Ch. 8.4 - In 9-11, prove each of the given statements,...Ch. 8.4 - In 9-11, prove each of the given statements,...Ch. 8.4 - Prove that for every integer n0,10n=1(mod9) . Use...Ch. 8.4 - a. Prove that for every integer n1 ,...Ch. 8.4 - Use the technique of Example 8.4.4 to find...Ch. 8.4 - Use the result of exercise 14 an d the technique...Ch. 8.4 - In 16-18, use the techniques of Example 8.4.4 and...Ch. 8.4 - In 16-18, use the techniques of Example 8.4.4 and...Ch. 8.4 - In 16-18, use the techniques of Example 8.4.4 and...Ch. 8.4 - In 19-24, use the RSA cipher from Examples 8.4.9...Ch. 8.4 - In 19-24, use the RSA cipher from Examples 8.4.9...Ch. 8.4 - In 19-24, use the RSA cipher from Examples 8.4.9...Ch. 8.4 - In 19-24, use the RSA cipher from Examples 8.4.9...Ch. 8.4 - In 19-24, use the RSA cipher from Examples 8.4.9...Ch. 8.4 - In 19-24, use the RSA cipher from Examples 8.4.9...Ch. 8.4 - Use Theorem 5.2.2 to prove that if a and n are...Ch. 8.4 - In 26 and 27, use the extended Euclidean algorithm...Ch. 8.4 - In 26 and 27, use the extended Euclidean algorithm...Ch. 8.4 - In 28 and 29, for the given values of A and B,...Ch. 8.4 - In 28 and 29, for the given values of A and B,...Ch. 8.4 - Finish the proof of Theorem 8.4.5 by proving that...Ch. 8.4 - Find an inverse for 210 modulo 13. Find appositive...Ch. 8.4 - Find an inverse for 41 modulo 660. Find the least...Ch. 8.4 - Use Theorem 8.4.5to prove that for all integers a,...Ch. 8.4 - Give a counterexample to show that the statement...Ch. 8.4 - Corollary 8.4.7 guarantees the existence of an...Ch. 8.4 - In 36,37,39 and 40, use the RSA cipher with public...Ch. 8.4 - In 36,37,39 and 40, use the RSA cipher with public...Ch. 8.4 - Find the least positive inverse for 43 modulo 660.Ch. 8.4 - In 36,37,39 and 40, use the RSA cipher with public...Ch. 8.4 - In 36,37,39 and 40, use the RSA cipher with public...Ch. 8.4 - a. Use mathematical induction and Euclid’s lemma...Ch. 8.4 - According to Fermat’s little theorem, if p is a...Ch. 8.4 - Fermat’s little theorem can be used to show that a...Ch. 8.5 - For a relation R on a set A on a set to be...Ch. 8.5 - To show that a relation R on an infinite set A is...Ch. 8.5 - To show that a relation R on a set A is not...Ch. 8.5 - To construct a Hasse diagram for a partial order...Ch. 8.5 - If A is a set that is partially odereed with...Ch. 8.5 - A relation on a set A is a total order if, and...Ch. 8.5 - If A a set that is partially ordered with respect...Ch. 8.5 - Let A be a set that is partially order with...Ch. 8.5 - Given a set A that is partially ordered with...Ch. 8.5 - PERT and CPM are used to produces efficient_____Ch. 8.5 - Each of the following is a relation on {0,1,2,3}...Ch. 8.5 - Let P be the set of all people in the world and...Ch. 8.5 - Let S be the set of all strings of a’s and b’s....Ch. 8.5 - Let R be the “less than” relation on R, the set of...Ch. 8.5 - Let R be the set of all real numbers and define a...Ch. 8.5 - Let P be the set of all people who have ever lived...Ch. 8.5 - Define a relation R on Z, the set of all integers...Ch. 8.5 - Define a relation R on Z, the set of all integers...Ch. 8.5 - Define a relation R on R, the set of all real...Ch. 8.5 - Suppose R and S are antisymmetric relations on a...Ch. 8.5 - Let A={a,b}, and supposeAhas the partial order...Ch. 8.5 - Prove Theorem 8.5.1Ch. 8.5 - Let A={a,b} . Describe all partial order relations...Ch. 8.5 - Let A={a,b,c}. Describe all partial order...Ch. 8.5 - Suppose a relation R on a set A is reflexive,...Ch. 8.5 - Consider the “divides” relation on each of the...Ch. 8.5 - Consider the “sbset” relation on P(S) for each of...Ch. 8.5 - Let S={0,1} and consider the partial order...Ch. 8.5 - Let S={0,1} and consider the partial order...Ch. 8.5 - Let S={0,1} and consider the partial order...Ch. 8.5 - Consider the “divides” relation defined on the set...Ch. 8.5 - In 22-29, find all greatest, least, maximal, and...Ch. 8.5 - In 22-29, find all greatest, least, maximal, and...Ch. 8.5 - In 22-29, find all greatest, least, maximal, and...Ch. 8.5 - In 22-29, find all greatest, least, maximal, and...Ch. 8.5 - In 22—29, find all greatest, least, maximal, and...Ch. 8.5 - In 22—29, find all greatest, least, maximal, and...Ch. 8.5 - In 22—29, find all greatest, least, maximal, and...Ch. 8.5 - In 22—29, find all greatest, least, maximal, and...Ch. 8.5 - Each of the following sets is partially ordered...Ch. 8.5 - Let A={a,b,c,d} , and let R be the relation...Ch. 8.5 - Let A={a,b,c,d} , and let R be the relation...Ch. 8.5 - Consider the set A={12,24,48,3,9} ordered by the...Ch. 8.5 - Suppose that R is a partial order relation on a...Ch. 8.5 - The set P({w,x,y,z}) is partially ordered with...Ch. 8.5 - The set A={2,4,3,6,12,18,24} is partially ordered...Ch. 8.5 - Find a chain of length 2 for the relation defined...Ch. 8.5 - Prove that a partially ordered set is totally...Ch. 8.5 - Suppose that A is a totally ordered set. Use...Ch. 8.5 - Prove that a nonempty, finite, partially ordered...Ch. 8.5 - Prove that a finite, partially ordered set has At...Ch. 8.5 - Draw a Hasse diagram for a partially ordered set...Ch. 8.5 - Draw a Hasse diagram for a partially ordered set...Ch. 8.5 - Use the algorithm given in the text find a...Ch. 8.5 - Use the algorithm given in the text to find a...Ch. 8.5 - Use the algorithm given in the text to find a...Ch. 8.5 - Use the algorithm given in the text to find a...Ch. 8.5 - Use the algorithm given in the text to find a...Ch. 8.5 - Refer to the prerequisite structure show in Figure...Ch. 8.5 - A set S of jobs can be ordered by writing x_y to...Ch. 8.5 - Suppose the tasks described in Example 8.5.12...

Additional Math Textbook Solutions

Find more solutions based on key concepts
Show solutions
In Exercises 5-8, find the values of the variables. [3xy3][12]=[74]

Finite Mathematics for the Managerial, Life, and Social Sciences

Multiply: (5)(9)(+2)

Elementary Technical Mathematics

Divide the following fractions and reduce to lowest terms. 28.

Contemporary Mathematics for Business & Consumers

In Exercises 4449, find an equation of the line L that passes through the point (2, 4) and satisfies the condit...

Applied Calculus for the Managerial, Life, and Social Sciences: A Brief Approach

True or False: If f(x) 0 for x c and f(x) 0 for x c, then c is a point of inflection.

Study Guide for Stewart's Single Variable Calculus: Early Transcendentals, 8th

Reminder Round all answers to two decimal places unless otherwise indicated. Driving Under the Influence: The W...

Functions and Change: A Modeling Approach to College Algebra (MindTap Course List)

Without actually solving the differential equation (1 2 sin x)y + xy = 0, find a lower bound for the radius of...

A First Course in Differential Equations with Modeling Applications (MindTap Course List)

Assembly Methods. Three different assembly methods have been proposed for a new product. A completely randomize...

Modern Business Statistics with Microsoft Office Excel (with XLSTAT Education Edition Printed Access Card) (MindTap Course List)