Discrete Structures
Virtual HW #6
Last Update: 20 February 2008
Note:
or
material is highlighted
|
Reminder: Each HW problem solution should consist of:
- a restatement of the entire problem (you may copy it word for word),
- followed by a complete solution with all intermediate steps shown.
Exercises are from §1.6, p. 85 (introduction to proofs).
- #6
- Hint: Odd(n) =def ∃x[n = 2x + 1]
- #16
- Suggestion: Try Proof by Contraposition.
Hint: You may appeal to problem #6, above.
- #18ab
- #22
- Suggestion: The instructor's answer manual suggests using
Proof by Contradiction.
But I think you might find it easier to try
using Proof by Cases (see pp. 86-90).
NOT DUE: ANSWERS WILL BE POSTED ON FRIDAY, FEBRUARY 27 |
Copyright © 2009 by
William J. Rapaport
(rapaport@cse.buffalo.edu)
http://www.cse.buffalo.edu/~rapaport/191/S09/hw06.html-20090210