# EGYPTIAN FRACTION EXPANSIONS FOR RATIONAL NUMBERS BETWEEN 0 AND 1 OBTAINED WITH ENGEL SERIES

Save this PDF as:

Size: px
Start display at page:

Download "EGYPTIAN FRACTION EXPANSIONS FOR RATIONAL NUMBERS BETWEEN 0 AND 1 OBTAINED WITH ENGEL SERIES"

## Transcription

2 ELVIA NIDIA GONZÁLEZ AND JULIA BERGNER, PHD DEPARTMENT OF MATHEMATICS Net, the fial loaf ca be cut ito eighths ad each perso would receive oe of those pieces. Alog with beig easier to distribute the bread, this solutio allows each perso to have oe larger piece (the half loaf) alog with the smaller piece (the eighth loaf). These represetatios ispired may questios. Some have bee aswered. For eample, we kow that Egyptia fractio epasios are ot uique. Di eret algorithms may produce di eret represetatios of the same fractio. Our eample of 8 ca also be epressed as Table lists several more eamples. Table. Epasios of various ratioal umbers usig di eret algorithms. Egel Series Greedy Algorithm Cotiued Fractio Aother questio that arose from Egyptia fractio epasios iquired whether or ot the Egyptias were limited by the use of this otatio. That is, could they epress ay ratioal umber as a sum of distict uit fractio? The Egyptias, as it turs out, were ot at all limited. Ay ratioal umber ca be epressed as the fiite sum of distict uity fractios. Furthermore, eve irratioal umbers ca be epressed as a ifiite sum of distict uit fractios. The focus of this project is Egyptia fractio epasios for ratioal umbers betwee 0 ad (but ot icludig 0 ad ) obtaied usig a Egel series. Some eamples of these epasios ca be see o the secod colum of Table.. Egel Epasios A Egel series, for ay real umber, is sequece of icreasig itegers []. Ay real umber, say z, ca be epressed as a Egyptia fractio epasio usig a Egel series i a uique way. This represetatio for ay real z ca be computed by defiig u = z the lettig a = d u e.from here, each subsequet a i+ ad u i+ is obtaied by first computig u i+ = u i a i the computig a i+ = d u i e,wheredeis the ceilig fuctio defied as dre = s if ad oly if s <rapple s [, Page 9, (.)]. If z is a ratioal umber, this process will halt wheever u k = 0 ad the Egel series is {a,a,...,a k }. The Egyptia fractio epasio for a ratioal umber is derived from the series as follows: z = kx i= = a a a i a a a a a a k. Otherwise, if z is irratioal, this algorithm cotiues ad we ed up with a ifiite Egel series {a,a,a,...}. This ifiite Egel series ca be used to obtai a Egyptia fractio epasio with the followig sum []: X. a a a i i= Ay Egyptia fractio epasio derived usig a Egel series will be referred to as a Egel epasio from ow o. Below we prove that Egel epasios are fiite for all ratioal umbers. Theorem.. Egel epasios are fiite for all ratioal umbers.

4 ELVIA NIDIA GONZÁLEZ AND JULIA BERGNER, PHD DEPARTMENT OF MATHEMATICS Table. Egel epasios for Egel Series Egel Epasio {, } + {, } + 0 = {} {,, } Table. Egel epasios for Egel Series Egel Epasio {,, } {, } + {, } + 8 = {} 9 {, } + 9 {, } + {, } + = {} {,,, } Table. Legth Egel series ad Egel epasios for. Egel Series Egel Epasio {, } + {,, } {,,, } {,,,, } ,8 +,08 + 8,9,888

5 EGYPTIAN FRACTION EXPANSIONS USING ENGEL SERIES Table. Other possible deomiators that produce a legth Egel Epasio for whe = Egel Series = lcm(, ) + {,, } = lcm(, ) + {,, } 9 9 = lcm(, ) + {, 0, 9} = lcm(, ) + {9,, } = lcm(, ) + {,, } = lcm(, ) + { 9 }. Theorems ad Proofs This sectio will iclude proofs of cojectures made withi the previous sectio. = k lcm(,,...,, ) + will produce a legth Egel epasio. Theorem.. Suppose is a positive iteger ad = k lcm(, legth Egel epasio. I order to prove Theorem., we eed a lemma first. Lemma.. [, Page 9, (.)] dr + se = dre + sorbr + sc = brc + sfors Z.,...,, ) +. The First we prove that will have a Proof Of Theorem.. Suppose = k lcm(,,...,, ) + ad (0, ) where N. To obtai the Egel epasio of begi by lettig u =. By assumptio, = k lcm(,,...,, ) + hece u = k lcm(,,...,, ) +. Net, a = d u e which ca be rewritte as a = d k lcm(,,...,, ) + k lcm(,,...,, ) e = d + e. The result of dividig k lcm(,,...,, ) by will be a atural umber so by the lemma, a ca be rewritte agai as k lcm(,,...,, ) a = + d e. Sice N, will always be a positive uit fractio ad d e will always equal. Agai the, a ca be rewritte as k lcm(,,...,, ) k lcm(,,...,, ) + a = +=.

6 ELVIA NIDIA GONZÁLEZ AND JULIA BERGNER, PHD DEPARTMENT OF MATHEMATICS Cotiuig to fid the Egel epasio requires computig u = u a which becomes u = k lcm(,,...,, ) + k lcm(,,...,, ) + = k lcm(,,...,, ) + k lcm(,,...,, ) k lcm(,,...,, ) + = k lcm(,,...,, ) +. Notice that the umerator of u = ad the umerator of u =. The umerator of u is oe less tha the umerator of u. Ideed, u will have a umerator of, u will have a umerator of, ad so o. Evetually, The u + term will have a umerator of 0 ad this process halts with the Egyptia fractio epasio = a + a a + + a a a as desired.. Cojecture Cojecture.. The from Theorem. is the least such which produces a legth Egel epasio. The tables icluded i the appedi do make a strog case for = lcm(,,...,, ) + beig the least deomiator that produces the desired legth epasio for. Below is a eample that proves it, logically, for a small fied value of. First we eed these additioal lemmas alog with Lemma.. Lemma.. [, Page 9, Eercise ] Lemma.. [, Page 8] d r s e = br + s c s dre = r, r Z,brc = r Eample. Let =. The by Theorem. = lcm(,,,, ) + =. We will show that this is the smallest possible value for that will produce a legth Egel epasio... Case : =p. Suppose =p. The = p = p. This is a oe-term Egel epasio. Hece the followig umbers are elimiated from cosideratio for are, 8,, 0,,, 8,, 0... Case : =p. Suppose =p. The = p = p.... Subcase : p is eve. If p is eve, the p the p ca be writte as p = p 0 for p N. Thus as i case. = p = p 0 = p 0 = p

7 EGYPTIAN FRACTION EXPANSIONS USING ENGEL SERIES... Subcase : p is odd. If p is odd the p =p 0 +. Now apply Egel s algorithm. u = = p = p = p 0 + a = d p0 + e By Lemma., a ca be rewritte usig the floor fuctio: a = b (p0 + ) + c = b p0 + c = bp 0 +c. Net, use Lemma. to separate the from the floor fuctio: a = bp 0 c +. Fially, sice p 0 N Z by Lemma., bp 0 c = p 0 ad a = p 0 +. Fid u by cotiuig the algorithm for Egel series: u = a u =(p 0 + ) p 0 = + p 0 + To fid a take the ceilig of the reciprocal of u : a = dp 0 +e = dp 0 e +=p 0 +. Repeat the algorithm oce more to obtai u = a u = p 0 + (p0 + ) = 0. Sice u = 0, we halt ad the Egel epasio is = p = (p 0 + ) = p 0 + = p (p 0 + )(p 0 + ). This is still ot a si-term epasio. Now elimiated as cadidates for are 9,,,,, 9,,, ad... Case : =p. Suppose =p. The = p = p.... Subcase : p is a multiple of. If p is a multiple of, I ca write p =p 0 for p 0 N ad = p 0 = p 0 which has already bee covered by case.... Subcase : p mod. If p mod the p = p 0 + ad = p = ( p 0 + ) = p 0 + = u so a = d p0 + e = b (p0 + ) + c = b p0 + c = bp 0 + c. Sice p N Z, by Lemma., a i ca be rewritte as: a = b c + p0 = p 0 +. Net, cotiue by fidig u ad a : u = u a = p 0 + (p0 + ) = p 0 + ad a = dp 0 +e = dp 0 e +=p 0 +. Fially, u = u a = p 0 + (p0 + ) = 0 ad the algorithm halts. The Egel epasio for this case becomes: = (p 0 + ) = p (p 0 + ) (p 0 + ),

8 8 ELVIA NIDIA GONZÁLEZ AND JULIA BERGNER, PHD DEPARTMENT OF MATHEMATICS which is less tha si terms log. Now elimiated as possibilities for are 0,,, 8,, 0,,, ad Subcase : p mod. Notice that if p mod the p = p 0 +. The followig two cases will eplore the possible Egel epasio produced for eve p or odd p.... Sub-Subcase A: p 0 is odd. If p is odd the p =p 0 + for some p 0 N ad u = = p = p = p 0 +. Net, use u to fid a : a = d p0 + e = b (p0 + ) + c = b p0 + c = bp 0 +c = bp 0 c +=p 0 +. Cotiue by usig a ad u to fid: u = p 0 + (p0 + ) = p 0 + ad a = d p0 + e Because p 0 is odd ad positive it ca be rewritte as p 0 =p 00 + (agai p 00 N). I ca ow cotiue to rewrite a as follows: a = d (p00 + ) + e = d p00 + e = dp 00 +e = dp 00 e +=p Sice p 0 =p 00 +, this ca be rewritte as p 00 = p0. This allows a to be rewritte oe last time i terms of p 0 : a =p 00 + = ( p0 + )+= p0 +. The et iteratio will produce u = p 0 + p0 + = 0 ad the algorithm halts. For this sub case, the Egel epasio is: = p = p = p (p 0 + ) (p 00 + ). This is still ot a si term Egel epasio so 8, 0,,, ad have bee elimiated as possible optios for the deomiator of.... Sub-Subcase B: p 0 is eve. Simillarly to.., both u ad a remai the same, so begi by computig: ad u = p 0 + (p0 + ) = p0 + p 0 p 0 = + p 0 + a = d p0 + e. I order to simplify a further, use the fact that p 0 is eve so it ca be rewritte as p 0 =p 00 for some p 00 N. Thus we get: a = d p00 + e = b (p00 + ) + c = b p00 + c = bp 00 +c = bp 00 c +=p Furthermore, sice p 0 =p 00 we ca rewrite this as p 00 = p0. This allows us to rewrite a as: a = p0 += p0 +.

9 EGYPTIAN FRACTION EXPANSIONS USING ENGEL SERIES 9 The cotiue with the algorithm to fid: ad u = p 0 + p0 + = a = d u e =p 0 +. p 0 + Fially u = p 0 + p0 + = 0 ad we halt. This produces the followig three-term Egel epasio: = p = p = p (p 0 + ) (p 00 + ) + (p 0 + ) (p 00 + ) (p 0 + ). Sice this is still ot a legth Egel epasio,,, 8, ad 0 have also bee elimiated... The remaiig <0. We ow oly have to elimiate,,,, 9,,, 9,,,,,,, 9,, ad 9 as possible choices for.... mod. Sice mod, =p + for some p N. First compute: u = = p + ad Net, ad a = d p + (p + ) + e = b c = bp + 0 c = b0 c + p = p +. u = (p + ) = p + p + p + a = d e = dpe +=p +. Fially, u = p+ (p + ) = 0. This produces the followig Egel epasio: = p + + (p + )(p + ) which is still ot the desired legth. Thus,,, 9,,,, ad 9 have bee elimiated as possible deomiators for. Table. Values of that do ot yield legth Egel epasios for. Egel Series {,,,, } {,,, } 9 {,, 9} {, } {,, 8, } {, 8,, 9, } {8, 9,, } 9 {9, 0, 9} {0, }

10 0 ELVIA NIDIA GONZÁLEZ AND JULIA BERGNER, PHD DEPARTMENT OF MATHEMATICS... mod. The remaiig ie possible deomiators are elimiated by brute force i Table. Fially, the smallest possible such that produces a legth Egel epasio is = lcm(,,,, ) + as desired.. Coclusio We have show a method for choosig a deomiator that will always produce Egel epasio whose legth is equal to its deomiator. This method is the relatioship betwee the umerator ad the deomiator give by = k lcm(,,...,, ) +. With this, we ca obtai etire families of legth Egel epasios for fied. We have also cojectured that = lcm(,,...,, ) + is the least deomiator to produce our desired legth epasio. I the future, we would like to prove that this is ideed the smallest deomiator with this property. I additio, we are iterested i the best case scearios (Egel epasios of legth two). We would like to employ similar methods used i this project to obtai a patter for these legth epasios the prove this patter holds.

11 EGYPTIAN FRACTION EXPANSIONS USING ENGEL SERIES. Appedi Egel Series Egel Series Egel Series {, } {,, } {8, } {, } {, } {8, } = {} = {} = 8 {8} {,, } {, 8} {9,, } 8 {, 8} {, } {9, } 9 = {} 8 = {} = 9 {9} 0 {, } 9 {, 0, 9} 8 {0, } {, } 0 {, 0} 9 {0, 9} = {} = {} 0 = 0 {0} Egel Series Egel Series Egel Series {,, } = {} {, } = {, } {,, } 8 = {} {, } 8 = 9 {, 9} 9 {8, 0, 9} 8 = {} 9 {, 9} 0 = {8, } 9 {, } 0 = {} {8, } 0 = {, } {, } = 8 {9} {, } = {, } {9, } = {} {, } = {9, } {,,, } = {} {9, } = {, } {, 9,, } = 9 {9} {, } = {, } {0,, 9, }

12 ELVIA NIDIA GONZÁLEZ AND JULIA BERGNER, PHD DEPARTMENT OF MATHEMATICS Egel Series Egel Series Egel Series {,, } = {} {9, } {,,, } {,, } = 9 {9} 8 {, } {, 9} {0,, } 9 {, 9} 8 {, } {0,, } 0 = {} 9 {, 9} 8 {0, } {,, } 0 = {} 9 {0, 9} {, } {, 8, } 0 = 0 {0} {,, } {,, } {,, } {, } {,, } {, 8, } = {} {, } {,, } {, } = {} {, } {,, } {8, 9} = {} 8 {, 9} {8,, 9, } {, } 9 {, 9} 8 {8, 9} {, 9} 0 = {} 9 {8, 9} 8 {, 9} {,, } 0 = 8 {8} 9 {, 99} {, 8, } {9,,, } 0 = {} {,, } {9, } {,,,, } {, } {9,, }

13 EGYPTIAN FRACTION EXPANSIONS USING ENGEL SERIES Refereces. Erdos, Shallit. New bouds o the legth of fiite Pierce ad Egel Series. Sémiaire de Théorie des Nombres Bordeau (99), -.. Graham, Kuth, Patashik. Cocrete Mathematics. AddisoWesley,Massachusetts,st Editio (989), Chapter.. V. Laohakosol, T. Chaichaa, J. Rattaamoog, ad N.R. Kaasri. Egel Series ad Cohe-Egyptia Fractio Epasios. Hidawi Publishig Corporatio. Iteratioal Joural of Mathematics ad Mathematical Scieces. Article ID 80 (009), pages.. Mays, Michael E. A Worst Case of the Fiboacci-Sylvester Epasio. The Joural of Combiatorial Mathematics ad Combiatorial Computig. (98), -8.. O Reilly, Decla Creatig Egyptia Fractios Mathematics i School. Vol., No. (Nov., 99), Page.. Reyi, A. A New Approach to the Theory of Egel s Series. Aales Uiversitatis Scietiarum Budapestiesis de Rolado Eötvös Nomiatae. Volume (9), -.. Weisstei, Eric W. Egyptia Fractio. From MathWorld A Wolfram Web Resource.

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

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

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

### Department of Computer Science, University of Otago

Departmet of Computer Sciece, Uiversity of Otago Techical Report OUCS-2006-09 Permutatios Cotaiig May Patters Authors: M.H. Albert Departmet of Computer Sciece, Uiversity of Otago Micah Colema, Rya Fly

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

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

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

### .04. This means \$1000 is multiplied by 1.02 five times, once for each of the remaining sixmonth

Questio 1: What is a ordiary auity? Let s look at a ordiary auity that is certai ad simple. By this, we mea a auity over a fixed term whose paymet period matches the iterest coversio period. Additioally,

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

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

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

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

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

### Lecture 4: Cauchy sequences, Bolzano-Weierstrass, and the Squeeze theorem

Lecture 4: Cauchy sequeces, Bolzao-Weierstrass, ad the Squeeze theorem The purpose of this lecture is more modest tha the previous oes. It is to state certai coditios uder which we are guarateed that limits

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

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

### Engineering 323 Beautiful Homework Set 3 1 of 7 Kuszmar Problem 2.51

Egieerig 33 eautiful Homewor et 3 of 7 Kuszmar roblem.5.5 large departmet store sells sport shirts i three sizes small, medium, ad large, three patters plaid, prit, ad stripe, ad two sleeve legths log

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

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

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

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

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

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

### BINOMIAL EXPANSIONS 12.5. In this section. Some Examples. Obtaining the Coefficients

652 (12-26) 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

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

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

### Lecture 13. Lecturer: Jonathan Kelner Scribe: Jonathan Pines (2009)

18.409 A Algorithmist s Toolkit October 27, 2009 Lecture 13 Lecturer: Joatha Keler Scribe: Joatha Pies (2009) 1 Outlie Last time, we proved the Bru-Mikowski iequality for boxes. Today we ll go over the

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

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

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

### Convexity, Inequalities, and Norms

Covexity, Iequalities, ad Norms Covex Fuctios You are probably familiar with the otio of cocavity of fuctios. Give a twicedifferetiable fuctio ϕ: R R, We say that ϕ is covex (or cocave up) if ϕ (x) 0 for

### On Formula to Compute Primes. and the n th Prime

Applied Mathematical cieces, Vol., 0, o., 35-35 O Formula to Compute Primes ad the th Prime Issam Kaddoura Lebaese Iteratioal Uiversity Faculty of Arts ad cieces, Lebao issam.kaddoura@liu.edu.lb amih Abdul-Nabi

### 1. C. The formula for the confidence interval for a population mean is: x t, which was

s 1. C. The formula for the cofidece iterval for a populatio mea is: x t, which was based o the sample Mea. So, x is guarateed to be i the iterval you form.. D. Use the rule : p-value

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

### Listing terms of a finite sequence List all of the terms of each finite sequence. a) a n n 2 for 1 n 5 1 b) a n for 1 n 4 n 2

74 (4 ) Chapter 4 Sequeces ad Series 4. SEQUENCES I this sectio Defiitio Fidig a Formula for the th Term The word sequece is a familiar word. We may speak of a sequece of evets or say that somethig is

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

### Cooley-Tukey. Tukey FFT Algorithms. FFT Algorithms. Cooley

Cooley Cooley-Tuey Tuey FFT Algorithms FFT Algorithms Cosider a legth- sequece x[ with a -poit DFT X[ where Represet the idices ad as +, +, Cooley Cooley-Tuey Tuey FFT Algorithms FFT Algorithms Usig these

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

### MARTINGALES AND A BASIC APPLICATION

MARTINGALES AND A BASIC APPLICATION TURNER SMITH Abstract. This paper will develop the measure-theoretic approach to probability i order to preset the defiitio of martigales. From there we will apply this

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

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

THE ABRACADABRA PROBLEM FRANCESCO CARAVENNA Abstract. We preset a detailed solutio of Exercise E0.6 i [Wil9]: i a radom sequece of letters, draw idepedetly ad uiformly from the Eglish alphabet, the expected

### The Stable Marriage Problem

The Stable Marriage Problem William Hut Lae Departmet of Computer Sciece ad Electrical Egieerig, West Virgiia Uiversity, Morgatow, WV William.Hut@mail.wvu.edu 1 Itroductio Imagie you are a matchmaker,

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

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

### SEQUENCES AND SERIES CHAPTER

CHAPTER SEQUENCES AND SERIES Whe the Grat family purchased a computer for \$,200 o a istallmet pla, they agreed to pay \$00 each moth util the cost of the computer plus iterest had bee paid The iterest each

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

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

### A Guide to the Pricing Conventions of SFE Interest Rate Products

A Guide to the Pricig Covetios of SFE Iterest Rate Products SFE 30 Day Iterbak Cash Rate Futures Physical 90 Day Bak Bills SFE 90 Day Bak Bill Futures SFE 90 Day Bak Bill Futures Tick Value Calculatios

### The following example will help us understand The Sampling Distribution of the Mean. C1 C2 C3 C4 C5 50 miles 84 miles 38 miles 120 miles 48 miles

The followig eample will help us uderstad The Samplig Distributio of the Mea Review: The populatio is the etire collectio of all idividuals or objects of iterest The sample is the portio of the populatio

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

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

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

### I. Why is there a time value to money (TVM)?

Itroductio to the Time Value of Moey Lecture Outlie I. Why is there the cocept of time value? II. Sigle cash flows over multiple periods III. Groups of cash flows IV. Warigs o doig time value calculatios

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

### 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 5: Span, linear independence, bases, and dimension

Lecture 5: Spa, liear idepedece, bases, ad dimesio Travis Schedler Thurs, Sep 23, 2010 (versio: 9/21 9:55 PM) 1 Motivatio Motivatio To uderstad what it meas that R has dimesio oe, R 2 dimesio 2, etc.;

### CHAPTER 11 Financial mathematics

CHAPTER 11 Fiacial mathematics I this chapter you will: Calculate iterest usig the simple iterest formula ( ) Use the simple iterest formula to calculate the pricipal (P) Use the simple iterest formula

### Building Blocks Problem Related to Harmonic Series

TMME, vol3, o, p.76 Buildig Blocks Problem Related to Harmoic Series Yutaka Nishiyama Osaka Uiversity of Ecoomics, Japa Abstract: I this discussio I give a eplaatio of the divergece ad covergece of ifiite

### Laws of Exponents Learning Strategies

Laws of Epoets Learig Strategies What should studets be able to do withi this iteractive? Studets should be able to uderstad ad use of the laws of epoets. Studets should be able to simplify epressios that

### Discrete Mathematics and Probability Theory Spring 2014 Anant Sahai Note 13

EECS 70 Discrete Mathematics ad Probability Theory Sprig 2014 Aat Sahai Note 13 Itroductio At this poit, we have see eough examples that it is worth just takig stock of our model of probability ad may

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

### Solving Logarithms and Exponential Equations

Solvig Logarithms ad Epoetial Equatios Logarithmic Equatios There are two major ideas required whe solvig Logarithmic Equatios. The first is the Defiitio of a Logarithm. You may recall from a earlier topic:

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

### Week 3 Conditional probabilities, Bayes formula, WEEK 3 page 1 Expected value of a random variable

Week 3 Coditioal probabilities, Bayes formula, WEEK 3 page 1 Expected value of a radom variable We recall our discussio of 5 card poker hads. Example 13 : a) What is the probability of evet A that a 5

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

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

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

### Measures of Spread and Boxplots Discrete Math, Section 9.4

Measures of Spread ad Boxplots Discrete Math, Sectio 9.4 We start with a example: Example 1: Comparig Mea ad Media Compute the mea ad media of each data set: S 1 = {4, 6, 8, 10, 1, 14, 16} S = {4, 7, 9,

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

### Permutations, the Parity Theorem, and Determinants

1 Permutatios, the Parity Theorem, ad Determiats Joh A. Guber Departmet of Electrical ad Computer Egieerig Uiversity of Wiscosi Madiso Cotets 1 What is a Permutatio 1 2 Cycles 2 2.1 Traspositios 4 3 Orbits

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

### Integer Factorization Algorithms

Iteger Factorizatio Algorithms Coelly Bares Departmet of Physics, Orego State Uiversity December 7, 004 This documet has bee placed i the public domai. Cotets I. Itroductio 3 1. Termiology 3. Fudametal

### A Faster Clause-Shortening Algorithm for SAT with No Restriction on Clause Length

Joural o Satisfiability, Boolea Modelig ad Computatio 1 2005) 49-60 A Faster Clause-Shorteig Algorithm for SAT with No Restrictio o Clause Legth Evgey Datsi Alexader Wolpert Departmet of Computer Sciece

### CHAPTER 3 DIGITAL CODING OF SIGNALS

CHAPTER 3 DIGITAL CODING OF SIGNALS Computers are ofte used to automate the recordig of measuremets. The trasducers ad sigal coditioig circuits produce a voltage sigal that is proportioal to a quatity

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

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

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

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

### THE LEAST COMMON MULTIPLE OF A QUADRATIC SEQUENCE

THE LEAST COMMON MULTIPLE OF A QUADRATIC SEQUENCE JAVIER CILLERUELO Abstract. We obtai, for ay irreducible quadratic olyomial f(x = ax 2 + bx + c, the asymtotic estimate log l.c.m. {f(1,..., f(} log. Whe

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

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

### Normal Distribution.

Normal Distributio www.icrf.l Normal distributio I probability theory, the ormal or Gaussia distributio, is a cotiuous probability distributio that is ofte used as a first approimatio to describe realvalued

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

### Math C067 Sampling Distributions

Math C067 Samplig Distributios Sample Mea ad Sample Proportio Richard Beigel Some time betwee April 16, 2007 ad April 16, 2007 Examples of Samplig A pollster may try to estimate the proportio of voters

### Lecture 2: Karger s Min Cut Algorithm

priceto uiv. F 3 cos 5: Advaced Algorithm Desig Lecture : Karger s Mi Cut Algorithm Lecturer: Sajeev Arora Scribe:Sajeev Today s topic is simple but gorgeous: Karger s mi cut algorithm ad its extesio.

### Taking DCOP to the Real World: Efficient Complete Solutions for Distributed Multi-Event Scheduling

Taig DCOP to the Real World: Efficiet Complete Solutios for Distributed Multi-Evet Schedulig Rajiv T. Maheswara, Milid Tambe, Emma Bowrig, Joatha P. Pearce, ad Pradeep araatham Uiversity of Souther Califoria

### University of California, Los Angeles Department of Statistics. Distributions related to the normal distribution

Uiversity of Califoria, Los Ageles Departmet of Statistics Statistics 100B Istructor: Nicolas Christou Three importat distributios: Distributios related to the ormal distributio Chi-square (χ ) distributio.

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

### Chapter 5 Unit 1. IET 350 Engineering Economics. Learning Objectives Chapter 5. Learning Objectives Unit 1. Annual Amount and Gradient Functions

Chapter 5 Uit Aual Amout ad Gradiet Fuctios IET 350 Egieerig Ecoomics Learig Objectives Chapter 5 Upo completio of this chapter you should uderstad: Calculatig future values from aual amouts. Calculatig

### CHAPTER 3 THE TIME VALUE OF MONEY

CHAPTER 3 THE TIME VALUE OF MONEY OVERVIEW A dollar i the had today is worth more tha a dollar to be received i the future because, if you had it ow, you could ivest that dollar ad ear iterest. Of all

### 0.7 0.6 0.2 0 0 96 96.5 97 97.5 98 98.5 99 99.5 100 100.5 96.5 97 97.5 98 98.5 99 99.5 100 100.5

Sectio 13 Kolmogorov-Smirov test. Suppose that we have a i.i.d. sample X 1,..., X with some ukow distributio P ad we would like to test the hypothesis that P is equal to a particular distributio P 0, i.e.

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

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

### Estimating Probability Distributions by Observing Betting Practices

5th Iteratioal Symposium o Imprecise Probability: Theories ad Applicatios, Prague, Czech Republic, 007 Estimatig Probability Distributios by Observig Bettig Practices Dr C Lych Natioal Uiversity of Irelad,

### Determining the sample size

Determiig the sample size Oe of the most commo questios ay statisticia gets asked is How large a sample size do I eed? Researchers are ofte surprised to fid out that the aswer depeds o a umber of factors

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

### UC Berkeley Department of Electrical Engineering and Computer Science. EE 126: Probablity and Random Processes. Solutions 9 Spring 2006

Exam format UC Bereley Departmet of Electrical Egieerig ad Computer Sciece EE 6: Probablity ad Radom Processes Solutios 9 Sprig 006 The secod midterm will be held o Wedesday May 7; CHECK the fial exam