Discrete Mathematics and its Applications, Fifth Edition Student's Solutions Guide for use with Discrete Mathematics and Its Applications, Fifth Edition. Discrete Mathematics and its Applications, Fifth Edition McGraw-Hill: Instructor's Resource Guide for Discrete Mathematics and Its Applications - 5th Edition. Access Discrete Mathematics and Its Applications 5th Edition solutions now. Our solutions are written by Chegg experts so you can be assured of the highest.
|Language:||English, Spanish, Portuguese|
|Genre:||Children & Youth|
|Distribution:||Free* [*Register to download]|
Solution Manual of Discrete Mathematics and its Application by Kenneth H .. 4. a) We construct the relevant truth table and note that the ﬁfth and seventh. kenneth rosen discrete mathematics pdf - demmimarlik - kenneth rosen discrete textbook. discrete mathematics and its applications, 5th edition, kenneth h. discrete mathematics and its applications 5th edition solutions applications-7th ruthenpress.info DRAFT Chapter 1.
Can I get help with questions outside of textbook solution manuals? You bet! Just post a question you need help with, and one of our experts will provide a custom solution.
You can also find solutions immediately by searching the millions of fully answered study questions in our archive. How do I view solution manuals on my smartphone? You can download our homework help app on iOS or Android to access solutions manuals on your mobile device. Chegg Solution Manuals are written by vetted Chegg Math experts, and rated by students - so you know you're getting high quality answers.
Solutions Manuals are available for thousands of the most popular college and high school textbooks in subjects such as Math, Science Physics , Chemistry , Biology , Engineering Mechanical , Electrical , Civil , Business and more. It's easier to figure out tough problems faster using Chegg Study. Unlike static PDF Discrete Mathematics and Its Applications solution manuals or printed answer keys, our experts show you how to solve each problem step-by-step.
No need to wait for office hours or assignments to be graded to find out where you took a wrong turn. You can check your reasoning as you tackle a problem using our interactive solutions viewer. Plus, we regularly update and improve textbook solutions based on student ratings and feedback, so you can be sure you're getting the latest information available. It is true from the given information. This is false, since there are some mathematics majors. This is true, since there is a sophomore majoring in computer science.
This is false, since there is a freshman mathematics major. This is false. It cannot be that m is mathematics, since there is no senior mathematics major, and it cannot be that m is computer science, since there is no freshman computer science major.
Nor, of course, can m be any other major. The best explanation is to assert that a certain universal conditional statement is not true. We need to use the transformations shown in Table 2 of Section 1. The logical expression is asserting that the domain consists of at most two members. It is saying that whenever you have two unequal objects, any object has to be one of those two.
Note that this is vacuously true for domains with one element.
Therefore any domain having one or two members will make it true such as the female members of the United States Supreme Court in , and any domain with more than two members will make it false such as all members of the United States Supreme Court in In each case we need to specify some predicates and identify the domain of discourse. In English, everybody in this class has either chatted with no one else or has chatted with two or more others. In English, some student in this class has sent e-mail to exactly two other students in this class.
In English, for every student in this class, there is some exercise that he or she has not solved. Word order in English sometimes makes for a little ambiguity. In English, some student has solved at least one exercise in every section of this book. This x provides a counterexample. The domain here is all real numbers. This statement says that there is a number that is less than or equal to all squares. We need to show that each of these propositions implies the other.
By our hypothesis, one of two things must be true. Either P is universally true, or Q is universally true. Next we need to prove the converse. Otherwise, P x0 must be false for some x0 in the domain of discourse.
Since P x0 is false, it must be the case that Q y is true for each y. Logic and Proofs c First we rewrite this using Table 7 in Section 1. This is modus tollens. Modus tollens is valid. This is, according to Table 1, disjunctive syllogism. See Table 1 for the other parts of this exercise as well.
We want to conclude r. We set up the proof in two columns, with reasons, as in Example 6. Note that it is valid to replace subexpressions by other expressions logically equivalent to them. Step Reason 1. Alternatively, we could apply modus tollens.
Another application of modus tollens then tells us that I did not play hockey. We could say using existential generalization that, for example, there exists a non-six-legged creature that eats a six-legged creature, and that there exists a non-insect that eats an insect. Now modus tollens tells us that Homer is not a student. There are no conclusions to be drawn about Maggie. Universal instantiation and modus ponens therefore tell us that tofu does not taste good.
The third sentence says that if you eat x, then x tastes good. No conclusions can be drawn about cheeseburgers from these statements. Therefore by modus ponens we know that I see elephants running down the road. In each case we set up the proof in two columns, with reasons, as in Example 6. In what follows y represents an arbitrary person. After applying universal instantiation, it contains the fallacy of denying the hypothesis.
We know that some s exists that makes S s, Max true, but we cannot conclude that Max is one such s. We will give an argument establishing the conclusion. We want to show that all hummingbirds are small. Let Tweety be an arbitrary hummingbird. We must show that Tweety is small.
Therefore by universal modus ponens we can conclude that Tweety is richly colored. The third premise implies that if Tweety does not live on honey, then Tweety is not richly colored. Therefore by universal modus tollens we can now conclude that Tweety does live on honey.
Finally, the second premise implies that if Tweety is a large bird, then Tweety does not live on honey. Therefore again by universal modus tollens we can now conclude that Tweety is not a large bird, i. Notice that we invoke universal generalization as the last step.
Thus we want to show that if P a is true for a particu- lar a, then R a is also true. The right-hand side is equivalent to F. Let us use the following letters to stand for the relevant propositions: As we noted above, the answer is yes, this conclusion is valid. This conditional statement fails in the case in which s is true and e is false. If we take d to be true as well, then both of our assumptions are true.
Therefore this conclusion is not valid. This does not follow from our assumptions. If we take d to be false, e to be true, and s to be false, then this proposition is false but our assumptions are true.
We noted above that this validly follows from our assumptions. The only case in which this is false is when s is false and both e and d are true. Therefore, in all cases in which the assumptions hold, this statement holds as well, so it is a valid conclusion. We must show that whenever we have two even integers, their sum is even.
Suppose that a and b are two even integers. We must show that whenever we have an even integer, its negative is even. Suppose that a is an even integer. This is true. We give a proof by contradiction. By Exercise 26, the product is rational.
We give a proof by contraposition. If it is not true than m is even or n is even, then m and n are both odd. By Exercise 6, this tells us that mn is odd, and our proof is complete. Assume that n is odd. But this is obviously not true. Therefore our supposition was wrong, and the proof by contradiction is complete. Therefore the conditional statement is true.
This is an example of a trivial proof, since we merely showed that the conclusion was true. Then we drew at most one of each color. This accounts for only two socks. But we are drawing three socks.
Therefore our supposition that we did not get a pair of blue socks or a pair of black socks is incorrect, and our proof is complete. Since we have chosen 25 days, at least three of them must fall in the same month. Since n is even, it can be written as 2k for some integer k. This is 2 times an integer, so it is even, as desired. So suppose that n is not even, i. This is 1 more than 2 times an integer, so it is odd.
That completes the proof by contraposition. There are two things to prove. Now the only way that a product of two numbers can be zero is if one of them is zero. We write these in symbols: It is now clear that all three statements are equivalent. We give direct proofs that i implies ii , that ii implies iii , and that iii implies i.
These are therefore the only possible solutions, but we have no guarantee that they are solutions, since not all of our steps were reversible in particular, squaring both sides.
Therefore we must substitute these values back into the original equation to determine whether they do indeed satisfy it. But these each follow with one or more intermediate steps: We claim that 7 is such a number in fact, it is the smallest such number.
The only squares that can be used to contribute to the sum are 0 , 1 , and 4. Thus 7 cannot be written as the sum of three squares. By Exercise 39, at least one of the sums must be greater than or equal to Example 1 showed that v implies i , and Example 8 showed that i implies v.
The cubes that might go into the sum are 1 , 8 , 27 , 64 , , , , , and We must show that no two of these sum to a number on this list. Having exhausted the possibilities, we conclude that no cube less than is the sum of two cubes. There are three main cases, depending on which of the three numbers is smallest.
In the second case, b is smallest or tied for smallest. Since one of the three has to be smallest we have taken care of all the cases.
The number 1 has this property, since the only positive integer not exceeding 1 is 1 itself, and therefore the sum is 1.
This is a constructive proof. Therefore these two consecutive integers cannot both be perfect squares. This is a nonconstructive proof—we do not know which of them meets the requirement.
In fact, a computer algebra system will tell us that neither of them is a perfect square. Of these three numbers, at least two must have the same sign both positive or both negative , since there are only two signs. It is conceivable that some of them are zero, but we view zero as positive for the purposes of this problem.
The product of two with the same sign is nonnegative. In fact, a computer algebra system will tell us that all three are positive, so all three products are positive. We know from algebra that the following equations are equivalent: This shows, constructively, what the unique solution of the given equation is.