# hw3 - n 3 Deﬁne a set M ⊆ Z 2 as follows(1(3 2 ∈ M(2...

This preview shows page 1. Sign up to view the full content.

CSC236H: Introduction to the Theory of Computation Homework 3 Due on Thursday March 4, 2010 (in class) 1. Early members of the Pythagorean Society deﬁned ﬁgurate numbers to be the number of dots in certain geometrical conﬁgurations. (a) The ﬁrst four triangular numbers are 1, 3, 6, and 10. Find a recursive expression for the nth triangular number. Guess (you may use substitution, but note that the answer is very easy, and you have seen it before) the closed form for this function and prove your answer to be correct. (a) The ﬁrst four pentagonal numbers are 1, 5, 12, and 22. Find a recursive expression for the nth pentagonal number. Guess the closed form for this function and prove your answer to be correct. 2. Deﬁne the function f as follows: f (1) = 1 f (2) = 5 f ( n + 1) = 5 f ( n ) - 6 f ( n - 1) (a) Compute f (3) and f (4). (b) Use strong induction to prove that f ( n ) = 3 n - 2 n for every positive integer
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: n . 3. Deﬁne a set M ⊆ Z 2 as follows (1) (3 , 2) ∈ M (2) If ( x,y ) ∈ M , then (3 x-2 y,x ) ∈ M Use structural induction to prove that elements of M always have the form (2 k +1 + 1 , 2 k + 1), where k is a natural number. (The point of this problem is to learn how to use structural induction, so you may not rephrase this into a normal proof by induction on k .) 4. The Fibonacci trees T k are a special sort of binary trees that are deﬁned as follows. Base: T 1 and T 2 are binary trees with only a single vertex. Induction: For any n ≥ 3, T n consists of a root node with T n-1 as its left subtree and T n-2 as its right subtree. Use structural induction to prove that the height of T n is n-2, for any n ≥ 2. (Again, use structural induction rather than looking for an explicit induction variable n .) 1...
View Full Document

## This note was uploaded on 04/11/2010 for the course CSC CSC236 taught by Professor Farzanazadeh during the Spring '10 term at University of Toronto.

Ask a homework question - tutors are online