AP Notes, Outlines, Study Guides, Vocabulary, Practice Exams and more!

discrete math

comp sci

Subject: 
Calculus
Rating: 
0
No votes yet
Tags: 
Mathematics
Mathematical logic
Logic
Inductive reasoning
Knowledge
Mathematical proofs
Mathematical induction
Proof theory
Graph theory
Structural induction
Recursive definition
XTR
discrete math

CS 330 : Discrete Computational Structures Fall Semester, 2013 Assignment #5 Due Date: Friday, Oct 11 Suggested Reading: Rosen Section 5.1 - 5.2; Lehman et al. Chapter 5.1 - 5.3 These are the problems that you need to turn in. For more practice, you are encouraged to work on the other problems. Always explain your answers and show your reasoning. 1. Rosen, Section 5.1: Exercise 4 2. Rosen, Section 5.1: Exercise 6 3. Rosen, Section 5.1: Exercise 10 4. Rosen, Section 5.1: Exercise 16 5. Rosen, Section 5.1: Exercise 20 6. Rosen, Section 5.1: Exercise 32 7. Rosen, Section 5.1: Exercise 44 8. Let P (n) be the statement that n-cent postage can be formed using just 3-cent and 8-cent stamps. Prove that P (n) is true for all n ? 14, using the steps below.
Subscribe to RSS - discrete math

Need Help?

We hope your visit has been a productive one. If you're having any problems, or would like to give some feedback, we'd love to hear from you.

For general help, questions, and suggestions, try our dedicated support forums.

If you need to contact the Course-Notes.Org web experience team, please use our contact form.

Need Notes?

While we strive to provide the most comprehensive notes for as many high school textbooks as possible, there are certainly going to be some that we miss. Drop us a note and let us know which textbooks you need. Be sure to include which edition of the textbook you are using! If we see enough demand, we'll do whatever we can to get those notes up on the site for you!