This preview shows pages 1–7. Sign up to view the full content.
This preview has intentionally blurred sections. Sign up to view the full version.
View Full DocumentThis preview has intentionally blurred sections. Sign up to view the full version.
View Full DocumentThis preview has intentionally blurred sections. Sign up to view the full version.
View Full Document
Unformatted text preview: of tiles in either color. 7 a) Find a recurrence relation and give initial conditions for the number of ternary strings of length n that do not contain consecutive symbols that are the same. b) Find a recurrence relation and give initial conditions for the number of ways to climb n stairs if the person climbing the stairs can take one stair or two stairs at a time....
View
Full
Document
This note was uploaded on 04/11/2011 for the course MACM 201 taught by Professor Marnimishna during the Spring '09 term at Simon Fraser.
 Spring '09
 MarniMishna

Click to edit the document details