Save this PDF as:
 WORD  PNG  TXT  JPG

Size: px
Start display at page:

Download ""

Transcription

1 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 of Utah I this paper we preset some prelimiary results o a cojecture by Paul Erdíos ë1,2,5ë cocerig coverig sets of cogrueces A coverig set cosists of a æite system of cogrueces with distict moduli, such thatevery iteger satisæes as a miimum oe of the cogrueces A iterestig cosequece of this cojecture is the depedece of the solutio o abudat umbers; a abudat umber is a iteger whose sum of its proper divisors exceeds the iteger Complemetary Sets Deæitio 1 If a ad b are itegers, the a mod b = fa; a æ b; a æ 2b;:::g : Deæitio 2 If a 1,a 2,:::,a,b 2 Z, the ëa 1 ;a 2 ;:::;a ëmodb = fa 1 mod bgëfa 2 mod bgëæææëfa mod bg = ë i=1 fa i mod bg : 1

2 CHAPTER 5 ON A CONJECTURE OF ERD í OS 2 The Remodulizatio Theorem ë3ë states that if a; b; c 2 Z ad cé0, the a mod b =ëa; a + b;:::;a+ bèc, 1èë mod cb : If we use Deæitio 2, the complemetary set of fa mod bg is give by fa mod bg c = Z fa mod bg =ë0; 1; 2;:::;a, 1;a+1;:::;b, 1ë mod b: I this case, the complemetary set cosists of b, 1 cogrueces modulo b We will always refer to the size of a set ad its complemet with respect to a speciæc modulus The followig theorem ad its proof is foud i ë4ë S i=1 ëa i;1;:::;a i;æbi ëmodb i o, where Theorem 1 The complemetary set of a i;j 6= a i;k for j 6= k, ad æ bi é b i, ad the b i are pairwise relatively prime, cotais exactly Q i=1 èb i, æ bi è cogrueces modulo Q i=1 b i Coverig Sets of Cogrueces I Daveport ë1ë, a problem has bee proposed to costruct a set of cogrueces with distict moduli, such thatevery iteger is cotaied i at least oe of the cogrueces of the system All moduli are ç 2, sice modulo 1 costitutes its ow complete residue system A extesio has bee proposed by Erdíos ë5ë: If give ay iteger N ç 1, does there exist aæitecoverig set of cogrueces usig oly distict moduli greater tha N? The followig system represets a set of coverig cogrueces for N = 1: 8 é x ç 0mod2 x ç 0mod3 x ç 1mod4 x ç 1mod6 x ç 11 mod 12 Note that the moduli are all divisors of 12 Usig the remodulizatio method to remodulize each cogruece to the modulus 12, wehave x ç ë0; 2; 4; 6; 8; 10ë mod 12 8é x ç ë0; 3; 6; 9ë mod 12 x ç ë1; 5; 9ë mod 12 è51è x ç ë1; 7ë mod 12 x ç ë11ë mod 12 By ispectio, this system costitutes a coverig system, because it is equivalet to the complete residue system modulo 12, that is, ë0; 1; 2; 3; 4; 5; 6; 7; 8; 9; 10; 11ë

3 CHAPTER 5 ON A CONJECTURE OF ERD í OS 3 mod12 ç Z The questio aturally arises as to the possibility of costructig a set of coverig cogrueces whose moduli are pairwise relatively prime The aswer is o, as we will ow show The proof depeds o results of Theorem 1 S Theorem 2 Ay æite system of cogrueces ëa i=1 i;1;a i;2 ;:::;a ëmodb i;æbi i where the b i are pairwise relatively prime, ad a i;k 6= a i;m for k 6= m, ad æ bi éb i,caot form a coverig set of cogrueces Proof We use Theorem S 1, for the case æ bi =1for 1 ç i ç Forasystem of cogrueces f a i=1 i mod b i g with pairwise relatively prime moduli b i to be a coverig set, it is ecessary that the system of cogrueces forms a complete residue Q Q system, that is, a uio of b i=1 i distict èicogruetè residues modulo b i=1 i However, Q Q sice the complemetary set cosists of èb i=1 i,1è cogrueces modulo Q Q b i=1 i, the system cosists Q of Q Q b i=1 i, èb i=1 i, 1è cogrueces modulo b i=1 i This meas that b Q Q i=1 i, èb i=1 i, 1è must equal b i=1 i,or èb i=1 i,1è = 0; this is a cotradictio, sice 2 ç b 1 éb 2 ::éb That is to say,ittakes iæitely may cogrueces with pairwise relatively prime moduli to costruct a coverig set The situatio is actually muchworse; if we costruct a system of cogrueces è ë è ëa i;1 ;a i;2 ;:::;a i;æbi ëmodb i ; i=1 a system of cogrueces with æ bi residues for each modulus b i, where æ bi éb i, ad a i;k 6= a i;m for k 6= Q m, the the complemetary Q Q set cosists of èb i=1 i,æ bi è cogrueces modulo b i=1 i Here, èb i=1 i, æ bi è must equal zero, which is a cotradictio because b i, æ bi ç 1 Agai, it takes iæitely may such cogrueces to costruct a coverig set I the extreme case, whe æ bi = b i, 1, we have the system 8é o, x ç ëa 1;1 ;a 1;2 ;:::;a 1;b1,1ë modb 1 x ç ëa 2;1 ;a 2;2 ;:::;a 2;b2,1ë modb 2 x ç ëa ;1 ;a ;2 ;:::;a ;b,1ë modb è52è where the b i are pairwise relatively prime, ad each set of cogrueces modulo b i cotais b i,1 cogrueces, ie, oe cogruece shy of a complete residue system for each modulus b i Q Q The complemet of the system cosists Q of èb i=1 i,èb i,1èè cogruece modulo b i=1 i, or 1 cogruece modulo b i=1 i Hece the system è52è cotais a complete residue system oly if we cap it oæ with the last

4 CHAPTER 5 ON A CONJECTURE OF ERD í OS 4 remaiig residue modulo Q i=1 b i However, by addig to the system the remaiig cogruece, we have relaxed our requiremet that all the moduli are pairwise relatively prime Upshot If a æite system of distict cogrueces è52è with pairwise relatively prime moduli forms a coverig set, it must cotai a cogruece class which itself forms a complete residue system, or coverig set Suppose p 1 is a prime such that p 1 é N, ad M = p ç1 1 pç2 2 æææpç, where p 1 Q é p 2 é ::: é p The total umber of divisors of M which are ç M is èç i=1 i + 1è; however, to form a coverig set we may oly use Q all factors greater tha 1, the total umber of useable factors is ç =,1+ èç i=1 i +1è We ow costruct a system of ç cogrueces 8 é x ç c 1 mod d 1 x ç c 2 mod d 2 x ç c ç mod d ç è53è where the d i are the various factors of M = p ç1 1 pç2 2 æææpç,add 1 éd 2 ::é d ç Note that d 1 = p 1 ad d ç = M Observatio 1 The umber of cogrueces is give by çx i=1 M d i = M d 1 + M d 2 + æææ+ M d ç =1+d 1 + d 2 + æææ+ d ç,1 = ç 0 èmè ; after remodulizig all cogrueces of system è53è to the modulus M = p ç1 1 pç2 2 æææpç Here, ç 0 deotes the sum of all proper divisors, ie, all positive divisors less tha M Up to this poitwehave ot made ay claims about these residues modulo M, that is, we have ot yet determied how may repetitios exist, ad equivaletly, if the total umber of distict residues is suæciet to create a complete residue system modulo M We ca see, however, that the total umberofresiduesmust be at least M to form a complete residue system modulo M Therefore, M must be a abudat or perfect umber, that is, the sum of all proper divisors çx i=1 M d i =1+d 1 + d 2 + æææ+ d ç,1 = ç 0 èmè ç M i order for this system to cotai a complete residue system modulo M We have proved the followig theorem

5 CHAPTER 5 ON A CONJECTURE OF ERD í OS 5 Theorem 3 I order for the proper divisors of a umber M to costitute the moduli of a coverig set it is ecessary that M be perfect or abudat, ie, ç 0 èmè ç M We will prove i Theorem 5 that if M is a perfect umber, ie, ç 0 èmè =M, the a system è53è caot comprise a coverig set Observatio 2 It may ot be ecessary to use all divisors of a abudat umber M to form a coverig set; however, accordig to our eumeratio of the residues modulo M of system è53è, we must remove all residues associated with the divisors that are removed For example, suppose we do't use the divisor d k, the we must remove a total of M=d k residues from the set of ç 0 èmè residues couted i Observatio 1 However, the divisor d k caot cotai the greatest multiple of ay oe prime appearig i the prime decompositio M = p ç1 1 pç2 2 æææpç, for i that case, lcmèd 1 ;d 2 ;:::;d k,1;d k+1 ;:::;d ç è 6= M, that is to say, we would ot have remodulized the system to the modulus M, but istead to some modulus ém I the origial set 8 é x ç ë0; 2; 4; 6; 8; 10ë mod 12 x ç ë0; 3; 6; 9ë mod 12 x ç ë1; 5; 9ë mod 12 x ç ë1; 7ë mod 12 x ç ë11ë mod 12 we æd that the itegers 0,1,6, ad 9 represet 4 repetitios, sice ç 0 è12è,12 = 4 The total umber of repetitios that occur i a system è53è which forms a coverig set is ç 0 èmè,m The followig theorem eumerates the total umber of repetitios that occur i two cogrueces Theorem 4 If two cogrueces a 1 mod b 1 ad a 2 mod b 2, where gcdèb 1 ;b 2 è= 1, are remodulized to the modulus pb 1 b 2, where p 2 Z, the the solutio set èitersectioè cosists of p residues modulo pb 1 b 2 Proof If we obtai a pair of cogrueces ç x ç a1 mod b 1 x ç a 2 mod b 2 è54è where b 1 ad b 2 are relatively prime, the remodulizig each tomodulo b 1 b 2, the itersectio by the Chiese Remaider Theorem ë3ë is determied to be the uique cogruece x ç a 0 mod b 1 b 2, where a 1 ç a 0 ç a 1 + b 1 èb 2, 1è ad a 2 ç a 0 ç a 2 +b 2 èb 1,1è If the pair is remodulized, ot to the smallest modulus,

6 CHAPTER 5 ON A CONJECTURE OF ERD í OS 6 b 1 b 2, but istead to some multiple of it, say pb 1 b 2, where p is a positive iteger, the ç x ç ëa1 ;a 1 + b 1 ;:::;a 1 + b 1 èpb 2, 1èë mod pb 1 b 2 x ç ëa 2 ;a 2 + b 2 ;:::;a 2 + b 2 èpb 1, 1èë mod pb 1 b 2 è55è We show that the itersectio of è55è is ëa 0 ;a 0 + b 1 b 2 ;:::;a 0 + b 1 b 2 èp, 1èë mod pb 1 b 2 ; which is equivalet to the solutio a 0 mod b 1 b 2 of the origial pair after a 0 mod b 1 b 2 has bee remodulized by the factor p By writig the ærst cogruece of è55è as a 1 mod b 1 =ë a 1 ; a 1 + b 1 ; ::: a 1 + b 1 èb 2, 1è; a 1 + b 1 b 2 ; a 1 + b 1 + b 1 b 2 ; ::: a 1 + b 1 è2b 2, 1è; a 1 +èp, 1èb 1 b 2 ; a 1 + b 1 +èp, 1èb 1 b 2 ; ::: a 1 + b 1 èpb 2, 1èë mod pb 1 b 2 we ote that the ærst row cotais the solutio, a 0 mod pb 1 b 2 Moreover, by addig multiples of b 1 b 2 to the residue a 0, we æd the subsequet solutios withi the same colum; hece there are p solutios èmodulo pb 1 b 2 è Costructig the secod cogruece of è55è i the same maer, we extract the same p solutios Therefore, if a pair of cogrueces è54è is remodulized to the modulus pb 1 b 2, the they share exactly p simultaeous residues As a example, if we have the pair of cogrueces ç x ç a1 mod p 1 x ç a 2 mod p 2 which are remodulized to the modulus M = p ç1 1 pç2 2 æææpç, the they share residues modulo M M=p 1 p 2 = p èç1,1è 1 p èç2,1è 2 p ç3 3 æææpç Theorem 5 If M is a perfect umber, the a system of cogrueces whose moduli cosist of all divisors é 1 of M caot form a coverig set Proof Suppose M is a eve perfect umber ë6ë; the it is of the form 2 k p, where p is a odd prime of the form 2 k+1, 1 Suppose we form a system of cogrueces è53è where the d i are all divisors of M greater tha 1, ad remodulize all cogrueces modulo d i to the modulus M By Observatio 1, ç 0 èmè = M; a complete residue system modulo M must cotai M distict residues modulo M Sice p is prime, the cogrueces modulo 2 ad modulo p

7 CHAPTER 5 ON A CONJECTURE OF ERD í OS 7 share 1 residue modulo 2p, or2 k,1 residues modulo 2 k p by Theorem 4 These represet 2 k,1 repetitios, ad M, 2 k,1 ém= ç 0 èmè; hece the total umber of distict residues is ot suæciet to form a coverig set If M is a odd perfect umber èif ay existè, the it must cotai more tha 8 distict prime factors ë7ë Sice p 1 ad p 2 are two distict prime factors, their itersectio cotais 1 cogruece modulo p 1 p 2, or M=p 1 p 2 cogrueces modulo M I that case, M, M=p 1 p 2 ém= ç 0 èmè, meaig that the total umber of distict residues modulo M is too small for a system of cogrueces è53è to form a coverig set Remark 1 Theorems 3 ad 5 combied suggest that if for each N ç 2 there exists a coverig set whose distict moduli all exceed N, the there would exist abudat umbers whose least prime factor exceeds N This is true I fact, eve more is true Deæitio 3 A umber M is said to be abudat of order k ç 1 if ad oly if ç 0 èmè=m ék Theorem 6 If K ad N are ay itegers, the there exists a iteger M, abudat of order K, whoseleast prime factor exceeds N Proof Sice the primes are such P P that 1=p i = +1, we may Q select N é p 1 é p 2 é æææ é p such that 1=p i=1 i = K Set M = p i=1 i, the ç 0 èmè = 1+p 1 + p 2 + æææ + p 1 p 2 æææp,1 ad ç 0 èmè=m = 1=èp 1 æææp è+ 1=èp 2 æææp è+æææ+1=p 1 + æææ+1=p ék Remark 2 Theorem 6 shows that there are umbers M whose divisors caot yet be excluded from formig a coverig set whose moduli all exceed N However, a settlig of this cojecture may well require ædig methods that ca accurately accout for the total umber of repetitios that occur i such systems Refereces ë1ë Harold Daveport, The Higher Arithmetic, Dover Publicatios, Ic, New York, 1983 p 57 ë2ë Erdíos, Paul, O Itegers of the Form 2 k + p ad some Related Problems, Summa Brasiliesis Mathematicae, Istituto de Mathematica Pura e Aplicada, 1950, Vol 2, p 120 ë3ë Gold, Jeærey F ad Do H Tucker, Remodulizatio of Cogrueces, Proceedigs Natioal Coferece o Udergraduate Research, èuiversity of

8 CHAPTER 5 ON A CONJECTURE OF ERD í OS 8 North Carolia Press, Asheville, North Carolia, 1992è, Vol II, pp 1036í41 ë4ë Gold, Jeærey F ad Do H Tucker, Complemetary Sets of Systems of Cogrueces, Proceedigs Natioal Coferece o Udergraduate Research, èuiversity of North Carolia Press, Asheville, North Carolia, 1993è, Vol II, pp 793í96 ë5ë Wacèlaw Sierpiçski, Elemetary Theory of Numbers, Paçstwowe Wydawictwo Naukowe, Warszawa, 1964, pp 190, 413 ë6ë Keeth H Rose, Elemetary Number Theory ad its Applicatios, Third Editio, Addiso-Wesley Publishig Compay, Massachusetts, 1993, pp 223í 29 ë7ë David M Burto, Elemetary Number Theory, Secod Editio, Wm C Brow Publishers, Iowa, 1989, p 167

Chapter 4 Complementary Sets Of Systems Of Congruences Proceedings NCUR VII. è1993è, Vol. II, pp. 793í796. Jeærey F. Gold Department of Mathematics, Department of Physics University of Utah Don H. Tucker

More information

1. MATHEMATICAL INDUCTION

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

More information

Chapter 2 Remodulization of Congruences Proceedings NCUR VI. è1992è, Vol. II, pp. 1036í1041. Jeærey F. Gold Department of Mathematics, Department of Physics University of Utah Don H. Tucker Department

More information

Factors of sums of powers of binomial coefficients

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

More information

Department of Computer Science, University of Otago

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

More information

3. Greatest Common Divisor - Least Common Multiple

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

More information

Infinite Sequences and Series

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

More information

CS103X: Discrete Structures Homework 4 Solutions

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

More information

In nite Sequences. Dr. Philippe B. Laval Kennesaw State University. October 9, 2008

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

More information

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

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

More information

A probabilistic proof of a binomial identity

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

More information

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

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

More information

THE ARITHMETIC OF INTEGERS. - multiplication, exponentiation, division, addition, and subtraction

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,

More information

Discrete Mathematics and Probability Theory Spring 2014 Anant Sahai Note 13

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

More information

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

More information

Irreducible polynomials with consecutive zero coefficients

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

More information

5 Boolean Decision Trees (February 11)

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

More information

5.3. Generalized Permutations and Combinations

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

More information

Section 11.3: The Integral Test

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

More information

1 Computing the Standard Deviation of Sample Means

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.

More information

THE LEAST COMMON MULTIPLE OF A QUADRATIC SEQUENCE

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

More information

CME 302: NUMERICAL LINEAR ALGEBRA FALL 2005/06 LECTURE 8

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

More information

2-3 The Remainder and Factor Theorems

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

More information

4. Trees. 4.1 Basics. Definition: A graph having no cycles is said to be acyclic. A forest is an acyclic graph.

4. Trees. 4.1 Basics. Definition: A graph having no cycles is said to be acyclic. A forest is an acyclic graph. 4. Trees Oe of the importat classes of graphs is the trees. The importace of trees is evidet from their applicatios i various areas, especially theoretical computer sciece ad molecular evolutio. 4.1 Basics

More information

Elementary Theory of Russian Roulette

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

More information

FIBONACCI NUMBERS: AN APPLICATION OF LINEAR ALGEBRA. 1. Powers of a matrix

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

More information

MARTINGALES AND A BASIC APPLICATION

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

More information

ON AN INTEGRAL OPERATOR WHICH PRESERVE THE UNIVALENCE

ON AN INTEGRAL OPERATOR WHICH PRESERVE THE UNIVALENCE Proceedigs of the Iteratioal Coferece o Theory ad Applicatios of Mathematics ad Iformatics ICTAMI 3, Alba Iulia ON AN INTEGRAL OPERATOR WHICH PRESERVE THE UNIVALENCE by Maria E Gageoea ad Silvia Moldoveau

More information

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

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

More information

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

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

More information

Theorems About Power Series

Theorems About Power Series 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

More information

Chapter 5: Inner Product Spaces

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

More information

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

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

More information

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.

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

More information

Asymptotic Growth of Functions

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

More information

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

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

More information

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

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.

More information

Factoring x n 1: cyclotomic and Aurifeuillian polynomials Paul Garrett <garrett@math.umn.edu>

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

More information

Chapter 7: Confidence Interval and Sample Size

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

More information

SECTION 1.5 : SUMMATION NOTATION + WORK WITH SEQUENCES

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,

More information

Permutations, the Parity Theorem, and Determinants

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

More information

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

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

More information

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

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

More information

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

More information

Your organization has a Class B IP address of 166.144.0.0 Before you implement subnetting, the Network ID and Host ID are divided as follows:

Your organization has a Class B IP address of 166.144.0.0 Before you implement subnetting, the Network ID and Host ID are divided as follows: Subettig Subettig is used to subdivide a sigle class of etwork i to multiple smaller etworks. Example: Your orgaizatio has a Class B IP address of 166.144.0.0 Before you implemet subettig, the Network

More information

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

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

More information

Confidence Intervals. CI for a population mean (σ is known and n > 30 or the variable is normally distributed in the.

Confidence Intervals. CI for a population mean (σ is known and n > 30 or the variable is normally distributed in the. Cofidece Itervals A cofidece iterval is a iterval whose purpose is to estimate a parameter (a umber that could, i theory, be calculated from the populatio, if measuremets were available for the whole populatio).

More information

Notes on exponential generating functions and structures.

Notes on exponential generating functions and structures. Notes o expoetial geeratig fuctios ad structures. 1. The cocept of a structure. Cosider the followig coutig problems: (1) to fid for each the umber of partitios of a -elemet set, (2) to fid for each the

More information

Center, Spread, and Shape in Inference: Claims, Caveats, and Insights

Center, Spread, and Shape in Inference: Claims, Caveats, and Insights Ceter, Spread, ad Shape i Iferece: Claims, Caveats, ad Isights Dr. Nacy Pfeig (Uiversity of Pittsburgh) AMATYC November 2008 Prelimiary Activities 1. I would like to produce a iterval estimate for the

More information

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

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.

More information

I. Chi-squared Distributions

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.

More information

Estimating Probability Distributions by Observing Betting Practices

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,

More information

On Formula to Compute Primes. and the n th Prime

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

More information

CHAPTER 3 DIGITAL CODING OF SIGNALS

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

More information

Soving Recurrence Relations

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

More information

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

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

More information

NATIONAL SENIOR CERTIFICATE GRADE 12

NATIONAL SENIOR CERTIFICATE GRADE 12 NATIONAL SENIOR CERTIFICATE GRADE MATHEMATICS P EXEMPLAR 04 MARKS: 50 TIME: 3 hours This questio paper cosists of 8 pages ad iformatio sheet. Please tur over Mathematics/P DBE/04 NSC Grade Eemplar INSTRUCTIONS

More information

Solutions to Exercises Chapter 4: Recurrence relations and generating functions

Solutions to Exercises Chapter 4: Recurrence relations and generating functions Solutios to Exercises Chapter 4: Recurrece relatios ad geeratig fuctios 1 (a) There are seatig positios arraged i a lie. Prove that the umber of ways of choosig a subset of these positios, with o two chose

More information

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

EGYPTIAN FRACTION EXPANSIONS FOR RATIONAL NUMBERS BETWEEN 0 AND 1 OBTAINED WITH ENGEL SERIES EGYPTIAN FRACTION EXPANSIONS FOR RATIONAL NUMBERS BETWEEN 0 AND OBTAINED WITH ENGEL SERIES ELVIA NIDIA GONZÁLEZ AND JULIA BERGNER, PHD DEPARTMENT OF MATHEMATICS Abstract. The aciet Egyptias epressed ratioal

More information

Ramsey-type theorems with forbidden subgraphs

Ramsey-type theorems with forbidden subgraphs Ramsey-type theorems with forbidde subgraphs Noga Alo Jáos Pach József Solymosi Abstract A graph is called H-free if it cotais o iduced copy of H. We discuss the followig questio raised by Erdős ad Hajal.

More information

Solving Logarithms and Exponential Equations

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:

More information

Modified Line Search Method for Global Optimization

Modified Line Search Method for Global Optimization Modified Lie Search Method for Global Optimizatio Cria Grosa ad Ajith Abraham Ceter of Excellece for Quatifiable Quality of Service Norwegia Uiversity of Sciece ad Techology Trodheim, Norway {cria, ajith}@q2s.tu.o

More information

A Note on Sums of Greatest (Least) Prime Factors

A Note on Sums of Greatest (Least) Prime Factors It. J. Cotemp. Math. Scieces, Vol. 8, 203, o. 9, 423-432 HIKARI Ltd, www.m-hikari.com A Note o Sums of Greatest (Least Prime Factors Rafael Jakimczuk Divisio Matemática, Uiversidad Nacioal de Luá Bueos

More information

Lecture 2: Karger s Min Cut Algorithm

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.

More information

Vladimir N. Burkov, Dmitri A. Novikov MODELS AND METHODS OF MULTIPROJECTS MANAGEMENT

Vladimir N. Burkov, Dmitri A. Novikov MODELS AND METHODS OF MULTIPROJECTS MANAGEMENT Keywords: project maagemet, resource allocatio, etwork plaig Vladimir N Burkov, Dmitri A Novikov MODELS AND METHODS OF MULTIPROJECTS MANAGEMENT The paper deals with the problems of resource allocatio betwee

More information

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

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

More information

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

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

More information

A Mathematical Perspective on Gambling

A Mathematical Perspective on Gambling A Mathematical Perspective o Gamblig Molly Maxwell Abstract. This paper presets some basic topics i probability ad statistics, icludig sample spaces, probabilistic evets, expectatios, the biomial ad ormal

More information

THE HEIGHT OF q-binary SEARCH TREES

THE HEIGHT OF q-binary SEARCH TREES THE HEIGHT OF q-binary 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

Exploratory Data Analysis

Exploratory Data Analysis 1 Exploratory Data Aalysis Exploratory data aalysis is ofte the rst step i a statistical aalysis, for it helps uderstadig the mai features of the particular sample that a aalyst is usig. Itelliget descriptios

More information

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

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

More information

A Combined Continuous/Binary Genetic Algorithm for Microstrip Antenna Design

A Combined Continuous/Binary Genetic Algorithm for Microstrip Antenna Design A Combied Cotiuous/Biary Geetic Algorithm for Microstrip Atea Desig Rady L. Haupt The Pesylvaia State Uiversity Applied Research Laboratory P. O. Box 30 State College, PA 16804-0030 haupt@ieee.org Abstract:

More information

Hypothesis testing. Null and alternative hypotheses

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

More information

Hypergeometric Distributions

Hypergeometric Distributions 7.4 Hypergeometric Distributios Whe choosig the startig lie-up for a game, a coach obviously has to choose a differet player for each positio. Similarly, whe a uio elects delegates for a covetio or you

More information

Chapter 1 A Pri Characterization of T m e Pairs w in Proceedings NCUR V. (1991), Vol. I, pp. 362{366. Jerey F. Gold Department of Mathematics, Department of Physics University of Utah DonH.Tucker Department

More information

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

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

More information

Chapter 8 Vector Products Revisited: A New and Eæcient Method of Proving Vector Identities Proceedings NCUR X. è1996è, Vol. II, pp. 994í998 Jeærey F. Gold Department of Mathematics, Department of Physics

More information

On the L p -conjecture for locally compact groups

On the L p -conjecture for locally compact groups Arch. Math. 89 (2007), 237 242 c 2007 Birkhäuser Verlag Basel/Switzerlad 0003/889X/030237-6, ublished olie 2007-08-0 DOI 0.007/s0003-007-993-x Archiv der Mathematik O the L -cojecture for locally comact

More information

1 Correlation and Regression Analysis

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

More information

Lecture 5: Span, linear independence, bases, and dimension

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

More information

Tangent circles in the ratio 2 : 1. Hiroshi Okumura and Masayuki Watanabe. In this article we consider the following old Japanese geometry problem

Tangent circles in the ratio 2 : 1. Hiroshi Okumura and Masayuki Watanabe. In this article we consider the following old Japanese geometry problem 116 Taget circles i the ratio 2 : 1 Hiroshi Okumura ad Masayuki Wataabe I this article we cosider the followig old Japaese geometry problem (see Figure 1), whose statemet i [1, p. 39] is missig the coditio

More information

Section 8.3 : De Moivre s Theorem and Applications

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 =

More information

Our aim is to show that under reasonable assumptions a given 2π-periodic function f can be represented as convergent series

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

More information

Chapter 7 Methods of Finding Estimators

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

More information

2. Degree Sequences. 2.1 Degree Sequences

2. Degree Sequences. 2.1 Degree Sequences 2. Degree Sequeces The cocept of degrees i graphs has provided a framewor for the study of various structural properties of graphs ad has therefore attracted the attetio of may graph theorists. Here we

More information

Integer Factorization Algorithms

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

More information

7.1 Finding Rational Solutions of Polynomial Equations

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?

More information

PROCEEDINGS OF THE YEREVAN STATE UNIVERSITY AN ALTERNATIVE MODEL FOR BONUS-MALUS SYSTEM

PROCEEDINGS OF THE YEREVAN STATE UNIVERSITY AN ALTERNATIVE MODEL FOR BONUS-MALUS SYSTEM PROCEEDINGS OF THE YEREVAN STATE UNIVERSITY Physical ad Mathematical Scieces 2015, 1, p. 15 19 M a t h e m a t i c s AN ALTERNATIVE MODEL FOR BONUS-MALUS SYSTEM A. G. GULYAN Chair of Actuarial Mathematics

More information

Perfect Packing Theorems and the Average-Case Behavior of Optimal and Online Bin Packing

Perfect Packing Theorems and the Average-Case Behavior of Optimal and Online Bin Packing SIAM REVIEW Vol. 44, No. 1, pp. 95 108 c 2002 Society for Idustrial ad Applied Mathematics Perfect Packig Theorems ad the Average-Case Behavior of Optimal ad Olie Bi Packig E. G. Coffma, Jr. C. Courcoubetis

More information

THE ABRACADABRA PROBLEM

THE ABRACADABRA PROBLEM 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

More information

France caters to innovative companies and offers the best research tax credit in Europe

France caters to innovative companies and offers the best research tax credit in Europe 1/5 The Frech Govermet has three objectives : > improve Frace s fiscal competitiveess > cosolidate R&D activities > make Frace a attractive coutry for iovatio Tax icetives have become a key elemet of public

More information

1.3. VERTEX DEGREES & COUNTING

1.3. VERTEX DEGREES & COUNTING 35 Chapter 1: Fudametal Cocepts Sectio 1.3: Vertex Degrees ad Coutig 36 its eighbor o P. Note that P has at least three vertices. If G x v is coected, let y = v. Otherwise, a compoet cut off from P x v

More information

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

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

More information

Sequences and Series

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

More information

CS103A Handout 23 Winter 2002 February 22, 2002 Solving Recurrence Relations

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

More information

A Recursive Formula for Moments of a Binomial Distribution

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,

More information

NATIONAL SENIOR CERTIFICATE GRADE 11

NATIONAL SENIOR CERTIFICATE GRADE 11 NATIONAL SENIOR CERTIFICATE GRADE MATHEMATICS P EXEMPLAR 007 MARKS: 50 TIME: 3 hours This questio paper cosists of pages, 4 diagram sheets ad a -page formula sheet. Please tur over Mathematics/P DoE/Exemplar

More information

Chatpun Khamyat Department of Industrial Engineering, Kasetsart University, Bangkok, Thailand ocpky@hotmail.com

Chatpun Khamyat Department of Industrial Engineering, Kasetsart University, Bangkok, Thailand ocpky@hotmail.com SOLVING THE OIL DELIVERY TRUCKS ROUTING PROBLEM WITH MODIFY MULTI-TRAVELING SALESMAN PROBLEM APPROACH CASE STUDY: THE SME'S OIL LOGISTIC COMPANY IN BANGKOK THAILAND Chatpu Khamyat Departmet of Idustrial

More information

Incremental calculation of weighted mean and variance

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

More information

Domain 1: Designing a SQL Server Instance and a Database Solution

Domain 1: Designing a SQL Server Instance and a Database Solution Maual SQL Server 2008 Desig, Optimize ad Maitai (70-450) 1-800-418-6789 Domai 1: Desigig a SQL Server Istace ad a Database Solutio Desigig for CPU, Memory ad Storage Capacity Requiremets Whe desigig a

More information