Set Notation Review. N the set of positive integers (aka set of natural numbers) {1, 2, 3, }
|
|
- Natalie Brooks
- 5 years ago
- Views:
Transcription
1 11. Notes o Mathematical Iductio Before we delve ito the today s topic, let s review some basic set otatio Set Notatio Review N the set of positive itegers (aa set of atural umbers) {1,, 3, } Z the set of itegers {, -3, -, -1, 0, 1,, 3, } Q the set of ratioal umbers (writte as a fractio a/b) R the set of real umbers Notice how all sets are deoted by CAPITAL LETTERS. This is because lower case letters were already reserved for use by variables. Cool fact, huh? May importat results i mathematics have bee discovered by observig patters i some specific cases ad the by maig geeralizatios from the observatios. This is called Applyig INDUCTIVE REASONING. Mathematicias would the use their deductive reasoig sills to come up with rules i fact, they were called cojectured rules (pretty facy) Now, mathematicias would give example after example provig that their cojectured rule is TRUE. Nice as this is, your frieds oly eed oe couterexample to prove that your cojecture is NOT TRUE. Let s see 3 is prime, so is 5, ad 7, ad 11 I cojecture that all prime umbers are odd. Wow, my first cojecture I woder what my math frieds will thi? Let s see Hey guys! Guess what? Hey Marvi. Hi I came up with a cojecture O, let s hear it Time to impress All prime umbers are odd! What about? Yeah. is prime ad is ot odd! Aw shux!! That s o, you re still cool! Iductio Priciple: mathematicias use this idea to prove properties with Natural umbers. It wors lie this Da Muscarella, 00
2 THE PRINCIPAL OF MATHEMATICAL INDUCTION Let P be a statemet ivolvig the positive iteger. If 1. P 1 is true for the atural umber 1 (some boos write this as P(1), or simply 1) AND. The truth of P implies the truth of P +1, for every positive, the P must be true for all positive itegers. BOTH PARTS ARE NECESSARY TO USE THE PRINCIPAL OF MATHEMATICAL INDUCTION Now, there are two sides to every equatio ad this is o differet. S Term formula + ( 1) Sum formula The left side is called the term formula side, ad the right is called the sum formula side. Did you ow that the first term does t always have to be 1? Nope I did t Really? Usually it is, but it ca be other umbers, too! Wow Cool What, lie? You re soooo fuy! Da Muscarella, 00
3 Speaig of terms, let s review what the ext term is for give situatios where represets a iteger Term Next term Simplified versio of ext term ( + 1) ( + 1) ( + 1) ( + 1) ( + 1) ( + 1) ( + 1) 1 ( + 1) ( + 1)(( + 1) + 1) ( + 1)( + ), or ( + 1) For geometric proofs, you eeded Statemets ad Reasos. Mathematical Iductio proofs eed four parts: Whe 1, Assume P() is true for 1, The, ad Therefore. Da Muscarella, 00
4 EX 1] Use mathematical iductio to prove the statemet is true for all atural umbers. + ( 1) S Idea whe we get to the ed of the THEN part we wat the right side to be i the form. Sometimes it is easier to wor bacwards if you get stuc. ( + 1)( + ) Whe 1 1 (1 + 1) 1 1() 1 () Simplify 1 1 (3) P(1) is true! (1) Write 1 o the left (sice it is the first term), ad substitute 1 for o the sum formula (right) side If the first term were 7, we d put 7 o the left. Assume P() is true for 1. () You have to actually state this ( + 1) S (5) Replace with mathematicias are soooo picy about how they write thigs! The, ( + 1) S ( + 1) + ( + 1) () Chage S to S +1,add ( + 1) to both sides ( + 1) ( + 1) +1 (7) Remember Factor By Groupig? From (7) oward, you ( + 1) ( + 1) + (8) Rewrite 1 as wor with the right side ( + 1) ( + 1) (9) Simplify ( + 1) ( + 1) ( + ) (10) Simplify Therefore, ( 1) is true for all N. (11) State coclusio Da Muscarella, 00
5 EX ] For this problem, we will loo at two differet approaches. Use mathematical iductio to prove P ( + 1) is true for all atural umbers. Whe 1 1(1+1) (1) Write o the left ad 1 for o the sum formula (right) side 1() () Simplify (3) P(1) is true! Assume P() is true for 1. () You have to actually state this The, S ( + 1) (5) Replace with mathematicias are soooo picy about how they write thigs! S ( + 1) ( + 1) + ( + 1) () S + ( + 1) ( + 1)( + ) (7) You ca substitute S for o the left ad use Factor By Groupig o the right Therefore, ( + 1) is true for all N. (8) State coclusio Example ] S ( + 1) Alterate Techique Whe 1 1(1 + 1) (1) Write o the left ad 1 for o the sum formula (right) side 1() () Simplify (3) P(1) is true! Assume P() is true for 1. S ( + 1) () You have to actually state this (5) Replace with The, S ( + 1) ( + 1) + ( + 1) () S + ( + 1) (7) Substitute S ad the distribute o the right side S + ( + 1) (8) Simplify S + ( + 1) ( + 1)( + ) (9) Factor right side ad we re doe!! Therefore, S ( + 1)is true for all N. (10) State coclusio Da Muscarella, 00
6 EX 3] Use mathematical iductio to prove P ( 1) ( + 1) is true for all atural umbers. Idea whe we get to the ed of the THEN part we wat the right side to be i the form ( +1)(( + 1) + 1) or ( +1)( + 3 ) Whe 1 3 1((1)+1) (1) Write 3 o the left ad 1 for o the sum formula (right) side 3 1(3) () Simplify 3 3 (3) P(1) is true! Assume P() is true for 1. () You have to actually state this S ( 1) ( + 1) (5) Replace with The, S ( 1) + ((+1) 1) ( + 1) + ((+1) 1) () S + (+3) ( + 1) + ( + 3) (7) Substitute S ad the simplify ((+1) 1) to ( + 3) S + (+3) (8) S + (+3) (9) Simplify S + (+3) ( +1)( + 3) (10) Factor S + (+3) ( +1)( + + 1) (11) Split 3 ito + 1 S + (+3) ( +1)(( + 1) + 1) (1) Therefore, ( 1) ( + 1) is true for all N. (13) State coclusio Da Muscarella, 00
7 Sums of Powers of Itegers: + ( 1) ( + 1)( + 1) ( + 1) ( + 1)( + 1)( ( + 1) ( EX ] Fid the sum usig the formulas for the sums of powers of itegers for S 5 1 Solutio: First, determie how may terms are i the sum 1,, 3,, 5 We have 5 terms S 5 1 ( + 1)( + 1)(3 + 3 (1) Write sum formula for 5((5) + 1)( ( 5) + 1)(3(5) + 3( 5) () Substitute 5 for 5()(10 + 1)( (3) Simplify (11)(89) () Simplify 979 (5) Simplify *Verify o your graphig calculator. Da Muscarella, 00
8 Math Aalysis Name: 11.5 Notes o Mathematical Iductio Bloc: Date: For geometric proofs, you eeded Statemets ad Reasos. Mathematical Iductio proofs eed four parts: Use mathematical iductio to prove the give statemet is true for all atural umbers. + ( 1) EX 1] S EX ] S ( + 1) EX 3] S ( 1) ( + 1) EX ] Usig the Sums of Powers of Itegers formula, fid the sum of 5. 1 Sums of Powers of Itegers + ( 1) ( + 1)( + 1) ( + 1) ( + 1)( + 1)( ( + 1) ( HW Problems: Use the Pricipal of Math Iductio to prove that the give statemet is true for all atural umbers,. 1] S (3 ) ( 3 1) ] S ] S ( + 1)(+ 1) ] S (5 3) ( 5 1) Use the formulas for the sums of powers of itegers fid the sum of each. 5]. ] 1 i 1 3 i [#5 ad # HINT: use formulas!] 8i Da Muscarella, 00
9 Math Iductio HW Problems Key: 1] S (3 ) ( 3 1) Whe ( 3(1) 1 ) (1) Write 1 o the left ad 1 for o the sum formula (right) side 1 1 ( ) () Simplify 1 1 (3) P(1) is true! Assume P() is true for 1. S (3 ) ( 3 1) () You have to actually state this (5) Replace with The, S (3 ) + (3(+ 1) ) ( 3 1) S + (3(+ 1) ) ( 3 1) S + (3(+ 1) ) ( 3 1) + (3(+ 1) ) () + (3 + 3 ) (7) Substitute S ad the simplify + (3 + 1) (8) S + (3(+ 1) ) ( 3 1) + ( ) S + (3(+ 1) ) ( (3 1) (3 1) ) S + (3(+ 1) ) ( ) S + (3(+ 1) ) ( ) (9) Rewrite (10) Factor out (11) (1) 1 ( 1)(3 ) + + (13) 1 ( 1)(3 3 1) + + (1) 1 ( 1)(3( 1) 1) + + (15) ( + 1) (3( + 1) 1) (1) S + (3(+ 1) ) ( ) S + (3(+ 1) ) ( ) S + (3(+ 1) ) ( ) S + (3(+ 1) ) ( ) Therefore, (3 ) ( 3 1) is true for all N. (17) State coclusio Da Muscarella, 00
10 ] S Whe (1) Write 1 o the left ad 1 for o the sum formula (right) side 1 1 () Simplify 1 1 (3) P(1) is true! Assume P() is true for 1. () You have to actually state this S (5) Replace with The, S () S (7) Substitute S S + () 1 (8) Simplify S (9) Remember, same base for (), so add expoets Therefore, S is true for all N. (10) State coclusio Da Muscarella, 00
11 3] S ( + 1)(+ 1) Whe 1 1 1(1 + 1)((1) + 1) (1) Write 1 o the left ad 1 for o the sum formula (right) side 1 1()(3) () Simplify 1 1 (3) P(1) is true! Assume P() is true for 1. S ( + 1)(+ 1) () You have to actually state this (5) Replace with The, S ( + 1) ( + 1)(+ 1) + ( + 1) () S + ( + 1) ( + 1)(+ 1) ( + 1) + (7) Substitute S ad get commo deomiator [ ] S + ( + 1) ( + 1) (+ 1) + ( + 1) ( + 1) S + ( + 1) ( + 1) 7 S + ( + 1) + + S + ( + 1) ( + 1)( + )(+ 3) S + ( + 1) ( + 1)(( + 1) + 1) + (+ + 1) S + ( + 1) ( + 1)(( + 1) + 1) + (( + 1) + 1) Therefore, S ( + 1)(+ 1) (8) Factor out ( + 1) (9) Distribute (10) Simplify (11) Could stop here ad go to (1) (1) (13) is true for all N. (1) State coclusio Da Muscarella, 00
12 1 5(1) 1 (1) Write 1 o the left ad 1 for o the sum formula (right) side 1 ( ) () Simplify (3) P(1) is true! ] S (5 3) ( 5 1) Whe 1 ( ) Assume P() is true for 1. () You have to actually state this S (5 3) ( 5 1) (5) Replace with The, + (5( + 1) 3) () S + (5 + ) ( 5 1) + (5 + ) (7) Substitute S ad simplify (5+ ) S + (5 + ) ( 5 1) + (8) Get commo deomiator S + (5 + ) (9) S + (5 + ) (10) ( + 1)(5+ ) S + (5 + ) (11) ( + 1)(5( + 1) S + (5 + ) (1) S (5 3) + (5( + 1) 3) ( 5 1) Therefore, S (5 3) ( 5 is true for all N. (13) State coclusio Use the formulas for the sums of powers of itegers fid the sum of each. 5] 1 ( + 1)(() + 1) ( + 1) (7)(13) (7) You have to show the substitutio ito the formulas to receive credit!!! 3 ] i 8i i 1 ( + 1)(() + 1) () ( + 1) 8 (7)(13) 8(3)(9) Da Muscarella, 00
13 Still completig this part EX 5] Prove 1 ( + 1)( + 1)(3 + 3 Whe 1 1 1(1 + 1)( 1+ 1)( ()(3)(5) 1 1 (1) 1 1 (left side), substitute o right side () Simplify (3) Simplify 1 1 (3) P(1) is true! Assume S() is true for 1. () State this S ( + 1)( + 1)(3 + 3 (5) Replace with The, S ( + 1) ( + 1)( + 1)( ( + 1) () S + ( + 1) S + ( + 1) ( + 1)( + 1)(3 + 3 ( + 1)( + 1)( ( + 1) (7) Substitute + ( + 1) (8) LCD S + ( + 1) S + ( + 1) ( + 1)( + 1)( ( + 1)( + 1)( ( + 1) ( + 1) (9) Simplify (10) Simplify S + ( + 1) ( Da Muscarella, )[ ( + 1)( ( + 1) 3 ] (11) Factor By Groupig
14 S + ( + 1) ( S + ( + 1) ( 3 + 1)[ )[( )( ] 5)] (1) Simplify (13) Factor You ca tha me later S + ( + 1) ( S + ( + 1) ( + 1)[( + )( + 3)( )] + 1)( + )[(( + 1) + 1))( )] (13) Factor (1)Rewrite + 3 as ( + 1) + 1 S + ( + 1) ( + 1)( + )[(( + 1) + 1))(3( + 1) + 9( + 1) 1)] (15) I (15), we replace every with ( + 1). The, use your algebra sills to determie what umber goes here ( + 1) + 9( + 1) + 3( + + 1) Da Muscarella, 00
Chapter 9 Sequences, Series, and Probability Section 9.4 Mathematical Induction
Chapter 9 equeces, eries, ad Probability ectio 9. Mathematical Iductio ectio Objectives: tudets will lear how to use mathematical iductio to prove statemets ivolvig a positive iteger, recogize patters
More informationProperties and Tests of Zeros of Polynomial Functions
Properties ad Tests of Zeros of Polyomial Fuctios The Remaider ad Factor Theorems: Sythetic divisio ca be used to fid the values of polyomials i a sometimes easier way tha substitutio. This is show by
More informationRADICAL EXPRESSION. If a and x are real numbers and n is a positive integer, then x is an. n th root theorems: Example 1 Simplify
Example 1 Simplify 1.2A Radical Operatios a) 4 2 b) 16 1 2 c) 16 d) 2 e) 8 1 f) 8 What is the relatioship betwee a, b, c? What is the relatioship betwee d, e, f? If x = a, the x = = th root theorems: RADICAL
More informationThese Two Weeks. Mathematical Induction Chapter 4 Lecture 10 & Lecture 13. CPRE 310 Discrete Mathematics. Mathematical Induction Problems
These Two Wees CPRE 0 Discrete Mathematics Mathematical Iductio Chapter Lecture 0 & Lecture Lecture 0 Mathematical Iductio (MI) MI Problems Lecture, Review Lecture February 9, Test I A list of topics ad
More informationSequences, Mathematical Induction, and Recursion. CSE 2353 Discrete Computational Structures Spring 2018
CSE 353 Discrete Computatioal Structures Sprig 08 Sequeces, Mathematical Iductio, ad Recursio (Chapter 5, Epp) Note: some course slides adopted from publisher-provided material Overview May mathematical
More informationZeros of Polynomials
Math 160 www.timetodare.com 4.5 4.6 Zeros of Polyomials I these sectios we will study polyomials algebraically. Most of our work will be cocered with fidig the solutios of polyomial equatios of ay degree
More information1 Generating functions for balls in boxes
Math 566 Fall 05 Some otes o geeratig fuctios Give a sequece a 0, a, a,..., a,..., a geeratig fuctio some way of represetig the sequece as a fuctio. There are may ways to do this, with the most commo ways
More informationSeries: Infinite Sums
Series: Ifiite Sums Series are a way to mae sese of certai types of ifiitely log sums. We will eed to be able to do this if we are to attai our goal of approximatig trascedetal fuctios by usig ifiite degree
More informationBertrand s Postulate
Bertrad s Postulate Lola Thompso Ross Program July 3, 2009 Lola Thompso (Ross Program Bertrad s Postulate July 3, 2009 1 / 33 Bertrad s Postulate I ve said it oce ad I ll say it agai: There s always a
More informationChapter 6 Overview: Sequences and Numerical Series. For the purposes of AP, this topic is broken into four basic subtopics:
Chapter 6 Overview: Sequeces ad Numerical Series I most texts, the topic of sequeces ad series appears, at first, to be a side topic. There are almost o derivatives or itegrals (which is what most studets
More informationCSE 1400 Applied Discrete Mathematics Number Theory and Proofs
CSE 1400 Applied Discrete Mathematics Number Theory ad Proofs Departmet of Computer Scieces College of Egieerig Florida Tech Sprig 01 Problems for Number Theory Backgroud Number theory is the brach of
More informationMATH 304: MIDTERM EXAM SOLUTIONS
MATH 304: MIDTERM EXAM SOLUTIONS [The problems are each worth five poits, except for problem 8, which is worth 8 poits. Thus there are 43 possible poits.] 1. Use the Euclidea algorithm to fid the greatest
More informationChapter 7: Numerical Series
Chapter 7: Numerical Series Chapter 7 Overview: Sequeces ad Numerical Series I most texts, the topic of sequeces ad series appears, at first, to be a side topic. There are almost o derivatives or itegrals
More informationInfinite Sequences and Series
Chapter 6 Ifiite Sequeces ad Series 6.1 Ifiite Sequeces 6.1.1 Elemetary Cocepts Simply speakig, a sequece is a ordered list of umbers writte: {a 1, a 2, a 3,...a, a +1,...} where the elemets a i represet
More informationP.3 Polynomials and Special products
Precalc Fall 2016 Sectios P.3, 1.2, 1.3, P.4, 1.4, P.2 (radicals/ratioal expoets), 1.5, 1.6, 1.7, 1.8, 1.1, 2.1, 2.2 I Polyomial defiitio (p. 28) a x + a x +... + a x + a x 1 1 0 1 1 0 a x + a x +... +
More informationDifferent kinds of Mathematical Induction
Differet ids of Mathematical Iductio () Mathematical Iductio Give A N, [ A (a A a A)] A N () (First) Priciple of Mathematical Iductio Let P() be a propositio (ope setece), if we put A { : N p() is true}
More information3.2 Properties of Division 3.3 Zeros of Polynomials 3.4 Complex and Rational Zeros of Polynomials
Math 60 www.timetodare.com 3. Properties of Divisio 3.3 Zeros of Polyomials 3.4 Complex ad Ratioal Zeros of Polyomials I these sectios we will study polyomials algebraically. Most of our work will be cocered
More informationRecurrence Relations
Recurrece Relatios Aalysis of recursive algorithms, such as: it factorial (it ) { if (==0) retur ; else retur ( * factorial(-)); } Let t be the umber of multiplicatios eeded to calculate factorial(). The
More informationThe "Last Riddle" of Pierre de Fermat, II
The "Last Riddle" of Pierre de Fermat, II Alexader Mitkovsky mitkovskiy@gmail.com Some time ago, I published a work etitled, "The Last Riddle" of Pierre de Fermat " i which I had writte a proof of the
More informationChapter 6: Numerical Series
Chapter 6: Numerical Series 327 Chapter 6 Overview: Sequeces ad Numerical Series I most texts, the topic of sequeces ad series appears, at first, to be a side topic. There are almost o derivatives or itegrals
More informationSect 5.3 Proportions
Sect 5. Proportios Objective a: Defiitio of a Proportio. A proportio is a statemet that two ratios or two rates are equal. A proportio takes a form that is similar to a aalogy i Eglish class. For example,
More information6.3 Testing Series With Positive Terms
6.3. TESTING SERIES WITH POSITIVE TERMS 307 6.3 Testig Series With Positive Terms 6.3. Review of what is kow up to ow I theory, testig a series a i for covergece amouts to fidig the i= sequece of partial
More informationMath F215: Induction April 7, 2013
Math F25: Iductio April 7, 203 Iductio is used to prove that a collectio of statemets P(k) depedig o k N are all true. A statemet is simply a mathematical phrase that must be either true or false. Here
More informationSeptember 2012 C1 Note. C1 Notes (Edexcel) Copyright - For AS, A2 notes and IGCSE / GCSE worksheets 1
September 0 s (Edecel) Copyright www.pgmaths.co.uk - For AS, A otes ad IGCSE / GCSE worksheets September 0 Copyright www.pgmaths.co.uk - For AS, A otes ad IGCSE / GCSE worksheets September 0 Copyright
More information4.3 Growth Rates of Solutions to Recurrences
4.3. GROWTH RATES OF SOLUTIONS TO RECURRENCES 81 4.3 Growth Rates of Solutios to Recurreces 4.3.1 Divide ad Coquer Algorithms Oe of the most basic ad powerful algorithmic techiques is divide ad coquer.
More informationIn number theory we will generally be working with integers, though occasionally fractions and irrationals will come into play.
Number Theory Math 5840 otes. Sectio 1: Axioms. I umber theory we will geerally be workig with itegers, though occasioally fractios ad irratioals will come ito play. Notatio: Z deotes the set of all itegers
More information11.1 Arithmetic Sequences and Series
11.1 Arithmetic Sequeces ad Series A itroductio 1, 4, 7, 10, 13 9, 1, 7, 15 6., 6.6, 7, 7.4 ππ+, 3, π+ 6 Arithmetic Sequeces ADD To get ext term 35 1 7. 3π + 9, 4, 8, 16, 3 9, 3, 1, 1/ 3 1,1/ 4,1/16,1/
More informationNAME: ALGEBRA 350 BLOCK 7. Simplifying Radicals Packet PART 1: ROOTS
NAME: ALGEBRA 50 BLOCK 7 DATE: Simplifyig Radicals Packet PART 1: ROOTS READ: A square root of a umber b is a solutio of the equatio x = b. Every positive umber b has two square roots, deoted b ad b or
More informationLecture 10: Mathematical Preliminaries
Lecture : Mathematical Prelimiaries Obective: Reviewig mathematical cocepts ad tools that are frequetly used i the aalysis of algorithms. Lecture # Slide # I this
More informationTopic 1 2: Sequences and Series. A sequence is an ordered list of numbers, e.g. 1, 2, 4, 8, 16, or
Topic : Sequeces ad Series A sequece is a ordered list of umbers, e.g.,,, 8, 6, or,,,.... A series is a sum of the terms of a sequece, e.g. + + + 8 + 6 + or... Sigma Notatio b The otatio f ( k) is shorthad
More informationMath 140A Elementary Analysis Homework Questions 1
Math 14A Elemetary Aalysis Homewor Questios 1 1 Itroductio 1.1 The Set N of Natural Numbers 1 Prove that 1 2 2 2 2 1 ( 1(2 1 for all atural umbers. 2 Prove that 3 11 (8 5 4 2 for all N. 4 (a Guess a formula
More informationChapter 10: Power Series
Chapter : Power Series 57 Chapter Overview: Power Series The reaso series are part of a Calculus course is that there are fuctios which caot be itegrated. All power series, though, ca be itegrated because
More informationACCESS TO SCIENCE, ENGINEERING AND AGRICULTURE: MATHEMATICS 1 MATH00030 SEMESTER / Statistics
ACCESS TO SCIENCE, ENGINEERING AND AGRICULTURE: MATHEMATICS 1 MATH00030 SEMESTER 1 018/019 DR. ANTHONY BROWN 8. Statistics 8.1. Measures of Cetre: Mea, Media ad Mode. If we have a series of umbers the
More information= 4 and 4 is the principal cube root of 64.
Chapter Real Numbers ad Radicals Day 1: Roots ad Radicals A2TH SWBAT evaluate radicals of ay idex Do Now: Simplify the followig: a) 2 2 b) (-2) 2 c) -2 2 d) 8 2 e) (-8) 2 f) 5 g)(-5) Based o parts a ad
More informationPatterns in Complex Numbers An analytical paper on the roots of a complex numbers and its geometry
IB MATHS HL POTFOLIO TYPE Patters i Complex Numbers A aalytical paper o the roots of a complex umbers ad its geometry i Syed Tousif Ahmed Cadidate Sessio Number: 0066-009 School Code: 0066 Sessio: May
More informationSNAP Centre Workshop. Basic Algebraic Manipulation
SNAP Cetre Workshop Basic Algebraic Maipulatio 8 Simplifyig Algebraic Expressios Whe a expressio is writte i the most compact maer possible, it is cosidered to be simplified. Not Simplified: x(x + 4x)
More informationSequences. Notation. Convergence of a Sequence
Sequeces A sequece is essetially just a list. Defiitio (Sequece of Real Numbers). A sequece of real umbers is a fuctio Z (, ) R for some real umber. Do t let the descriptio of the domai cofuse you; it
More informationIf we want to add up the area of four rectangles, we could find the area of each rectangle and then write this sum symbolically as:
Sigma Notatio: If we wat to add up the area of four rectagles, we could fid the area of each rectagle ad the write this sum symbolically as: Sum A A A A Liewise, the sum of the areas of te triagles could
More informationMAT 271 Project: Partial Fractions for certain rational functions
MAT 7 Project: Partial Fractios for certai ratioal fuctios Prerequisite kowledge: partial fractios from MAT 7, a very good commad of factorig ad complex umbers from Precalculus. To complete this project,
More informationPROBLEM SET 5 SOLUTIONS 126 = , 37 = , 15 = , 7 = 7 1.
Math 7 Sprig 06 PROBLEM SET 5 SOLUTIONS Notatios. Give a real umber x, we will defie sequeces (a k ), (x k ), (p k ), (q k ) as i lecture.. (a) (5 pts) Fid the simple cotiued fractio represetatios of 6
More informationMath 113 Exam 3 Practice
Math Exam Practice Exam will cover.-.9. This sheet has three sectios. The first sectio will remid you about techiques ad formulas that you should kow. The secod gives a umber of practice questios for you
More informationOrder doesn t matter. There exists a number (zero) whose sum with any number is the number.
P. Real Numbers ad Their Properties Natural Numbers 1,,3. Whole Numbers 0, 1,,... Itegers..., -1, 0, 1,... Real Numbers Ratioal umbers (p/q) Where p & q are itegers, q 0 Irratioal umbers o-termiatig ad
More informationMath 475, Problem Set #12: Answers
Math 475, Problem Set #12: Aswers A. Chapter 8, problem 12, parts (b) ad (d). (b) S # (, 2) = 2 2, sice, from amog the 2 ways of puttig elemets ito 2 distiguishable boxes, exactly 2 of them result i oe
More informationName Period ALGEBRA II Chapter 1B and 2A Notes Solving Inequalities and Absolute Value / Numbers and Functions
Nae Period ALGEBRA II Chapter B ad A Notes Solvig Iequalities ad Absolute Value / Nubers ad Fuctios SECTION.6 Itroductio to Solvig Equatios Objectives: Write ad solve a liear equatio i oe variable. Solve
More informationSigma notation. 2.1 Introduction
Sigma otatio. Itroductio We use sigma otatio to idicate the summatio process whe we have several (or ifiitely may) terms to add up. You may have see sigma otatio i earlier courses. It is used to idicate
More informationEssential Question How can you recognize an arithmetic sequence from its graph?
. Aalyzig Arithmetic Sequeces ad Series COMMON CORE Learig Stadards HSF-IF.A.3 HSF-BF.A. HSF-LE.A. Essetial Questio How ca you recogize a arithmetic sequece from its graph? I a arithmetic sequece, the
More informationProblem 4: Evaluate ( k ) by negating (actually un-negating) its upper index. Binomial coefficient
Problem 4: Evaluate by egatig actually u-egatig its upper idex We ow that Biomial coefficiet r { where r is a real umber, is a iteger The above defiitio ca be recast i terms of factorials i the commo case
More informationand each factor on the right is clearly greater than 1. which is a contradiction, so n must be prime.
MATH 324 Summer 200 Elemetary Number Theory Solutios to Assigmet 2 Due: Wedesday July 2, 200 Questio [p 74 #6] Show that o iteger of the form 3 + is a prime, other tha 2 = 3 + Solutio: If 3 + is a prime,
More informationThe picture in figure 1.1 helps us to see that the area represents the distance traveled. Figure 1: Area represents distance travelled
1 Lecture : Area Area ad distace traveled Approximatig area by rectagles Summatio The area uder a parabola 1.1 Area ad distace Suppose we have the followig iformatio about the velocity of a particle, how
More informationMath 234 Test 1, Tuesday 27 September 2005, 4 pages, 30 points, 75 minutes.
Math 34 Test 1, Tuesday 7 September 5, 4 pages, 3 poits, 75 miutes. The high score was 9 poits out of 3, achieved by two studets. The class average is 3.5 poits out of 3, or 77.5%, which ordiarily would
More informationn m CHAPTER 3 RATIONAL EXPONENTS AND RADICAL FUNCTIONS 3-1 Evaluate n th Roots and Use Rational Exponents Real nth Roots of a n th Root of a
CHAPTER RATIONAL EXPONENTS AND RADICAL FUNCTIONS Big IDEAS: 1) Usig ratioal expoets ) Performig fuctio operatios ad fidig iverse fuctios ) Graphig radical fuctios ad solvig radical equatios Sectio: Essetial
More informationMathematical Induction. How do you program a robot to climb infinite stairs? Let s use that as a proof method. 22c:19 Chapter 4 Hantao Zhang
Mathematical Iductio c:9 Chapter 4 Hatao Zhag How do you program a robot to climb ifiite stairs? First, you let the robot get to the base platform of the staircase The repeat: From the curret positio,
More informationIn algebra one spends much time finding common denominators and thus simplifying rational expressions. For example:
74 The Method of Partial Fractios I algebra oe speds much time fidig commo deomiators ad thus simplifyig ratioal epressios For eample: + + + 6 5 + = + = = + + + + + ( )( ) 5 It may the seem odd to be watig
More informationINTEGRATION BY PARTS (TABLE METHOD)
INTEGRATION BY PARTS (TABLE METHOD) Suppose you wat to evaluate cos d usig itegratio by parts. Usig the u dv otatio, we get So, u dv d cos du d v si cos d si si d or si si d We see that it is ecessary
More informationAlgebra II Notes Unit Seven: Powers, Roots, and Radicals
Syllabus Objectives: 7. The studets will use properties of ratioal epoets to simplify ad evaluate epressios. 7.8 The studet will solve equatios cotaiig radicals or ratioal epoets. b a, the b is the radical.
More informationDiscrete Mathematics for CS Spring 2007 Luca Trevisan Lecture 22
CS 70 Discrete Mathematics for CS Sprig 2007 Luca Trevisa Lecture 22 Aother Importat Distributio The Geometric Distributio Questio: A biased coi with Heads probability p is tossed repeatedly util the first
More informationCHAPTER 10 INFINITE SEQUENCES AND SERIES
CHAPTER 10 INFINITE SEQUENCES AND SERIES 10.1 Sequeces 10.2 Ifiite Series 10.3 The Itegral Tests 10.4 Compariso Tests 10.5 The Ratio ad Root Tests 10.6 Alteratig Series: Absolute ad Coditioal Covergece
More informationThe Binomial Theorem
The Biomial Theorem Robert Marti Itroductio The Biomial Theorem is used to expad biomials, that is, brackets cosistig of two distict terms The formula for the Biomial Theorem is as follows: (a + b ( k
More informationPractice Problems: Taylor and Maclaurin Series
Practice Problems: Taylor ad Maclauri Series Aswers. a) Start by takig derivatives util a patter develops that lets you to write a geeral formula for the -th derivative. Do t simplify as you go, because
More informationEssential Question How can you use properties of exponents to simplify products and quotients of radicals?
. TEXAS ESSENTIAL KNOWLEDGE AND SKILLS A.7.G Properties of Ratioal Expoets ad Radicals Essetial Questio How ca you use properties of expoets to simplify products ad quotiets of radicals? Reviewig Properties
More informationCalculus with Analytic Geometry 2
Calculus with Aalytic Geometry Fial Eam Study Guide ad Sample Problems Solutios The date for the fial eam is December, 7, 4-6:3p.m. BU Note. The fial eam will cosist of eercises, ad some theoretical questios,
More informationAlternating Series. 1 n 0 2 n n THEOREM 9.14 Alternating Series Test Let a n > 0. The alternating series. 1 n a n.
0_0905.qxd //0 :7 PM Page SECTION 9.5 Alteratig Series Sectio 9.5 Alteratig Series Use the Alteratig Series Test to determie whether a ifiite series coverges. Use the Alteratig Series Remaider to approximate
More informationSequences, Sums, and Products
CSCE 222 Discrete Structures for Computig Sequeces, Sums, ad Products Dr. Philip C. Ritchey Sequeces A sequece is a fuctio from a subset of the itegers to a set S. A discrete structure used to represet
More informationMATH 324 Summer 2006 Elementary Number Theory Solutions to Assignment 2 Due: Thursday July 27, 2006
MATH 34 Summer 006 Elemetary Number Theory Solutios to Assigmet Due: Thursday July 7, 006 Departmet of Mathematical ad Statistical Scieces Uiversity of Alberta Questio [p 74 #6] Show that o iteger of the
More information(A sequence also can be thought of as the list of function values attained for a function f :ℵ X, where f (n) = x n for n 1.) x 1 x N +k x N +4 x 3
MATH 337 Sequeces Dr. Neal, WKU Let X be a metric space with distace fuctio d. We shall defie the geeral cocept of sequece ad limit i a metric space, the apply the results i particular to some special
More informationProof of Fermat s Last Theorem by Algebra Identities and Linear Algebra
Proof of Fermat s Last Theorem by Algebra Idetities ad Liear Algebra Javad Babaee Ragai Youg Researchers ad Elite Club, Qaemshahr Brach, Islamic Azad Uiversity, Qaemshahr, Ira Departmet of Civil Egieerig,
More informationMathematics review for CSCI 303 Spring Department of Computer Science College of William & Mary Robert Michael Lewis
Mathematics review for CSCI 303 Sprig 019 Departmet of Computer Sciece College of William & Mary Robert Michael Lewis Copyright 018 019 Robert Michael Lewis Versio geerated: 13 : 00 Jauary 17, 019 Cotets
More informationAddition: Property Name Property Description Examples. a+b = b+a. a+(b+c) = (a+b)+c
Notes for March 31 Fields: A field is a set of umbers with two (biary) operatios (usually called additio [+] ad multiplicatio [ ]) such that the followig properties hold: Additio: Name Descriptio Commutativity
More informationFind a formula for the exponential function whose graph is given , 1 2,16 1, 6
Math 4 Activity (Due by EOC Apr. ) Graph the followig epoetial fuctios by modifyig the graph of f. Fid the rage of each fuctio.. g. g. g 4. g. g 6. g Fid a formula for the epoetial fuctio whose graph is
More informationExponential Rules and How to Use Them Together
Epoetial Rules ad How to Use Them Together Welcome back! Before we look at problems that ivolve the use of all of our epoetial rules, let s review the epoetial rules ad get a strateg for attackig these
More informationSeunghee Ye Ma 8: Week 5 Oct 28
Week 5 Summary I Sectio, we go over the Mea Value Theorem ad its applicatios. I Sectio 2, we will recap what we have covered so far this term. Topics Page Mea Value Theorem. Applicatios of the Mea Value
More informationRegent College Maths Department. Further Pure 1. Proof by Induction
Reget College Maths Departmet Further Pure Proof by Iductio Further Pure Proof by Mathematical Iductio Page Further Pure Proof by iductio The Edexcel syllabus says that cadidates should be able to: (a)
More informationSummary: Congruences. j=1. 1 Here we use the Mathematica syntax for the function. In Maple worksheets, the function
Summary: Cogrueces j whe divided by, ad determiig the additive order of a iteger mod. As described i the Prelab sectio, cogrueces ca be thought of i terms of coutig with rows, ad for some questios this
More informationSEQUENCES AND SERIES
Sequeces ad 6 Sequeces Ad SEQUENCES AND SERIES Successio of umbers of which oe umber is desigated as the first, other as the secod, aother as the third ad so o gives rise to what is called a sequece. Sequeces
More informationCombinatorially Thinking
Combiatorially Thiig SIMUW 2008: July 4 25 Jeifer J Qui jjqui@uwashigtoedu Philosophy We wat to costruct our mathematical uderstadig To this ed, our goal is to situate our problems i cocrete coutig cotexts
More informationRoberto s Notes on Infinite Series Chapter 1: Sequences and series Section 3. Geometric series
Roberto s Notes o Ifiite Series Chapter 1: Sequeces ad series Sectio Geometric series What you eed to kow already: What a ifiite series is. The divergece test. What you ca le here: Everythig there is to
More information10.1 Sequences. n term. We will deal a. a n or a n n. ( 1) n ( 1) n 1 2 ( 1) a =, 0 0,,,,, ln n. n an 2. n term.
0. Sequeces A sequece is a list of umbers writte i a defiite order: a, a,, a, a is called the first term, a is the secod term, ad i geeral eclusively with ifiite sequeces ad so each term Notatio: the sequece
More informationModern Algebra 1 Section 1 Assignment 1. Solution: We have to show that if you knock down any one domino, then it knocks down the one behind it.
Moder Algebra 1 Sectio 1 Assigmet 1 JOHN PERRY Eercise 1 (pg 11 Warm-up c) Suppose we have a ifiite row of domioes, set up o ed What sort of iductio argumet would covice us that ocig dow the first domio
More information( ) GENERATING FUNCTIONS
GENERATING FUNCTIONS Solve a ifiite umber of related problems i oe swoop. *Code the problems, maipulate the code, the decode the aswer! Really a algebraic cocept but ca be eteded to aalytic basis for iterestig
More information4 Mathematical Induction
4 Mathematical Iductio Examie the propositios for all, 1 + + ( + 1) + = for all, + 1 ( + 1) for all How do we prove them? They are statemets ivolvig a variable ruig through the ifiite set Strictly speakig,
More informationCHAPTER I: Vector Spaces
CHAPTER I: Vector Spaces Sectio 1: Itroductio ad Examples This first chapter is largely a review of topics you probably saw i your liear algebra course. So why cover it? (1) Not everyoe remembers everythig
More informationAppendix: The Laplace Transform
Appedix: The Laplace Trasform The Laplace trasform is a powerful method that ca be used to solve differetial equatio, ad other mathematical problems. Its stregth lies i the fact that it allows the trasformatio
More informationFLC Ch 8 & 9. Evaluate. Check work. a) b) c) d) e) f) g) h) i) j) k) l) m) n) o) 3. p) q) r) s) t) 3.
Math 100 Elemetary Algebra Sec 8.1: Radical Expressios List perfect squares ad evaluate their square root. Kow these perfect squares for test. Def The positive (pricipal) square root of x, writte x, is
More informationMATH 147 Homework 4. ( = lim. n n)( n + 1 n) n n n. 1 = lim
MATH 147 Homework 4 1. Defie the sequece {a } by a =. a) Prove that a +1 a = 0. b) Prove that {a } is ot a Cauchy sequece. Solutio: a) We have: ad so we re doe. a +1 a = + 1 = + 1 + ) + 1 ) + 1 + 1 = +
More informationMATH 166 TEST 3 REVIEW SHEET
MATH 66 TEST REVIEW SHEET Geeral Commets ad Advice: The studet should regard this review sheet oly as a sample of potetial test problems, ad ot a ed-all-be-all guide to its cotet. Aythig ad everythig which
More informationZ ß cos x + si x R du We start with the substitutio u = si(x), so du = cos(x). The itegral becomes but +u we should chage the limits to go with the ew
Problem ( poits) Evaluate the itegrals Z p x 9 x We ca draw a right triagle labeled this way x p x 9 From this we ca read off x = sec, so = sec ta, ad p x 9 = R ta. Puttig those pieces ito the itegralrwe
More informationObjective Mathematics
. If sum of '' terms of a sequece is give by S Tr ( )( ), the 4 5 67 r (d) 4 9 r is equal to : T. Let a, b, c be distict o-zero real umbers such that a, b, c are i harmoic progressio ad a, b, c are i arithmetic
More informationMathematical Induction
Mathematical Iductio Itroductio Mathematical iductio, or just iductio, is a proof techique. Suppose that for every atural umber, P() is a statemet. We wish to show that all statemets P() are true. I a
More informationROSE WONG. f(1) f(n) where L the average value of f(n). In this paper, we will examine averages of several different arithmetic functions.
AVERAGE VALUES OF ARITHMETIC FUNCTIONS ROSE WONG Abstract. I this paper, we will preset problems ivolvig average values of arithmetic fuctios. The arithmetic fuctios we discuss are: (1)the umber of represetatios
More informationTHE KENNESAW STATE UNIVERSITY HIGH SCHOOL MATHEMATICS COMPETITION PART II Calculators are NOT permitted Time allowed: 2 hours
THE 06-07 KENNESAW STATE UNIVERSITY HIGH SCHOOL MATHEMATICS COMPETITION PART II Calculators are NOT permitted Time allowed: hours Let x, y, ad A all be positive itegers with x y a) Prove that there are
More informationMath 105 TOPICS IN MATHEMATICS REVIEW OF LECTURES VII. 7. Binomial formula. Three lectures ago ( in Review of Lectuires IV ), we have covered
Math 5 TOPICS IN MATHEMATICS REVIEW OF LECTURES VII Istructor: Lie #: 59 Yasuyuki Kachi 7 Biomial formula February 4 Wed) 5 Three lectures ago i Review of Lectuires IV ) we have covered / \ / \ / \ / \
More informationARITHMETIC PROGRESSIONS
CHAPTER 5 ARITHMETIC PROGRESSIONS (A) Mai Cocepts ad Results A arithmetic progressio (AP) is a list of umbers i which each term is obtaied by addig a fixed umber d to the precedig term, except the first
More informationSeries Review. a i converges if lim. i=1. a i. lim S n = lim i=1. 2 k(k + 2) converges. k=1. k=1
Defiitio: We say that the series S = Series Review i= a i is the sum of the first terms. i= a i coverges if lim S exists ad is fiite, where The above is the defiitio of covergece for series. order to see
More informationPb ( a ) = measure of the plausibility of proposition b conditional on the information stated in proposition a. & then using P2
Axioms for Probability Logic Pb ( a ) = measure of the plausibility of propositio b coditioal o the iformatio stated i propositio a For propositios a, b ad c: P: Pb ( a) 0 P2: Pb ( a& b ) = P3: Pb ( a)
More informationSECTION 1.5 : SUMMATION NOTATION + WORK WITH SEQUENCES
SECTION 1.5 : SUMMATION NOTATION + WORK WITH SEQUENCES Read Sectio 1.5 (pages 5 9) Overview I Sectio 1.5 we lear to work with summatio otatio ad formulas. We will also itroduce a brief overview of sequeces,
More information(b) What is the probability that a particle reaches the upper boundary n before the lower boundary m?
MATH 529 The Boudary Problem The drukard s walk (or boudary problem) is oe of the most famous problems i the theory of radom walks. Oe versio of the problem is described as follows: Suppose a particle
More informationLecture Overview. 2 Permutations and Combinations. n(n 1) (n (k 1)) = n(n 1) (n k + 1) =
COMPSCI 230: Discrete Mathematics for Computer Sciece April 8, 2019 Lecturer: Debmalya Paigrahi Lecture 22 Scribe: Kevi Su 1 Overview I this lecture, we begi studyig the fudametals of coutig discrete objects.
More informationPart I: Covers Sequence through Series Comparison Tests
Part I: Covers Sequece through Series Compariso Tests. Give a example of each of the followig: (a) A geometric sequece: (b) A alteratig sequece: (c) A sequece that is bouded, but ot coverget: (d) A sequece
More informationInduction proofs - practice! SOLUTIONS
Iductio proofs - practice! SOLUTIONS 1. Prove that f ) = 6 + + 15 is odd for all Z +. Base case: For = 1, f 1) = 41) + 1) + 13 = 19. Sice 19 is odd, f 1) is odd - base case prove. Iductive hypothesis:
More informationSquare-Congruence Modulo n
Square-Cogruece Modulo Abstract This paper is a ivestigatio of a equivalece relatio o the itegers that was itroduced as a exercise i our Discrete Math class. Part I - Itro Defiitio Two itegers are Square-Cogruet
More information