Solution Manual of Discrete Mathematics and its Application by Kenneth H Rosen . For parts (c) and (d) we have the following table (columns five and six). Discrete mathematics and its applications / Kenneth H. Rosen. — 7th ed. p. cm. .. Its Applications, published by Pearson, currently in its sixth edition, which has been translated .. In most examples, a question is first posed, then its solution. View Homework Help – Discrete Mathematics and Its Applications (6th edition) – from MATH at Universidade Federal de Goiás.

Author: Yozshugor JoJojinn
Country: Maldives
Language: English (Spanish)
Genre: Music
Published (Last): 28 May 2009
Pages: 172
PDF File Size: 9.15 Mb
ePub File Size: 10.14 Mb
ISBN: 734-9-77595-575-9
Downloads: 91849
Price: Free* [*Free Regsitration Required]
Uploader: Arajas


Because there is an odd number of tiles, the number placed horizontally and the number placed vertically cannot both be odd, so assume without loss of generality that an even number of tiles are placed horizontally. This has been slightly reworded so that the tenses make more sense.

Alternatively, there exists a student in the school who has visited North Dakota. This counterexample discrette the statement. We must show that Tweety is small. If the barber shaved himself, then he would be applicatioms the rule that he shaves only those people who do not shave themselves.

In each case we need to specify some propositional functions predicates and identify the domain of discourse. This time we have omitted the column explicitly showing the negation of q. To say that there are exactly two elements that make the statement true is to say that two elements exist that make the statement true, and that every element that makes the statement true is one of these two elements.


Discrete Mathematics with Applications () :: Homework Help and Answers :: Slader

Note that part b and part c are not the sorts of things one would normally say. Therefore Jones is the murderer. Note that we can make all the conclusion true by making a false, s true, and u editiln. Many answer are possible in each case. This is a constructive proof. First suppose that H is true.

Example 1 showed that v implies iand Example 8 showed that i implies v. This is a nonconstructive proof—we do not know which of them meets the requirement. Our domain of discourse for persons here consists of people in this class.

On the other hand, if P x is false for all xthen both sides are false. If so, then they are all telling the truth, but this is impossible, because as we just saw, some of the statements are contradictory.

A knight will declare himself to be a knight, telling the truth. This requires that both L and Q be true, by the two conditional statements that have B as their consequence. Skip to main content.

In the second case, b is smallest or tied for smallest. Therefore it is not a tautology. The truth table is as follows.

An alternative approach, which we show only for part ais to use the equivalences listed in the section and work symbolically.

This does not follow from our assumptions. To say that p and alplications are logically equivalent is to say that the truth tables for p and q are identical; similarly, to say that q and r are logically equivalent is to say that the truth tables for q and r are identical.


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.

Discrete Mathematics and Its Applications (6th edition) – Solutions (1) | Quang Mai –

Therefore Alice is telling the truth, so 6tj did it. To be perfectly clear, one could say that every student in this school has failed to visit North Dakota, or simply that no student has visited North Dakota.

Neither is possible, so there can be no such barber. In what follows we will sometimes make use of the contrapositives of these conditional statements as well. In fact, a computer algebra system will tell us that neither of them is a perfect square. As we noted above, the answer is yes, this conclusion is valid. The only case in which this is false is when s is false and both e and d are true.

For part a we have the following table.

It is saying that whenever you have two unequal objects, any object has to be one of those two. We can see that this is the unique solution in a couple of ways. P x is true, so we form the disjunction of these three cases.