Unformatted text preview: g. Hannah saw Joe touch the candlestick Given that there is only one killer, use resolution to identify the killer. 4. Provide a Direct Proof of the following, where a, b, and c are integers If ab and bc, then ac Hint : definition of “  “ (Divisible) is given in lecture 20. 5. Prove using induction that P(n) = P(n1) + P(n2), where P(n) is a Fibonacci number. Hint : What are Fibonacci numbers? That will help you identify the base case. 6. Prove using induction that if p does not divide any of the numbers a 1 , a 2 , a 3 , …, a n (i.e., p is not a common divisor for a 1 , a 2 , a 3 , …, a n ) ;then p does not divide a 1 *a 2 *a 3 * …*a n...
View
Full Document
 Fall '05
 MarkDrela
 Logic, Boolean Algebra, Propositional calculus, Fibonacci number

Click to edit the document details