Asymptotic Dominance Problems. is not constant but for n 0, f ( n) 11. 0, so that for n N f

Similar documents
ICS141: Discrete Mathematics for Computer Science I

Available online through

. The set of these sums. be a partition of [ ab, ]. Consider the sum f( x) f( x 1)

LECTURE 8: Topics in Chaos Ricker Equation. Period doubling bifurcation. Period doubling cascade. A Quadratic Equation Ricker Equation 1.0. x x 4 0.

12 Iterative Methods. Linear Systems: Gauss-Seidel Nonlinear Systems Case Study: Chemical Reactions

ME 501A Seminar in Engineering Analysis Page 1

Differential Entropy 吳家麟教授

MTH 146 Class 7 Notes

Sequences and summations

In Calculus I you learned an approximation method using a Riemann sum. Recall that the Riemann sum is

Optimality of Strategies for Collapsing Expanded Random Variables In a Simple Random Sample Ed Stanek

Assignment 7/MATH 247/Winter, 2010 Due: Friday, March 19. Powers of a square matrix

1 4 6 is symmetric 3 SPECIAL MATRICES 3.1 SYMMETRIC MATRICES. Defn: A matrix A is symmetric if and only if A = A, i.e., a ij =a ji i, j. Example 3.1.

Exercises for Square-Congruence Modulo n ver 11

this is the indefinite integral Since integration is the reverse of differentiation we can check the previous by [ ]

COMPLEX NUMBERS AND DE MOIVRE S THEOREM

MATH2999 Directed Studies in Mathematics Matrix Theory and Its Applications

CS473-Algorithms I. Lecture 3. Solving Recurrences. Cevdet Aykanat - Bilkent University Computer Engineering Department

ON NILPOTENCY IN NONASSOCIATIVE ALGEBRAS

Complex Variables. Chapter 19 Series and Residues. March 26, 2013 Lecturer: Shih-Yuan Chen

A Brief Introduction to Olympiad Inequalities

10.2 Series. , we get. which is called an infinite series ( or just a series) and is denoted, for short, by the symbol. i i n

Matrix. Definition 1... a1 ... (i) where a. are real numbers. for i 1, 2,, m and j = 1, 2,, n (iii) A is called a square matrix if m n.

SOME REMARKS ON HORIZONTAL, SLANT, PARABOLIC AND POLYNOMIAL ASYMPTOTE

Math 2414 Activity 16 (Due by end of class August 13) 1. Let f be a positive, continuous, decreasing function for x 1, and suppose that

On Several Inequalities Deduced Using a Power Series Approach

A Technique for Constructing Odd-order Magic Squares Using Basic Latin Squares

B. Examples 1. Finite Sums finite sums are an example of Riemann Sums in which each subinterval has the same length and the same x i

Mathematically, integration is just finding the area under a curve from one point to another. It is b

f(t)dt 2δ f(x) f(t)dt 0 and b f(t)dt = 0 gives F (b) = 0. Since F is increasing, this means that

On Signed Product Cordial Labeling

Abstrct Pell equto s mportt reserch object elemetry umber theory of defte equto ts form s smple, but t s rch ture My umber theory problems ce trsforme

POWERS OF COMPLEX PERSYMMETRIC ANTI-TRIDIAGONAL MATRICES WITH CONSTANT ANTI-DIAGONALS

under the curve in the first quadrant.

Solutions Manual for Polymer Science and Technology Third Edition

Sect Simplifying Radical Expressions. We can use our properties of exponents to establish two properties of radicals: and

Log1 Contest Round 2 Theta Complex Numbers. 4 points each. 5 points each

MATRIX AND VECTOR NORMS

European Journal of Mathematics and Computer Science Vol. 3 No. 1, 2016 ISSN ISSN

UNIVERSITY OF BRISTOL. Examination for the Degrees of B.Sc. and M.Sci. (Level C/4) ANALYSIS 1B, SOLUTIONS MATH (Paper Code MATH-10006)

Numerical Differentiation and Integration

UNIVERSITY OF OSLO DEPARTMENT OF ECONOMICS

Expectation and Variance

Second Mean Value Theorem for Integrals By Ng Tze Beng. The Second Mean Value Theorem for Integrals (SMVT) Statement of the Theorem

Section 6.1 Definite Integral

Suppose we want to find the area under the parabola and above the x axis, between the lines x = 2 and x = -2.

( a n ) converges or diverges.

Section IV.6: The Master Method and Applications

CHAPTER 4 RADICAL EXPRESSIONS

Exercise # 2.1 3, 7, , 3, , -9, 1, Solution: natural numbers are 3, , -9, 1, 2.5, 3, , , -9, 1, 2 2.5, 3, , -9, 1, , -9, 1, 2.

Mu Sequences/Series Solutions National Convention 2014

Chapter 3 Supplemental Text Material

2.28 The Wall Street Journal is probably referring to the average number of cubes used per glass measured for some population that they have chosen.

Chapter 7. Bounds for weighted sums of Random Variables

Chapter Unary Matrix Operations

University of California at Berkeley College of Engineering Dept. of Electrical Engineering and Computer Sciences.

Chapter 14 Logistic Regression Models

50 AMC Lectures Problem Book 2 (36) Substitution Method

X ε ) = 0, or equivalently, lim

The Reimann Integral is a formal limit definition of a definite integral

We will begin by supplying the proof to (a).

Neville Robbins Mathematics Department, San Francisco State University, San Francisco, CA (Submitted August 2002-Final Revision December 2002)

Review of the Riemann Integral

1 Onto functions and bijections Applications to Counting

ITERATIVE METHODS FOR SOLVING SYSTEMS OF LINEAR ALGEBRAIC EQUATIONS

7 - Continuous random variables

Limit of a function:

Bond Additive Modeling 5. Mathematical Properties of the Variable Sum Exdeg Index

MTH 146 Class 16 Notes

Soo King Lim Figure 1: Figure 2: Figure 3: Figure 4: Figure 5: Figure 6: Figure 7: Figure 8: Figure 9: Figure 10: Figure 11:

Interval Estimation. Consider a random variable X with a mean of X. Let X be distributed as X X

Method: Step 1: Step 2: Find f. Step 3: = Y dy. Solution: 0, ( ) 0, y. Assume

Lecture 3 ( ) (translated and slightly adapted from lecture notes by Martin Klazar)

AT100 - Introductory Algebra. Section 2.7: Inequalities. x a. x a. x < a

Coordination equilibria. Wilson s disease. Chelation therapy. Stability and competition M n+ + :L M:L n+

5.4 The Quarter-Wave Transformer

Initial-Value Problems for ODEs. numerical errors (round-off and truncation errors) Consider a perturbed system: dz dt

Fredholm Type Integral Equations with Aleph-Function. and General Polynomials

5 Short Proofs of Simplified Stirling s Approximation

{ }{ ( )} (, ) = ( ) ( ) ( ) Chapter 14 Exercises in Sampling Theory. Exercise 1 (Simple random sampling): Solution:

MATH 104: INTRODUCTORY ANALYSIS SPRING 2008/09 PROBLEM SET 10 SOLUTIONS. f m. and. f m = 0. and x i = a + i. a + i. a + n 2. n(n + 1) = a(b a) +

MATH 118 HW 7 KELLY DOUGAN, ANDREW KOMAR, MARIA SIMBIRSKY, BRANDEN LASKE

Chapter 9 Jordan Block Matrices

ENGI 4430 Numerical Integration Page 5-01

Lecture 4 Recursive Algorithm Analysis. Merge Sort Solving Recurrences The Master Theorem

The linear system. The problem: solve

Area and the Definite Integral. Area under Curve. The Partition. y f (x) We want to find the area under f (x) on [ a, b ]

Chapter 5. The Riemann Integral. 5.1 The Riemann integral Partitions and lower and upper integrals. Note: 1.5 lectures

On a class of analytic functions defined by Ruscheweyh derivative

Homework 2 solutions

= lim. (x 1 x 2... x n ) 1 n. = log. x i. = M, n

Z = = = = X np n. n n. npq. npq pq

Infinite Sequences and Series. Sequences. Sequences { } { } A sequence is a list of number in a definite order: a 1, a 2, a 3,, a n, or {a n } or

The Basic Properties of the Integral

5. Solving recurrences

ANALYSIS HW 3. f(x + y) = f(x) + f(y) for all real x, y. Demonstration: Let f be such a function. Since f is smooth, f exists.

Roberto s Notes on Integral Calculus Chapter 4: Definite integrals and the FTC Section 2. Riemann sums

Coding Theorems on New Fuzzy Information Theory of Order α and Type β

Chapter Linear Regression

Union, Intersection, Product and Direct Product of Prime Ideals

Transcription:

Asymptotc Domce Prolems Dsply ucto : N R tht s Ο( ) ut s ot costt 0 = 0 The ucto ( ) = > 0 s ot costt ut or 0, ( ) Dee the relto " " o uctos rom N to R y g d oly = Ο( g) Prove tht s relexve d trstve (Recll: to e relexve, you must To prove relexvty, otce tht or y : N R d ll 0, ( ) ( ) To prove trstvty, suppose = Ο( g) d g = Ο( h), the y deto, there exst N 0, M 0, Ng 0, Mg 0, so tht or N, ( ) M g( ) d or N g, g ( ) Mg h ( ) Thus or mx{ N, Ng}, ( ) M Mg h( ) We my coclude tht =Ο( h) 3 Suppose = Ο(g) d g = Ο(h), prove or dsprove (wth smple couter-exmple) tht = Ο(h) Suppose =Ο( g) d g =Ο( h), the y deto, there exst N 0, M 0, Ng 0, Mg 0, so tht or N, ( ) M g( ) d or N g, g ( ) Mg h ( ) Thus or mx{ N, Ng}, ( ) M Mg h( ) We my coclude tht =Ο( h) 4 Suppose = ο( g) d g =Ο( h) Prove tht = ο( h) Sce g = Ο(h), there exst M d N so tht N g( ) M h( ) Gve ε > 0, let ε = ε / M Sce = ο(g), there exst N such tht N ( ) ε g( ) = ε / M g( ) Thus lettg N = mx{ N, N }, or N we hve ( ) ε / M g( ) ε h( ) so = ο(h) 5 Suppose =Ο( g) d g =Ο( h) I h = Ο( ), prove tht h = Ο( g) By deto, there exst N 0, M 0, Nh 0, Mh 0, so tht or N, ( ) M g( ) d or N h, h ( ) Mh ( ) Thus or mx{ N, Nh}, h ( ) M M g ( ) We my coclude tht h = Ο( g) h

6 Usg Theorem d ducto prove tht or =,,,, =Ο( g = Ο( g ) ), the For =, we hve = = Ο( g ) = Ο( g ) Now ssume = Ο( g ) d cosder + Sce = g + + + + + Ο + Ο( ) d = Ο( g ), Theorem gurtees tht = + = ( g + g ) = Ο( g ) 7 Employg ducto d Theorem 3, prove tht or =,,,, =Ο( g), the = Ο( g) For =, we hve = = Ο( g) y hypothess Now ssume = Ο( g) d cosder + + Sce = Ο( g) d + = Ο( g), Theorem 3 gurtees tht = + + = Ο(mx{ g, g }) = Ο( g ) = Ο( g) 8 Show tht ( )= + 3 d g ( )=, the = O(g) Let N = 3 d M = 3 For N : ( ) = + 3 = + 3 + = 3 3 = 3 = M Thus = O(g) g( ) 00 0 or = 7 9 Dee : N R y ( ) = or 7 For 8, ( ) =, so = Ο( ) Prove tht = Ο( )

0 Cosder the uctos d g deed o N y ( ) = g ( ) = Show tht =Ο( g) ut tht ο( g) d g Ο( ) or eve or odd d =Ο( g): Sce or 0, ; we hve tht d, so ( ) g( ) Thus = Ο( g) ο( g): Suppose = ο( g), the or ε = / there s o-egtve N so tht or ll N, ( ) ε g( ) But lettg = N = 0 d = N or N+ (whchever s eve) N s postve, we hve ( ) = > = ε g( ) Ths s cotrdcto, so ο( g) g Ο( ): Suppose g =Ο( ), the there exst oegtve M d N so tht or ll N, g ( ) M ( ) But lettg e odd d greter th N d M, the we hve g ( ) = = > M= M = M ( ) Ths s cotrdcto, so g Ο( ) Show tht =Ο(!) For d = 3,,,, we hve, thus = = = =! d we hve =Ο(!) Thereore,!, thus Show tht or y rel vlue o, =Ο(!) (Ht: e creul to cosder egtve vlues o ) Dee K = (e K s the rst teger greter th or equl to ) For K d = K, K +,,, we hve, thus Thereore, K K K K K K K K K d N = K, we hve M! or ll N = = =! So wth M = Thus =Ο(!)

3 Show tht or y >, log =ο ( ) Cosder y postve ε, d choose N = + ε ( ) The, > N, we hve > + ε, thus ( ) ε ( ) >, d ( ) ( ε ) > But usg the ( ) oml theorem, we hve ε ε ε ε j ε = = + = j j > ( ) ( ( )) ( ) ( ) > = 0 By tg se logrthms, we hve ε ε = ε = log > log = log 4 Prove tht 0 <, the = ο ( ) I = 0, the or ll ε > 0 d ll, we hve = 0 ε Assume ow tht > 0 Te N = l( ε ) / l( / ) d (ssumg ε < ), or N, l( / ) l( ε ) d = ε = ε (I ε the = ε = ε or 0 ) Thus = ο ( ) 5 Prove tht 0 <, the = ο ( ) Gve y ε > 0, let N /ε, d = ο ( ) ( ) = ( / ) /( ) 6 Prove tht 0 < <, the Ο( ) Gve M 0 d N 0, let M ε Notce the or N = ( / ε ) /( ), ε So = ( ) = ( ) ε Thereore, = mx{ M, } thus M M d l( M) 0 Notce tht l( ) > 0 d choose N l( M) M = mx{, } + For ths we hve > l( ), l( ) l( ) thus l( ) > l( M) d ( ) M M > But the M M = > = so Ο( )

7 Prove tht =Ο( ) Let M = d N = For, 3/ N Thus = 3/ = =, so = Ο( ) ( ) 8 Prove tht e ο ( e ) Let ε =, cosder d N, d choose mx{n,} Sce, > e ( ) > e = ε so e ο( e ) d 4 45 9 Usg oly Deto, prove tht 3 = Ο( ) Let M = 3 d N = For N =, we hve 4 4, so 3 3 45 = 3 4 45 Thus 3 = Ο( ) 0 Usg oly Deto, prove tht 5 ο ( 4 ) Let ε = / 4 d suppose there exsts N so tht or ll N, 5 ε 4 But or 5 = mx{, N }, we hve N d, so ( ) > d 5 > 4, thus 4 5 = 5 > 4 = / 4 = ε 4 d 5 ο ( 4 ) Show tht ( )= d g( )=, the o(g) Let ε = d cosder y postve N Let = N + so d N ( ) = = > ε = ε g( ) Thus o(g) Show tht log! =Ο ( log ) d log = Ο (log!) For, we hve log! = log ( ) = log log = We hve: log Thus log! log d log! = Ο ( log ) To show log =Ο (log!) let N = 8 d M = 3 Notce tht 8,, so 3 ( ) = Also otce tht 8 8, so + = Flly 3 3( ) / 3 / 3 / + 3 3 3 = ( ) (( ) ) = ( ) ( ) = (!) = = = =

By tg logs, we hve or 8, log = log 3log! = 3 log!