MIT6_042JF10_rec13

# MIT6_042JF10_rec13 - equality. Hint an = a 2 log 2 n . 1 1...

This preview shows pages 1–3. Sign up to view the full content.

6.042/18.062J Mathematics for Computer Science October 22, 2010 Tom Leighton and Marten van Dijk Problems for Recitation 13 1 Asymptotic Notation Which of these symbols Θ O Ω o ω can go in these boxes? (List all that apply.) 2 n + log n = ( n ) log n = ( n ) n = (log 300 n ) n 2 n = ( n ) n 7 = (1 . 01 n )

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

View Full Document
Recitation 13 2 2 Asymptotic Equivalence Suppose f,g : Z + Z + and f g . 1. Prove that 2 f 2 g . 2. Prove that f 2 g 2 . 3. Give examples of f and g such that 2 f 2 g . 4. Show that is an equivalence relation 5. Show that Θ is an equivalence relation 3 More Asymptotic Notation 1. Show that ( an ) b/n 1 . where a,b are positive constants and denotes asymptotic
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: equality. Hint an = a 2 log 2 n . 1 1 n n . 2. You may assume that if f ( n ) ≥ 1 and g ( n ) ≥ 1 for all n , then f ∼ g ⇒ f ∼ g Show that n √ n ! = Θ( n ) . MIT OpenCourseWare http://ocw.mit.edu 6.042J / 18.062J Mathematics for Computer Science Fall 2010 For information about citing these materials or our Terms of Use, visit: http://ocw.mit.edu/terms ....
View Full Document

## This note was uploaded on 01/19/2012 for the course CS 6.042J / 1 taught by Professor Tomleighton,dr.martenvandijk during the Fall '10 term at MIT.

### Page1 / 3

MIT6_042JF10_rec13 - equality. Hint an = a 2 log 2 n . 1 1...

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

View Full Document
Ask a homework question - tutors are online