Solution to HW 3, Ma 1a Fall 2016

Similar documents
Method for Approximating Irrational Numbers

A proof of the binomial theorem

Auchmuty High School Mathematics Department Advanced Higher Notes Teacher Version

Σk=1. g r 3/2 z. 2 3-z. g 3 ( 3/2 ) g r 2. = 1 r = 0. () z = ( a ) + Σ. c n () a = ( a) 3-z -a. 3-z. z - + Σ. z 3, 5, 7, z ! = !

Math 301: The Erdős-Stone-Simonovitz Theorem and Extremal Numbers for Bipartite Graphs

Markscheme May 2017 Calculus Higher level Paper 3

k. s k=1 Part of the significance of the Riemann zeta-function stems from Theorem 9.2. If s > 1 then 1 p s

On a quantity that is analogous to potential and a theorem that relates to it

Physics 2A Chapter 10 - Moment of Inertia Fall 2018

(n 1)n(n + 1)(n + 2) + 1 = (n 1)(n + 2)n(n + 1) + 1 = ( (n 2 + n 1) 1 )( (n 2 + n 1) + 1 ) + 1 = (n 2 + n 1) 2.

6 PROBABILITY GENERATING FUNCTIONS

Chapter Eight Notes N P U1C8S4-6

Algebra. Substitution in algebra. 3 Find the value of the following expressions if u = 4, k = 7 and t = 9.

Lecture 28: Convergence of Random Variables and Related Theorems

PROBLEM SET #1 SOLUTIONS by Robert A. DiStasio Jr.

Chapter 3: Theory of Modular Arithmetic 38

16 Modeling a Language by a Markov Process

working pages for Paul Richards class notes; do not copy or circulate without permission from PGR 2004/11/3 10:50

When two numbers are written as the product of their prime factors, they are in factored form.

Numerical approximation to ζ(2n+1)

Divisibility. c = bf = (ae)f = a(ef) EXAMPLE: Since 7 56 and , the Theorem above tells us that

CHAPTER 3. Section 1. Modeling Population Growth

ON INDEPENDENT SETS IN PURELY ATOMIC PROBABILITY SPACES WITH GEOMETRIC DISTRIBUTION. 1. Introduction. 1 r r. r k for every set E A, E \ {0},

of the contestants play as Falco, and 1 6

arxiv: v1 [math.nt] 12 May 2017

Journal of Inequalities in Pure and Applied Mathematics

A Bijective Approach to the Permutational Power of a Priority Queue

9.1 The multiplicative group of a finite field. Theorem 9.1. The multiplicative group F of a finite field is cyclic.

3.1 Random variables

Motithang Higher Secondary School Thimphu Thromde Mid Term Examination 2016 Subject: Mathematics Full Marks: 100

A generalization of the Bernstein polynomials

Hopefully Helpful Hints for Gauss s Law

Question 1: The dipole

F-IF Logistic Growth Model, Abstract Version

2.5 The Quarter-Wave Transformer

A Short Combinatorial Proof of Derangement Identity arxiv: v1 [math.co] 13 Nov Introduction

A Relativistic Electron in a Coulomb Potential

arxiv: v1 [math.co] 4 May 2017

< 1. max x B(0,1) f. ν ds(y) Use Poisson s formula for the ball to prove. (r x ) x y n ds(y) (x B0 (0, r)). 1 nα(n)r n 1

The Substring Search Problem

STUDY OF SOLUTIONS OF LOGARITHMIC ORDER TO HIGHER ORDER LINEAR DIFFERENTIAL-DIFFERENCE EQUATIONS WITH COEFFICIENTS HAVING THE SAME LOGARITHMIC ORDER

Lecture 8 - Gauss s Law

MASSACHUSETTS INSTITUTE OF TECHNOLOGY Physics Department. Problem Set 10 Solutions. r s

Solutions to Problem Set 8

Brief summary of functional analysis APPM 5440 Fall 2014 Applied Analysis

arxiv: v1 [math.nt] 28 Oct 2017

Vanishing lines in generalized Adams spectral sequences are generic

Single Particle State AB AB

Stanford University CS259Q: Quantum Computing Handout 8 Luca Trevisan October 18, 2012

EM Boundary Value Problems

4. Some Applications of first order linear differential

Internet Appendix for A Bayesian Approach to Real Options: The Case of Distinguishing Between Temporary and Permanent Shocks

Physics 161 Fall 2011 Extra Credit 2 Investigating Black Holes - Solutions The Following is Worth 50 Points!!!

A Crash Course in (2 2) Matrices

AST 121S: The origin and evolution of the Universe. Introduction to Mathematical Handout 1

Lab 10: Newton s Second Law in Rotation

Lecture 16 Root Systems and Root Lattices

763620SS STATISTICAL PHYSICS Solutions 2 Autumn 2012

Determining solar characteristics using planetary data

Probablistically Checkable Proofs

QIP Course 10: Quantum Factorization Algorithm (Part 3)

C/CS/Phys C191 Shor s order (period) finding algorithm and factoring 11/12/14 Fall 2014 Lecture 22

Chapter 5 Linear Equations: Basic Theory and Practice

Macro Theory B. The Permanent Income Hypothesis

. Using our polar coordinate conversions, we could write a

Do Managers Do Good With Other People s Money? Online Appendix

10/04/18. P [P(x)] 1 negl(n).

Suggested Solutions to Homework #4 Econ 511b (Part I), Spring 2004

Scattering in Three Dimensions

RECTIFYING THE CIRCUMFERENCE WITH GEOGEBRA

MATH 417 Homework 3 Instructor: D. Cabrera Due June 30. sin θ v x = v r cos θ v θ r. (b) Then use the Cauchy-Riemann equations in polar coordinates

2 x 8 2 x 2 SKILLS Determine whether the given value is a solution of the. equation. (a) x 2 (b) x 4. (a) x 2 (b) x 4 (a) x 4 (b) x 8

Fractional Zero Forcing via Three-color Forcing Games

Berkeley Math Circle AIME Preparation March 5, 2013

Review: Electrostatics and Magnetostatics

PDF Created with deskpdf PDF Writer - Trial ::

Between any two masses, there exists a mutual attractive force.

Semicanonical basis generators of the cluster algebra of type A (1)

New problems in universal algebraic geometry illustrated by boolean equations

f h = u, h g = v, we have u + v = f g. So, we wish

The Chromatic Villainy of Complete Multipartite Graphs

A GENERALIZATION OF A CONJECTURE OF MELHAM. 1. Introduction The Fibonomial coefficient is, for n m 1, defined by

TANTON S TAKE ON CONTINUOUS COMPOUND INTEREST

Double-angle & power-reduction identities. Elementary Functions. Double-angle & power-reduction identities. Double-angle & power-reduction identities

Quasi-Randomness and the Distribution of Copies of a Fixed Graph

A Multivariate Normal Law for Turing s Formulae

ON LACUNARY INVARIANT SEQUENCE SPACES DEFINED BY A SEQUENCE OF MODULUS FUNCTIONS

I. CONSTRUCTION OF THE GREEN S FUNCTION

MASSACHUSETTS INSTITUTE OF TECHNOLOGY Physics Department Physics 8.07: Electromagnetism II September 15, 2012 Prof. Alan Guth PROBLEM SET 2

Circular Orbits. and g =

ON SPARSELY SCHEMMEL TOTIENT NUMBERS. Colin Defant 1 Department of Mathematics, University of Florida, Gainesville, Florida

Universal Gravitation

CALCULUS II Vectors. Paul Dawkins

CHAPTER 5 : SERIES. 5.2 The Sum of a Series Sum of Power of n Positive Integers Sum of Series of Partial Fraction Difference Method

So, if we are finding the amount of work done over a non-conservative vector field F r, we do that long ur r b ur =

4/18/2005. Statistical Learning Theory

Syntactical content of nite approximations of partial algebras 1 Wiktor Bartol Inst. Matematyki, Uniw. Warszawski, Warszawa (Poland)

On the ratio of maximum and minimum degree in maximal intersecting families

556: MATHEMATICAL STATISTICS I

Introduction Common Divisors. Discrete Mathematics Andrei Bulatov

Transcription:

Solution to HW 3, Ma a Fall 206 Section 2. Execise 2: Let C be a subset of the eal numbes consisting of those eal numbes x having the popety that evey digit in the decimal expansion of x is, 3, 5, o 7. Let {c n } be a sequence of elements of C so that c j < fo evey natual numbe j. Show that thee is a subsequence of {c n } which conveges to an element of C. Solution: Take C to be defined as above. We will begin ou poof with a shot lemma. Lemma: Given any x R \ C, thee exists an ɛ > 0 such that fo evey y (x ɛ, x + ɛ), one has that y / C as well. poof We suppose without loss of geneality that x (0, ) \ C, fo if not, we may apply essentially the same poof stating with the highest (nondecimal) place and coecting fo sign. Now, in paticula, we may wite that x =.x x 2 x 3... = x n 0, whee x n n lies between 0 and 9, inclusive, fo any n N. Given that x / C, we have that thee must exist a decimal place such that the value at that decimal place does not lie within {, 3, 5, 7}. Now, by well odeing, thee must be a minimal such decimal place, which we take to be the k-th decimal place. In othe wods, one has that c k / {, 3, 5, 7}, while fo any l such that 0 < l k, one has c l {, 3, 5, 7}. Now, conside ɛ =, 0 k+2 and select y =.y y 2 y 3... = y n 0 n (x 0 k+2, x + 0 k+2 ). We may suppose without loss of geneality that y < x, fo if y = x, we have automatically that y / C, and if y > x, then the poof woks moe o less identically with the subtaction in evese. Then we note that 0 < x y = x y = 0 n < 0 k+2. In paticula, we note that we must have fo all l such that 0 < l k that y l = x l, o y =.x x 2...x k y k y k+..., fo othewise we would have a contadiction, as the distance between them would be geate than. Thus, we in fact 0 k+2 have that x y = n=k 0 n < 0 k+2.

Now, futhemoe, if we have that y k = x k, then we have automatically that y / C, so suppose y k x k. Then, in fact, one must have that x k y k =, given that x > y and given that, if the diffeence between the x k and y k wee any lage, we would have x y > 0 k+2 which would be a contadiction. Thus, x y = 0 k + n=k+ 0 n < 0 k+2, which may only be the case if x k+ y k+ = 9. Given that x k+ and y k+ lie between 0 and 9, inclusive, this may only be the case if x k+ = 0 and y k+ = 9. Thus, as y k+ / {, 3, 5, 7}, we have that y / C. Indeed, we have that fo any y (x, x + ), one has y / C. 0 k+2 0 k+2 Now,taking C and {c n } as above, we note that by ou supposition, c n (, ) [, ] fo evey n N, so by the Bolzano-Weiestass theoem, thee exists a convegent subsequence of {c n }. Take {c nk } to be one such convegent subsequence, conveging to a limit c [.]. Now, suppose fo contadiction that c / C. By the lemma we poved above (estated slightly), thee must exist an ɛ > 0 such that fo evey d R such that c d < ɛ, one must have that d / C. Howeve, we note that since lim k c nk = c, thee exists a K N such that fo all k > K, one has that c c nk < ɛ, which immediately implies that fo evey k > K that c nk / C, which is a contadiction. Thus, one must have that c C. In fact, we have poven that, not only must thee exist a convegent subsequence of {c n }, but also that fo EVERY such convegent subsequence of {c n }, its limit must also lie in C. Section 2.2 Execise 2: Pove eithe that the following seies conveges o diveges: n 206 206 n. Solution: Consideing the seies n 206 206 n =, we note that = n206 206 n. fom hee, we apply the atio test. We see that + = (n + )206 206 n+ /(n + )! n 206 206 n = (n + )206 206 n+ (n + )206 / (n + )!n 206 = 206 206n (n + )n 206. Now, we know that (n + ) 206 = 206 ( 206 ) k=0 k n k is a polynomial in n of degee 206, wheeas (n + )n 206 = n 207 + n 206 is a polynomial in n of degee 207. Thus, as the degee of the polynomial in the denominato is geate than that of the polynomial in the numeato, we immediately see that lim + = lim 206 (n + ) 206 = 206 lim n n (n + )n206 2 n (n + ) 206 = 0. (n + )n206

Finally, as lim n an+ = 0 <, one has by the atio test that n 206 206 n = conveges (absolutely). Section 2.2 Execise 6: A 30 yea fixed ate motgage is a loan taken out ove a peiod of 360 months. The initial loan amount is M. Each month, the boowe pays a fixed payment p. We define a function f(j) whee j is the numbe of months that have passed. We let f(0) = M, and we let f(j) = ( + )f(j ) p, fo j 360, whee is the fixed monthly inteest ate. Futhe, we equie that f(360) = 0. Deive and pove a fomula fo p in tems of M and in closed fom. Hint: You ll have to use the fomula fo the sum of a finite geometic seies. It helps to eaange things so that you e setting equal the motgage amount M with inteest on it compounded ove 30 yeas and the steam of monthly payments each compounded fom the moment it is made. Solution: Recalling ou definition of f(j), we have that f(0) = M and f(j) = ( + )f(j ) p fo any j 0, whee M is ou initial loan amount, is ou fixed monthly inteest ate, j is the numbe of months that has passed, and p is ou fixed payment amount. Fo any j N, we may continue out the expansion fom befoe as f(j) = ( + )f(j ) p = ( + )(( + )f(j 2) p) p = ( + ) 2 f(j 2) [( + ) + ]p. = ( + ) 2 (( + )f(j 3) p) [( + ) + ]p = ( + ) 3 f(j 3) [( + ) 2 + ( + ) + ]p j = ( + ) j f(0) [( + ) j + ( + ) j 2 + + ( + ) + ]p = ( + ) j M ( ( + ) k )p Thus, invoking the fomula fo a finite geometic seies, we see that, in fact f(j) = ( + ) j M ( + )j p. Now, one has that f(360) = 0, so we have that ( + ) 360 M ( + )360 p = 0. Reaanging, we get that ( + ) 360 p = ( + ) 360 M, so dividing out fo the tem in font of p, we get ou desied expession: p = ( + )360 M ( + ) 360, 3 k=0

o, to simplify it a little, p = M ( + ) 360. Section 2.3 Execise : Show that the seies n n x n diveges fo all x such that x > 0. Solution: Letting S(x) = nn x n, one clealy has that S(0) = 0. Now, let x be such that x > 0. The easiest way to demonstate that nn x n diveges is actually to go back to the pevious section and invoke the ation test. Note that we have, in this case, = n n x n. Thus, we have that + = (n + )n+ x n+ n n x n = (n + )n+ n n x. Now, noting that n n < (n + ) n fo any n N, one has that, in fact + (n + )n+ = n n x = (n + )n n n (n + ) x > (n + ) x. Thus, using the Infinite Squeeze Theoem, one has that since and fo all n N, one has that lim (n + ) x = x lim (n + ) =, n n in fact, one must have that + > (n + ) x, lim + =. n Thus, invoking the atio test, we see that, since the ation diveges, and consequently lim n an+ >, one has that n n x n diveges fo all x such that x > 0. Section 2.3 Execise 3: Let { } be a sequence satisfying = 2 +3 2 fo n > 2 with a = and a 2 = 2. Following Example 3, find a ational function epesenting the powe seies x n.

What is the adius of convegence of this seies? Justify you answe. Hint: The sequence is just the sum of two geometic sequences. Solution: Conside the function x n, defined only fomally at the moment. Using the defining elations among the, we obtain that ( 2x 3x 2 ) ( 2x 3x 2 ) x n = x n 2 x n+ 3 x n+2 n=2 *eindexing* = x n 2 x n 3 2 x n *pulling out leading tems* = a x + a 2 x 2 + x n 2a x 2 2 x n 3 2 x n *plugging in a and a 2 values* = x + 2x 2 2x 2 + *noting the sum is zeo* = x. ( 2 3 2 )x n Thus, dividing though by 2x 3x 2, we see that x 2x 3x 2 = x ( 3x)( + x), and, afte applying the patial factions method, that ( 3x) ( + x). We may now apply the fomula fo the sum of a geometic seies to see that ( 3x) ( + x) = ( 3x + x ) = ( 3 n x n ( ) n x n ) 3 n ( ) n = x n 3 n ( ) n = x n, which implies that = 3n ( ) n, so is the sum of two geometic sequences, both of whose esulting seies convege if and only if x = x < and 3x = 3 x <, so one must have x < 3. Thus, the adius of convegence of the powe seies in question is R = 3. 5