CSCI 250 Spring 2012
Discrete Structures
Archived Class
Charles Cusack
Computer Science
Hope College
Main
Schedule
Grading
Gradebook
Homework

Policies
College
    Policies
Advice

Notes
Programs
Tutorials

CSCI 125
CSCI 255
MATH 131 (01 and 02)
Others

Admin

Homework 13

Comments

  • Exercises taken from Discrete Mathematics and its Applications, Seventh Edition unless otherwise noted.
  • You must show all of your work for each problem!
  • Points will be deducted if you do not show all of your work.
  • Each problem is generally worth 10 points. Problems with multiple parts may be assigned more points if there are enough parts or each part is significant enough.
  • The Review Questions are always related to the section that will be discussed on the assignment due date.

Details

SectionProblemNotes
2.224You may use any of the valid techniques from the book.
2.426eDo not give a recursive formula. I should be able to determine a100 by just plugging in 100, for instance. Assume the first term is a1. If you are having a hard time with this, try adding or subtracting 1 from the term and seeing if the numbers look more familiar. Then you should be able to determine a formula.
32d
34d
5.14This problem is much easier if you assume P(k-1) and show P(k).
50