HOMEWORK 5 SOLUTIONS. n!f n (1) lim. ln x n! + xn x. 1 = G n 1 (x). (2) k + 1 n. (n 1)!


 Charlene Allison
 1 years ago
 Views:
Transcription
1 Math 7 Fall 205 HOMEWORK 5 SOLUTIONS Problem B2 Let F 0 x = ln x. For n 0 and x > 0, let F n+ x = 0 F ntdt. Evaluate n!f n lim n ln n. By directly computing F n x for small n s, we obtain the following conjectural identity F n x = xn n! For convenience, let us define G n x = xn n! as F n x = G n x. For n 0 and x > 0 we note that G nx = xn n! = xn n! = = = + xn n! x + n =. for n 0 and x > 0, so that can be stated = xn n! n = = G n x. 2 We proceed by induction on n to prove, i.e. F n x = G n x. For n = 0, we immediately verify that G 0 x = ln x = F 0 x. For the inductive step, we assume that is true for n = m. This means that F m x = G m x, while 2 says that G m x = G m+x. Now we calculate F m+ x = 0 F m tdt = 0 G m tdt = lim r G m tdt = lim r G m+tdt = lim G m+ x G m+ r by the Fundamental Theorem of Calculus = G m+ x lim G m+ r In order to complete the inductive step, it remains to show that lim G m+ r = 0. This can be seen by r m writing G m+ r = m +! ln r m+ =. Note that as r goes to 0, the fisrt factor clearly converges to 0 /r whereas the second factor also converges to 0 by L Hopital s rule.
2 Math 7 Fall 205 Now says that n!f n = following inequalities: = = =. Since fx = x n = + n + Hence we have that + ln n ln n =2 n + = n!f n ln n x = =2 n+ x is strictly decreasing for x > 0, we obtain the n x = + = + ln n, x = lnn + > ln n. < ln n =. Since lim + ln n =, we deduce that ln n n ln n n!f n lim =. n ln n Problem A2 Let a, a 2, and b, b 2, be sequences of positive real numbers such that a = b = and b n = b n a n 2 for n = 2, 3,. Assume that the sequence b j is bounded. Prove that converges, and evaluate S. S = a a n n= The relation b n = b n a n 2 for n = 2, 3, can be written as a n = b n + 2 b n. Then for n = 2, 3,, = a a n a a 2 a n = a b b 2 b n b 2 + 2b b n + 2 = 3 b b 2 b n b + 2 b 2 + 2b b n + 2 since a = b = 3b b 2 b n = b + 2b b n + 2 = 3 b b 2 b n b n b + 2b b n + 2 b b 2 b n b n b + 2b b n + 2 = 3 b b 2 b n 2 b + 2b b n + 2 b b 2 b n b n b + 2b b n + 2 b b 2 b n b n For convenience, set c n = for n =, 2,, so that the above identity can be b + 2b b n + 2 written as = 3 a a n 2 c n c n for n = 2, 3,. Then for every positive integer m, we have n= a a 2 a n = a + n=2 a a 2 a n = c n c n = c c m = 3 2 c m, 3 n=2
3 Math 7 Fall 205 where the last identity follows by the fact that c = 3. Note that c m is clearly positive by construction since b, b 2, are all positive. We also now that the sequence b j is bounded by some number M > 0. Now observe that 0 < c m = b b + 2 b 2 b b m b m + 2 = + 2/b + 2/b 2 < + 2/b m + 2/M m. Since + 2/M converges to 3 2. >, this implies that lim m c m = 0. Thus we deduce from 3 that S = n= a a n Problem A3 Let, 2, 3,, 2005, 2006, 2007, 2009, 202, 206, be a sequence defined by x = for =, 2,, 2006 and x + = x + x 2005 for Show that the sequence has 2005 consecutive terms each divisible by Define a sequence y by y = 0 for =, 2,, 2005, y 2006 = and y + = y + y 2005 for Then we can easily compute y 2006 = y 2007 = = y 40 =, y 402 = 2, y 403 = 3,, y 607 = In particular, we have that y 40 = x, y 402 = x 2,, y 607 = x Now an easy strong induction shows that x = y +400 for =, 2,. Note that y is clearly a sequence of integers, so Useful Facts 2 from Lecture 5 see the remar below says that the sequence is periodic modulo In particular, since y, y 2,, y 2005 are all zero and therefore divisible by 2006, there exist infinitely many integers such that y +, y +2,, y are all divisible by Choose such a with 40, then x 4009 = y +, x 4008 = y +2,, x 2005 = y are all divisible by Remar. For the sae of completeness, we state and prove Useful Facts 2 from Lecture 5. Lemma. If x n is a sequence of integers satisfying a linear recurrence x n = a x n +a 2 x n 2 + +a x n, then x n is a periodic sequence in modulo m for every integer m. Proof. Without loss of generality, we may assume that a 0. Consider the vectors of the form x n, x n+,, x n+. Note that there are only finitely many such vectors modulo m, so there exist integers p and N such that x N+p, x N++p,, x N+ +p x N, x N+,, x N+ mod m. 4
4 Math 7 Fall 205 We claim that x n+p x n mod m for all n. It suffices to prove that the following holds for all n: x n+p, x n++p,, x n+ +p x n, x n+,, x n+ mod m. 5 We proceed by the twoway induction on n. The case when n = N is given by 4. For the inductive step, we assume that 5 holds for n = r. We wish to prove that 5 holds for n = r and n = r +. For n = r +, it suffices to prove that x r++p x r+ mod m. This can be seen by x r++p = a x r+ +p + a 2 x r+ 2+p + + a x r+p a x r+ + a 2 x r a x r mod m by recursion by the induction hypothesis = x r+ by recursion For n = r, it suffices to prove that x r +p x r mod m. This can be seen by x r +p = a x r+ +p a x r+ 2+p a x r+p by recursion a x r+ a x r+ 2 a x r mod m by the induction hypothesis = x r by recursion Problem B3 Let x 0 = and for n 0, let x n+ = 3x n + x n 5. In particular, x = 5, x 2 = 26, x 3 = 36, x 4 = 72. Find a closedform expression for x a means the largest integer a. Note that x n is an integer for n = 0,, 2,. By definition of the floor function, we have the following inequality for n 0: x n 5 < xn 5 xn 5. 6 Then the recursion x n+ = 3x n + x n 5 gives an inequality 3 + 5xn < x n x n. Multiplying by 3 5 yields 4x n 3 5 < 3 5x n+ 4x n. 7
5 Math 7 Fall 205 Now observe that for n =, 2,, x n+ 6x n = 3x n + x n 5 3 5xn < 4x n < 4x n +, x n+ 6x n = 3x n + x n 5 > 3 5xn 4x n where in each line, the first and the second inequality respectively follow from 6 and 7. Hence we have that 4x n < x n+ 6x n < 4x n + for n =, 2,. Since x n+ 6x n is an integer, the only possibility is that x n+ 6x n = 4x n. In other words, we have the following recurrence for n : x n+ = 6x n 4x n. 8 The characteristic polynomial x 2 6x + 4 has two roots 3 ± 5, so there exist constants c and d such that x n = c3 + 5 n + d3 5 n for n = 0,, 2,. Substituiting n = 0 and n =, we obtain a system of equations = c + d and 5 = c d3 5, which can be solved by c = , d = Hence 8 yields the following expression of x 2007 : 0 0 x 2007 =
CONTINUED FRACTIONS AND PELL S EQUATION. Contents 1. Continued Fractions 1 2. Solution to Pell s Equation 9 References 12
CONTINUED FRACTIONS AND PELL S EQUATION SEUNG HYUN YANG Abstract. In this REU paper, I will use some important characteristics of continued fractions to give the complete set of solutions to Pell s equation.
More informationMath 2602 Finite and Linear Math Fall 14. Homework 9: Core solutions
Math 2602 Finite and Linear Math Fall 14 Homework 9: Core solutions Section 8.2 on page 264 problems 13b, 27a27b. Section 8.3 on page 275 problems 1b, 8, 10a10b, 14. Section 8.4 on page 279 problems
More informationLecture 24Section 11.4 Absolute and Conditional
Lecture 4Section.4 Absolute and Conditional Convergence; Alternating Series Jiwen He Convergence Tests Basic Series that Converge or Diverge Basic Series that Converge Geometric series: pseries: x, if
More informationSome Notes on Taylor Polynomials and Taylor Series
Some Notes on Taylor Polynomials and Taylor Series Mark MacLean October 3, 27 UBC s courses MATH /8 and MATH introduce students to the ideas of Taylor polynomials and Taylor series in a fairly limited
More informationContinued Fractions and the Euclidean Algorithm
Continued Fractions and the Euclidean Algorithm Lecture notes prepared for MATH 326, Spring 997 Department of Mathematics and Statistics University at Albany William F Hammond Table of Contents Introduction
More informationLectures 56: Taylor Series
Math 1d Instructor: Padraic Bartlett Lectures 5: Taylor Series Weeks 5 Caltech 213 1 Taylor Polynomials and Series As we saw in week 4, power series are remarkably nice objects to work with. In particular,
More informationMATH 289 PROBLEM SET 1: INDUCTION. 1. The induction Principle The following property of the natural numbers is intuitively clear:
MATH 89 PROBLEM SET : INDUCTION The induction Principle The following property of the natural numbers is intuitively clear: Axiom Every nonempty subset of the set of nonnegative integers Z 0 = {0,,, 3,
More informationFibonacci and the Golden Mean
Fibonacci and the Golden Mean by: Joshua Wood In the above spreadsheet shows, the first column is the Fibonacci sequence, F i+ = F i + F i, with F 0 = F =. The second column shows the ratios of successive
More informationa n. n=1 m=0 (b n b n 1 ), n=1
Lecture 5 Infinite Series In today s lecture, we will restrict our attention to infinite series, which we will view as special kinds of sequences. We will bring what we learned about convergence of sequence
More informationLecture 2: Linear Algebra and Fourier Series.
Lecture : Linear Algebra and Fourier Series. 1 Introduction. At the beginning of the first lecture we gave the definition of Fourier series. Here we begin with the same definition: Definition 1.1 The Fourier
More informationSequences and Summations. Andreas Klappenecker
Sequences and Summations Andreas Klappenecker Sequences Sequences A sequence is a function from a subset of the set of integers (such as {0,1,2,...} or {1,2,3,...}) to some set S. We use the notation a
More informationMath 115 Spring 2014 Written Homework 3 Due Wednesday, February 19
Math 11 Spring 01 Written Homework 3 Due Wednesday, February 19 Instructions: Write complete solutions on separate paper (not spiral bound). If multiple pieces of paper are used, they must be stapled with
More informationMath 1B, lecture 14: Taylor s Theorem
Math B, lecture 4: Taylor s Theorem Nathan Pflueger 7 October 20 Introduction Taylor polynomials give a convenient way to describe the local behavior of a function, by encapsulating its first several derivatives
More informationMERSENNE PRIMES SARAH MEIKLEJOHN AND STEVEN J. MILLER. 4 if i = 0, s i =
MERSENNE PRIMES SARAH MEIKLEJOHN AND STEVEN J. MILLER ABSTRACT. A Mersenne prime is a prime that can be written as 2 p 1 for some prime p. The first few Mersenne primes are 3, 7 and 31 (corresponding respectively
More informationTHE PRIMITIVE ROOT THEOREM Amin Witno
WON Series in Discrete Mathematics and Modern Algebra Volume 5 THE PRIMITIVE ROOT THEOREM Amin Witno Abstract A primitive root g modulo n is when the congruence g x 1 (mod n) holds if x = ϕ(n) but not
More informationAlthough the exam is not supposed to be cummulative, you are still responsible for all of the information that we have covered in the course.
Calculus 2  Examination II PRIOR INFORMATION: Although the exam is not supposed to be cummulative, you are still responsible for all of the information that we have covered in the course. As Improper
More information1. Please write your name in the blank above, and sign & date below. 2. Please use the space provided to write your solution.
Name : Instructor: Marius Ionescu Instructions: 1. Please write your name in the blank above, and sign & date below. 2. Please use the space provided to write your solution. 3. If you need extra pages
More informationDiscrete Mathematics: Homework 7 solution. Due: 2011.6.03
EE 2060 Discrete Mathematics spring 2011 Discrete Mathematics: Homework 7 solution Due: 2011.6.03 1. Let a n = 2 n + 5 3 n for n = 0, 1, 2,... (a) (2%) Find a 0, a 1, a 2, a 3 and a 4. (b) (2%) Show that
More informationSample Induction Proofs
Math 3 Worksheet: Induction Proofs III, Sample Proofs A.J. Hildebrand Sample Induction Proofs Below are model solutions to some of the practice problems on the induction worksheets. The solutions given
More informationExample. (A sequence defined by induction or defined recursively ) a 1 = 1 = 1/1 and if a n = b n /c n where b n, c n Z, then
Chapter 2: (Infinite) Sequences and Series A(n infinite) sequence is a list of numbers a 1, a 2, a 3,..., indexed by N (or a 0, a 1, a 2, a 3,..., indexed by the nonnegative integers N 0 ) so there is
More informationTaylor Polynomials and Taylor Series Math 126
Taylor Polynomials and Taylor Series Math 26 In many problems in science and engineering we have a function f(x) which is too complicated to answer the questions we d like to ask. In this chapter, we will
More informationON THE FIBONACCI NUMBERS
ON THE FIBONACCI NUMBERS Prepared by Kei Nakamura The Fibonacci numbers are terms of the sequence defined in a quite simple recursive fashion. However, despite its simplicity, they have some curious properties
More informationI. Pointwise convergence
MATH 40  NOTES Sequences of functions Pointwise and Uniform Convergence Fall 2005 Previously, we have studied sequences of real numbers. Now we discuss the topic of sequences of real valued functions.
More informationFACTORING POLYNOMIALS IN THE RING OF FORMAL POWER SERIES OVER Z
FACTORING POLYNOMIALS IN THE RING OF FORMAL POWER SERIES OVER Z DANIEL BIRMAJER, JUAN B GIL, AND MICHAEL WEINER Abstract We consider polynomials with integer coefficients and discuss their factorization
More informationMath 55: Discrete Mathematics
Math 55: Discrete Mathematics UC Berkeley, Spring 2012 Homework # 9, due Wednesday, April 11 8.1.5 How many ways are there to pay a bill of 17 pesos using a currency with coins of values of 1 peso, 2 pesos,
More informationSequences. Chapter 3. n + 1 3n + 2 sin n n. 3. lim (ln(n + 1) ln n) 1. lim. 2. lim. 4. lim (1 + n)1/n. Answers: 1. 1/3; 2. 0; 3. 0; 4. 1.
Chapter 3 Sequences Both the main elements of calculus (differentiation and integration) require the notion of a limit. Sequences will play a central role when we work with limits. Definition 3.. A Sequence
More information3.1. Sequences and Their Limits Definition (3.1.1). A sequence of real numbers (or a sequence in R) is a function from N into R.
CHAPTER 3 Sequences and Series 3.. Sequences and Their Limits Definition (3..). A sequence of real numbers (or a sequence in R) is a function from N into R. Notation. () The values of X : N! R are denoted
More informationCS 103X: Discrete Structures Homework Assignment 3 Solutions
CS 103X: Discrete Structures Homework Assignment 3 s Exercise 1 (20 points). On wellordering and induction: (a) Prove the induction principle from the wellordering principle. (b) Prove the wellordering
More informationIntroduction. Appendix D Mathematical Induction D1
Appendix D Mathematical Induction D D Mathematical Induction Use mathematical induction to prove a formula. Find a sum of powers of integers. Find a formula for a finite sum. Use finite differences to
More informationMultiple Choice Questions for Review
Review Questions Multiple Choice Questions for Review In each case there is one correct answer (given at the end of the problem set). Try to work the problem first without looking at the answer. Understand
More informationMATH 201: LIMITS. a k+1 = 1.04a k
MATH 0: LIMITS. Sequences Definition (Sequences). A sequence a n is a realvalued function () T R; n a n whose domain T is an inductive subset of the set N of natural numbers. Definition (Terms of a sequence).
More informationTaylor Polynomials and Taylor Series
Contents Taylor Polynomials and Taylor Series Taylor Polynomials... Example... Example... 4 Example.3... 5 Exercises... 6 Exercise Solutions... 8 Taylor s Inequality... Example... Example... Exercises...3
More informationPHYSICS 116A Homework 1 Solutions. The distance traveled in 10 bounces (i.e. to reach the maximum height after the 10th bounce) is
. The total distance is + ( 4 + PHYSICS 6A Homework Solutions ( ) + ) = + (/4) = +6 = 7m. 4 /4 The distance traveled in bounces (i.e. to reach the maximum height after the th bounce) is [ ( ) ( ) ] 9 (
More informationLimits at Infinity Limits at Infinity for Polynomials Limits at Infinity for the Exponential Function Function Dominance More on Asymptotes
Lecture 5 Limits at Infinity and Asymptotes Limits at Infinity Horizontal Asymptotes Limits at Infinity for Polynomials Limit of a Reciprocal Power The End Behavior of a Polynomial Evaluating the Limit
More informationMATH 209: PROOF OF EXISTENCE / UNIQUENESS THEOREM FOR FIRST ORDER DIFFERENTIAL EQUATIONS
MATH 29: PROOF OF EXISTENCE / UNIQUENESS THEOREM FOR FIRST ORDER DIFFERENTIAL EQUATIONS INSTRUCTOR: STEVEN MILLER Abstract. We highlight the proof of Theorem 2.8.1, the existence / uniqueness theorem for
More informationCh 5.6: Series Solutions Near a Regular Singular Point, Part I
Ch 5.6: Series Solutions Near a Regular Singular Point, Part I! We now consider solving the general second order linear equation in the neighborhood of a regular singular point x 0. For convenience, will
More informationThe Real Numbers. Here we show one way to explicitly construct the real numbers R. First we need a definition.
The Real Numbers Here we show one way to explicitly construct the real numbers R. First we need a definition. Definitions/Notation: A sequence of rational numbers is a funtion f : N Q. Rather than write
More informationMATH : HONORS CALCULUS3 HOMEWORK 6: SOLUTIONS
MATH 1630033: HONORS CALCULUS3 HOMEWORK 6: SOLUTIONS 251 Find the absolute value and argument(s) of each of the following. (ii) (3 + 4i) 1 (iv) 7 3 + 4i (ii) Put z = 3 + 4i. From z 1 z = 1, we have
More informationElementary Inversion of the Laplace Transform
Elementary Inversion of the Laplace Transform Kurt Bryan 1 Abstract. This paper provides an elementary derivation of a very simple closedform inversion formula for the Laplace Transform. Key words. Laplace
More informationPower Series. Chapter Introduction
Chapter 6 Power Series Power series are one of the most useful type of series in analysis. For example, we can use them to define transcendental functions such as the exponential and trigonometric functions
More information4.3 Limit of a Sequence: Theorems
4.3. LIMIT OF A SEQUENCE: THEOREMS 5 4.3 Limit of a Sequence: Theorems These theorems fall in two categories. The first category deals with ways to combine sequences. Like numbers, sequences can be added,
More informationPOSITIVE INTEGERS, INTEGERS AND RATIONAL NUMBERS OBTAINED FROM THE AXIOMS OF THE REAL NUMBER SYSTEM
MAT 1011 TECHNICAL ENGLISH I 03.11.2016 Dokuz Eylül University Faculty of Science Department of Mathematics Instructor: Engin Mermut Course assistant: Zübeyir Türkoğlu web: http://kisi.deu.edu.tr/engin.mermut/
More informationa 11 x 1 + a 12 x 2 + + a 1n x n = b 1 a 21 x 1 + a 22 x 2 + + a 2n x n = b 2.
Chapter 1 LINEAR EQUATIONS 1.1 Introduction to linear equations A linear equation in n unknowns x 1, x,, x n is an equation of the form a 1 x 1 + a x + + a n x n = b, where a 1, a,..., a n, b are given
More informationLecture 13  Basic Number Theory.
Lecture 13  Basic Number Theory. Boaz Barak March 22, 2010 Divisibility and primes Unless mentioned otherwise throughout this lecture all numbers are nonnegative integers. We say that A divides B, denoted
More informationPUTNAM TRAINING NUMBER THEORY. Exercises 1. Show that the sum of two consecutive primes is never twice a prime.
PUTNAM TRAINING NUMBER THEORY (Last updated: November 8, 2016) Remark. This is a list of exercises on Number Theory. Miguel A. Lerma Exercises 1. Show that the sum of two consecutive primes is never twice
More information3 More Algebra: Progressions and Binomial Theorem
MATH1983/1954 Mathematics 0C/1C. General information for the academic year 01013: Lecturer: Dr Theodore Voronov, Room.109, School of Mathematics, Alan Turing Building, email: theodore.voronov@manchester.ac.uk.
More information1 Randomness and Probabilistic Turing Machines
CS 6505: Complexity and Algorithms Lecture Notes for Week 9 Randomness 1 Randomness and Probabilistic Turing Machines We consider a new resource for computation in addition to space and time: randomness
More informationH/wk 13, Solutions to selected problems
H/wk 13, Solutions to selected problems Ch. 4.1, Problem 5 (a) Find the number of roots of x x in Z 4, Z Z, any integral domain, Z 6. (b) Find a commutative ring in which x x has infinitely many roots.
More informationSolutions of Equations in One Variable. FixedPoint Iteration II
Solutions of Equations in One Variable FixedPoint Iteration II Numerical Analysis (9th Edition) R L Burden & J D Faires Beamer Presentation Slides prepared by John Carroll Dublin City University c 2011
More informationLecture VI. Review of even and odd functions Definition 1 A function f(x) is called an even function if. f( x) = f(x)
ecture VI Abstract Before learning to solve partial differential equations, it is necessary to know how to approximate arbitrary functions by infinite series, using special families of functions This process
More informationIntroduction to Series and Sequences Math 121 Calculus II D Joyce, Spring 2013
Introduction to Series and Sequences Math Calculus II D Joyce, Spring 03 The goal. The main purpose of our study of series and sequences is to understand power series. A power series is like a polynomial
More informationROB EBY Blinn College Mathematics Department
Sequences In mathematics the word sequence is employed to convey the idea of a set of things arranged in order. That is, a sequence is a list of numbers. Each number in the sequence is called a term. If
More informationLinear Congruences. The subject of this lecture is how to solve any linear congruence. ax b (mod m)
Linear Congruences In ordinary algebra, an equation of the form ax = b (where a and b are given real numbers) is called a linear equation, and its solution x = b/a is obtained by multiplying both sides
More informationa i (X α) i, a i C. i=0 This also works naturally for the integers: given a positive integer m and a prime p, we can write it in base p, that is m =
Chapter 5 padic numbers The padic numbers were first introduced by the German mathematician K. Hensel (though they are foreshadowed in the work of his predecessor E. Kummer). It seems that Hensel s main
More informationFibonacci Numbers (Handout January, 2016)
Fibonacci Numbers (Handout January, 06) This document summarizes the introduction to Fibonacci numbers presented during our first week of semester. This quick introduction is intended to highlight some
More informationMATH 56A SPRING 2008 STOCHASTIC PROCESSES 31
MATH 56A SPRING 2008 STOCHASTIC PROCESSES 3.3. Invariant probability distribution. Definition.4. A probability distribution is a function π : S [0, ] from the set of states S to the closed unit interval
More informationMA131  Analysis 1. Workbook 4 Sequences III
MA3  Analysis Workbook 4 Sequences III Autumn 2008 Contents 2.3 Roots................................. 2.4 Powers................................. 3 2.5 * Application  Factorials *.....................
More informationMath 115 Spring 11 Written Homework 12 Solutions
Math 5 Spring Written Homework Solutions. Consider f(x) := (x ) (x + ). (a) What is the domain of f? Justify your answer. Solution: Since f is a polynomial, we know that the domain of f is all of R. (b)
More informationConvergence and Divergence of some Basic Series nth Term Test for Divergence: (the series aren't necessarily basic, but the test is) Given a series X
Convergence and Divergence of Series Definition of an Infinite Series: Given a sequence of numbers fa n g, an expression of the form a k = a + a 2 + a 3 + +a n + is an infinite series. The number a n is
More informationLecture 3: Fourier Series: pointwise and uniform convergence.
Lecture 3: Fourier Series: pointwise and uniform convergence. 1. Introduction. At the end of the second lecture we saw that we had for each function f L ([, π]) a Fourier series f a + (a k cos kx + b k
More informationSolutions series for some nonharmonic motion equations
Fifth Mississippi State Conference on Differential Equations and Computational Simulations, Electronic Journal of Differential Equations, Conference 10, 2003, pp 115 122. http://ejde.math.swt.edu or http://ejde.math.unt.edu
More informationMath 117: Infinite Sequences
Math 117: Infinite Sequences John Douglas Moore November 3, 2010 We next describe how the BolzanoWeierstrass Theorem which in turn is an immediate consequence of the HeineBorel Theorem) can be used to
More information1 nx 2n dx, n 2/3 = n 1 3.
MATH 433/533, Fourier Analysis Section 7, L 2 convergence of Fourier Series In the last section we investigated the convergence of the Fourier series for a function f at a single point x, socalled pointwise
More informationMath 135 Algebra Midterm Solutions
Math 135  Midterm Examination 1 Math 135 Algebra Midterm Solutions Question 1. (a) [4 marks] Consider the following two statements: x y(p (x) = Q(y)), and ( x P (x)) = ( y Q(y)) Give an example of a universe
More informationMethod To Solve Linear, Polynomial, or Absolute Value Inequalities:
Solving Inequalities An inequality is the result of replacing the = sign in an equation with ,, or. For example, 3x 2 < 7 is a linear inequality. We call it linear because if the < were replaced with
More informationLecture Notes for Numerical Methods (MA5625)
Lecture Notes for Numerical Methods (MA565) Weiwei Sun Chapter One Numerical Solution of Nonlinear Equations 1.1 Introduction This chapter is devoted to the problem of locating roots of equations(or zeros
More informationMath 55: Discrete Mathematics
Math 55: Discrete Mathematics UC Berkeley, Fall 2011 Homework # 5, due Wednesday, February 22 5.1.4 Let P (n) be the statement that 1 3 + 2 3 + + n 3 = (n(n + 1)/2) 2 for the positive integer n. a) What
More informationThe Greatest Integer function.
The Greatest Integer function Definition For a real number x, denote by x the largest integer less than or equal to x A couple of trivial facts about x: x is the unique integer satisfying x 1 < x x x x
More informationZero: If P is a polynomial and if c is a number such that P (c) = 0 then c is a zero of P.
MATH 11011 FINDING REAL ZEROS KSU OF A POLYNOMIAL Definitions: Polynomial: is a function of the form P (x) = a n x n + a n 1 x n 1 + + a x + a 1 x + a 0. The numbers a n, a n 1,..., a 1, a 0 are called
More informationx a x 2 (1 + x 2 ) n.
Limits and continuity Suppose that we have a function f : R R. Let a R. We say that f(x) tends to the limit l as x tends to a; lim f(x) = l ; x a if, given any real number ɛ > 0, there exists a real number
More informationSubsequences of the Fibonacci Sequence
Subsequences of the Fibonacci Sequence William H. Richardson Wichita State University 1 The Fibonacci and Lucas Numbers In this note, we will develop a collection of sequences each of which is a subsequence
More informationSeries Convergence Tests Math 122 Calculus III D Joyce, Fall 2012
Some series converge, some diverge. Series Convergence Tests Math 22 Calculus III D Joyce, Fall 202 Geometric series. We ve already looked at these. We know when a geometric series converges and what it
More informationCourse Notes for Math 162: Mathematical Statistics Approximation Methods in Statistics
Course Notes for Math 16: Mathematical Statistics Approximation Methods in Statistics Adam Merberg and Steven J. Miller August 18, 6 Abstract We introduce some of the approximation methods commonly used
More informationMATH 304 Linear Algebra Lecture 11: Basis and dimension.
MATH 304 Linear Algebra Lecture 11: Basis and dimension. Linear independence Definition. Let V be a vector space. Vectors v 1,v 2,...,v k V are called linearly dependent if they satisfy a relation r 1
More informationSection 3 Sequences and Limits, Continued.
Section 3 Sequences and Limits, Continued. Lemma 3.6 Let {a n } n N be a convergent sequence for which a n 0 for all n N and it α 0. Then there exists N N such that for all n N. α a n 3 α In particular
More informationSequences and Series
Contents 6 Sequences and Series 6. Sequences and Series 6. Infinite Series 3 6.3 The Binomial Series 6 6.4 Power Series 3 6.5 Maclaurin and Taylor Series 40 Learning outcomes In this Workbook you will
More informationPrime Numbers. p 1 p 2 p n + 1.
Prime Numbers 7192006 A prime number is an integer n > 1 whose only positive divisors are 1 and n. An integer greater than 1 which is not prime is composite. Euclid showed that there are infinitely many
More informationSeries Solutions Near a Regular Singular Point
Series Solutions Near a Regular Singular Point We will now consider solving the equation P (x)y + Q(x)y + R(x)y = 0 (1) in the neighborhood of a regular singular point x 0. For convenience, we ll assume
More informationEvery Positive Integer is the Sum of Four Squares! (and other exciting problems)
Every Positive Integer is the Sum of Four Squares! (and other exciting problems) Sophex University of Texas at Austin October 18th, 00 Matilde N. Lalín 1. Lagrange s Theorem Theorem 1 Every positive integer
More informationUniform continuity on unbounded intervals: classroom notes
International Journal of Mathematical Education in Science and Technology, Vol. 00, No. 00, 00 Month 200x, 1 6 Uniform continuity on unbounded intervals: classroom notes RODRIGO LÓPEZ POUSO Department
More informationContinued fractions. Yann BUGEAUD. x 1 + and, more generally, we call any expression of the above form or of the form
Continued fractions Yann BUGEAUD Let x 0, x,... be real numbers with x, x 2,... positive. A finite continued fraction denotes any expression of the form [x 0 ; x, x 2..., x n ] = x 0 + x + x 2 +... + x
More informationProbability Generating Functions
page 39 Chapter 3 Probability Generating Functions 3 Preamble: Generating Functions Generating functions are widely used in mathematics, and play an important role in probability theory Consider a sequence
More informationLECTURE 21. This next result clarifies the degree of the polynomial describing the Hilbert function of a graded module.
LECTURE 21 1. The HilbertSamuel function This next result clarifies the degree of the polynomial describing the Hilbert function of a graded module. Theorem 1.1. (Hilbert polynomial Let be a finitely
More informationHomework # 3 Solutions
Homework # 3 Solutions February, 200 Solution (2.3.5). Noting that and ( + 3 x) x 8 = + 3 x) by Equation (2.3.) x 8 x 8 = + 3 8 by Equations (2.3.7) and (2.3.0) =3 x 8 6x2 + x 3 ) = 2 + 6x 2 + x 3 x 8
More informationCYCLICITY OF (Z/(p))
CYCLICITY OF (Z/(p)) KEITH CONRAD 1. Introduction For any prime p, the group (Z/(p)) is cyclic. We will give six proofs of this fundamental result. A common feature of the proofs that (Z/(p)) is cyclic
More informationLimits and Continuity
Math 20C Multivariable Calculus Lecture Limits and Continuity Slide Review of Limit. Side limits and squeeze theorem. Continuous functions of 2,3 variables. Review: Limits Slide 2 Definition Given a function
More informationAlgebra 2 REVERSE CORRELATION. Math Grade 11 Assessment Anchors and Eligible Content. Pennsylvania. Unit 1 Linear Relations and Functions
Math Grade 11 Assessment Anchors and Pennsylvania Algebra 2 2010 REVERSE CORRELATION CHAPTER/LESSON TITLES Unit 1 Linear Relations and Functions Chapter 1 Equations and Inequalities 11 Expressions and
More informationCONTINUED FRACTIONS, PELL S EQUATION, AND TRANSCENDENTAL NUMBERS
CONTINUED FRACTIONS, PELL S EQUATION, AND TRANSCENDENTAL NUMBERS JEREMY BOOHER Continued fractions usually get shortchanged at PROMYS, but they are interesting in their own right and useful in other areas
More informationALGORITHMS AND COMPLEXITY THEORY
ALGORITHMS AND COMPLEXITY THEORY Chapter 2: Induction and Recursion JulesR Tapamo Computer Science Durban  February 2010 Contents 1 The principle of induction 2 2 recursive procedures 2 2.1 Principles..........................................
More informationHomework until Test #2
MATH31: Number Theory Homework until Test # Philipp BRAUN Section 3.1 page 43, 1. It has been conjectured that there are infinitely many primes of the form n. Exhibit five such primes. Solution. Five such
More information6. Metric spaces. In this section we review the basic facts about metric spaces. d : X X [0, )
6. Metric spaces In this section we review the basic facts about metric spaces. Definitions. A metric on a nonempty set X is a map with the following properties: d : X X [0, ) (i) If x, y X are points
More informationSQUARE PATTERNS AND INFINITUDE OF PRIMES
SQUARE PATTERNS AND INFINITUDE OF PRIMES KEITH CONRAD 1. Introduction Numerical data suggest the following conjectures for prime numbers p: 1 mod p p = 2 or p 1 mod 4, 2 mod p p = 2 or p 1, 7 mod 8, 2
More information4.7. Taylor and MacLaurin Series
4.7. TAYLOR AND MACLAURIN SERIES 0 4.7. Taylor and MacLaurin Series 4.7.. Polynomial Approximations. Assume that we have a function f for which we can easily compute its value f(a) at some point a, but
More informationInner Product Spaces
Math 571 Inner Product Spaces 1. Preliminaries An inner product space is a vector space V along with a function, called an inner product which associates each pair of vectors u, v with a scalar u, v, and
More informationMATH 10550, EXAM 2 SOLUTIONS. x 2 + 2xy y 2 + x = 2
MATH 10550, EXAM SOLUTIONS (1) Find an equation for the tangent line to at the point (1, ). + y y + = Solution: The equation of a line requires a point and a slope. The problem gives us the point so we
More informationAnswer Key for California State Standards: Algebra I
Algebra I: Symbolic reasoning and calculations with symbols are central in algebra. Through the study of algebra, a student develops an understanding of the symbolic language of mathematics and the sciences.
More informationNewton s Method for Unconstrained Optimization
Newton s Method for Unconstrained Optimization Robert M. Freund February, 24 24 Massachusetts Institute of Technology. Newton s Method Suppose we want to solve: (P:) min f (x) At x = x, f (x) can be approximated
More informationFurther linear algebra. Chapter I. Integers.
Further linear algebra. Chapter I. Integers. Andrei Yafaev Number theory is the theory of Z = {0, ±1, ±2,...}. 1 Euclid s algorithm, Bézout s identity and the greatest common divisor. We say that a Z divides
More informationAdditional Problems for An Invitation to Modern Number Theory
Additional Problems for An Invitation to Modern Number Theory Steven J. Miller and Ramin TaklooBighash June 16, 2007 Abstract Below are some addition problems for An Invitation to Modern Number Theory.
More informationThe Fibonacci Sequence and Recursion
The Fibonacci Sequence and Recursion (Handout April 6, 0) The Fibonacci sequence,,,3,,8,3,,34,,89,44,... is defined recursively by {, for n {0,}; F n = F n + F n, for n. Note that the first two terms in
More information