Solutions to Problem Sheet 1

Similar documents
Problem Sheet 1. 1) Use Theorem 1.1 to prove that. 1 p loglogx 1

Proposition 2.1. There are an infinite number of primes of the form p = 4n 1. Proof. Suppose there are only a finite number of such primes, say

THE INTEGRAL TEST AND ESTIMATES OF SUMS

1. C only. 3. none of them. 4. B only. 5. B and C. 6. all of them. 7. A and C. 8. A and B correct

2.4.2 A Theorem About Absolutely Convergent Series

6.3 Testing Series With Positive Terms

s = and t = with C ij = A i B j F. (i) Note that cs = M and so ca i µ(a i ) I E (cs) = = c a i µ(a i ) = ci E (s). (ii) Note that s + t = M and so

1.3 Convergence Theorems of Fourier Series. k k k k. N N k 1. With this in mind, we state (without proof) the convergence of Fourier series.

Math 113 Exam 3 Practice

Physics 116A Solutions to Homework Set #1 Winter Boas, problem Use equation 1.8 to find a fraction describing

1 Lecture 2: Sequence, Series and power series (8/14/2012)

Chapter 2 Elementary Prime Number Theory for

Notes on the prime number theorem

PRACTICE FINAL/STUDY GUIDE SOLUTIONS

Real Analysis Fall 2004 Take Home Test 1 SOLUTIONS. < ε. Hence lim

INFINITE SEQUENCES AND SERIES

Final Solutions. 1. (25pts) Define the following terms. Be as precise as you can.

MAT1026 Calculus II Basic Convergence Tests for Series

Convergence of random variables. (telegram style notes) P.J.C. Spreij

University of Colorado Denver Dept. Math. & Stat. Sciences Applied Analysis Preliminary Exam 13 January 2012, 10:00 am 2:00 pm. Good luck!

Find a formula for the exponential function whose graph is given , 1 2,16 1, 6

MIDTERM 3 CALCULUS 2. Monday, December 3, :15 PM to 6:45 PM. Name PRACTICE EXAM SOLUTIONS

MATH 31B: MIDTERM 2 REVIEW

10.1 Sequences. n term. We will deal a. a n or a n n. ( 1) n ( 1) n 1 2 ( 1) a =, 0 0,,,,, ln n. n an 2. n term.

Lesson 10: Limits and Continuity

Assignment 5: Solutions

SCORE. Exam 2. MA 114 Exam 2 Fall 2016

(A sequence also can be thought of as the list of function values attained for a function f :ℵ X, where f (n) = x n for n 1.) x 1 x N +k x N +4 x 3

MATH 10550, EXAM 3 SOLUTIONS

INFINITE SEQUENCES AND SERIES

Review for Test 3 Math 1552, Integral Calculus Sections 8.8,

Math 140A Elementary Analysis Homework Questions 3-1

Chapter 6 Infinite Series

Solutions to Tutorial 5 (Week 6)

Infinite Sequences and Series

6. Uniform distribution mod 1

It is often useful to approximate complicated functions using simpler ones. We consider the task of approximating a function by a polynomial.

Analytic Continuation

In this section, we show how to use the integral test to decide whether a series

MAT136H1F - Calculus I (B) Long Quiz 1. T0101 (M3) Time: 20 minutes. The quiz consists of four questions. Each question is worth 2 points. Good Luck!

MATH 413 FINAL EXAM. f(x) f(y) M x y. x + 1 n

MATH301 Real Analysis (2008 Fall) Tutorial Note #7. k=1 f k (x) converges pointwise to S(x) on E if and

ECE534, Spring 2018: Final Exam

3.1. Introduction Assumptions.

62. Power series Definition 16. (Power series) Given a sequence {c n }, the series. c n x n = c 0 + c 1 x + c 2 x 2 + c 3 x 3 +

Carleton College, Winter 2017 Math 121, Practice Final Prof. Jones. Note: the exam will have a section of true-false questions, like the one below.

Seunghee Ye Ma 8: Week 5 Oct 28

Integrable Functions. { f n } is called a determining sequence for f. If f is integrable with respect to, then f d does exist as a finite real number

If a subset E of R contains no open interval, is it of zero measure? For instance, is the set of irrationals in [0, 1] is of measure zero?

Math 113 Exam 3 Practice

Math 132, Fall 2009 Exam 2: Solutions

Midterm Exam #2. Please staple this cover and honor pledge atop your solutions.

Definition An infinite sequence of numbers is an ordered set of real numbers.

1. (25 points) Use the limit definition of the definite integral and the sum formulas 1 to compute

Read carefully the instructions on the answer book and make sure that the particulars required are entered on each answer book.

d) If the sequence of partial sums converges to a limit L, we say that the series converges and its

LECTURES 5 AND 6: CONVERGENCE TESTS

MA131 - Analysis 1. Workbook 2 Sequences I

MATH 324 Summer 2006 Elementary Number Theory Solutions to Assignment 2 Due: Thursday July 27, 2006

4x 2. (n+1) x 3 n+1. = lim. 4x 2 n+1 n3 n. n 4x 2 = lim = 3

Sequences I. Chapter Introduction

REVIEW 1, MATH n=1 is convergent. (b) Determine whether a n is convergent.

Math 113 Exam 4 Practice

LECTURE SERIES WITH NONNEGATIVE TERMS (II). SERIES WITH ARBITRARY TERMS

Chapter 10: Power Series

MA131 - Analysis 1. Workbook 3 Sequences II

Measure and Measurable Functions

CHAPTER 1 SEQUENCES AND INFINITE SERIES

Sequences. Notation. Convergence of a Sequence

MA541 : Real Analysis. Tutorial and Practice Problems - 1 Hints and Solutions

HOMEWORK #10 SOLUTIONS

Chapter 6 Overview: Sequences and Numerical Series. For the purposes of AP, this topic is broken into four basic subtopics:

Ma 530 Infinite Series I

Chapter 7: Numerical Series

sin(n) + 2 cos(2n) n 3/2 3 sin(n) 2cos(2n) n 3/2 a n =

f(x) dx as we do. 2x dx x also diverges. Solution: We compute 2x dx lim

Chapter 8. Uniform Convergence and Differentiation.

Lecture 3 The Lebesgue Integral

7 Sequences of real numbers

Are the following series absolutely convergent? n=1. n 3. n=1 n. ( 1) n. n=1 n=1

Bertrand s Postulate. Theorem (Bertrand s Postulate): For every positive integer n, there is a prime p satisfying n < p 2n.

1 Approximating Integrals using Taylor Polynomials

Ma 4121: Introduction to Lebesgue Integration Solutions to Homework Assignment 5

SUMMARY OF SEQUENCES AND SERIES

and each factor on the right is clearly greater than 1. which is a contradiction, so n must be prime.

Sequences. A Sequence is a list of numbers written in order.

MATH 112: HOMEWORK 6 SOLUTIONS. Problem 1: Rudin, Chapter 3, Problem s k < s k < 2 + s k+1

PRIME RECIPROCALS AND PRIMES IN ARITHMETIC PROGRESSION

Math 163 REVIEW EXAM 3: SOLUTIONS

Sequences and Series of Functions

Chapter 4. Fourier Series

Topic 1 2: Sequences and Series. A sequence is an ordered list of numbers, e.g. 1, 2, 4, 8, 16, or

Section 11.8: Power Series

COMPUTING FOURIER SERIES

Sequences and Limits

n n 2 n n + 1 +

PRELIM PROBLEM SOLUTIONS

Math 25 Solutions to practice problems

M17 MAT25-21 HOMEWORK 5 SOLUTIONS

Math 341 Lecture #31 6.5: Power Series

Transcription:

Solutios to Problem Sheet ) Use Theorem. to rove that loglog for all real 3. This is a versio of Theorem. with the iteger N relaced by the real. Hit Give 3 let N = [], the largest iteger. The, imortatly, for a sum over ay terms, a = N a. Solutio Give 3 let N = [], the largest iteger. So N 3 ad N < N +. The =, N because there is o iteger betwee N ad. We ca ow aly Theorem., loglogn +) loglog, sice N + >. N ) Show that for every iteger k there eist a cosecutive sequece of k comosite itegers i.e. o-rimes). Solutio k +)!+, k +)!+3, k +)!+4,..., k +)!+k +). 3) I the roof of Theorem. it is show that logn +) logn +, for iteger N. Prove that for all real. log N log+

Solutio Let N = [] whe = N, thus log logn +) logn + < log+. The idea glbf t)b a) [a,b] b a f t)dt lubf t)b a), 5) [a,b] has lots of alicatios, though it sometimes eeds a little tweakig. 4) Let f be a fuctio itegrable o [M,N]. Prove that for N > M, i) if f is decreasig M f t)dt+f N) ii) if f is icreasig M f t)dt+f M) f ) M N M f ) M N M f t)dt+f M). f t)dt+f N), These two arts ca be summed u by sayig that if f is mootoic the mif M),f N)) f ) M N M f t)dt maf M),f N)). Hit For Part i follow closely the roof of logn +) N logn +. give i the lectures, though the result here i Part i imlies logn + N N 3 logn +.

Solutio i) Sice f is decreasig we have + f t)dt f ) f t)dt. Sum the left had iequality over M N, ad sum the right had oe over M + N. Thus we get the stated result. ii) Sice f is icreasig we have f t)dt f ) + f t)dt. Sum the left had iequality over M + N, ad sum the right had oe over M N. Thus we get the stated result. 5) Prove that for N N logn N + log educe that for such N, e N ) N N N! < N e log N +)logn N + log. e ) ) N N. e Hit It might hel to ote that N log = N log. Solutio Start from log = 0 so log = N The by Questio 4 i we get logtdt+log The stated result follows from N N log log. logtdt+logn. logtdt = N logn N log ). 4

If you caot remember, you itegrate logt by arts). The result o N! follows from logn! = log. N 6) i) Prove that for θ > 0, θ N θ M N N θ M θ θ θ M θ. ii)youcaotutθ = itoartibecauseofthe θ ithedeomiator but what is the limit N θ M θ lim? θ θ Solutio i) Aly the result i Questio 4 ii) with f ) = / θ to get M dt t + θ N θ M N N θ M A straightforward itegratio gives the stated result. dt t + θ M θ. ii) The most direct aroach is to aly L Hoital s Rule. I leave this to the studet. The Otherwise, erhas ote that N θ M θ θ is, i fact, the defiitio of = M θn/m) θ. θ N/M) θ lim θ θ ) θ d N = d dθ M dθ e θ)logn/m) θ= θ= = logn/m) e θ)logn/m) θ= = logn/m). 5

The the Product Rule for limits gives lim θ N θ M θ θ = limm θ θ θ= θ= = logn/m) lim θ N/M) θ θ θ= 7) i) Use 5) to show that logy < y for all y >. ii) By a aroriate choice of y i art i show that for all we have log < / for >. iii) educe that for all ε > 0, we have log ε ε. This meas that the logarithm of grows slower tha ay ower of. Here f ) ε g) meas that there eists a costat C = Cε), deedig o ε, such that f ) < Cε)g). Solutio i) For y >, logy = y dt t < y = y. ii) Choose y = / i logy < y < y to get log / < / which rearrages to the required result. iii)letε > 0begive. BytheArchimedeaProertyfortherealumbers R, there eists a iteger such that / < ε. The by art ii log < / ε. The iteger deeds o ε hece log ε ε. 8) A imortat task throughout this course is the estimatig of itegrals. The first is logy) l, with iteger l. A alicatio of 5) gives log) l logy) l log) l. 6) i) Which of these bouds do you thik reresets more truly the rate of growth of the itegral as? 6

Hit Itegrate by arts. ii) Aly a tweak ad slit the itegral at : logy) = l logy) + l Aly the uer boud i 5) to both arts to show logy) l l logy) l. log) l. 7) Hit You may eed to make use of Questio 4 i the itegral over [, ]. iii) Show, usig itegratio by arts a umber of times ad the Part ii, that for m we have m ) logy) = l +j)! l l )! log l+j +O l,m log l+m+ j=0 Solutio i) Itegratio by arts shows that [ ] logy) = y l logy) l +l logy) l+. If we assume 7) for ow, the itegral o the right is of size /log) l+ which is smaller tha the /log) l that comes from the first term. Thus we would thik that the lower boud i 6) most truly reresets the growth of the itegral. ii) Firstly logy) l log) l From Questio 4 we have log < l /l) which rearrages as l)l log) l. Thus logy) l log) l l)l log) l log) l. 7

Secodly logy) l log ) l l log) l. Add these two bouds to get the required result. iii) Itegratig by arts m+ times gives logy) l = m j=0 l +j)! l )! [ t log l+j t ] + l+m)! l )! logy) l+m+. By art i the last term i O l,m /log) l+m+), ad all the costats that arise from the t = i the earlier itegrals ca be absorbed ito this boud. 9) Aother itegral we will meet i the course is the tail ed i.e. from to ) logy) l, 8) y with iteger l. i) Use log < l /l), which follows from Questio 4, to show that logy) l y l)l /. o you thik this uer boud truly reresets the size of the itegral? ii) We caot directly aly 5) to 8) because the iterval of itegratio is ifiite. Istead tweak as i Questio 5 but this time slit the itegral at : logy) l y = logy) l y + l logy). y Now remove the log factors from both itegrals, leavig a itegratio over a ower of y i both cases. Thus show that logy) l log) l y l. 8

Solutio i) The boud is immediate after the substitutio. It does ot rereset the true growth of the itegral, as ca be see by artial itegratio, logy) l y = log)l logy) l +l 9) y If we assume the coclusio of this questio the the itegral o the right of 9) is of size log) l / which is smaller tha the first term log) l / which thus reresets the true growth of the itegral. ii) Firstly logy) l y log )) l y llog)l. Secodly, use log < l /l) as i art i to get Add to get the required result. l logy) y l) l l)l y y ) = l) l. / 0) Show that for all 3. Thus deduce that lim ) log, 0) ) = 0. Hit Relace by a iteger, look at the iverse of the roduct, ad use ideas ad results from the roof of Theorem.. Later i the course we will show, for level 4 studets, that with a aroriate costat c we have ) c log as. Here f ) g) as meas lim f )/g) =.) 9

Solutio Let N = [], so N < N + ad ) = N N sice there are o itegers betwee ad N. Cosider the iverse, whe ) =, as see i the roof of Theorem.. As also see i that roof N {,,...,N} so logn +) > log. N N N Combiig all 3 dislayed results we get ) log. ) For σ > the Riema zeta fuctio coverges absolutely ad so ζσ) N = for all N, while from Theorem.8 we have ) σ ), σ, ) ζσ) = for such σ. Assume that there are oly fiitely may rimes ad use these two facts to obtai a cotradictio. Hit For each rime the factor of the Euler Product is cotiuous, i.e. lim ) = ), σ σ 0 σ σ 0 for all σ 0 R. From secod year aalysis the fiite roduct or sum) of fuctios cotiuous at a oit, is cotiuous at that oit, i.e. for two fuctios f ad g if lim σ σ0 f σ) = f σ 0 ) ad lim σ σ0 gσ) = gσ 0 ) the lim f σ)+gσ)) = f σ 0 )+gσ 0 ) σ σ 0 0

ad lim f σ)gσ)) = f σ 0 )gσ 0 ). σ σ 0 By reeated alicatio these results hold for fiitely may terms i the sum or roduct. Use these facts i your solutio. Note that the ifiite sum or roduct of fuctios cotiuous at a oit, are ot ecessarily cotiuous at that oit. Solutio If there are oly fiitely may rimes the lim ζσ) = lim σ + σ + σ ) = = lim ) σ + σ allowable sice a fiite roduct, ), which is fiite. Yet from ) we have lim ζσ) lim σ + σ + N = σ = = N = N = lim σ + σ allowable sice a fiite sum, logn +) by4),foreachn.thislastiequalitycotradictstheassertiothatlim σ + ζσ) is fiite. This cotradictio meas that the last assumtio is false, hece there are ifiitely may rimes.

) Let π) = be the umber of rimes less tha equal to. The ifiitude of rimes is equivalet to lim π) = Prove that π) clog for some costat c > 0. Justify each ste i the followig argumet. With > a costat to be chose log π) log < log < log log e 3 log. log loglog log ) log )) + Solutio With > a costat to be chose, we throw away some terms to get a lower boud: π) = log <. The, we rearrage the lower coditio i the summatio, log/ < as log. This lower boud o ca be used as log < log < log = log log < Writethissumasadiffereceoftwoadrelacethesecodbythesummatio over all itegers log/, log = log log < log log log..

Usig Questios ad 3 gives log loglog The log log factors cacel, leavig log ) log )) +. log log. Thecostatisstilltobechose. Trytochooseittomaimiselog )/. Though it is of iterest to derive a result o π) = from the weighted sum /, later i the course we will show that π) > C/log, for some costat C > 0, which is a far larger lower boud, 3) Prove that coverges for σ > 0. m= m+) σ m Show that the Euler roduct ) + s ) coverges for Res > 0. Solutio As i 8) we have m+) σ m m σ+. N N m +σ du u N σ =. +σ σ This itegral coverges as N sice σ > 0. Thus /m+σ coverges for such σ. Therefore, by the comariso test for series, This series m= m+) σ m 3

coverges for σ > 0. As see i the otes the Euler roduct will coverge for those s for which s ) coverges. Yet s ) σ ) = m= m+) σ m relacig the sum over rimes by oe over all itegers, ad the chagig to a sum over m =. The result o Euler Product tha follows from the first art of this questio. 4