This preview has intentionally blurred sections. Sign up to view the full version.View Full Document
Unformatted text preview: How many di²erent answer keys are possible? 1 (c) A multiple-choice exam has 50 questions, and each question ofers Four choices: A, B, C, and D. Each question has exactly one answer, ten are B, and another ten are D. How many diferent answer keys to the exam satisFy these constraints? Problem 5. ±ind a closed-Form generating Function For the sequence (1 , 3 , 5 , 7 , 9 , 11 , ··· ) Problem 6. How many ways are there to tile an n × 3 board using 2 × 1 dominoes? Model this counting problem using a coupled set oF recurrence relations which in theory could be solved to give you a closed Formula. Problem 7. How many ways are there to build a 2 × 2 × n pillar using 1 × 1 × 2 bricks? Model this counting problem using a coupled set oF recurrence relations. 2...
View Full Document
- Spring '11
- Tn, Recurrence relation, Fibonacci number, Generating function, diﬀerent answer keys, closed-form generating function