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 255
MATH 132
Others

Admin

Homework 11

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
1.436
1.738Clearly show why your counterexample works. Also, read the problem carefully so you do not come up with a false counterexample.
2.130Prove your conclusion.
2.216eUse a "set containment proof". Your proof should contain phrases like "Let x∈FOO", "by the definition of union", "thus FOO⊆FERZLE", etc.
2.320N is the set of natural numbers ({0, 1, 2, ...}). Also, when part c says "different than the identity", it means it cannot always map a number to itself, regardless of what the function looks like. So functions like f(x)=⌊x⌋ or f(x)=2*(x/2) don't count.
36Make sure you clearly indicate which answer is which.
2.44ad
16b
26bhDo 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.
32cMake sure to show your work.
34bMake sure to show your work.
40Make sure to show your work.