mt1 - MATH 3012 Applied Combinatorics(Fall’07 – TEST...

Info iconThis preview shows pages 1–2. Sign up to view the full content.

View Full Document Right Arrow Icon

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: MATH 3012 Applied Combinatorics (Fall’07) – TEST 1 (Solutions) Instructor : Prasad Tetali, office: Skiles 234, email: [email protected] Time: 1 hour 25 minutes Total Score: 5 + 10 + 10 + 5 + 10 = 40 pts 1 (5pts). A license plate has 3 letters (from the English alphabet) followed by 3 digits from 0 through 9. How many license plates can be made? (Assume that letters can not be repeated, but digits can be repeated.) Solution . Note that ordering matters, and that letters can not be reused. So it is 26 × 25 × 24 × 10 × 10 × 10. 2 (10pts). If n ∈ Z + and n ≥ 2, prove that 2 n < 2 n n < 4 n . Solution . It is simplest to prove by induction on n ≥ 2. Base Case : True, since 2 2 < 4 2 = 6 < 4 2 . Induction Hypothesis . Assume that for some n = k , k ≥ 2, the inequalities are true. Induction Step . Need to prove the case of n = k + 1, namely that 2 k +1 < 2( k +1) k +1 < 4 k +1 ....
View Full Document

This note was uploaded on 11/29/2011 for the course AMS 301 taught by Professor Arkin during the Spring '08 term at SUNY Stony Brook.

Page1 / 3

mt1 - MATH 3012 Applied Combinatorics(Fall’07 – TEST...

This preview shows document pages 1 - 2. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online