# Factoring x n 1: cyclotomic and Aurifeuillian polynomials Paul Garrett

Save this PDF as:

Size: px
Start display at page:

Download "Factoring x n 1: cyclotomic and Aurifeuillian polynomials Paul Garrett "

## Transcription

1 (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 + x x + x + 1) Equivaletly, polyomials like x y, x 3 y 3, ad x 4 y 4 have factorizatios x y = (x y)(x 1 + x y xy + y 1 ) For odd, replacig y by y gives a variat x + y = (x + y)(x 1 x y +... xy + y 1 ) For composite expoet oe obtais several differet factorizatios x 30 1 = (x 15 ) 1 = (x 15 1)(x ) x 30 1 = (x 10 ) 3 1 = (x 10 1)(x 0 + x ) x 30 1 = (x 6 ) 5 1 = (x 6 1)((x 6 ) ) Such algebraic factorizatios yield umerical partial factorizatios of some special large umbers, such as 33 1 = ( 11 ) 3 1 = ( 11 1)( ) 33 1 = ( 3 ) 11 1 = ( 3 1)( ) Thus, 33 1 has factors 3 1 = 7 ad 11 1 = It is the easier to complete the prime factorizatio 33 1 = But that largish umber might be awkward to uderstad. How do we verify that a umber such as N = is prime? That is, how do we show that N is ot evely divisible by ay iteger D i the rage 1 < D < N? Oe could divide N by all itegers D betwee 1 ad N, but this is eedlessly slow, sice if D evely divides N ad D > N the N/D is a iteger ad N/D < N. That is, we eed oly do trial divisios by D for D N. Ad, after dividig by, we eed oly divide by odd umbers D thereafter. Also, we eed oly divide by primes, if coveiet. For example, sice N = 101 is ot divisible by the primes D =, 3, 5, 7 o larger tha , we see that 101 is prime. Cogrueces: Recall that a = b mod m 1

2 meas that m divides a b evely. Thus, for example, 6 = 1 mod 5 10 = 1 mod = 101 mod 977 Oe might worry that i the prime factorizatio 33 1 = the large umber is left over after algebraic factorig. But Fermat ad Euler proved that a prime factor p of b 1 either divides b d 1 for a divisor d < of the expoet, or else p = 1 mod. Sice here the expoet 33 is odd, ad sice primes bigger tha are odd, i fact we ca say that if a prime p divides 33 1 ad is ot 7, 3, 89, the p = 1 mod 66. Thus, i testig for divisibility by D we do ot eed to test all odd umbers, but oly 67, 133, 199,... ad oly eed to do /66 11 trial divisios to see that is prime. So 1 is ot prime uless the expoet is prime. For p prime, if p 1 is prime, it is a Mersee prime. Not every umber of the form p 1 is prime, eve with p prime. For example, 11 1 = = = = = Nevertheless, usually the largest kow prime at ay momet is a Mersee prime, such as Theorem (Lucas-Lehmer) Let L o = 4, L = L 1. For p a odd prime, p 1 is prime if ad oly if L p = 0 mod p 1 We wat the complete factorizatio of x 1 ito irreducible polyomials with ratioal coefficiets (which caot be factored further without goig outside the ratioal umbers). The irreducible factors are cyclotomic polyomials. For example, x 18 1 = (x 1)(x + 1)(x + x + 1)(x x + 1)(x 6 + x 3 + 1)(x 6 x 3 + 1) has familiar-lookig factors, but x 15 1 = (x 1)(x + x + 1)(x 4 + x 3 + x + x + 1)(x 8 x 7 + x 5 x 4 + x 3 x + 1)

3 has a ufamiliar factor. How do we get all these? For complex α the polyomial x α is a factor of x 1 if ad oly if α = 1. This happes if ad oly if α = cos πk πk + i si = eπik/ for some k = 0, 1,,..., 1. These are th roots of uity, ad they accout for the complex roots of x 1 = 0. Amog the th roots of uity are d th roots of uity for divisors d of. For example, amog the 6 th roots of uity are square roots ad cube roots of 1 also, ot to metio 1 itself. A th root of uity is primitive if it is ot a d th root of uity for ay d < dividig. The primitive complex th roots of uity are cos πk πk + i si = eπik/ with 0 < k < ad gcd(k, ) = 1. Ideed, if gcd(k, ) = d > 1, the sice d divides k evely. For example, the primitive complex 6 th roots of 1 are (e πik/ ) (/d) = e πik/d = 1 e πi 1/6 e πi 5/6 The primitive complex 10 th roots of 1 are e πi 1/10 e πi 3/10 e πi 7/10 e πi 9/10 Oe defiitio of the th cyclotomic polyomial Φ (x) is Φ (x) = (x α) α primitive th root of 1 This does ot make immediately clear that the coefficiets are ratioal, which they are. immediately clear how to compute the cyclotomic polyomials from this. It is also ot But this defiitio does give the importat property x 1 = d Φ d (x) where d meas that d divides evely. A aive computatioal approach comes from the idea that roots α of Φ (x) = 0 should satisfy α 1 = 0 but ot α d 1 = 0 for smaller d. Thus, for prime p ideed Φ p (x) = xp 1 x 1 = xp 1 + x p x + x + 1 3

4 We might try Paul Garrett: Factorig x 1: cyclotomic ad Aurifeuillia polyomials (March 16, 004) Φ (x) = But this is ot quite right. For example, Φ 6 (x) x 1 x d 1 for d < dividig (?) x 6 1 (x 1)(x 1)(x 3 1) shows that this attempted defiitio tries to remove more factors of x 1 that there are i x 6 1. Correctig this, Φ 6 (x) = (x 6 1) 1 (x 6/ 1)(x 6/3 1) (x6/6 1) = (x6 1)(x 1) (x 3 1)(x 1) = x x + 1 That is, we iclude all 6 th roots of uity, take away those which are cube roots or square roots, ad put back those we have couted twice, amely 1. Similarly, (x 30 1) 1 (x 15 1)(x 10 1)(x 6 1) (x5 1)(x 3 1)(x 1 1) (x 1) = (x30 1)(x 5 1)(x 3 1)(x 1) (x 15 1)(x 10 1)(x 6 1)(x 1) = x8 + x 7 x 5 x 4 x 3 + x + 1 That is, we iclude all 30 th roots of uity, take away 15 th, 10 th, ad 6 th roots, put back those we have couted twice, amely 5 th, cube, ad square roots, ad the take away agai those we ve couted 3 times, amely 1. Systematically icorporatig the idea of compesatig for over-coutig we have the correct expressio Φ (x) = (x 1 1) prime p (x/p 1) distict primes p,q (x /pq 1 1) distict primes p,q,r (x/pqr 1)... Usig the property x 1 = d Φ d (x) gives a more elegat approach, by rearragig: x 1 Φ (x) = d, d< Φ d(x) By iductio, if Φ d (x) has ratioal coefficiets for d <, the so does Φ (x). Also, iductively, if we kow Φ d (x) for d < the we ca compute Φ (x). Groupig helps. For example, Φ 15 (x) = x 15 1 Φ 1 (x)φ 3 (x)φ 5 (x) = x 15 1 Φ 3 (x)(x 5 1) = x10 + x = x10 + x Φ 3 (x) x + x + 1 = x8 x 7 +x 5 x 4 +x 3 x+1 by direct divisio at the last step. We ca be a little clever. For example, x 30 1 Φ 1 (x)φ (x)φ 3 (x)φ 5 (x)φ 6 (x)φ 10 (x)φ 15 (x) 4

5 Use to simplify to Use to get Paul Garrett: Factorig x 1: cyclotomic ad Aurifeuillia polyomials (March 16, 004) x 15 1 = Φ 1 (x)φ 3 (x)φ 5 (x)φ 15 (x) x 30 1 Φ (x)φ 6 (x)φ 10 (x)(x 15 1) = x Φ (x)φ 6 (x)φ 10 (x) x 10 1 = Φ 1 (x)φ (x)φ 5 (x)φ 10 (x) x Φ (x)φ 6 (x)φ 10 (x) = (x )Φ 1 (x)φ 5 (x) Φ 1 (x)φ (x)φ 5 (x)φ 10 (x) Φ 6 (x) = (x15 + 1)(x 5 1) Φ 6 (x)(x 10 1) = (x15 + 1) Φ 6 (x)(x 5 + 1) = (x10 + x 5 + 1) x = (x10 x 5 + 1) x + 1 x = x 8 + x 7 x 5 x 4 x 3 + x + 1 x + 1 by direct divisio at the last step. Based o fairly extesive had calculatios, oe might suspect that all coefficiets of all cyclotomic polyomials are either +1, 1, or 0, but this is ot true. It is true for prime, ad for havig at most distict prime factors, but ot geerally. The smallest where Φ (x) has a exotic coefficiet is = 105. It is o coicidece that 105 = is the product of the first 3 primes above. = Φ 105 (x) = x Φ 1 (x)φ 3 (x)φ 5 (x)φ 7 (x)φ 15 (x)φ 1 (x)φ 35 (x) = x Φ 3 (x)φ 15 (x)φ 1 (x)(x 35 1) x 70 + x Φ 3 (x)φ 15 (x)φ 1 (x) = (x70 + x )(x 7 1) Φ 15 (x)(x 1 = (x70 + x )(x 7 1)Φ 1 (x)φ 3 (x)φ 5 (x) 1) (x 15 1)(x 1 1) = (x70 + x )(x 7 1)(x 5 1)Φ 3 (x) (x 15 1)(x 1 1) Istead of direct polyomial computatios, we do power series computatios, imagiig that x < 1, for example. Thus, 1 x 1 1 = 1 1 x 1 = 1 + x1 + x 4 + x We aticipate that the degree of Φ 105 (x) is (3 1)(5 1)(7 1) = 48 (why?). We also observe that the coefficiets of all cyclotomic polyomials are the same back-to-frot as frot-to-back (why?). Thus, we ll use power series i x ad igore terms of degree above 4. Thus Φ 105 (x) = (x70 + x )(x 7 1)(x 5 1)(x + x + 1) (x 15 1)(x 1 1) = (1 + x + x )(1 x 7 )(1 x 5 )(1 + x 15 )(1 + x 1 ) = (1 + x + x ) (1 x 5 x 7 + x 1 + x 15 x 0 + x 1 x ) = 1+x+x x 5 x 6 x 7 x 7 x 8 x 9 +x 1 +x 13 +x 14 +x 15 +x 16 +x 17 x 0 x 1 x +x 1 +x +x 3 x x 3 x 4 = 1 + x + x x 5 x 6 x 7 x 8 x 9 + x 1 + x 13 + x 14 + x 15 + x 16 + x 17 x 0 x x 4 Lookig closely, we have a x 7. I fact, Φ (x) caot be factored further usig oly ratioal coefficiets. For prime p, this follows from Eisestei s criterio: for f(x) with iteger coefficiets, highest-degree coefficiet 1, all lower-degree coefficiets divisible by p, ad costat term ot divisible by p, f(x) caot be factored (with ratioal coefficiets). 5

6 For example, Φ 5 (x) = x 4 + x 3 + x + x + 1 itself does ot have the right kid of coefficiets, but a variatio does: Φ 5 (x + 1) = (x + 1)5 1 (x + 1) 1 = x4 + 5x x + 10x + 5 Ad Φ 7 (x + 1) = (x + 1)7 1 (x + 1) 1 = x6 + 7x 5 + 1x x x + 1x + 7 Less well kow are Lucas-Aurifeullia-LeLasseur factorizatios such as x = (x 4 + 4x + 4) (x) = (x + x + )(x x + ) More exotic are ad ad further x x + 3 = (x + 3x + 3)(x 3x + 3) x x 5 = (x4 + 5x x + 5x + 5) (x 4 5x x 5x + 5) x x = (x4 + 6x x + 36x + 36) (x 4 6x x 36x + 36) x x + 7 = (x6 + 7x 5 + 1x x x + 343x + 343) (x 6 7x 5 + 1x 4 49x x 343x + 343) These Aurifeuillia factorizatios yield further factorizatios of special large umbers, such as ad similarly + 1 = 4 ( 5 ) = (( 5 ) + ( 5 ) + 1)(( 5 ) ( 5 ) + 1) = = = 7 (35 ) (3 5 ) + 1 = (3(35 ) + 3(3 5 ) + 1)(3(3 5 ) + 3(3 5 ) + 1) = Where do these come from? For a odd prime p Φ p (x ) = (x ) p 1 Φ 1 (x ) Replacig x by p x i this equality gives = (xp 1)Φ p (x) Φ 1 (x)φ (x)φ p (x) = Φ p(x)φ p (x) Φ p (px ) = Φ p ( p x)φ p ( p x) The factors o the right-had side o loger have ratioal coefficiets. But their liear factors ca be regrouped ito two batches of p 1 which do have ratioal coefficiets, ad these are the Aurifeuillia factors of Φ p (px ). From Galois theory, usig p = 1 mod 4, for ζ = e πi/p, p is a Gauss sum p 1 p = k=1 ( ) k ζ k Q(ζ) p 6

7 ( ) with quadratic symbol = ±1 depedig whether k is a square mod p or ot. The automorphisms of Q(ζ) over Q are for a Z/p, ad The k p Φ p (px ) = ( k p ) =1 σ a : ζ ζ a σ a ( p) = p ( ) a p ( p x ζ k ) ( k p ) = 1 ( p x ζ k ) is the Aurifeuillia factorizatio ito two factors with ratioal coefficiets. To compute the Aurifeuillia factors? From the Galois theory view, it turs out that there are polyomials f(x) ad g(x) with ratioal coefficiets such that Φ p (x) = f(x) ± pxg(x) with +1 for p = 1 mod 4, 1 for p = 3 mod 4. The replacig x by px gives a differece of squares, which factors For example, The Ad Φ p ( px ) = f( px ) p x g( px ) = ( f( px ) pxg( px ) ) ( f( px ) + pxg( px ) ) Φ 3 (x) = x + x + 1 = (x + 1) 3x Φ 3 (3x ) = (3x + 1) 9x = (3x + 3x + 1) (3x 3x + 1) Φ 5 (x) = x 4 + x 3 + x + x + 1 = (x + 3x + 1) + 5x(x + 1) The latter igrediets are ot so hard to determie. If we kow x 4 + x 3 + x + x + 1 = f(x) + 5xg(x) it is reasoable to take f(x) = x + ax ± 1 ad try to fid parameter a so that f(x) differs from Φ 5 (x) by some 5xg(x). (x + ax + 1) Φ 5 (x) = (a 1)x + (1 + a )x + (a 1) x Tryig a = 0, 1,,... yields a good result for a = 3: 5x + 10x + 5 = 5(x + 1) Refereces: Has Riesel, Prime Numbers ad Computer Methods for Factorizatio, page 309 ff. Brillhart, Lehmer, Selfridge, Tuckerma, Wagstaff Factorizatio of b ± 1, b =, 3, 5, 6, 7, 10, 11, 1 up to High Powers. R.P. Bret O computig factors of cyclotomic polyomials, Math. of Comp. 61, / garrett/m/umber theory/aurifeuillia.pdf 7

### 1. 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

### Soving 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

### WHEN IS THE (CO)SINE OF A RATIONAL ANGLE EQUAL TO A RATIONAL NUMBER?

WHEN IS THE (CO)SINE OF A RATIONAL ANGLE EQUAL TO A RATIONAL NUMBER? JÖRG JAHNEL 1. My Motivatio Some Sort of a Itroductio Last term I tought Topological Groups at the Göttige Georg August Uiversity. This

### Repeating Decimals are decimal numbers that have number(s) after the decimal point that repeat in a pattern.

5.5 Fractios ad Decimals Steps for Chagig a Fractio to a Decimal. Simplify the fractio, if possible. 2. Divide the umerator by the deomiator. d d Repeatig Decimals Repeatig Decimals are decimal umbers

### The 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

### CS103A 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

### The 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

### Incremental 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

### Factors 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

### 3. Greatest Common Divisor - Least Common Multiple

3 Greatest Commo Divisor - Least Commo Multiple Defiitio 31: The greatest commo divisor of two atural umbers a ad b is the largest atural umber c which divides both a ad b We deote the greatest commo gcd

### arxiv:1012.1336v2 [cs.cc] 8 Dec 2010

Uary Subset-Sum is i Logspace arxiv:1012.1336v2 [cs.cc] 8 Dec 2010 1 Itroductio Daiel M. Kae December 9, 2010 I this paper we cosider the Uary Subset-Sum problem which is defied as follows: Give itegers

Radicals ad Roots Radicals ad Fractioal Expoets I math, may problems will ivolve what is called the radical symbol, X is proouced the th root of X, where is or greater, ad X is a positive umber. What it

### TAYLOR SERIES, POWER SERIES

TAYLOR SERIES, POWER SERIES The followig represets a (icomplete) collectio of thigs that we covered o the subject of Taylor series ad power series. Warig. Be prepared to prove ay of these thigs durig the

### Chapter 6: Variance, the law of large numbers and the Monte-Carlo method

Chapter 6: Variace, the law of large umbers ad the Mote-Carlo method Expected value, variace, ad Chebyshev iequality. If X is a radom variable recall that the expected value of X, E[X] is the average value

### 2-3 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

### Example 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

### Module 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

### Trigonometric 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

### x(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,...,

### Infinite 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...

### Sum and Product Rules. Combinatorics. Some Subtler Examples

Combiatorics Sum ad Product Rules Problem: How to cout without coutig. How do you figure out how may thigs there are with a certai property without actually eumeratig all of them. Sometimes this requires

### Learning 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

### Chapter 5: Inner Product Spaces

Chapter 5: Ier Product Spaces Chapter 5: Ier Product Spaces SECION A Itroductio to Ier Product Spaces By the ed of this sectio you will be able to uderstad what is meat by a ier product space give examples

### SAMPLE QUESTIONS FOR FINAL EXAM. (1) (2) (3) (4) Find the following using the definition of the Riemann integral: (2x + 1)dx

SAMPLE QUESTIONS FOR FINAL EXAM REAL ANALYSIS I FALL 006 3 4 Fid the followig usig the defiitio of the Riema itegral: a 0 x + dx 3 Cosider the partitio P x 0 3, x 3 +, x 3 +,......, x 3 3 + 3 of the iterval

### S. 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,

### Lesson 15 ANOVA (analysis of variance)

Outlie Variability -betwee group variability -withi group variability -total variability -F-ratio Computatio -sums of squares (betwee/withi/total -degrees of freedom (betwee/withi/total -mea square (betwee/withi

### THE REGRESSION MODEL IN MATRIX FORM. For simple linear regression, meaning one predictor, the model is. for i = 1, 2, 3,, n

We will cosider the liear regressio model i matrix form. For simple liear regressio, meaig oe predictor, the model is i = + x i + ε i for i =,,,, This model icludes the assumptio that the ε i s are a sample

### Hypothesis testing. Null and alternative hypotheses

Hypothesis testig Aother importat use of samplig distributios is to test hypotheses about populatio parameters, e.g. mea, proportio, regressio coefficiets, etc. For example, it is possible to stipulate

### CS103X: Discrete Structures Homework 4 Solutions

CS103X: Discrete Structures Homewor 4 Solutios Due February 22, 2008 Exercise 1 10 poits. Silico Valley questios: a How may possible six-figure salaries i whole dollar amouts are there that cotai at least

### The 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

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

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

### THE 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,

### Basic Elements of Arithmetic Sequences and Series

MA40S PRE-CALCULUS 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

### Section 8.3 : De Moivre s Theorem and Applications

The Sectio 8 : De Moivre s Theorem ad Applicatios Let z 1 ad z be complex umbers, where z 1 = r 1, z = r, arg(z 1 ) = θ 1, arg(z ) = θ z 1 = r 1 (cos θ 1 + i si θ 1 ) z = r (cos θ + i si θ ) ad z 1 z =

### Asymptotic Growth of Functions

CMPS Itroductio to Aalysis of Algorithms Fall 3 Asymptotic Growth of Fuctios We itroduce several types of asymptotic otatio which are used to compare the performace ad efficiecy of algorithms As we ll

### 4.1 Sigma Notation and Riemann Sums

0 the itegral. Sigma Notatio ad Riema Sums Oe strategy for calculatig the area of a regio is to cut the regio ito simple shapes, calculate the area of each simple shape, ad the add these smaller areas

### NUMBERS 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

### FOUNDATIONS OF MATHEMATICS AND PRE-CALCULUS GRADE 10

FOUNDATIONS OF MATHEMATICS AND PRE-CALCULUS GRADE 10 [C] Commuicatio Measuremet A1. Solve problems that ivolve liear measuremet, usig: SI ad imperial uits of measure estimatio strategies measuremet strategies.

### Lesson 17 Pearson s Correlation Coefficient

Outlie Measures of Relatioships Pearso s Correlatio Coefficiet (r) -types of data -scatter plots -measure of directio -measure of stregth Computatio -covariatio of X ad Y -uique variatio i X ad Y -measurig

### 1 Computing the Standard Deviation of Sample Means

Computig the Stadard Deviatio of Sample Meas Quality cotrol charts are based o sample meas ot o idividual values withi a sample. A sample is a group of items, which are cosidered all together for our aalysis.

### Sequences 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

### Maximum Likelihood Estimators.

Lecture 2 Maximum Likelihood Estimators. Matlab example. As a motivatio, let us look at oe Matlab example. Let us geerate a radom sample of size 00 from beta distributio Beta(5, 2). We will lear the defiitio

### I. Chi-squared Distributions

1 M 358K Supplemet to Chapter 23: CHI-SQUARED DISTRIBUTIONS, T-DISTRIBUTIONS, AND DEGREES OF FREEDOM To uderstad t-distributios, we first eed to look at aother family of distributios, the chi-squared distributios.

### SECTION 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,

### In 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

### Elementary Theory of Russian Roulette

Elemetary Theory of Russia Roulette -iterestig patters of fractios- Satoshi Hashiba Daisuke Miematsu Ryohei Miyadera Itroductio. Today we are goig to study mathematical theory of Russia roulette. If some

### FIBONACCI 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

### Irreducible polynomials with consecutive zero coefficients

Irreducible polyomials with cosecutive zero coefficiets Theodoulos Garefalakis Departmet of Mathematics, Uiversity of Crete, 71409 Heraklio, Greece Abstract Let q be a prime power. We cosider the problem

INFINITE SERIES KEITH CONRAD. Itroductio The two basic cocepts of calculus, differetiatio ad itegratio, are defied i terms of limits (Newto quotiets ad Riema sums). I additio to these is a third fudametal

### Divide 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

### 7. Sample Covariance and Correlation

1 of 8 7/16/2009 6:06 AM Virtual Laboratories > 6. Radom Samples > 1 2 3 4 5 6 7 7. Sample Covariace ad Correlatio The Bivariate Model Suppose agai that we have a basic radom experimet, ad that X ad Y

### Our 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

### Chapter 7: Confidence Interval and Sample Size

Chapter 7: Cofidece Iterval ad Sample Size Learig Objectives Upo successful completio of Chapter 7, you will be able to: Fid the cofidece iterval for the mea, proportio, ad variace. Determie the miimum

### Definition. 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.

### Gregory Carey, 1998 Linear Transformations & Composites - 1. Linear Transformations and Linear Composites

Gregory Carey, 1998 Liear Trasformatios & Composites - 1 Liear Trasformatios ad Liear Composites I Liear Trasformatios of Variables Meas ad Stadard Deviatios of Liear Trasformatios A liear trasformatio

### 7.1 Finding Rational Solutions of Polynomial Equations

4 Locker LESSON 7. Fidig Ratioal Solutios of Polyomial Equatios Name Class Date 7. Fidig Ratioal Solutios of Polyomial Equatios Essetial Questio: How do you fid the ratioal roots of a polyomial equatio?

### Properties of MLE: consistency, asymptotic normality. Fisher information.

Lecture 3 Properties of MLE: cosistecy, asymptotic ormality. Fisher iformatio. I this sectio we will try to uderstad why MLEs are good. Let us recall two facts from probability that we be used ofte throughout

### A 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,

### 4 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 p-series (the Compariso Test), but of

### Z-TEST / Z-STATISTIC: used to test hypotheses about. µ when the population standard deviation is unknown

Z-TEST / Z-STATISTIC: used to test hypotheses about µ whe the populatio stadard deviatio is kow ad populatio distributio is ormal or sample size is large T-TEST / T-STATISTIC: used to test hypotheses about

### How Euler Did It. In a more modern treatment, Hardy and Wright [H+W] state this same theorem as. n n+ is perfect.

Amicable umbers November 005 How Euler Did It by Ed Sadifer Six is a special umber. It is divisible by, ad 3, ad, i what at first looks like a strage coicidece, 6 = + + 3. The umber 8 shares this remarkable

### Chapter 7 Methods of Finding Estimators

Chapter 7 for BST 695: Special Topics i Statistical Theory. Kui Zhag, 011 Chapter 7 Methods of Fidig Estimators Sectio 7.1 Itroductio Defiitio 7.1.1 A poit estimator is ay fuctio W( X) W( X1, X,, X ) of

### 1.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

### Fast 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.

### Running Time ( 3.1) Analysis of Algorithms. Experimental Studies ( 3.1.1) Limitations of Experiments. Pseudocode ( 3.1.2) Theoretical Analysis

Ruig Time ( 3.) Aalysis of Algorithms Iput Algorithm Output A algorithm is a step-by-step procedure for solvig a problem i a fiite amout of time. Most algorithms trasform iput objects ito output objects.

### Section 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

### 5.4 Amortization. Question 1: How do you find the present value of an annuity? Question 2: How is a loan amortized?

5.4 Amortizatio Questio 1: How do you fid the preset value of a auity? Questio 2: How is a loa amortized? Questio 3: How do you make a amortizatio table? Oe of the most commo fiacial istrumets a perso

### GCSE STATISTICS. 4) How to calculate the range: The difference between the biggest number and the smallest number.

GCSE STATISTICS You should kow: 1) How to draw a frequecy diagram: e.g. NUMBER TALLY FREQUENCY 1 3 5 ) How to draw a bar chart, a pictogram, ad a pie chart. 3) How to use averages: a) Mea - add up all

### Confidence Intervals for One Mean

Chapter 420 Cofidece Itervals for Oe Mea Itroductio This routie calculates the sample size ecessary to achieve a specified distace from the mea to the cofidece limit(s) at a stated cofidece level for a

### 5 Boolean Decision Trees (February 11)

5 Boolea Decisio Trees (February 11) 5.1 Graph Coectivity Suppose we are give a udirected graph G, represeted as a boolea adjacecy matrix = (a ij ), where a ij = 1 if ad oly if vertices i ad j are coected

Chapter 5 O A Cojecture Of Erdíos Proceedigs NCUR VIII è1994è, Vol II, pp 794í798 Jeærey F Gold Departmet of Mathematics, Departmet of Physics Uiversity of Utah Do H Tucker Departmet of Mathematics Uiversity

### minimal polyonomial Example

Minimal Polynomials Definition Let α be an element in GF(p e ). We call the monic polynomial of smallest degree which has coefficients in GF(p) and α as a root, the minimal polyonomial of α. Example: We

### Here 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

### GCE 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 A-level Further Mathematics 660 Further Pure : Cotets Chapter : Comple umbers 4 Itroductio 5 The geeral comple umber 5

### Lecture 3. denote the orthogonal complement of S k. Then. 1 x S k. n. 2 x T Ax = ( ) λ x. with x = 1, we have. i = λ k x 2 = λ k.

18.409 A Algorithmist s Toolkit September 17, 009 Lecture 3 Lecturer: Joatha Keler Scribe: Adre Wibisoo 1 Outlie Today s lecture covers three mai parts: Courat-Fischer formula ad Rayleigh quotiets The

### 8.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

### One-sample test of proportions

Oe-sample test of proportios The Settig: Idividuals i some populatio ca be classified ito oe of two categories. You wat to make iferece about the proportio i each category, so you draw a sample. Examples:

### 1 Correlation and Regression Analysis

1 Correlatio ad Regressio Aalysis I this sectio we will be ivestigatig the relatioship betwee two cotiuous variable, such as height ad weight, the cocetratio of a ijected drug ad heart rate, or the cosumptio

### 4.3. The Integral and Comparison Tests

4.3. THE INTEGRAL AND COMPARISON TESTS 9 4.3. The Itegral ad Compariso Tests 4.3.. The Itegral Test. Suppose f is a cotiuous, positive, decreasig fuctio o [, ), ad let a = f(). The the covergece or divergece

### A 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

### Recursion and Recurrences

Chapter 5 Recursio ad Recurreces 5.1 Growth Rates of Solutios to Recurreces Divide ad Coquer Algorithms Oe of the most basic ad powerful algorithmic techiques is divide ad coquer. Cosider, for example,

### 7 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

### CME 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

### Section 6.1 Radicals and Rational Exponents

Sectio 6.1 Radicals ad Ratioal Expoets Defiitio of Square Root The umber b is a square root of a if b The priciple square root of a positive umber is its positive square root ad we deote this root by usig

### Present Value Factor To bring one dollar in the future back to present, one uses the Present Value Factor (PVF): Concept 9: Present Value

Cocept 9: Preset Value Is the value of a dollar received today the same as received a year from today? A dollar today is worth more tha a dollar tomorrow because of iflatio, opportuity cost, ad risk Brigig

### Solving Divide-and-Conquer Recurrences

Solvig Divide-ad-Coquer Recurreces Victor Adamchik A divide-ad-coquer algorithm cosists of three steps: dividig a problem ito smaller subproblems solvig (recursively) each subproblem the combiig solutios

### 5: Introduction to Estimation

5: Itroductio to Estimatio Cotets Acroyms ad symbols... 1 Statistical iferece... Estimatig µ with cofidece... 3 Samplig distributio of the mea... 3 Cofidece Iterval for μ whe σ is kow before had... 4 Sample

### CHAPTER 7: Central Limit Theorem: CLT for Averages (Means)

CHAPTER 7: Cetral Limit Theorem: CLT for Averages (Meas) X = the umber obtaied whe rollig oe six sided die oce. If we roll a six sided die oce, the mea of the probability distributio is X P(X = x) Simulatio:

Physics 6A Witer 20 Theorems About Power Series Cosider a power series, f(x) = a x, () where the a are real coefficiets ad x is a real variable. There exists a real o-egative umber R, called the radius

### Math 114- Intermediate Algebra Integral Exponents & Fractional Exponents (10 )

Math 4 Math 4- Itermediate Algebra Itegral Epoets & Fractioal Epoets (0 ) Epoetial Fuctios Epoetial Fuctios ad Graphs I. Epoetial Fuctios The fuctio f ( ) a, where is a real umber, a 0, ad a, is called

### Notes on Hypothesis Testing

Probability & Statistics Grishpa Notes o Hypothesis Testig A radom sample X = X 1,..., X is observed, with joit pmf/pdf f θ x 1,..., x. The values x = x 1,..., x of X lie i some sample space X. The parameter

### 5.3. Generalized Permutations and Combinations

53 GENERALIZED PERMUTATIONS AND COMBINATIONS 73 53 Geeralized Permutatios ad Combiatios 53 Permutatios with Repeated Elemets Assume that we have a alphabet with letters ad we wat to write all possible

### Math 113 HW #11 Solutions

Math 3 HW # Solutios 5. 4. (a) Estimate the area uder the graph of f(x) = x from x = to x = 4 usig four approximatig rectagles ad right edpoits. Sketch the graph ad the rectagles. Is your estimate a uderestimate

### Case Study. Normal and t Distributions. Density Plot. Normal Distributions

Case Study Normal ad t Distributios Bret Halo ad Bret Larget Departmet of Statistics Uiversity of Wiscosi Madiso October 11 13, 2011 Case Study Body temperature varies withi idividuals over time (it ca

### Distributions of Order Statistics

Chapter 2 Distributios of Order Statistics We give some importat formulae for distributios of order statistics. For example, where F k: (x)=p{x k, x} = I F(x) (k, k + 1), I x (a,b)= 1 x t a 1 (1 t) b 1

### Linear 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

### Algebra 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

### 3.1 Measures of Central Tendency. Introduction 5/28/2013. Data Description. Outline. Objectives. Objectives. Traditional Statistics Average

5/8/013 C H 3A P T E R Outlie 3 1 Measures of Cetral Tedecy 3 Measures of Variatio 3 3 3 Measuresof Positio 3 4 Exploratory Data Aalysis Copyright 013 The McGraw Hill Compaies, Ic. C H 3A P T E R Objectives