SUMS OF nth POWERS OF ROOTS OF A GIVEN QUADRATIC EQUATION. N.A. Draim, Ventura, Calif., and Marjorie Bicknell Wilcox High School, Santa Clara, Calif.


 Garry McCoy
 2 years ago
 Views:
Transcription
1 SUMS OF th OWERS OF ROOTS OF A GIVEN QUADRATIC EQUATION N.A. Draim, Vetura, Calif., ad Marjorie Bickell Wilcox High School, Sata Clara, Calif. The quadratic equatio whose roots a r e the sum or differece of the th powers of the roots of a give quadratic equatio is of i t e r e s t to the algorithmatist both for the umber patters to be see ad for the implied coectio betwee quadratic equatios ad the factorability ad primeess of u m b e r s. I this paper, a elemetary approach which poits out relatioships which might otherwise be m i s s e d is used to derive geeral expressios for the subject equatio ad to show how Lucas ad Fiboacci umbers a r i s e as special c a s e s. Sums of like powers of roots of a give equatio have bee studied i detail. For a few examples, i this Quarterly S. L. Basi [l~j has used a developmet of Warig's formula [ ] for sums of like powers of roots to write a geeratig fuctio for Lucas u mbers ad to write the kth Lucas umber as a sum of biomial coefficiets. R. G. Buschma [J has used a liear combiatio of like powers of roots of a quadratic to study the differece equatio u, = au + bu, arrivig at a result which e x p r e s s e s u i t e r m s of a ad b. aul F. Byrd ["j, [ ] h a s studied the coefficiets i expasios of a  alytic fuctios i polyomials associated with Fiboacci u m b e r s. A umber of the results i the foregoig refereces appear as special cases of those of the preset paper. A. THE SUMS OF THE th OWERS Give the primitive equatio f(x) = x  px q =, with roots r, ad r?, the first problem cosidered h e r e is to write the equatio with roots r ] ad r?. formula, i \, *. * f(x) = x  (r + r ) x  ( r x r ) =, Solvig /the primitive equatio for r, ad r by the quadratic
2 9 SUMS OF th OWERS OF ROOTS OF A GIVEN r x = ( + J? Z + q)/, r = (p  Jp Z + q)/. Sice r ad r satisfy the equatio (x  r )(x  r ) =, x  (r + r )x + r r = x  px  q = idetically, so r, + r = p ad r r~ = q. Next, write the equatio f(x), havig roots. r, ad r Squarig roots, r J = [(p + \/p + q)/] = (p + q + p / p + q)/ r\ =[(p  V/ + q)/] = (p + q  p / p + q)/. Addig, r, + r? = p + q. The desired equatio is the f(x) = x  (p + q)x + q =. Similarly, the coefficiet of x for the equatio f(x) =, by multi plyig ad addig, is r + r = p + pq. Cotiuig i this maer, the coefficiets for x for the equatios whose roots a r e higher powers of r, ad r ca be tabulated as follows: The sequece for r, + r eds whe, for a give, the last t e r m i the sequece becomes equal to zero. The peultimate t e r m a s s u m e s the form q ' whe is evead pq ' whe is odd. Writig the umerical coefficiets from Table i the form of a a r r a y of m colums ad rows ad lettig C(m, ) deote the c o efficiet i the m t h colum ad th row leads to Table. It is obvious that.the iterative operatio i Table to geerate additioal um e r i c a l coefficiets is C(m, ) = C ( m , ) + C(m, ), which suggests a liear combiatio of biomial coefficiets. expasio, By direct (  m ) (  m  l )... (m+) _?,+lm,,m ( (ml)i " m  } " ( m  l
3 QUADRATIC EQUATION April TABLE : r * + r r l + r =,, r T r =, r l + r =, t r = r l + r =, r l + r = 8, 8 r l + r = 8 + q + pq + p q + q + p q + :pq' + p q + 9p q + q + p q + p q + pq + 8p q + p q + lp q + q., Z, (  ) , (  )(  )  r l = p q q p q ~T! T (  m)(  m  )... (  m + ) m+ m ( m  )! q TABLE : C(m, ) m L SC(m, ) L L L L L L 9 8 L 9 L 8
4 9 SUMS OF th OWERS OF ROOTS OF A GIVEN F r o m the above tables, (A. ). r + l r [a/] i= z^: )  (  i  ) s ' i i p q where [ x ] is the greatest iteger less tha or equal to x, ad ( ) is the biomial coefficiet roof: By algebra, (m)l! k+ k+ k, k+ A k+ k, k x, k t k. r, + r = (r, + r~ + r r 9 + A r l ^ ' )  ( ^r, + r, ^ )' = (r^ + r ^ ) ( r i + r )  r ^ r * " + r k " l ) = p(r + r ) + q(r + r ). 'I F r o m Table, (A. ) holds for =,,..., 8. To prove (A. ) by mathematical iductio, a s s u m e that (A ) holds whe = k ad = k . Usig the result just give ad the iductive hypothesis, [k/] k+, k+ v r, + r = p i= [(kl)/] + q i= ( k :S. ( k_i " ) i i ki i q k  l  i _ ki I I k  l  i i q Multiplyig as idicated ad usig the idex substitutio i for i i the secod s e r i e s yields k+, k+ r + l r [V] i= ( k : i )  ( k " i _ ) ' k+li i q +l)/] + i [( k :j>  ( k ; ; ) i= k+li i q
5 QUADRATIC EQUATION April Sice the r e c u r s i o formula for biomial coefficiets is m m m+ l ' l + l ; { + l ' ' combiig the s e r i e s above will yield [ ( k + i  i } _ ( k  i } ] for the coefficiet of p q. Cosiderig the s e r i e s for k eve ad for k odd leads to [(k+l)/] k+, k+ v r x + r = I i= ' ( k + l  i j _ (ki } ' k+li i p q so that (A. ) follows by mathematical iductio. A expressio equivalet to (A. ) was give by Basi i [! ] Usig formula (A. ), we ca write the desired equatio,... v f(x) = x  (r x + r ) x + () q =. Example: Give the equatio x  x + =, write the equatio whose roots a r e the fourth powers of the roots of the give equatio, without solvig the give equatio. I the give equatio, p =, q =. F r o m Table or formula (A. ), r^ + rjj = () + () () + () = 9, so f(x) = x  9x + =. As a check, by factorig x x + =, r ] = ad r_ =, givig us f(x) = (x  )(x  ) = x  9x +. Returig to Table, the summatio of the coefficiets by rows yields the s e r i e s,,,,, 8, 9,,..., the successive Lucas umbers defied by L, =, L =, ad L = L, + L.   The geeral equatio for r, + r? reduces to the umerical values of C(m, ) of Table for p = q = i the primitive equatio x  px q = c p, which becomes x  x  = with roots a = ( + /ft)/ ad ( = (  \/~)/. This yields a expressio for the th Lucas umber, sice L = a + ;
6 9 SUMS OF th OWERS OF ROOTS OF A GIVEN (A. ) L^ = + + (N)/! + ()()/! + ()()()/! [/] i= ( : i )  ( 'Y l y For example, L, = + + ()/ + ()(l)/ = 8. Also, the equatio whose roots a r e the th roots of x  x  = is x  L x + () =. (Essetially, equatio (A. ), a s w e l l a s (A. ), (B. ), (B ), appears i [ ] by Buschma. ) A alterate expressio for L is obtaied by expressig r + r i t e r m s of p ad A, where A = \/p + rq e Now, T i _LA\/? o  /. ~ l. (l) ~. (l)() , r x = L( +A )/J = (p + p A +  ^ T " A + / 'p + r, \ / o i o~ / _ = l.. (l) ,(l)() , r = [( A )/J (  A + " ^ T ~  A +^r + which, for p = q =, A = v, implies, o addig, (A. ) L = ~ (l  (l)/i + (~ l)()()/! +... ) [/] _i,, T ^;.)?  l x r Z i= B. THE DIFFERENCES OF THE th OWERS Now let us tur to the equatio whose roots a r e r ad  r where r ad r a r e the roots of the primitive equatio x px q = Ct Sice r l " r = ( p + ^ p + r q ) / / " ( p " V pl + q ) / / = ^ p + q = A ' the equatio whose roots a r e r, ad ~r is x  y p + rq x  r, r =, ad f(x) = x  A x + q =. Similarly, *\ x \ = O + / + ( )/ ]  [(  V/ + <>/ ] =
7 Q U A D R A T I C E Q U A T I O N A p r i l C o t i u i g i t h i s m a e r, a d a s s e m b l i g r e s u l t s, we h a v e T A B L E r l " r A. A (p + q ) A ( p + pq)a ( p + p q + q ) A ( p + p q + p q ) A ( p + p q + p q + q )A., . _.  ^ (  ) (  )  (p + ()p q +  i JJ ' p q +..., (  m  l ) (  m  ),., (  m )  m  l m.. + _ Li ' i L p q ) A mi The sequece for r  r? as give i Table eds, for a give, o arrivig at t e r m z e r o. Writig the umerical coefficiets from Table i the form of a a r r a y of m colums ad rows, ad lettig C (m, ) deote the coefficiet i the mth colum ad th row, TABLE : C (m, ) A m % C A (m, ) L L L L L L L 8 L L
8 9 SUMS OF th OWERS OF ROOTS OF A GIVEN It is obvious that the iterative p r o c e s s to geerate additioal umerical coefficiets r e s t s o the relatio the same as for Table C A (m? ) = C A ( m  l, ) + C A (m, ), The coefficiets geerated a r e also the coefficiets appearig i the Fiboacci polyomials defied by f + (x) = x f j x ) +f _ (x), f (x) = l, f (x) = x. (For further refereces to Fiboacci polyomials, see Byrd, [ ], p.. ) Tables ad lead to l>/] (B.l) r j  r j = A (""j" ) ^ ' V. j= which is proved similarly to (A. ) The equatio whose roots a r e r ' ad  r?, where r ad r,u r\ i \ / \ J_ a r e the roots of x  px  q =, is f(x) A = x  (r  r )x + q =. We use ( B. l ) to solve the followig: i L Give the equatio x  lox + = with usolved roots r, ad r?, write the quadratic equatio whose roots a r e r, ad  r? F r o m the give equatio, p =, q = , r ad A = /  () =, Usig ( B. l ) or Table, r l " r = ( p + q ) = ( " ) = l e Hece f (x) A = x  lx + () =. As a check, the roots of the prob lem equatio a r e r ] =, r =, so f(xl = (x  )(x + ) = x  lx  =. The summatio of t e r m s i the successive rows of Table is see to yield the sequece of Fiboacci u m b e r s, defied by F, = F? =, F = F, + F o8 This result ca be demostrated by substitutig &   p = q = i the geeral expressio (B. ) ad dividig by A = /, for the left had m e m b e r becomes the Biet form, F = (a  p")/ ST. I geeral,
9 8 QUADRATIC EQUATION April (B.) F = + () + ()()/! + ()()()/! +... j=o the sum of t e r m s i risig diagoals of a s c a l ' s triagle. Also, the quadratic equatio whose roots a r e a ad (, th powers of the roots of the quadratic equatio x  x  = with roots a = ( + / ) / ad ( = (  / ) /, is x  /" F x  =. Expressig r,  r? i t e r m s of oly p ad A ad assemblig t e r m s as we did for r, + r i (A. ), we a r r i v e at a alterate exp r e s s i o for the th Fiboacci umber, (B. ) F = ~ ( I (l)()/! + ( l)()(~)()/! +... [(l)/] R < X " ( i + l J i= REFERENCES le S. L Basi, "A Note o Warig's Formula for Sums of Like owers of Roots", 9. Fiboacci Quarterly :, April, 9, pp.. L. E. Dickso, F i r s t Course i the Theory of Equatios, Joh Wiley, 9. ~. R. G. Buschma, "Fiboacci Numbers, Chebyshev olyomials, Geeralizatios ad Differece Equatios", Fiboacci Quarterly :, D e c, 9, pp aul F. Byrd, "Expasio of Aalytic Fuctios i olyomials Associated with Fiboacci Numbers", Fiboacci Quarterly, :, Feb. 9, pp aul F. Byrd, "Expasio of Aalytic Fuctios i T e r m s Ivolvig Lucas Numbers or Similar Number Sequeces", Fiboacci Quarterly :, April, 9, pp. . XXXXXXXXXXXXXXX
Binet Formulas for Recursive Integer Sequences
Biet Formulas for Recursive Iteger Sequeces Homer W. Austi Jatha W. Austi Abstract May iteger sequeces are recursive sequeces ad ca be defied either recursively or explicitly by use of Biettype formulas.
More informationThe second difference is the sequence of differences of the first difference sequence, 2
Differece Equatios I differetial equatios, you look for a fuctio that satisfies ad equatio ivolvig derivatives. I differece equatios, istead of a fuctio of a cotiuous variable (such as time), we look for
More informationChapter Gaussian Elimination
Chapter 04.06 Gaussia Elimiatio After readig this chapter, you should be able to:. solve a set of simultaeous liear equatios usig Naïve Gauss elimiatio,. lear the pitfalls of the Naïve Gauss elimiatio
More information1 The Binomial Theorem: Another Approach
The Biomial Theorem: Aother Approach Pascal s Triagle I class (ad i our text we saw that, for iteger, the biomial theorem ca be stated (a + b = c a + c a b + c a b + + c ab + c b, where the coefficiets
More informationON SUMMATIONS AND EXPANSIONS OF FIBONACCI NUMBERS
ON SUMMATIONS AND EXPANSIONS OF FIBONACCI NUMBERS HERTAT. FRESTAG Hoilis, Virgiia INTRODUCTION Oe of the early delights a eophyte i the study of Fiboacci umbers experieces may be a ecouter with some elemetary
More informationSoving Recurrence Relations
Sovig Recurrece Relatios Part 1. Homogeeous liear 2d degree relatios with costat coefficiets. Cosider the recurrece relatio ( ) T () + at ( 1) + bt ( 2) = 0 This is called a homogeeous liear 2d degree
More information8.3 POLAR FORM AND DEMOIVRE S THEOREM
SECTION 8. POLAR FORM AND DEMOIVRE S THEOREM 48 8. POLAR FORM AND DEMOIVRE S THEOREM Figure 8.6 (a, b) b r a 0 θ Complex Number: a + bi Rectagular Form: (a, b) Polar Form: (r, θ) At this poit you ca add,
More informationHW 1 Solutions Math 115, Winter 2009, Prof. Yitzhak Katznelson
HW Solutios Math 5, Witer 2009, Prof. Yitzhak Katzelso.: Prove 2 + 2 2 +... + 2 = ( + )(2 + ) for all atural umbers. The proof is by iductio. Call the th propositio P. The basis for iductio P is the statemet
More information1. MATHEMATICAL INDUCTION
1. MATHEMATICAL INDUCTION EXAMPLE 1: Prove that for ay iteger 1. Proof: 1 + 2 + 3 +... + ( + 1 2 (1.1 STEP 1: For 1 (1.1 is true, sice 1 1(1 + 1. 2 STEP 2: Suppose (1.1 is true for some k 1, that is 1
More informationMath Discrete Math Combinatorics MULTIPLICATION PRINCIPLE:
Math 355  Discrete Math 4.14.4 Combiatorics Notes MULTIPLICATION PRINCIPLE: If there m ways to do somethig ad ways to do aother thig the there are m ways to do both. I the laguage of set theory: Let
More informationTo get the next Fibonacci number, you add the previous two. numbers are defined by the recursive formula. F 1 F n+1
Liear Algebra Notes Chapter 6 FIBONACCI NUMBERS The Fiboacci umbers are F, F, F 2, F 3 2, F 4 3, F, F 6 8, To get the ext Fiboacci umber, you add the previous two umbers are defied by the recursive formula
More informationInfinite Sequences and Series
CHAPTER 4 Ifiite Sequeces ad Series 4.1. Sequeces A sequece is a ifiite ordered list of umbers, for example the sequece of odd positive itegers: 1, 3, 5, 7, 9, 11, 13, 15, 17, 19, 21, 23, 25, 27, 29...
More informationModule 4: Mathematical Induction
Module 4: Mathematical Iductio Theme 1: Priciple of Mathematical Iductio Mathematical iductio is used to prove statemets about atural umbers. As studets may remember, we ca write such a statemet as a predicate
More informationSEQUENCES AND SERIES
Chapter 9 SEQUENCES AND SERIES Natural umbers are the product of huma spirit. DEDEKIND 9.1 Itroductio I mathematics, the word, sequece is used i much the same way as it is i ordiary Eglish. Whe we say
More informationBINOMIAL EXPANSIONS 12.5. In this section. Some Examples. Obtaining the Coefficients
652 (1226) Chapter 12 Sequeces ad Series 12.5 BINOMIAL EXPANSIONS I this sectio Some Examples Otaiig the Coefficiets The Biomial Theorem I Chapter 5 you leared how to square a iomial. I this sectio you
More informationNUMBERS COMMON TO TWO POLYGONAL SEQUENCES
NUMBERS COMMON TO TWO POLYGONAL SEQUENCES DIANNE SMITH LUCAS Chia Lake, Califoria a iteger, The polygoal sequece (or sequeces of polygoal umbers) of order r (where r is r > 3) may be defied recursively
More informationSection IV.5: Recurrence Relations from Algorithms
Sectio IV.5: Recurrece Relatios from Algorithms Give a recursive algorithm with iput size, we wish to fid a Θ (best big O) estimate for its ru time T() either by obtaiig a explicit formula for T() or by
More information1.3 Binomial Coefficients
18 CHAPTER 1. COUNTING 1. Biomial Coefficiets I this sectio, we will explore various properties of biomial coefficiets. Pascal s Triagle Table 1 cotais the values of the biomial coefficiets ( ) for 0to
More informationTrigonometric Form of a Complex Number. The Complex Plane. axis. ( 2, 1) or 2 i FIGURE 6.44. The absolute value of the complex number z a bi is
0_0605.qxd /5/05 0:45 AM Page 470 470 Chapter 6 Additioal Topics i Trigoometry 6.5 Trigoometric Form of a Complex Number What you should lear Plot complex umbers i the complex plae ad fid absolute values
More informationORDERS OF GROWTH KEITH CONRAD
ORDERS OF GROWTH KEITH CONRAD Itroductio Gaiig a ituitive feel for the relative growth of fuctios is importat if you really wat to uderstad their behavior It also helps you better grasp topics i calculus
More informationAlgebra Work Sheets. Contents
The work sheets are grouped accordig to math skill. Each skill is the arraged i a sequece of work sheets that build from simple to complex. Choose the work sheets that best fit the studet s eed ad will
More informationYour grandmother and her financial counselor
Sectio 10. Arithmetic Sequeces 963 Objectives Sectio 10. Fid the commo differece for a arithmetic sequece. Write s of a arithmetic sequece. Use the formula for the geeral of a arithmetic sequece. Use the
More informationSolving DivideandConquer Recurrences
Solvig DivideadCoquer Recurreces Victor Adamchik A divideadcoquer algorithm cosists of three steps: dividig a problem ito smaller subproblems solvig (recursively) each subproblem the combiig solutios
More informationFactors of sums of powers of binomial coefficients
ACTA ARITHMETICA LXXXVI.1 (1998) Factors of sums of powers of biomial coefficiets by Neil J. Cali (Clemso, S.C.) Dedicated to the memory of Paul Erdős 1. Itroductio. It is well ow that if ( ) a f,a = the
More informationSequences and Series
CHAPTER 9 Sequeces ad Series 9.. Covergece: Defiitio ad Examples Sequeces The purpose of this chapter is to itroduce a particular way of geeratig algorithms for fidig the values of fuctios defied by their
More informationLinear Algebra II. 4 Determinants. Notes 4 1st November Definition of determinant
MTH6140 Liear Algebra II Notes 4 1st November 2010 4 Determiats The determiat is a fuctio defied o square matrices; its value is a scalar. It has some very importat properties: perhaps most importat is
More informationNPTEL STRUCTURAL RELIABILITY
NPTEL Course O STRUCTURAL RELIABILITY Module # 0 Lecture 1 Course Format: Web Istructor: Dr. Aruasis Chakraborty Departmet of Civil Egieerig Idia Istitute of Techology Guwahati 1. Lecture 01: Basic Statistics
More informationFourier Series and the Wave Equation Part 2
Fourier Series ad the Wave Equatio Part There are two big ideas i our work this week. The first is the use of liearity to break complicated problems ito simple pieces. The secod is the use of the symmetries
More informationEssential Question How can you use properties of exponents to simplify products and quotients of radicals?
. Properties of Ratioal Expoets ad Radicals Essetial Questio How ca you use properties of expoets to simplify products ad quotiets of radicals? Reviewig Properties of Expoets Work with a parter. Let a
More informationAlgebra Vocabulary List (Definitions for Middle School Teachers)
Algebra Vocabulary List (Defiitios for Middle School Teachers) A Absolute Value Fuctio The absolute value of a real umber x, x is xifx 0 x = xifx < 0 http://www.math.tamu.edu/~stecher/171/f02/absolutevaluefuctio.pdf
More information8.5 Alternating infinite series
65 8.5 Alteratig ifiite series I the previous two sectios we cosidered oly series with positive terms. I this sectio we cosider series with both positive ad egative terms which alterate: positive, egative,
More informationFIBONACCI NUMBERS: AN APPLICATION OF LINEAR ALGEBRA. 1. Powers of a matrix
FIBONACCI NUMBERS: AN APPLICATION OF LINEAR ALGEBRA. Powers of a matrix We begi with a propositio which illustrates the usefuless of the diagoalizatio. Recall that a square matrix A is diogaalizable if
More informationUnit 8 Rational Functions
Uit 8 Ratioal Fuctios Algebraic Fractios: Simplifyig Algebraic Fractios: To simplify a algebraic fractio meas to reduce it to lowest terms. This is doe by dividig out the commo factors i the umerator ad
More informationHomework 1 Solutions
Homewor 1 Solutios Math 171, Sprig 2010 Please sed correctios to herya@math.staford.edu 2.2. Let h : X Y, g : Y Z, ad f : Z W. Prove that (f g h = f (g h. Solutio. Let x X. Note that ((f g h(x = (f g(h(x
More informationPage 2 of 14 = T(2) + 2 = [ T(3)+1 ] + 2 Substitute T(3)+1 for T(2) = T(3) + 3 = [ T(4)+1 ] + 3 Substitute T(4)+1 for T(3) = T(4) + 4 After i
Page 1 of 14 Search C455 Chapter 4  Recursio Tree Documet last modified: 02/09/2012 18:42:34 Uses: Use recursio tree to determie a good asymptotic boud o the recurrece T() = Sum the costs withi each level
More informationSUMS OF GENERALIZED HARMONIC SERIES. Michael E. Ho man Department of Mathematics, U. S. Naval Academy, Annapolis, Maryland
#A46 INTEGERS 4 (204) SUMS OF GENERALIZED HARMONIC SERIES Michael E. Ho ma Departmet of Mathematics, U. S. Naval Academy, Aapolis, Marylad meh@usa.edu Courtey Moe Departmet of Mathematics, U. S. Naval
More informationA probabilistic proof of a binomial identity
A probabilistic proof of a biomial idetity Joatho Peterso Abstract We give a elemetary probabilistic proof of a biomial idetity. The proof is obtaied by computig the probability of a certai evet i two
More informationARITHMETIC AND GEOMETRIC PROGRESSIONS
Arithmetic Ad Geometric Progressios Sequeces Ad ARITHMETIC AND GEOMETRIC PROGRESSIONS Successio of umbers of which oe umber is desigated as the first, other as the secod, aother as the third ad so o gives
More informationCS103A Handout 23 Winter 2002 February 22, 2002 Solving Recurrence Relations
CS3A Hadout 3 Witer 00 February, 00 Solvig Recurrece Relatios Itroductio A wide variety of recurrece problems occur i models. Some of these recurrece relatios ca be solved usig iteratio or some other ad
More informationIn nite Sequences. Dr. Philippe B. Laval Kennesaw State University. October 9, 2008
I ite Sequeces Dr. Philippe B. Laval Keesaw State Uiversity October 9, 2008 Abstract This had out is a itroductio to i ite sequeces. mai de itios ad presets some elemetary results. It gives the I ite Sequeces
More informationCME 302: NUMERICAL LINEAR ALGEBRA FALL 2005/06 LECTURE 8
CME 30: NUMERICAL LINEAR ALGEBRA FALL 005/06 LECTURE 8 GENE H GOLUB 1 Positive Defiite Matrices A matrix A is positive defiite if x Ax > 0 for all ozero x A positive defiite matrix has real ad positive
More informationMath 475, Problem Set #6: Solutions
Math 475, Problem Set #6: Solutios A (a) For each poit (a, b) with a, b oegative itegers satisfyig ab 8, cout the paths from (0,0) to (a, b) where the legal steps from (i, j) are to (i 2, j), (i, j 2),
More informationwhen n = 1, 2, 3, 4, 5, 6, This list represents the amount of dollars you have after n days. Note: The use of is read as and so on.
Geometric eries Before we defie what is meat by a series, we eed to itroduce a related topic, that of sequeces. Formally, a sequece is a fuctio that computes a ordered list. uppose that o day 1, you have
More informationFOUNDATIONS OF MATHEMATICS AND PRECALCULUS GRADE 10
FOUNDATIONS OF MATHEMATICS AND PRECALCULUS GRADE 10 [C] Commuicatio Measuremet A1. Solve problems that ivolve liear measuremet, usig: SI ad imperial uits of measure estimatio strategies measuremet strategies.
More informationThe Field of Complex Numbers
The Field of Complex Numbers S. F. Ellermeyer The costructio of the system of complex umbers begis by appedig to the system of real umbers a umber which we call i with the property that i = 1. (Note that
More informationx(x 1)(x 2)... (x k + 1) = [x] k n+m 1
1 Coutig mappigs For every real x ad positive iteger k, let [x] k deote the fallig factorial ad x(x 1)(x 2)... (x k + 1) ( ) x = [x] k k k!, ( ) k = 1. 0 I the sequel, X = {x 1,..., x m }, Y = {y 1,...,
More informationDefinition. A variable X that takes on values X 1, X 2, X 3,...X k with respective frequencies f 1, f 2, f 3,...f k has mean
1 Social Studies 201 October 13, 2004 Note: The examples i these otes may be differet tha used i class. However, the examples are similar ad the methods used are idetical to what was preseted i class.
More informationFactoring x n 1: cyclotomic and Aurifeuillian polynomials Paul Garrett <garrett@math.umn.edu>
(March 16, 004) Factorig x 1: cyclotomic ad Aurifeuillia polyomials Paul Garrett Polyomials of the form x 1, x 3 1, x 4 1 have at least oe systematic factorizatio x 1 = (x 1)(x 1
More informationThe Euler Totient, the Möbius and the Divisor Functions
The Euler Totiet, the Möbius ad the Divisor Fuctios Rosica Dieva July 29, 2005 Mout Holyoke College South Hadley, MA 01075 1 Ackowledgemets This work was supported by the Mout Holyoke College fellowship
More informationThe Field Q of Rational Numbers
Chapter 3 The Field Q of Ratioal Numbers I this chapter we are goig to costruct the ratioal umber from the itegers. Historically, the positive ratioal umbers came first: the Babyloias, Egyptias ad Grees
More informationA Recursive Formula for Moments of a Binomial Distribution
A Recursive Formula for Momets of a Biomial Distributio Árpád Béyi beyi@mathumassedu, Uiversity of Massachusetts, Amherst, MA 01003 ad Saverio M Maago smmaago@psavymil Naval Postgraduate School, Moterey,
More information23 The Remainder and Factor Theorems
 The Remaider ad Factor Theorems Factor each polyomial completely usig the give factor ad log divisio 1 x + x x 60; x + So, x + x x 60 = (x + )(x x 15) Factorig the quadratic expressio yields x + x x
More informationSection 11.3: The Integral Test
Sectio.3: The Itegral Test Most of the series we have looked at have either diverged or have coverged ad we have bee able to fid what they coverge to. I geeral however, the problem is much more difficult
More informationChapter Suppose you wish to use the Principle of Mathematical Induction to prove that 1 1! + 2 2! + 3 3! n n! = (n + 1)! 1 for all n 1.
Chapter 4. Suppose you wish to prove that the followig is true for all positive itegers by usig the Priciple of Mathematical Iductio: + 3 + 5 +... + ( ) =. (a) Write P() (b) Write P(7) (c) Write P(73)
More informationBasic Elements of Arithmetic Sequences and Series
MA40S PRECALCULUS UNIT G GEOMETRIC SEQUENCES CLASS NOTES (COMPLETED NO NEED TO COPY NOTES FROM OVERHEAD) Basic Elemets of Arithmetic Sequeces ad Series Objective: To establish basic elemets of arithmetic
More informationI. Chisquared Distributions
1 M 358K Supplemet to Chapter 23: CHISQUARED DISTRIBUTIONS, TDISTRIBUTIONS, AND DEGREES OF FREEDOM To uderstad tdistributios, we first eed to look at aother family of distributios, the chisquared distributios.
More informationFast Fourier Transform
18.310 lecture otes November 18, 2013 Fast Fourier Trasform Lecturer: Michel Goemas I these otes we defie the Discrete Fourier Trasform, ad give a method for computig it fast: the Fast Fourier Trasform.
More informationTILE PATTERNS & GRAPHING
TILE PATTERNS & GRAPHING LESSON 1 THE BIG IDEA Tile patters provide a meaigful cotext i which to geerate equivalet algebraic expressios ad develop uderstadig of the cocept of a variable. Such patters are
More informationMATH /2003. Assignment 4. Due January 8, 2003 Late penalty: 5% for each school day.
MATH 260 2002/2003 Assigmet 4 Due Jauary 8, 2003 Late pealty: 5% for each school day. 1. 4.6 #10. A croissat shop has plai croissats, cherry croissats, chocolate croissats, almod croissats, apple croissats
More informationGCE Further Mathematics (6360) Further Pure Unit 2 (MFP2) Textbook. Version: 1.4
GCE Further Mathematics (660) Further Pure Uit (MFP) Tetbook Versio: 4 MFP Tetbook Alevel Further Mathematics 660 Further Pure : Cotets Chapter : Comple umbers 4 Itroductio 5 The geeral comple umber 5
More informationIntro to Sequences / Arithmetic Sequences and Series Levels
Itro to Sequeces / Arithmetic Sequeces ad Series Levels Level : pg. 569: #7, 0, 33 Pg. 575: #, 7, 8 Pg. 584: #8, 9, 34, 36 Levels, 3, ad 4(Fiboacci Sequece Extesio) See Hadout Check for Uderstadig Level
More informationHere are a couple of warnings to my students who may be here to get a copy of what happened on a day that you missed.
This documet was writte ad copyrighted by Paul Dawkis. Use of this documet ad its olie versio is govered by the Terms ad Coditios of Use located at http://tutorial.math.lamar.edu/terms.asp. The olie versio
More information6 Algorithm analysis
6 Algorithm aalysis Geerally, a algorithm has three cases Best case Average case Worse case. To demostrate, let us cosider the a really simple search algorithm which searches for k i the set A{a 1 a...
More informationLesson 12. Sequences and Series
Retur to List of Lessos Lesso. Sequeces ad Series A ifiite sequece { a, a, a,... a,...} ca be thought of as a list of umbers writte i defiite order ad certai patter. It is usually deoted by { a } =, or
More information7 b) 0. Guided Notes for lesson P.2 Properties of Exponents. If a, b, x, y and a, b, 0, and m, n Z then the following properties hold: 1 n b
Guided Notes for lesso P. Properties of Expoets If a, b, x, y ad a, b, 0, ad m, Z the the followig properties hold:. Negative Expoet Rule: b ad b b b Aswers must ever cotai egative expoets. Examples: 5
More informationSolutions to Selected Problems In: Pattern Classification by Duda, Hart, Stork
Solutios to Selected Problems I: Patter Classificatio by Duda, Hart, Stork Joh L. Weatherwax February 4, 008 Problem Solutios Chapter Bayesia Decisio Theory Problem radomized rules Part a: Let Rx be the
More informationLinear Algebra II. Notes 6 25th November 2010
MTH6140 Liear Algebra II Notes 6 25th November 2010 6 Quadratic forms A lot of applicatios of mathematics ivolve dealig with quadratic forms: you meet them i statistics (aalysis of variace) ad mechaics
More informationExample 2 Find the square root of 0. The only square root of 0 is 0 (since 0 is not positive or negative, so those choices don t exist here).
BEGINNING ALGEBRA Roots ad Radicals (revised summer, 00 Olso) Packet to Supplemet the Curret Textbook  Part Review of Square Roots & Irratioals (This portio ca be ay time before Part ad should mostly
More information13 Fast Fourier Transform (FFT)
13 Fast Fourier Trasform FFT) The fast Fourier trasform FFT) is a algorithm for the efficiet implemetatio of the discrete Fourier trasform. We begi our discussio oce more with the cotiuous Fourier trasform.
More informationCombinatorics II. Combinatorics. Product Rule. Sum Rule II. Theorem (Product Rule) Theorem (Sum Rule)
Combiatorics Combiatorics I Slides by Christopher M. Bourke Istructor: Berthe Y. Choueiry Sprig 26 Computer Sciece & Egieerig 235 to Discrete Mathematics Sectios 4.4.6 & 6.56.6 of Rose cse235@cse.ul.edu
More informationTommy R. Jensen, Department of Mathematics, KNU. 1 Number Sequences 1. 2 Special Number Sequences 2. 3 Generating Functions 4
Part 13 Geeratig Fuctios Prited versio of the lecture Discrete Mathematics o 1 October 009 Tommy R Jese, Departmet of Mathematics, KNU 131 Cotets 1 Number Sequeces 1 Special Number Sequeces 3 Geeratig
More informationMath 115 HW #4 Solutions
Math 5 HW #4 Solutios From 2.5 8. Does the series coverge or diverge? ( ) 3 + 2 = Aswer: This is a alteratig series, so we eed to check that the terms satisfy the hypotheses of the Alteratig Series Test.
More informationReview for College Algebra Final Exam
Review for College Algebra Fial Exam (Please remember that half of the fial exam will cover chapters 14. This review sheet covers oly the ew material, from chapters 5 ad 7.) 5.1 Systems of equatios i
More informationREACHABILITY AND OBSERVABILITY
Updated: Saturday October 4 8 Copyright F.L. Lewis ll rights reserved RECHILIY ND OSERVILIY Cosider a liear statespace system give by x x + u y Cx + Du m with x t R the iteral state u t R the cotrol iput
More information8.1 Arithmetic Sequences
MCR3U Uit 8: Sequeces & Series Page 1 of 1 8.1 Arithmetic Sequeces Defiitio: A sequece is a comma separated list of ordered terms that follow a patter. Examples: 1, 2, 3, 4, 5 : a sequece of the first
More informationIncremental calculation of weighted mean and variance
Icremetal calculatio of weighted mea ad variace Toy Fich faf@cam.ac.uk dot@dotat.at Uiversity of Cambridge Computig Service February 009 Abstract I these otes I eplai how to derive formulae for umerically
More informationTHE ARITHMETIC OF INTEGERS.  multiplication, exponentiation, division, addition, and subtraction
THE ARITHMETIC OF INTEGERS  multiplicatio, expoetiatio, divisio, additio, ad subtractio What to do ad what ot to do. THE INTEGERS Recall that a iteger is oe of the whole umbers, which may be either positive,
More information4 n. n 1. You shold think of the Ratio Test as a generalization of the Geometric Series Test. For example, if a n ar n is a geometric sequence then
SECTION 2.6 THE RATIO TEST 79 2.6. THE RATIO TEST We ow kow how to hadle series which we ca itegrate (the Itegral Test), ad series which are similar to geometric or pseries (the Compariso Test), but of
More informationA Simplified Binet Formula for kgeneralized Fibonacci Numbers
A Simplified Biet Formula for kgeeralized Fiboacci Numbers Gregory P. B. Dresde Departmet of Mathematics Washigto ad Lee Uiversity Lexigto, VA 440 dresdeg@wlu.edu Abstract I this paper, we preset a particularly
More informationTHE HEIGHT OF qbinary SEARCH TREES
THE HEIGHT OF qbinary SEARCH TREES MICHAEL DRMOTA AND HELMUT PRODINGER Abstract. q biary search trees are obtaied from words, equipped with the geometric distributio istead of permutatios. The average
More information= 2, 3, 4, etc. = { FLC Ch 7. Math 120 Intermediate Algebra Sec 7.1: Radical Expressions and Functions
Math 120 Itermediate Algebra Sec 7.1: Radical Expressios ad Fuctios idex radicad = 2,,, etc. Ex 1 For each umber, fid all of its square roots. 121 2 6 Ex 2 1 Simplify. 1 22 9 81 62 8 27 16 16 0 1 180 22
More informationLiteral Equations and Formulas
. Literal Equatios ad Formulas. OBJECTIVE 1. Solve a literal equatio for a specified variable May problems i algebra require the use of formulas for their solutio. Formulas are simply equatios that express
More informationLearning outcomes. Algorithms and Data Structures. Time Complexity Analysis. Time Complexity Analysis How fast is the algorithm? Prof. Dr.
Algorithms ad Data Structures Algorithm efficiecy Learig outcomes Able to carry out simple asymptotic aalysisof algorithms Prof. Dr. Qi Xi 2 Time Complexity Aalysis How fast is the algorithm? Code the
More informationGrade 7. Strand: Number Specific Learning Outcomes It is expected that students will:
Strad: Number Specific Learig Outcomes It is expected that studets will: 7.N.1. Determie ad explai why a umber is divisible by 2, 3, 4, 5, 6, 8, 9, or 10, ad why a umber caot be divided by 0. [C, R] [C]
More informationwhere: T = number of years of cash flow in investment's life n = the year in which the cash flow X n i = IRR = the internal rate of return
EVALUATING ALTERNATIVE CAPITAL INVESTMENT PROGRAMS By Ke D. Duft, Extesio Ecoomist I the March 98 issue of this publicatio we reviewed the procedure by which a capital ivestmet project was assessed. The
More informationOur aim is to show that under reasonable assumptions a given 2πperiodic function f can be represented as convergent series
8 Fourier Series Our aim is to show that uder reasoable assumptios a give periodic fuctio f ca be represeted as coverget series f(x) = a + (a cos x + b si x). (8.) By defiitio, the covergece of the series
More informationS. Tanny MAT 344 Spring 1999. be the minimum number of moves required.
S. Tay MAT 344 Sprig 999 Recurrece Relatios Tower of Haoi Let T be the miimum umber of moves required. T 0 = 0, T = 7 Iitial Coditios * T = T + $ T is a sequece (f. o itegers). Solve for T? * is a recurrece,
More information1. Strong vs regular indiction 2. Strong induction examples: ! Divisibility by a prime! Recursion sequence: product of fractions
Today s Topics: CSE 0: Discrete Mathematics for Computer Sciece Prof. Miles Joes 1. Strog vs regular idictio. Strog iductio examples:! Divisibility by a prime! Recursio sequece: product of fractios 3 4
More informationG r a d e. 5 M a t h e M a t i c s. Patterns and relations
G r a d e 5 M a t h e M a t i c s Patters ad relatios Grade 5: Patters ad Relatios (Patters) (5.PR.1) Edurig Uderstadigs: Number patters ad relatioships ca be represeted usig variables. Geeral Outcome:
More informationOnestep equations. Vocabulary
Review solvig oestep equatios with itegers, fractios, ad decimals. Oestep equatios Vocabulary equatio solve solutio iverse operatio isolate the variable Additio Property of Equality Subtractio Property
More informationDivide and Conquer. Maximum/minimum. Integer Multiplication. CS125 Lecture 4 Fall 2015
CS125 Lecture 4 Fall 2015 Divide ad Coquer We have see oe geeral paradigm for fidig algorithms: the greedy approach. We ow cosider aother geeral paradigm, kow as divide ad coquer. We have already see a
More informationData Structures. Outline
Data Structures Solvig Recurreces Tzachi (Isaac) Rose 1 Outlie Recurrece The Substitutio Method The Iteratio Method The Master Method Tzachi (Isaac) Rose 2 1 Recurrece A recurrece is a fuctio defied i
More informationSearching Algorithm Efficiencies
Efficiecy of Liear Search Searchig Algorithm Efficiecies Havig implemeted the liear search algorithm, how would you measure its efficiecy? A useful measure (or metric) should be geeral, applicable to ay
More information3. Covariance and Correlation
Virtual Laboratories > 3. Expected Value > 1 2 3 4 5 6 3. Covariace ad Correlatio Recall that by takig the expected value of various trasformatios of a radom variable, we ca measure may iterestig characteristics
More informationNEW RELATIONS BETWEEN FIBONACCI AND BERNOULLI NUMBERS
NEW RELATIONS BETWEEN FIBONACCI AND BERNOULLI NUMBERS PAUL F a BYRD Sa Jose State Uiversity, Sa Jose, Califoria 95192 1. INTRODUCTION There seems to be o ed to the umber or variety of idetities ivolvig
More informationMultiple Representations for Pattern Exploration with the Graphing Calculator and Manipulatives
Douglas A. Lapp Multiple Represetatios for Patter Exploratio with the Graphig Calculator ad Maipulatives To teach mathematics as a coected system of cocepts, we must have a shift i emphasis from a curriculum
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 information1 StateSpace Canonical Forms
StateSpace Caoical Forms For ay give system, there are essetially a ifiite umber of possible state space models that will give the idetical iput/output dyamics Thus, it is desirable to have certai stadardized
More information1 n. n > dt. t < n 1 + n=1
Math 05 otes C. Pomerace The harmoic sum The harmoic sum is the sum of recirocals of the ositive itegers. We kow from calculus that it diverges, this is usually doe by the itegral test. There s a more
More informationA NEW PROOF FOR A CLASSICAL QUADRATIC HARMONIC SERIES. 1. Introduction and the main result
Joural of Classical Aalysis Volume 8, Number (6, 55 6 doi:.753/jca84 A NEW PROOF FOR A CLASSICAL QUADRATIC HARMONIC SERIES CORNEL IOAN VĂLEAN To my parets, Ileaa ad Ioel Abstract. I the followig paper
More information