(3n 2) = (3n 2) = 1(3 1) 2 1 = (3k 2) =


 Amos Willis
 1 years ago
 Views:
Transcription
1 Question 1 Prove using mathematical induction that for all n 1, Solution (n ) = n(n 1) For any integer n 1, let P n be the statement that (n ) = n(n 1) Base Case The statement P 1 says that which is true 1 = 1( 1), Inductive Step Fix k 1, and suppose that P k holds, that is, (k ) = k(k 1) It remains to show that P k+1 holds, that is, ((k + 1) ) = (k + 1)((k + 1) 1) Therefore P k+1 holds ((k + 1) ) = ((k + 1) ) = (k + 1) = (k ) + (k + 1) k(k 1) = + (k + 1) k(k 1) + (k + 1) = = k k + 6k + ) = k + k + ) (k + 1)(k + ) = (k + 1)((k + 1) 1) = Thus, by the principle of mathematical induction, for all n 1, P n holds
2 Question Use the Principle of Mathematical Induction to verify that, for n any positive integer, 6 n 1 is divisible by Solution For any n 1, let P n be the statement that 6 n 1 is divisible by Base Case The statement P 1 says that = 6 1 = is divisible by, which is true Inductive Step Fix k 1, and suppose that P k holds, that is, 6 k 1 is divisible by It remains to show that P k+1 holds, that is, that 6 k+1 1 is divisible by 6 k+1 1 = 6(6 k ) 1 = 6(6 k 1) = 6(6 k 1) + By P k, the first term 6(6 k 1) is divisible by, the second term is clearly divisible by Therefore the left hand side is also divisible by Therefore P k+1 holds Thus by the principle of mathematical induction, for all n 1, P n holds
3 Question Verify that for all n 1, the sum of the squares of the first n positive integers is given by the formula (n) n(n + 1)(n + 1) = Solution For any integer n 1, let P n be the statement that (n) = n(n + 1)(n + 1) Base Case The statement P 1 says that which is true 1 + = (1)((1) + 1)((1) + 1) = () =, Inductive Step Fix k 1, and suppose that P k holds, that is, (k) = k(k + 1)(k + 1) It remains to show that P k+1 holds, that is, ((k + 1)) = (k + 1)((k + 1) + 1)((k + 1) + 1) ((k + 1)) = (k + ) On the other side of P k+1, = (k) + (k + 1) + (k + ) k(k + 1)(k + 1) = + (k + 1) + (k + ) (by P k ) k(k + 1)(k + 1) = + (k + 1) + (k + ) = k(k + 1)(k + 1) + (k + 1) + (k + ) = k(8k + 6k + 1) + (k + k + 1) + (k + 8k + ) = (8k + 6k + k) + (1k + 1k + ) + (1k + k + 1) = 8k + 0k + 7k + 1 (k + 1)((k + 1) + 1)((k + 1) + 1) = (k + 1)(k + + 1)(k + + 1)
4 Therefore P k+1 holds = (k + 1)(k + )(k + ) = (k + k + )(k + ) = 8k + 0k + 7k + 1 Thus, by the principle of mathematical induction, for all n 1, P n holds
5 Question Consider the sequence of real numbers defined by the relations x 1 = 1 and x n+1 = 1 + x n for n 1 Use the Principle of Mathematical Induction to show that x n < for all n 1 Solution For any n 1, let P n be the statement that x n < Base Case The statement P 1 says that x 1 = 1 <, which is true Inductive Step Fix k 1, and suppose that P k holds, that is, x k < It remains to show that P k+1 holds, that is, that x k+1 < x k+1 = 1 + x k < 1 + () = 9 = < Therefore P k+1 holds Thus by the principle of mathematical induction, for all n 1, P n holds
6 Question Show that n! > n for n 7 Solution For any n 7, let P n be the statement that n! > n Base Case The statement P 7 says that 7! = = 00 > 7 = 187, which is true Inductive Step Fix k 7, and suppose that P k holds, that is, k! > k It remains to show that P k+1 holds, that is, that (k + 1)! > k+1 (k + 1)! = (k + 1)k! > (k + 1) k (7 + 1) k = 8 k > k = k+1 Therefore P k+1 holds Thus by the principle of mathematical induction, for all n 1, P n holds
7 Question 6 Let p 0 = 1, p 1 = cos θ (for θ some fixed constant) and p n+1 = p 1 p n p n1 for n 1 Use an extended Principle of Mathematical Induction to prove that p n = cos(nθ) for n 0 Solution For any n 0, let P n be the statement that p n = cos(nθ) Base Cases The statement P 0 says that p 0 = 1 = cos(0θ) = 1, which is true The statement P 1 says that p 1 = cos θ = cos(1θ), which is true Inductive Step Fix k 0, and suppose that both P k and P k+1 hold, that is, p k = cos(kθ), and p k+1 = cos((k + 1)θ) It remains to show that P k+ holds, that is, that p k+ = cos((k + )θ) We have the following identities: cos(a + b) = cos a cos b sin a sin b cos(a b) = cos a cos b + sin a sin b Therefore, using the first identity when a = θ and b = (k + 1)θ, we have cos(θ + (k + 1)θ) = cos θ cos(k + 1)θ sin θ sin(k + 1)θ, and using the second identity when a = (k + 1)θ and b = θ, we have Therefore, cos((k + 1)θ θ) = cos(k + 1)θ cos θ + sin(k + 1)θ sin θ p k+ = p 1 p k+1 p k = (cos θ)(cos((k + 1)θ)) cos(kθ) Therefore P k+ holds = (cos θ)(cos((k + 1)θ)) + (cos θ)(cos((k + 1)θ)) cos(kθ) = cos(θ + (k + 1)θ) + sin θ sin(k + 1)θ + (cos θ)(cos((k + 1)θ)) cos(kθ) = cos((k + )θ) + sin θ sin(k + 1)θ + (cos θ)(cos((k + 1)θ)) cos(kθ) = cos((k + )θ) + sin θ sin(k + 1)θ + cos((k + 1)θ θ) sin(k + 1)θ sin θ cos(kθ) = cos((k + )θ) + cos(kθ) cos(kθ) = cos((k + )θ) Thus by the principle of mathematical induction, for all n 1, P n holds
8 Question 7 Consider the famous Fibonacci sequence {x n } n=1, defined by the relations x 1 = 1, x = 1, and x n = x n1 + x n for n (a) Compute x 0 (b) Use an extended Principle of Mathematical Induction in order to show that for n 1, [( ) x n = 1 n ( ) n ] (c) Use the result of part (b) to compute x Solution (a) 1, 1,,,, 8, 1, 1,,, 89, 1,, 77, 610, 987, 197, 8, 181, 676 (b) For any n 1, let P n be the statement that [( x n = Base Case The statement P 1 says that x 1 ) n ( 1 + ) 1 ( [ = [ = 1 [ = 1 = 1, which is true The statement P says that x ] ] 1 + ) ( 1 ) n ] 1 ) 1 ] 1 )
9 which is again true = 1 [( = 1 [( [ = 1 = 1, 1 + ) ( + 1 )] )] ] Inductive Step Fix k 1, and suppose that P k and P k+1 both hold, that is, x k 1 ) k, and x k ) k+1 ( 1 ) k+1 It remains to show that P k+ holds, that is, that x k+ 1 + ) k+ ( 1 ) k+ x k+ = x k + x k ) k ( + 1 ) k ( ) k+1 ( ) ( + ) ( 6 + ) ( 1 + ) k+1 ( 1 ) k ( 1 ) k+1 1 ) k+1 1 ) k ( ) 1 ) k ( 1 ) k ( ) 6 )
10 Therefore P k+ holds 1 + ) k+ ( 1 + ) ( ) ( 1 ) k+ 1 ) k ( 1 ) k ( 1 ) + 1 ) Thus by the principle of mathematical induction, for all n 1, P n holds (c) Plugging n = 0 in a calculator yields the answer quickly Induction Examples
Math 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 informationWorksheet on induction Calculus I Fall 2006 First, let us explain the use of for summation. The notation
Worksheet on induction MA113 Calculus I Fall 2006 First, let us explain the use of for summation. The notation f(k) means to evaluate the function f(k) at k = 1, 2,..., n and add up the results. In other
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 informationSection 62 Mathematical Induction
6 Mathematical Induction 457 In calculus, it can be shown that e x k0 x k k! x x x3!! 3!... xn n! where the larger n is, the better the approximation. Problems 6 and 6 refer to this series. Note that
More informationClass XI Chapter 5 Complex Numbers and Quadratic Equations Maths. Exercise 5.1. Page 1 of 34
Question 1: Exercise 5.1 Express the given complex number in the form a + ib: Question 2: Express the given complex number in the form a + ib: i 9 + i 19 Question 3: Express the given complex number in
More informationSECTION 102 Mathematical Induction
73 0 Sequences and Series 6. Approximate e 0. using the first five terms of the series. Compare this approximation with your calculator evaluation of e 0.. 6. Approximate e 0.5 using the first five terms
More information3 0 + 4 + 3 1 + 1 + 3 9 + 6 + 3 0 + 1 + 3 0 + 1 + 3 2 mod 10 = 4 + 3 + 1 + 27 + 6 + 1 + 1 + 6 mod 10 = 49 mod 10 = 9.
SOLUTIONS TO HOMEWORK 2  MATH 170, SUMMER SESSION I (2012) (1) (Exercise 11, Page 107) Which of the following is the correct UPC for Progresso minestrone soup? Show why the other numbers are not valid
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 information1.2. Successive Differences
1. An Application of Inductive Reasoning: Number Patterns In the previous section we introduced inductive reasoning, and we showed how it can be applied in predicting what comes next in a list of numbers
More information1 Review of complex numbers
1 Review of complex numbers 1.1 Complex numbers: algebra The set C of complex numbers is formed by adding a square root i of 1 to the set of real numbers: i = 1. Every complex number can be written uniquely
More informationMathematical Induction
Mathematical Induction (Handout March 8, 01) The Principle of Mathematical Induction provides a means to prove infinitely many statements all at once The principle is logical rather than strictly mathematical,
More informationAppendix F: Mathematical Induction
Appendix F: Mathematical Induction Introduction In this appendix, you will study a form of mathematical proof called mathematical induction. To see the logical need for mathematical induction, take another
More informationIntersections of Polar Curves
Intersections of Polar Curves The purpose of this supplement is to find a method for determining where graphs of polar equations intersect each other. Let s start with a fairly straightforward example.
More informationBasic Proof Techniques
Basic Proof Techniques David Ferry dsf43@truman.edu September 13, 010 1 Four Fundamental Proof Techniques When one wishes to prove the statement P Q there are four fundamental approaches. This document
More informationDiscrete Mathematics: Solutions to Homework (12%) For each of the following sets, determine whether {2} is an element of that set.
Discrete Mathematics: Solutions to Homework 2 1. (12%) For each of the following sets, determine whether {2} is an element of that set. (a) {x R x is an integer greater than 1} (b) {x R x is the square
More informationSCORE SETS IN ORIENTED GRAPHS
Applicable Analysis and Discrete Mathematics, 2 (2008), 107 113. Available electronically at http://pefmath.etf.bg.ac.yu SCORE SETS IN ORIENTED GRAPHS S. Pirzada, T. A. Naikoo The score of a vertex v in
More informationFibonacci Numbers and Greatest Common Divisors. The Finonacci numbers are the numbers in the sequence 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 144,...
Fibonacci Numbers and Greatest Common Divisors The Finonacci numbers are the numbers in the sequence 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 144,.... After starting with two 1s, we get each Fibonacci number
More informationSolutions for Practice problems on proofs
Solutions for Practice problems on proofs Definition: (even) An integer n Z is even if and only if n = 2m for some number m Z. Definition: (odd) An integer n Z is odd if and only if n = 2m + 1 for some
More informationMathematical induction. Niloufar Shafiei
Mathematical induction Niloufar Shafiei Mathematical induction Mathematical induction is an extremely important proof technique. Mathematical induction can be used to prove results about complexity of
More informationSection IV.1: Recursive Algorithms and Recursion Trees
Section IV.1: Recursive Algorithms and Recursion Trees Definition IV.1.1: A recursive algorithm is an algorithm that solves a problem by (1) reducing it to an instance of the same problem with smaller
More informationMathematical Induction. Mary Barnes Sue Gordon
Mathematics Learning Centre Mathematical Induction Mary Barnes Sue Gordon c 1987 University of Sydney Contents 1 Mathematical Induction 1 1.1 Why do we need proof by induction?.... 1 1. What is proof by
More informationMathematics. (www.tiwariacademy.com : Focus on free Education) (Chapter 5) (Complex Numbers and Quadratic Equations) (Class XI)
( : Focus on free Education) Miscellaneous Exercise on chapter 5 Question 1: Evaluate: Answer 1: 1 ( : Focus on free Education) Question 2: For any two complex numbers z1 and z2, prove that Re (z1z2) =
More informationInduction. Margaret M. Fleck. 10 October These notes cover mathematical induction and recursive definition
Induction Margaret M. Fleck 10 October 011 These notes cover mathematical induction and recursive definition 1 Introduction to induction At the start of the term, we saw the following formula for computing
More informationMathematical Induction. Lecture 1011
Mathematical Induction Lecture 1011 Menu Mathematical Induction Strong Induction Recursive Definitions Structural Induction Climbing an Infinite Ladder Suppose we have an infinite ladder: 1. We can reach
More informationMath 115 Spring 2011 Written Homework 5 Solutions
. Evaluate each series. a) 4 7 0... 55 Math 5 Spring 0 Written Homework 5 Solutions Solution: We note that the associated sequence, 4, 7, 0,..., 55 appears to be an arithmetic sequence. If the sequence
More information20.1 Revisiting Maxwell s equations
Scott Hughes 28 April 2005 Massachusetts Institute of Technology Department of Physics 8.022 Spring 2005 Lecture 20: Wave equation & electromagnetic radiation 20.1 Revisiting Maxwell s equations In our
More informationMITES Physics III Summer Introduction 1. 3 Π = Product 2. 4 Proofs by Induction 3. 5 Problems 5
MITES Physics III Summer 010 Sums Products and Proofs Contents 1 Introduction 1 Sum 1 3 Π Product 4 Proofs by Induction 3 5 Problems 5 1 Introduction These notes will introduce two topics: A notation which
More informationLesson 4 Annuities: The Mathematics of Regular Payments
Lesson 4 Annuities: The Mathematics of Regular Payments Introduction An annuity is a sequence of equal, periodic payments where each payment receives compound interest. One example of an annuity is a Christmas
More informationELEMENTARY PROBLEMS AND SOLUTIONS
EDITED BY RUSS EULER AND JAWAD SADEK Please submit all new problem proposals and their solutions to the Problems Editor, DR. RUSS EULER, Department of Mathematics and Statistics, Northwest Missouri State
More informationk, then n = p2α 1 1 pα k
Powers of Integers An integer n is a perfect square if n = m for some integer m. Taking into account the prime factorization, if m = p α 1 1 pα k k, then n = pα 1 1 p α k k. That is, n is a perfect square
More informationMISS. INDUCTION SEQUENCES and SERIES. J J O'Connor MT1002 2009/10
MISS MATHEMATICAL INDUCTION SEQUENCES and SERIES J J O'Connor MT002 2009/0 Contents This booklet contains eleven lectures on the topics: Mathematical Induction 2 Sequences 9 Series 3 Power Series 22 Taylor
More informationSolution to Exercise 2.2. Both m and n are divisible by d, som = dk and n = dk. Thus m ± n = dk ± dk = d(k ± k ),som + n and m n are divisible by d.
[Chap. ] Pythagorean Triples 6 (b) The table suggests that in every primitive Pythagorean triple, exactly one of a, b,orc is a multiple of 5. To verify this, we use the Pythagorean Triples Theorem to write
More informationInduction Problems. Tom Davis November 7, 2005
Induction Problems Tom Davis tomrdavis@earthlin.net http://www.geometer.org/mathcircles November 7, 2005 All of the following problems should be proved by mathematical induction. The problems are not necessarily
More information1.4 Factors and Prime Factorization
1.4 Factors and Prime Factorization Recall from Section 1.2 that the word factor refers to a number which divides into another number. For example, 3 and 6 are factors of 18 since 3 6 = 18. Note also that
More informationG E O M E T R Y CHAPTER 9 RIGHT TRIANGLES AND TRIGONOMETRY. Notes & Study Guide
G E O M E T R Y CHAPTER 9 RIGHT TRIANGLES AND TRIGONOMETRY Notes & Study Guide 2 TABLE OF CONTENTS SIMILAR RIGHT TRIANGLES... 3 THE PYTHAGOREAN THEOREM... 4 SPECIAL RIGHT TRIANGLES... 5 TRIGONOMETRIC RATIOS...
More informationn k=1 k=0 1/k! = e. Example 6.4. The series 1/k 2 converges in R. Indeed, if s n = n then k=1 1/k, then s 2n s n = 1 n + 1 +...
6 Series We call a normed space (X, ) a Banach space provided that every Cauchy sequence (x n ) in X converges. For example, R with the norm = is an example of Banach space. Now let (x n ) be a sequence
More informationWRITING PROOFS. Christopher Heil Georgia Institute of Technology
WRITING PROOFS Christopher Heil Georgia Institute of Technology A theorem is just a statement of fact A proof of the theorem is a logical explanation of why the theorem is true Many theorems have this
More informationProof of Infinite Number of Fibonacci Primes. Stephen Marshall. 22 May Abstract
Proof of Infinite Number of Fibonacci Primes Stephen Marshall 22 May 2014 Abstract This paper presents a complete and exhaustive proof of that an infinite number of Fibonacci Primes exist. The approach
More informationArea in Polar Coordinates
Area in Polar Coordinates If we have a circle of radius r, and select a sector of angle θ, then the area of that sector can be shown to be 1. r θ Area = (1/)r θ As a check, we see that if θ =, then the
More information28 CHAPTER 1. VECTORS AND THE GEOMETRY OF SPACE. v x. u y v z u z v y u y u z. v y v z
28 CHAPTER 1. VECTORS AND THE GEOMETRY OF SPACE 1.4 Cross Product 1.4.1 Definitions The cross product is the second multiplication operation between vectors we will study. The goal behind the definition
More information3.1. Solving linear equations. Introduction. Prerequisites. Learning Outcomes. Learning Style
Solving linear equations 3.1 Introduction Many problems in engineering reduce to the solution of an equation or a set of equations. An equation is a type of mathematical expression which contains one or
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 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 informationMATHEMATICAL INDUCTION. Mathematical Induction. This is a powerful method to prove properties of positive integers.
MATHEMATICAL INDUCTION MIGUEL A LERMA (Last updated: February 8, 003) Mathematical Induction This is a powerful method to prove properties of positive integers Principle of Mathematical Induction Let P
More informationNotes: Chapter 2 Section 2.2: Proof by Induction
Notes: Chapter 2 Section 2.2: Proof by Induction Basic Induction. To prove: n, a W, n a, S n. (1) Prove the base case  S a. (2) Let k a and prove that S k S k+1 Example 1. n N, n i = n(n+1) 2. Example
More informationPythagorean Triples. Chapter 2. a 2 + b 2 = c 2
Chapter Pythagorean Triples The Pythagorean Theorem, that beloved formula of all high school geometry students, says that the sum of the squares of the sides of a right triangle equals the square of the
More information36 CHAPTER 1. LIMITS AND CONTINUITY. Figure 1.17: At which points is f not continuous?
36 CHAPTER 1. LIMITS AND CONTINUITY 1.3 Continuity Before Calculus became clearly de ned, continuity meant that one could draw the graph of a function without having to lift the pen and pencil. While this
More informationarxiv:0909.4913v2 [math.ho] 4 Nov 2009
IRRATIONALITY FROM THE BOOK STEVEN J. MILLER AND DAVID MONTAGUE arxiv:0909.4913v2 [math.ho] 4 Nov 2009 A right of passage to theoretical mathematics is often a proof of the irrationality of 2, or at least
More information9 Modular Exponentiation and Cryptography
9 Modular Exponentiation and Cryptography 9.1 Modular Exponentiation Modular arithmetic is used in cryptography. In particular, modular exponentiation is the cornerstone of what is called the RSA system.
More informationSOLUTIONS TO PROBLEM SET 4
MASSACHUSETTS INSTITUTE OF TECHNOLOGY Department of Physics Physics 8.01X Fall Term 2002 SOLUTIONS TO PROBLEM SET 4 1 Young & Friedman 5 26 A box of bananas weighing 40.0 N rests on a horizontal surface.
More informationAssignment 5  Due Friday March 6
Assignment 5  Due Friday March 6 (1) Discovering Fibonacci Relationships By experimenting with numerous examples in search of a pattern, determine a simple formula for (F n+1 ) 2 + (F n ) 2 that is, a
More information8 Divisibility and prime numbers
8 Divisibility and prime numbers 8.1 Divisibility In this short section we extend the concept of a multiple from the natural numbers to the integers. We also summarize several other terms that express
More informationRECURSIVE ENUMERATION OF PYTHAGOREAN TRIPLES
RECURSIVE ENUMERATION OF PYTHAGOREAN TRIPLES DARRYL MCCULLOUGH AND ELIZABETH WADE In [9], P. W. Wade and W. R. Wade (no relation to the second author gave a recursion formula that produces Pythagorean
More informationMATH 2300 review problems for Exam 3 ANSWERS
MATH 300 review problems for Exam 3 ANSWERS. Check whether the following series converge or diverge. In each case, justify your answer by either computing the sum or by by showing which convergence test
More informationHOMEWORK 5 SOLUTIONS. n!f n (1) lim. ln x n! + xn x. 1 = G n 1 (x). (2) k + 1 n. (n 1)!
Math 7 Fall 205 HOMEWORK 5 SOLUTIONS Problem. 2008 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
More informationSets and Counting. Let A and B be two sets. It is easy to see (from the diagram above) that A B = A + B A B
Sets and Counting Let us remind that the integer part of a number is the greatest integer that is less or equal to. It is denoted by []. Eample [3.1] = 3, [.76] = but [ 3.1] = 4 and [.76] = 6 A B Let A
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 informationInvestigation of Chebyshev Polynomials
Investigation of Chebyshev Polynomials Leon Loo April 25, 2002 1 Introduction Prior to taking part in this Mathematics Research Project, I have been responding to the Problems of the Week in the Math Forum
More informationUndergraduate Notes in Mathematics. Arkansas Tech University Department of Mathematics
Undergraduate Notes in Mathematics Arkansas Tech University Department of Mathematics An Introductory Single Variable Real Analysis: A Learning Approach through Problem Solving Marcel B. Finan c All Rights
More informationPartial Fractions. Combining fractions over a common denominator is a familiar operation from algebra:
Partial Fractions Combining fractions over a common denominator is a familiar operation from algebra: From the standpoint of integration, the left side of Equation 1 would be much easier to work with than
More informationMicroeconomics Sept. 16, 2010 NOTES ON CALCULUS AND UTILITY FUNCTIONS
DUSP 11.203 Frank Levy Microeconomics Sept. 16, 2010 NOTES ON CALCULUS AND UTILITY FUNCTIONS These notes have three purposes: 1) To explain why some simple calculus formulae are useful in understanding
More informationLS.6 Solution Matrices
LS.6 Solution Matrices In the literature, solutions to linear systems often are expressed using square matrices rather than vectors. You need to get used to the terminology. As before, we state the definitions
More information6.2 Permutations continued
6.2 Permutations continued Theorem A permutation on a finite set A is either a cycle or can be expressed as a product (composition of disjoint cycles. Proof is by (strong induction on the number, r, of
More informationComplex Numbers Basic Concepts of Complex Numbers Complex Solutions of Equations Operations on Complex Numbers
Complex Numbers Basic Concepts of Complex Numbers Complex Solutions of Equations Operations on Complex Numbers Identify the number as real, complex, or pure imaginary. 2i The complex numbers are an extension
More informationPolynomials and Vieta s Formulas
Polynomials and Vieta s Formulas Misha Lavrov ARML Practice 2/9/2014 Review problems 1 If a 0 = 0 and a n = 3a n 1 + 2, find a 100. 2 If b 0 = 0 and b n = n 2 b n 1, find b 100. Review problems 1 If a
More informationDivisor graphs have arbitrary order and size
Divisor graphs have arbitrary order and size arxiv:math/0606483v1 [math.co] 20 Jun 2006 Le Anh Vinh School of Mathematics University of New South Wales Sydney 2052 Australia Abstract A divisor graph G
More information8 Primes and Modular Arithmetic
8 Primes and Modular Arithmetic 8.1 Primes and Factors Over two millennia ago already, people all over the world were considering the properties of numbers. One of the simplest concepts is prime numbers.
More informationTossing a Biased Coin
Tossing a Biased Coin Michael Mitzenmacher When we talk about a coin toss, we think of it as unbiased: with probability onehalf it comes up heads, and with probability onehalf it comes up tails. An ideal
More informationThe Prime Numbers. Definition. A prime number is a positive integer with exactly two positive divisors.
The Prime Numbers Before starting our study of primes, we record the following important lemma. Recall that integers a, b are said to be relatively prime if gcd(a, b) = 1. Lemma (Euclid s Lemma). If gcd(a,
More informationLinear Approximations ACADEMIC RESOURCE CENTER
Linear Approximations ACADEMIC RESOURCE CENTER Table of Contents Linear Function Linear Function or Not Real World Uses for Linear Equations Why Do We Use Linear Equations? Estimation with Linear Approximations
More informationFull and Complete Binary Trees
Full and Complete Binary Trees Binary Tree Theorems 1 Here are two important types of binary trees. Note that the definitions, while similar, are logically independent. Definition: a binary tree T is full
More informationMath 313 Lecture #10 2.2: The Inverse of a Matrix
Math 1 Lecture #10 2.2: The Inverse of a Matrix Matrix algebra provides tools for creating many useful formulas just like real number algebra does. For example, a real number a is invertible if there is
More informationCategory 3 Number Theory Meet #1, October, 2000
Category 3 Meet #1, October, 2000 1. For how many positive integral values of n will 168 n be a whole number? 2. What is the greatest integer that will always divide the product of four consecutive integers?
More informationWe now explore a third method of proof: proof by contradiction.
CHAPTER 6 Proof by Contradiction We now explore a third method of proof: proof by contradiction. This method is not limited to proving just conditional statements it can be used to prove any kind of statement
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 informationStudent Outcomes. Lesson Notes. Classwork. Discussion (10 minutes)
NYS COMMON CORE MATHEMATICS CURRICULUM Lesson 5 8 Student Outcomes Students know the definition of a number raised to a negative exponent. Students simplify and write equivalent expressions that contain
More information9.4. The Scalar Product. Introduction. Prerequisites. Learning Style. Learning Outcomes
The Scalar Product 9.4 Introduction There are two kinds of multiplication involving vectors. The first is known as the scalar product or dot product. This is socalled because when the scalar product of
More informationON FIBONACCI NUMBERS WITH FEW PRIME DIVISORS
ON FIBONACCI NUMBERS WITH FEW PRIME DIVISORS YANN BUGEAUD, FLORIAN LUCA, MAURICE MIGNOTTE, SAMIR SIKSEK Abstract If n is a positive integer, write F n for the nth Fibonacci number, and ω(n) for the number
More informationTaylor and Maclaurin Series
Taylor and Maclaurin Series In the preceding section we were able to find power series representations for a certain restricted class of functions. Here we investigate more general problems: Which functions
More information1, 1 2, 1 3, 1 4,... 2 nd term. 1 st term
1 Sequences 11 Overview A (numerical) sequence is a list of real numbers in which each entry is a function of its position in the list The entries in the list are called terms For example, 1, 1, 1 3, 1
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 informationEquations, Inequalities & Partial Fractions
Contents Equations, Inequalities & Partial Fractions.1 Solving Linear Equations 2.2 Solving Quadratic Equations 1. Solving Polynomial Equations 1.4 Solving Simultaneous Linear Equations 42.5 Solving Inequalities
More information4. An isosceles triangle has two sides of length 10 and one of length 12. What is its area?
1 1 2 + 1 3 + 1 5 = 2 The sum of three numbers is 17 The first is 2 times the second The third is 5 more than the second What is the value of the largest of the three numbers? 3 A chemist has 100 cc of
More information3. Mathematical Induction
3. MATHEMATICAL INDUCTION 83 3. Mathematical Induction 3.1. First Principle of Mathematical Induction. Let P (n) be a predicate with domain of discourse (over) the natural numbers N = {0, 1,,...}. If (1)
More informationMODULAR ARITHMETIC. a smallest member. It is equivalent to the Principle of Mathematical Induction.
MODULAR ARITHMETIC 1 Working With Integers The usual arithmetic operations of addition, subtraction and multiplication can be performed on integers, and the result is always another integer Division, on
More informationThe thing that started it 8.6 THE BINOMIAL THEOREM
476 Chapter 8 Discrete Mathematics: Functions on the Set of Natural Numbers (b) Based on your results for (a), guess the minimum number of moves required if you start with an arbitrary number of n disks.
More informationarxiv:math/0202219v1 [math.co] 21 Feb 2002
RESTRICTED PERMUTATIONS BY PATTERNS OF TYPE (2, 1) arxiv:math/0202219v1 [math.co] 21 Feb 2002 TOUFIK MANSOUR LaBRI (UMR 5800), Université Bordeaux 1, 351 cours de la Libération, 33405 Talence Cedex, France
More informationTOPIC 4: DERIVATIVES
TOPIC 4: DERIVATIVES 1. The derivative of a function. Differentiation rules 1.1. The slope of a curve. The slope of a curve at a point P is a measure of the steepness of the curve. If Q is a point on the
More informationHomework 5 Solutions
Homework 5 Solutions 4.2: 2: a. 321 = 256 + 64 + 1 = (01000001) 2 b. 1023 = 512 + 256 + 128 + 64 + 32 + 16 + 8 + 4 + 2 + 1 = (1111111111) 2. Note that this is 1 less than the next power of 2, 1024, which
More informationx if x 0, x if x < 0.
Chapter 3 Sequences In this chapter, we discuss sequences. We say what it means for a sequence to converge, and define the limit of a convergent sequence. We begin with some preliminary results about the
More informationG.A. Pavliotis. Department of Mathematics. Imperial College London
EE1 MATHEMATICS NUMERICAL METHODS G.A. Pavliotis Department of Mathematics Imperial College London 1. Numerical solution of nonlinear equations (iterative processes). 2. Numerical evaluation of integrals.
More informationIB Math Research Problem
Vincent Chu Block F IB Math Research Problem The product of all factors of 2000 can be found using several methods. One of the methods I employed in the beginning is a primitive one I wrote a computer
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 informationThe Fibonacci Sequence and the Golden Ratio
55 The solution of Fibonacci s rabbit problem is examined in Chapter, pages The Fibonacci Sequence and the Golden Ratio The Fibonacci Sequence One of the most famous problems in elementary mathematics
More informationPolynomials and the Fast Fourier Transform (FFT) Battle Plan
Polynomials and the Fast Fourier Transform (FFT) Algorithm Design and Analysis (Wee 7) 1 Polynomials Battle Plan Algorithms to add, multiply and evaluate polynomials Coefficient and pointvalue representation
More informationSome practice problems for midterm 2
Some practice problems for midterm 2 Kiumars Kaveh November 15, 2011 Problem: What is the remainder of 6 2000 when divided by 11? Solution: This is a longwinded way of asking for the value of 6 2000 mod
More informationPreCalculus II. where 1 is the radius of the circle and t is the radian measure of the central angle.
PreCalculus II 4.2 Trigonometric Functions: The Unit Circle The unit circle is a circle of radius 1, with its center at the origin of a rectangular coordinate system. The equation of this unit circle
More information1. Annuity a sequence of payments, each made at equally spaced time intervals.
Ordinary Annuities (Young: 6.2) In this Lecture: 1. More Terminology 2. Future Value of an Ordinary Annuity 3. The Ordinary Annuity Formula (Optional) 4. Present Value of an Ordinary Annuity More Terminology
More informationTHE FIBONACCI NUMBERS. 1. Introduction The term Fibonacci numbers is used to describe the series of numbers generated by the pattern
THE FIBONACCI NUMBERS TYLER CLANCY 1 Introduction The term Fibonacci numbers is used to describe the series of numbers generated by the pattern 1, 1,, 3,, 8, 13, 1, 34,, 89, 144, where each number in the
More informationAPPLICATIONS AND MODELING WITH QUADRATIC EQUATIONS
APPLICATIONS AND MODELING WITH QUADRATIC EQUATIONS Now that we are starting to feel comfortable with the factoring process, the question becomes what do we use factoring to do? There are a variety of classic
More information