Solutions to Problem Sheet 1

Similar documents
Math 312, Intro. to Real Analysis: Homework #4 Solutions

Sequences and Series

The Limit of a Sequence (Brief Summary) 1

Further Pure 1 Revision Topic 5: Sums of Series

SELECTING THE NUMBER OF CHANGE-POINTS IN SEGMENTED LINE REGRESSION

Rafa l Kulik and Marc Raimondo. University of Ottawa and University of Sydney. Supplementary material

11.7 (TAYLOR SERIES) NAME: SOLUTIONS 31 July 2018

EXERCISE - BINOMIAL THEOREM

x satisfying all regularity conditions. Then

1 The Power of Compounding

Section Mathematical Induction and Section Strong Induction and Well-Ordering

5. Best Unbiased Estimators

. (The calculated sample mean is symbolized by x.)

Summary. Recap. Last Lecture. .1 If you know MLE of θ, can you also know MLE of τ(θ) for any function τ?

Notes on Expected Revenue from Auctions

Problem Set 1a - Oligopoly

ACTUARIAL RESEARCH CLEARING HOUSE 1990 VOL. 2 INTEREST, AMORTIZATION AND SIMPLICITY. by Thomas M. Zavist, A.S.A.

NORMALIZATION OF BEURLING GENERALIZED PRIMES WITH RIEMANN HYPOTHESIS

Outline. Plotting discrete-time signals. Sampling Process. Discrete-Time Signal Representations Important D-T Signals Digital Signals

A random variable is a variable whose value is a numerical outcome of a random phenomenon.

. The firm makes different types of furniture. Let x ( x1,..., x n. If the firm produces nothing it rents out the entire space and so has a profit of

FOUNDATION ACTED COURSE (FAC)

Lecture 9: The law of large numbers and central limit theorem

Today: Finish Chapter 9 (Sections 9.6 to 9.8 and 9.9 Lesson 3)

Monetary Economics: Problem Set #5 Solutions

INTERVAL GAMES. and player 2 selects 1, then player 2 would give player 1 a payoff of, 1) = 0.

18.S096 Problem Set 5 Fall 2013 Volatility Modeling Due Date: 10/29/2013

Combining imperfect data, and an introduction to data assimilation Ross Bannister, NCEO, September 2010

Overlapping Generations

0.07. i PV Qa Q Q i n. Chapter 3, Section 2

Game Theory. Lecture Notes By Y. Narahari. Department of Computer Science and Automation Indian Institute of Science Bangalore, India July 2012

physicsandmathstutor.com

1 Estimating sensitivities

Hopscotch and Explicit difference method for solving Black-Scholes PDE

Maximum Empirical Likelihood Estimation (MELE)

4.5 Generalized likelihood ratio test

1 The Black-Scholes model

14.30 Introduction to Statistical Methods in Economics Spring 2009

FINM6900 Finance Theory How Is Asymmetric Information Reflected in Asset Prices?

Estimating Proportions with Confidence

MATH : EXAM 2 REVIEW. A = P 1 + AP R ) ny

Class Sessions 2, 3, and 4: The Time Value of Money

Statistics for Economics & Business

1 Basic Growth Models

On the Composition of 2-Prover Commitments and Multi-Round Relativistic Commitments. CWI Amsterdam

Chapter 8. Confidence Interval Estimation. Copyright 2015, 2012, 2009 Pearson Education, Inc. Chapter 8, Slide 1

Exam 1 Spring 2015 Statistics for Applications 3/5/2015

ECON 5350 Class Notes Maximum Likelihood Estimation

Chapter 10 - Lecture 2 The independent two sample t-test and. confidence interval

Single-Payment Factors (P/F, F/P) Single-Payment Factors (P/F, F/P) Single-Payment Factors (P/F, F/P)

A New Constructive Proof of Graham's Theorem and More New Classes of Functionally Complete Functions

MATH 205 HOMEWORK #1 OFFICIAL SOLUTION

Sampling Distributions and Estimation

Subject CT1 Financial Mathematics Core Technical Syllabus

MA Lesson 11 Section 1.3. Solving Applied Problems with Linear Equations of one Variable

Limits of sequences. Contents 1. Introduction 2 2. Some notation for sequences The behaviour of infinite sequences 3

Date: Practice Test 6: Compound Interest

A point estimate is the value of a statistic that estimates the value of a parameter.

EVEN NUMBERED EXERCISES IN CHAPTER 4

CHAPTER 2 PRICING OF BONDS

2.6 Rational Functions and Their Graphs

Unbiased estimators Estimators

Chapter 5: Sequences and Series

Chapter 4: Time Value of Money

Solutions to Interest Theory Sample Questions

Probability and statistics

ST 305: Exam 2 Fall 2014

The material in this chapter is motivated by Experiment 9.

Introduction to Probability and Statistics Chapter 7

Topic-7. Large Sample Estimation

Online appendices from Counterparty Risk and Credit Value Adjustment a continuing challenge for global financial markets by Jon Gregory

SUPPLEMENTAL MATERIAL

1 Random Variables and Key Statistics

Lecture 5: Sampling Distribution

Chapter 1 Additional Questions

Using Math to Understand Our World Project 5 Building Up Savings And Debt

APPLICATION OF GEOMETRIC SEQUENCES AND SERIES: COMPOUND INTEREST AND ANNUITIES

1. Suppose X is a variable that follows the normal distribution with known standard deviation σ = 0.3 but unknown mean µ.

Analysis III (BAUG) Assignment 1 Prof. Dr. Alessandro Sisto Due 29 of September 2017

Parametric Density Estimation: Maximum Likelihood Estimation

We learned: $100 cash today is preferred over $100 a year from now

Lecture 4: Parameter Estimation and Confidence Intervals. GENOME 560 Doug Fowler, GS

A Note About Maximum Likelihood Estimator in Hypergeometric Distribution

Asymptotics: Consistency and Delta Method

2. Find the annual percentage yield (APY), to the nearest hundredth of a %, for an account with an APR of 12% with daily compounding.

SOCIETY OF ACTUARIES FINANCIAL MATHEMATICS EXAM FM SAMPLE SOLUTIONS

Journal of Statistical Software

Introduction to Econometrics (3 rd Updated Edition) Solutions to Odd- Numbered End- of- Chapter Exercises: Chapter 2

When you click on Unit V in your course, you will see a TO DO LIST to assist you in starting your course.

STAT 135 Solutions to Homework 3: 30 points

STRAND: FINANCE. Unit 3 Loans and Mortgages TEXT. Contents. Section. 3.1 Annual Percentage Rate (APR) 3.2 APR for Repayment of Loans

The Valuation of the Catastrophe Equity Puts with Jump Risks

Lecture 4: Probability (continued)

Subject CT5 Contingencies Core Technical. Syllabus. for the 2011 Examinations. The Faculty of Actuaries and Institute of Actuaries.

Simulation Efficiency and an Introduction to Variance Reduction Methods

CHAPTER 8 Estimating with Confidence

Online appendices from The xva Challenge by Jon Gregory. APPENDIX 10A: Exposure and swaption analogy.

5 Statistical Inference

Binomial Theorem. Combinations with repetition.

Anomaly Correction by Optimal Trading Frequency

Transcription:

Solutios to Problem Sheet ) Use Theorem.4 to prove that p log for all real x 3. This is a versio of Theorem.4 with the iteger N replaced by the real x. Hit Give x 3 let N = [x], the largest iteger x. The, importatly, the sets of itegers { : x} ad { : N} are equal. Therefore sums ad products) over both sets are equal, i.e. for ay terms a, x a = N a. Solutio Give x 3 let N = [x], the largest iteger x. So N 3 ad N x < N +. The p = p, p N because there is o iteger betwee N ad x. We ca ow apply Theorem.4, loglogn +) log, p sice N + > x. p N 2) Corollary.2 states that for iteger N. i. Prove that for N. logn +) N logn + N N logn +, 8) logn + ii. Why is the lower boud i Part i better tha that i 8)? iii. Prove that x + 6

for all real x. Solutio i N = N + N logn + N, by the lower boud i 8) with N replaced by N. ii. logn +) = + dt N t = dt N+ t + dt N t = logn + + N dt t logn + N + N dt iii Let N = [x] whe thus = logn + N. x logn +) = x N, logn + < +. The idea b a)glbf t) [a,b] b a f t)dt b a)lubf t), 9) [a,b] has lots of applicatios, ad oe of the most importat is see i the ext questio. Whe ca a sum be replaced by a itegral? 3) Boudig a Sum by a Itegral. Let f be a fuctio itegrable o [,N]. Prove that for itegers N >, 7

i) if f is icreasig ii) if f is decreasig ft)dt+f) N ft)dt+fn) N f) f) ft)dt+fn), ft)dt+f). These two parts ca be summed up by sayig that if f is mootoic the mif),fn)) for all itegers N >. Hit Apply 9). N Solutio i) If f is icreasig the f) ft)dt f) ft)dt maxf),fn)), + ft)dt. Sum the left had iequality over + N, ad sum the right had oe over N. Thus we get the stated result. ii) If f is decreasig the + ft)dt f) ft)dt. Sum the left had iequality over N, ad sum the right had oe over + N. Thus we get the stated result. 4) i. Use Questio 3 to prove that for itegers N N logn N ) N log N +)logn N ) ii educe that e ) N N N! en e ) N N, 20) e 8

for N. This is a weak result, there is a factor of N differece betwee the upper ad lower bouds. Which boud is closer to N!? Perhaps it lies somewhere i the middle? See later questios for the aswers. Solutio i. From Questio 3i logtdt+log Itegratio by parts gives Combiig gives stated result. ii. N! = explogn!) = exp N log logtdt = N logn N ). log Take the expoetial of Part i gives logtdt+logn, ) N N ) = exp log. expn logn N )) N! expn +)logn N )). For the lower boud = = expn logn N )) = exp logn N) exp N)exp = N N e N e = e ) N N. e N. The upper boud is idetical other tha a extra factor of explogn) = 5) i) Use Questio 3 to prove that for σ > 0, σ N σ N for all itegers N >. N σ σ σ σ σ, 2) ii) You caot substitute σ = ito part i because of the σ i the deomiator but what is the limit lim σ N σ σ? σ 9

What does the result 2) become uder the limit σ? Solutio i) Apply the result i Questio 3ii) with the decreasig fuctio f) = / σ to get dt t σ + N σ N N σ dt t σ + σ. A straightforward itegratio gives the stated result. ii) The most direct approach is to apply L Hopital s Rule. I leave this to the studet. Otherwise, perhaps ote that The N σ σ σ = σn/) σ. σ N/) σ lim σ σ is, i fact, the defiitio of the derivative ) σ d N = d dσ σ= dσ e σ)logn/) σ= = logn/) e σ)logn/) σ= = logn/). The the Product Rule for limits gives N σ σ lim σ σ = lim σ σ σ= σ= = logn/). lim σ Thus uder the limit of σ 2) becomes N ) N log. N 20 N/) σ σ σ=

6) Show that ) < p, 22) for all real x 3. Thus deduce that lim ) = 0. x p I which case we say that the ifiite product diverges. Hit Replace x by a iteger, look at the iverse of the product, ad use ideas ad results from the proof of Theorem.4. Later i the course we will show that, with a appropriate costat c, we have ) c p as x, where f x) gx) as x meas lim x f x)/gx) =. Solutio Let N = [x], so N x < N + ad ) = p p N p sice there are o itegers betwee x ad N. Cosider the iverse, whe p N ) = p N as see i the proof of Theorem.4. As also see i that proof N {,2,...,N} so logn +) >. N N Combiig all three displayed results we get ) < p. 2, ),

7) Let πx) =, the umber of primes less tha equal to x. The ifiitude of primes is equivalet to lim x πx) = Prove that πx) c for some costat c > 0. Justify each step i the followig argumet. With > a costat to be chose πx) < e 2, < p p 2 log log )) for a appropriate choice of. What is that choice ad why? Solutio With > a costat to be chose, we throw away some terms to get a lower boud: πx) = <. as The, we rearrage the lower coditio i the summatio, )/ < p p. This lower boud o ca be used as < < p = < p. 22

Write this sum as a differece of two ad replace the secod by the summatio over all itegers 2 /, p = p p < Usig Questios ad 2iii gives log log p p 2 )).. You ca see ow why we eeded results o sums over p x ad x with real x rather tha p N ad N for iteger N. This justifies Questios ad 2iii.) The log log x factors cacel, leavig πx) log. The costat is still to be chose. Try to choose it to maximise log )/. Though it is of iterest to derive a result o πx) = from the weighted sum /p, later i the course we will show that πx) > Cx/, for some costat C > 0, which is a far larger lower boud. 23