This preview has intentionally blurred sections. Sign up to view the full version.View Full Document
Unformatted text preview: Su’09: MATH 3012 Applied Combinatorics Carl Yerger Thursday 7/9/2009 Test 2 105 minutes Name: Student ID: Instructions. 1. Attempt all questions. 2. The questions on this test sum to 205 points, but the test will be scored out of 200 points. 3. Show all the steps of your work clearly. Use complete sentences. Points may be deducted for lack of clarity or poor mathematical exposition. Neatness counts! 4. Calculators are not permitted on this exam nor the use of any other electronic devices. 5. No collaboration of any kind is permitted on this exam. 6. As a reminder, the Georgia Tech Honor Code applies to all matters of conduct in this course. Question Points Your Score Q1 35 Q2 10 Q3 15 Q4 20 Q5 25 Q6 10 Q7 20 Q8 20 Q9 20 Q10 15 Q11 15 TOTAL 200 1. [35 points total, 5 points each part] a. What is the formula for the number of derangements on a set of n elements? b. How many derangements are there of length 7? Please compute this explicitly....
View Full Document
- Summer '08
- Combinatorics, Recurrence relation, Fibonacci number, Generating function, Q3 Q4 Q5, Lucas sequence