x(x 1)(x 2)... (x k + 1) = [x] k n+m 1


 Marvin Dawson
 1 years ago
 Views:
Transcription
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,..., y }. If we write X (resp., Ỹ ), that meas that we caot distiguish the elemets of X (resp., Y ). Propositio 1 The total umber of all mappigs f : X Y is m ad the umber of ijective mappigs f : X Y is [] m. Propositio 2 The umber of bijective mappigs f : X Y is! whe = m ad 0 otherwise. Propositio 3 The umber of ijective mappigs f : X Y is ( ) m. PROOF. Associate with every ijective mappig f : X Y the image, f(x), of X. By Propositio 1, the umber of ijective mappigs f : X Y is [] m. By Propositio 2, every subset Z of Y with Z = m is the image of X for m! ijective mappigs, ad these mappigs are idistiguishable i the model f : X Y. Thus, the umber i questio is [] m /m! = ( ) m. Propositio 4 The umber of surjective mappigs f : X Y is ( ) m 1 1. The total umber of all mappigs f : X Y is ( ) +m 1 1. PROOF. Assig a set of 1 vertical strips betwee m poits poits o a lie to every surjective mappig f : X Y as follows. If f 1 (y i ) = a i, the put the ith strip betwee the poits with the umbers a a i ad a a i +1. Observe that this is a bijectio betwee the set of surjective mappigs f : X Y ad the set of arragemets of 1 strips betwee m poits o a lie such that each iterval betwee two cosecutive poits ca cotai at most oe strip. But the umber of such arragemets is ( ) m 1 1. Similarly, we have a bijectio betwee the set of all mappigs f : X Y ad the set of all possible arragemets of 1 strips betwee m poits o a lie. Ad the umber of such arragemets is ( ) +m 1 1. The umber S(m, k) of the partitios of a melemet set ito k oempty subsets is a Stirlig umber of the secod kid. Propositio 5 (1) The umber of surjective mappigs f : X Ỹ is S(m, ). (2) The umber of surjective mappigs f : X Y is!s(m, ). (3) The umber of all mappigs f : X Ỹ is S(m, k). 1
2 PROOF. (1) is easy. Every surjective mappig f : X Y ca be costructed i two steps. O the first oe we partitio X ito parts that will be mapped ito the same elemet of Y (by the defiito, there is S(m, ) ways to do this), ad o the secod step we choose the image for every of these parts (! ways). This proves (2). Now, (3) follows from (1). Propositio 6 (1) S(m, m) = 1 for m 0. (2) S(m, 0) = 0 for m > 0. (3)S(m, k) = S(m 1, k 1) + ks(m 1, k) for 0 < k < m. PROOF. (1) ad (2) are evidet. To see (3), observe that the set R of all partitios of X = {x 1,..., x m } ito oempty parts is the uio of R 1 = {π R {x m } is a part of the partitio } ad R 2 = R\R 1. Clearly, R 1 = S(m 1, k 1). Assig every π R 2 the partitio π of X\{x m }, obtaied from π by deletig x m. Notice that every partitio π of X\{x m } ito k parts is assiged to k differet partitios of X. This shows that R 2 = ks(m 1, k). This propositio lets us cout S(m, k) recursively: m \ k Propositio 7 For every k 2 S(m, k) = m 1 i=k 1 ( ) m 1 S(i, k 1). i PROOF. Let (X 1,..., X k ) be a arbitrary partitio of X ito k oempty parts ad x m X k. There are ( ) m 1 r 1 ways to choose Xk with X k = r ad x m X k. Now there are S(m r, k 1) ways to partitio the rest ito k 1 oempty parts. Hece, S(m, k) = m k+1 r=1 ( ) m 1 S(m r, k 1) = r 1 Theorem 8 For every iteger m 0, m 1 i=k 1 x m = S(m, k)[x] k. 2 ( ) m 1 S(i, k 1). i
3 PROOF. Let be a positive iteger. By Propositio For every A Y, A, let X A be the set of mappigs f : X Y such that f(x) = A. If A = k, the X A = k!s(m, k). Hece by Propositio 5 (3), m = ( k)s(m, k)k! = S(m, k)[] k. Thus the values of the polyomials x m ad m S(m, k)[x] k coicide for x = 1, 2, 3,.... It follows that this is the same polyomial. Now, cosider mappigs X ito Ỹ. I order to distiguish two such mappigs f 1 ad f 2, we eed the sets { f1 1 (y 1 ), f1 1 (y 2 ),..., f1 1 (y ) } ad { f2 1 (y 1 ), f2 1 (y 2 ),..., f2 1 (y ) } to be differet. Thus, the umber R(m, ) of all mappigs of X ito Ỹ is the umber of partitios of the umber m ito the sum of oegative itegers. Let P (m, k) deote the umber of partitios of the umber m ito the sum of k positive itegers, ad P (m) deote the umber of partitios of the umber m ito the sum of positive itegers. Clearly, P (m) = P (m, k) m > 0, R(m, ) = P (m, k). Helpful tools i studyig P (m, k) are Ferrer s diagrams. A Ferrer s diagram for the partitio m = a 1 + a a k (assumig a 1 a 2... a k ) cosists of k rows, ad the ith row cotais a i poits i colums 1,..., a i. The example below shows the Ferrer s diagram for the partitio 16 = Ferrer s diagrams imply the followig propositio. Propositio 9 (1) The umber of partitios of m ito the sum of exactly k positive itegers equals the umber of partitios of m ito the sum of positive itegers the maximum of which is k. (2) P (m, ) = P (m, 1) + P (m, 2) P (m, ). Now we prove a deeper fact Propositio 10 The umber of partitios of m ito the sum of distict positive itegers equals the umber of partitios of m ito the sum of odd positive itegers. 3
4 PROOF. Let Q be the set of partitios of m ito the sum of distict positive itegers ad P be the set of partitios of m ito the sum of odd positive itegers. Costruct the mappig F : Q P as follows. Let m = a 1 + a a k ad a 1 > a 2 >... > a k. Write every a i i the form a i = 2 c i b i, where b i is odd. There is oly oe way to do so. Map the partitio m = a 1 + a a k to the partitio m = b 1 + b b }{{ 1 + b } 2 + b b b }{{} k + b k b k. }{{} 2 c 1 times 2 c 2 times 2 c k times This is our mappig F. Now we costruct the mappig G : P Q as follows. Let a partitio m = b 1 + b b }{{ 1 + b } 2 + b b b }{{} s + b s b }{{} s d 1 times d 2 times d s times of m ito the sum of odd positive itegers be give, ad let there be exactly s distict summads. Every of d i s ca be writte i the form Now the partitio d i = 2 e i,1 + 2 e i, e i,t(i), e i,1 > e i,2 >... > e i,t(i). (2) s m = (2 e i,1 b i + 2 e i,2 b i e i,t(i) b i ) (3) i=1 cosists of distict summads. Ideed, for the same i, the summads are distict sice e i,j are distict, ad for distict i, the maximum odd divisors are distict. Let G map every partitio of the kid (1) to the partitio of the kid (3). Observe that if we apply G to a partitio of the kid (1) ad the apply F to the obtaied partitio, the we get the iitial partitio. Sice the form (2) is uiquely determied, F maps differet partitios of m ito the sum of distict positive itegers ito differet partitios of m ito the sum of odd positive itegers. It follows that F ad G are bijectios ad P = Q. Part of the obtaied results is summarized i the followig table. All Ijective Surjective Bijective mappigs mappigs mappigs mappigs X Y m [] m!s(m, )! (1) X Y ( ) ( ) ( ) +m 1 m 1 m m 1 1 X Ỹ X Ỹ S(m, k) 0, if m > S(m, ) 1 1, if m P (m, k) 0, if m > P (m, ) 1 1, if m 4
5 2 Catala s umbers The Catala s umbers {c } =0 are defied as follows: c 0 = 1 ad for every > 0, c := c 0 c 1 + c 1 c c 1 c 0. (4) The sequece begis: 1, 1, 2, 5, 14, 42, 132, 429,... Example 1. A plaar rooted tree is a tree with a special vertex (called the root ) where the sos of every vertex are liearly ordered. To every plaar rooted tree T with the root r, we ca correspod the pair (T 1, T 2 ) obtaied from T by deletig the edge (r, s) coectig r with the oldest so s. We assume that T 1 cotais r, ad T 2 cotais s. It is ot hard to check that this is a 11 correspodece. Hece, for the umber t of plaar rooted trees with edges, we have t 0 = 1 ad for every > 0, t := t 0 t 1 + t 1 t t 1 t 0. I other words, t = c for every. Example 2. Let a plaar rooted tree T be placed with root up o the plae ad so that the sos of every vertex are placed from left to right i their order. The the walk aroud this tree startig from the edge rs ad leavig the tree o the left had all the time correspods to a sequece of 1s ad 1s as follows: whe we come from a father to a so, we put 1, otherwise, we put 1. We will get a sequece of oes ad miusoes, where for every 1 i 2, the sum of the first i etries is oegative. Clearly, every sequece with these properties correspods to plaar rooted tree with edges, ad this correspodece is 11. It follows that the umber p of such sequeces is also c. To calculate c, write p i the form p = w v, where w is the umber of all sequeces with oes ad miusoes, ad v is the umber of sequeces (a 1,..., a 2 ) of oes ad miusoes such that i : a a i 1. (5) Clearly, w = ( ) 2. I order to evaluate v, we correspod to every sequece A = {a j } 2 j=1 i the family V of sequeces of oes ad miusoes satisfyig (5), the sequece F (A) of + 1 oes ad 1 miusoes as follows. Let i(a) be the smallest positive iteger i, such that a a i = 1. The we get F (A) by chagig i A the sigs of the first i(a) members. Oe ca observe (please, try it) that so defied F is a 11 correspodece betwee V ad the set Z of all sequeces of + 1 oes ad 1 miusoes. Cosequetly, V = Z = ( 2 1 ) c = p = ( ) ( ) 2 2 = ( 2. ) ad thus Now we will derive this formula agai usig the geeratig fuctio C(t) of these umbers which we will fid by the defiitio (4): C(t) = c t = 1 + (c 0 c c 1 c 0 )t = =0 =1 5
6 = 1 + t (c 0 c c c 0 )t = 1 + t(c(t)) 2. =0 Solvig the quadratic with respect to C(t), we obtai C(t) = 1 ± 1 4t. 2t Sice we kow that C(0) = 1, we must take the mius i the formula. Let us calculate the th derivative of 1 4t: d dt 1 4t = ( ) 1/2!(1 4t) 1/2 ( 4) = 2 ( 1)(2 3)!!(1 4t) 1/2. Hece ad Observe that 1 1 4t = C(t) = 2 (2 1)!! ( + 1)! =0 =1 2 (2 3)!! t! 2 (2 1)!! t. ( + 1)! = (2)!!( + 1)! = 1 ( )
{{1}, {2, 4}, {3}} {{1, 3, 4}, {2}} {{1}, {2}, {3, 4}} 5.4 Stirling Numbers
. Stirlig Numbers Whe coutig various types of fuctios from., we quicly discovered that eumeratig the umber of oto fuctios was a difficult problem. For a domai of five elemets ad a rage of four elemets,
More informationChapter Suppose you wish to use the Principle of Mathematical Induction to prove that 1 1! + 2 2! + 3 3! n n! = (n + 1)! 1 for all n 1.
Chapter 4. Suppose you wish to prove that the followig is true for all positive itegers by usig the Priciple of Mathematical Iductio: + 3 + 5 +... + ( ) =. (a) Write P() (b) Write P(7) (c) Write P(73)
More informationCS103X: 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 sixfigure salaries i whole dollar amouts are there that cotai at least
More informationrepresented by 4! different arrangements of boxes, divide by 4! to get ways
Problem Set #6 solutios A juggler colors idetical jugglig balls red, white, ad blue (a I how may ways ca this be doe if each color is used at least oce? Let us preemptively color oe ball i each color,
More informationMath 475, Problem Set #6: Solutions
Math 475, Problem Set #6: Solutios A (a) For each poit (a, b) with a, b oegative itegers satisfyig ab 8, cout the paths from (0,0) to (a, b) where the legal steps from (i, j) are to (i 2, j), (i, j 2),
More informationMath Discrete Math Combinatorics MULTIPLICATION PRINCIPLE:
Math 355  Discrete Math 4.14.4 Combiatorics Notes MULTIPLICATION PRINCIPLE: If there m ways to do somethig ad ways to do aother thig the there are m ways to do both. I the laguage of set theory: Let
More informationIn nite Sequences. Dr. Philippe B. Laval Kennesaw State University. October 9, 2008
I ite Sequeces Dr. Philippe B. Laval Keesaw State Uiversity October 9, 2008 Abstract This had out is a itroductio to i ite sequeces. mai de itios ad presets some elemetary results. It gives the I ite Sequeces
More information1 The Binomial Theorem: Another Approach
The Biomial Theorem: Aother Approach Pascal s Triagle I class (ad i our text we saw that, for iteger, the biomial theorem ca be stated (a + b = c a + c a b + c a b + + c ab + c b, where the coefficiets
More informationSAMPLE 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 informationWinter Camp 2012 Sequences Alexander Remorov. Sequences. Alexander Remorov
Witer Camp 202 Sequeces Alexader Remorov Sequeces Alexader Remorov alexaderrem@gmail.com Warmup Problem : Give a positive iteger, cosider a sequece of real umbers a 0, a,..., a defied as a 0 = 2 ad =
More informationFIBONACCI NUMBERS: AN APPLICATION OF LINEAR ALGEBRA. 1. Powers of a matrix
FIBONACCI NUMBERS: AN APPLICATION OF LINEAR ALGEBRA. Powers of a matrix We begi with a propositio which illustrates the usefuless of the diagoalizatio. Recall that a square matrix A is diogaalizable if
More informationChapter 7. In the questions below, describe each sequence recursively. Include initial conditions and assume that the sequences begin with a 1.
Use the followig to aswer questios 6: Chapter 7 I the questios below, describe each sequece recursively Iclude iitial coditios ad assume that the sequeces begi with a a = 5 As: a = 5a,a = 5 The Fiboacci
More informationChapter 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 informationThe Field of Complex Numbers
The Field of Complex Numbers S. F. Ellermeyer The costructio of the system of complex umbers begis by appedig to the system of real umbers a umber which we call i with the property that i = 1. (Note that
More informationLecture 7: Borel Sets and Lebesgue Measure
EE50: Probability Foudatios for Electrical Egieers JulyNovember 205 Lecture 7: Borel Sets ad Lebesgue Measure Lecturer: Dr. Krisha Jagaatha Scribes: Ravi Kolla, Aseem Sharma, Vishakh Hegde I this lecture,
More informationSum 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
More informationHomework 1 Solutions
Homewor 1 Solutios Math 171, Sprig 2010 Please sed correctios to herya@math.staford.edu 2.2. Let h : X Y, g : Y Z, ad f : Z W. Prove that (f g h = f (g h. Solutio. Let x X. Note that ((f g h(x = (f g(h(x
More informationSoving Recurrence Relations
Sovig Recurrece Relatios Part 1. Homogeeous liear 2d degree relatios with costat coefficiets. Cosider the recurrece relatio ( ) T () + at ( 1) + bt ( 2) = 0 This is called a homogeeous liear 2d degree
More informationORDERS OF GROWTH KEITH CONRAD
ORDERS OF GROWTH KEITH CONRAD Itroductio Gaiig a ituitive feel for the relative growth of fuctios is importat if you really wat to uderstad their behavior It also helps you better grasp topics i calculus
More informationOur aim is to show that under reasonable assumptions a given 2πperiodic function f can be represented as convergent series
8 Fourier Series Our aim is to show that uder reasoable assumptios a give periodic fuctio f ca be represeted as coverget series f(x) = a + (a cos x + b si x). (8.) By defiitio, the covergece of the series
More informationDepartment of Computer Science, University of Otago
Departmet of Computer Sciece, Uiversity of Otago Techical Report OUCS200609 Permutatios Cotaiig May Patters Authors: M.H. Albert Departmet of Computer Sciece, Uiversity of Otago Micah Colema, Rya Fly
More informationif A S, then X \ A S, and if (A n ) n is a sequence of sets in S, then n A n S,
Lecture 5: Borel Sets Topologically, the Borel sets i a topological space are the σalgebra geerated by the ope sets. Oe ca build up the Borel sets from the ope sets by iteratig the operatios of complemetatio
More informationTrigonometric Form of a Complex Number. The Complex Plane. axis. ( 2, 1) or 2 i FIGURE 6.44. The absolute value of the complex number z a bi is
0_0605.qxd /5/05 0:45 AM Page 470 470 Chapter 6 Additioal Topics i Trigoometry 6.5 Trigoometric Form of a Complex Number What you should lear Plot complex umbers i the complex plae ad fid absolute values
More informationPermutations, 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 information8.5 Alternating infinite series
65 8.5 Alteratig ifiite series I the previous two sectios we cosidered oly series with positive terms. I this sectio we cosider series with both positive ad egative terms which alterate: positive, egative,
More information8.3 POLAR FORM AND DEMOIVRE S THEOREM
SECTION 8. POLAR FORM AND DEMOIVRE S THEOREM 48 8. POLAR FORM AND DEMOIVRE S THEOREM Figure 8.6 (a, b) b r a 0 θ Complex Number: a + bi Rectagular Form: (a, b) Polar Form: (r, θ) At this poit you ca add,
More informationwhen n = 1, 2, 3, 4, 5, 6, This list represents the amount of dollars you have after n days. Note: The use of is read as and so on.
Geometric eries Before we defie what is meat by a series, we eed to itroduce a related topic, that of sequeces. Formally, a sequece is a fuctio that computes a ordered list. uppose that o day 1, you have
More informationLinear Algebra II. 4 Determinants. Notes 4 1st November Definition of determinant
MTH6140 Liear Algebra II Notes 4 1st November 2010 4 Determiats The determiat is a fuctio defied o square matrices; its value is a scalar. It has some very importat properties: perhaps most importat is
More informationRiemann Sums y = f (x)
Riema Sums Recall that we have previously discussed the area problem I its simplest form we ca state it this way: The Area Problem Let f be a cotiuous, oegative fuctio o the closed iterval [a, b] Fid
More information2.7 Sequences, Sequences of Sets
2.7. SEQUENCES, SEQUENCES OF SETS 67 2.7 Sequeces, Sequeces of Sets 2.7.1 Sequeces Defiitio 190 (sequece Let S be some set. 1. A sequece i S is a fuctio f : K S where K = { N : 0 for some 0 N}. 2. For
More information1.3 Binomial Coefficients
18 CHAPTER 1. COUNTING 1. Biomial Coefficiets I this sectio, we will explore various properties of biomial coefficiets. Pascal s Triagle Table 1 cotais the values of the biomial coefficiets ( ) for 0to
More informationThe Euler Totient, the Möbius and the Divisor Functions
The Euler Totiet, the Möbius ad the Divisor Fuctios Rosica Dieva July 29, 2005 Mout Holyoke College South Hadley, MA 01075 1 Ackowledgemets This work was supported by the Mout Holyoke College fellowship
More informationInfinite Sequences and Series
CHAPTER 4 Ifiite Sequeces ad Series 4.1. Sequeces A sequece is a ifiite ordered list of umbers, for example the sequece of odd positive itegers: 1, 3, 5, 7, 9, 11, 13, 15, 17, 19, 21, 23, 25, 27, 29...
More informationChapter Gaussian Elimination
Chapter 04.06 Gaussia Elimiatio After readig this chapter, you should be able to:. solve a set of simultaeous liear equatios usig Naïve Gauss elimiatio,. lear the pitfalls of the Naïve Gauss elimiatio
More information4.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
More informationModule 4: Mathematical Induction
Module 4: Mathematical Iductio Theme 1: Priciple of Mathematical Iductio Mathematical iductio is used to prove statemets about atural umbers. As studets may remember, we ca write such a statemet as a predicate
More information4 n. n 1. You shold think of the Ratio Test as a generalization of the Geometric Series Test. For example, if a n ar n is a geometric sequence then
SECTION 2.6 THE RATIO TEST 79 2.6. THE RATIO TEST We ow kow how to hadle series which we ca itegrate (the Itegral Test), ad series which are similar to geometric or pseries (the Compariso Test), but of
More informationReview for College Algebra Final Exam
Review for College Algebra Fial Exam (Please remember that half of the fial exam will cover chapters 14. This review sheet covers oly the ew material, from chapters 5 ad 7.) 5.1 Systems of equatios i
More information8 The Poisson Distribution
8 The Poisso Distributio Let X biomial, p ). Recall that this meas that X has pmf ) p,p k) p k k p ) k for k 0,,...,. ) Agai, thik of X as the umber of successes i a series of idepedet experimets, each
More informationSection 11.3: The Integral Test
Sectio.3: The Itegral Test Most of the series we have looked at have either diverged or have coverged ad we have bee able to fid what they coverge to. I geeral however, the problem is much more difficult
More informationLinear Algebra II. Notes 6 25th November 2010
MTH6140 Liear Algebra II Notes 6 25th November 2010 6 Quadratic forms A lot of applicatios of mathematics ivolve dealig with quadratic forms: you meet them i statistics (aalysis of variace) ad mechaics
More informationDistributions 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
More informationLecture 17 TwoWay Finite Automata
This is page 9 Priter: Opaque this Lecture 7 TwoWay Fiite Automata Twoway fiite automata are similar to the machies we have bee studyig, except that they ca read the iput strig i either directio. We
More informationMATH /2003. Assignment 4. Due January 8, 2003 Late penalty: 5% for each school day.
MATH 260 2002/2003 Assigmet 4 Due Jauary 8, 2003 Late pealty: 5% for each school day. 1. 4.6 #10. A croissat shop has plai croissats, cherry croissats, chocolate croissats, almod croissats, apple croissats
More information5 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 information1. MATHEMATICAL INDUCTION
1. MATHEMATICAL INDUCTION EXAMPLE 1: Prove that for ay iteger 1. Proof: 1 + 2 + 3 +... + ( + 1 2 (1.1 STEP 1: For 1 (1.1 is true, sice 1 1(1 + 1. 2 STEP 2: Suppose (1.1 is true for some k 1, that is 1
More informationARITHMETIC AND GEOMETRIC PROGRESSIONS
Arithmetic Ad Geometric Progressios Sequeces Ad ARITHMETIC AND GEOMETRIC PROGRESSIONS Successio of umbers of which oe umber is desigated as the first, other as the secod, aother as the third ad so o gives
More informationSection IV.5: Recurrence Relations from Algorithms
Sectio IV.5: Recurrece Relatios from Algorithms Give a recursive algorithm with iput size, we wish to fid a Θ (best big O) estimate for its ru time T() either by obtaiig a explicit formula for T() or by
More informationSUMS OF GENERALIZED HARMONIC SERIES. Michael E. Ho man Department of Mathematics, U. S. Naval Academy, Annapolis, Maryland
#A46 INTEGERS 4 (204) SUMS OF GENERALIZED HARMONIC SERIES Michael E. Ho ma Departmet of Mathematics, U. S. Naval Academy, Aapolis, Marylad meh@usa.edu Courtey Moe Departmet of Mathematics, U. S. Naval
More informationMa/CS 6b Class 17: Extremal Graph Theory
//06 Ma/CS 6b Class 7: Extremal Graph Theory Paul Turá By Adam Sheffer Extremal Graph Theory The subfield of extremal graph theory deals with questios of the form: What is the maximum umber of edges that
More informationSolving DivideandConquer Recurrences
Solvig DivideadCoquer Recurreces Victor Adamchik A divideadcoquer algorithm cosists of three steps: dividig a problem ito smaller subproblems solvig (recursively) each subproblem the combiig solutios
More informationNotes 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 informationTo get the next Fibonacci number, you add the previous two. numbers are defined by the recursive formula. F 1 F n+1
Liear Algebra Notes Chapter 6 FIBONACCI NUMBERS The Fiboacci umbers are F, F, F 2, F 3 2, F 4 3, F, F 6 8, To get the ext Fiboacci umber, you add the previous two umbers are defied by the recursive formula
More informationS. Tanny MAT 344 Spring 1999. be the minimum number of moves required.
S. Tay MAT 344 Sprig 999 Recurrece Relatios Tower of Haoi Let T be the miimum umber of moves required. T 0 = 0, T = 7 Iitial Coditios * T = T + $ T is a sequece (f. o itegers). Solve for T? * is a recurrece,
More informationSequences and Series
CHAPTER 9 Sequeces ad Series 9.. Covergece: Defiitio ad Examples Sequeces The purpose of this chapter is to itroduce a particular way of geeratig algorithms for fidig the values of fuctios defied by their
More informationBinet Formulas for Recursive Integer Sequences
Biet Formulas for Recursive Iteger Sequeces Homer W. Austi Jatha W. Austi Abstract May iteger sequeces are recursive sequeces ad ca be defied either recursively or explicitly by use of Biettype formulas.
More informationChapter 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
More informationDefinition. A variable X that takes on values X 1, X 2, X 3,...X k with respective frequencies f 1, f 2, f 3,...f k has mean
1 Social Studies 201 October 13, 2004 Note: The examples i these otes may be differet tha used i class. However, the examples are similar ad the methods used are idetical to what was preseted i class.
More informationContinued Fractions continued. 3. Best rational approximations
Cotiued Fractios cotiued 3. Best ratioal approximatios We hear so much about π beig approximated by 22/7 because o other ratioal umber with deomiator < 7 is closer to π. Evetually 22/7 is defeated by 333/06
More informationYour 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 informationApproximating Area under a curve with rectangles. To find the area under a curve we approximate the area using rectangles and then use limits to find
1.8 Approximatig Area uder a curve with rectagles 1.6 To fid the area uder a curve we approximate the area usig rectagles ad the use limits to fid 1.4 the area. Example 1 Suppose we wat to estimate 1.
More informationMATH 361 Homework 9. Royden Royden Royden
MATH 61 Homework 9 Royde..9 First, we show that for ay subset E of the real umbers, E c + y = E + y) c traslatig the complemet is equivalet to the complemet of the traslated set). Without loss of geerality,
More informationSolutions 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 informationPage 2 of 14 = T(2) + 2 = [ T(3)+1 ] + 2 Substitute T(3)+1 for T(2) = T(3) + 3 = [ T(4)+1 ] + 3 Substitute T(4)+1 for T(3) = T(4) + 4 After i
Page 1 of 14 Search C455 Chapter 4  Recursio Tree Documet last modified: 02/09/2012 18:42:34 Uses: Use recursio tree to determie a good asymptotic boud o the recurrece T() = Sum the costs withi each level
More informationTILE PATTERNS & GRAPHING
TILE PATTERNS & GRAPHING LESSON 1 THE BIG IDEA Tile patters provide a meaigful cotext i which to geerate equivalet algebraic expressios ad develop uderstadig of the cocept of a variable. Such patters are
More informationHW 1 Solutions Math 115, Winter 2009, Prof. Yitzhak Katznelson
HW Solutios Math 5, Witer 2009, Prof. Yitzhak Katzelso.: Prove 2 + 2 2 +... + 2 = ( + )(2 + ) for all atural umbers. The proof is by iductio. Call the th propositio P. The basis for iductio P is the statemet
More informationNUMBERS COMMON TO TWO POLYGONAL SEQUENCES
NUMBERS COMMON TO TWO POLYGONAL SEQUENCES DIANNE SMITH LUCAS Chia Lake, Califoria a iteger, The polygoal sequece (or sequeces of polygoal umbers) of order r (where r is r > 3) may be defied recursively
More information1 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 informationThe Field Q of Rational Numbers
Chapter 3 The Field Q of Ratioal Numbers I this chapter we are goig to costruct the ratioal umber from the itegers. Historically, the positive ratioal umbers came first: the Babyloias, Egyptias ad Grees
More informationAdvanced Probability Theory
Advaced Probability Theory Math5411 HKUST Kai Che (Istructor) Chapter 1. Law of Large Numbers 1.1. σalgebra, measure, probability space ad radom variables. This sectio lays the ecessary rigorous foudatio
More informationON MINIMAL COLLECTIONS OF INDEXES. Egor A. Timoshenko
ON MINIMAL COLLECTIONS OF INDEXES Egor A. Timosheko We deote s [ +1 ], l [ ], M C s C; l idexes built for the case of colums (i.e., ordered subsets of the set {1,,..., }) will be called idexes. The legth
More informationMeasurable Functions
Measurable Fuctios Dug Le 1 1 Defiitio It is ecessary to determie the class of fuctios that will be cosidered for the Lebesgue itegratio. We wat to guaratee that the sets which arise whe workig with these
More information4. 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 informationDiscrete 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 informationLecture 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 information1 Set Theory and Functions
Set Theory ad Fuctios. Basic De itios ad Notatio A set A is a collectio of objects of ay kid. We write a A to idicate that a is a elemet of A: We express this as a is cotaied i A. We write A B if every
More informationTheorems 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 oegative umber R, called the radius
More informationChapter Eleven. Taylor Series. (x a) k. c k. k= 0
Chapter Eleve Taylor Series 111 Power Series Now that we are kowledgeable about series, we ca retur to the problem of ivestigatig the approximatio of fuctios by Taylor polyomials of higher ad higher degree
More informationAsymptotic 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 information3. 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 informationCOMP 251 Assignment 2 Solutions
COMP 251 Assigmet 2 Solutios Questio 1 Exercise 8.34 Treat the umbers as 2digit umbers i radix. Each digit rages from 0 to 1. Sort these 2digit umbers ith the RADIXSORT algorithm preseted i Sectio
More informationLesson 12. Sequences and Series
Retur to List of Lessos Lesso. Sequeces ad Series A ifiite sequece { a, a, a,... a,...} ca be thought of as a list of umbers writte i defiite order ad certai patter. It is usually deoted by { a } =, or
More informationCooleyTukey. Tukey FFT Algorithms. FFT Algorithms. Cooley
Cooley CooleyTuey Tuey FFT Algorithms FFT Algorithms Cosider a legth sequece x[ with a poit DFT X[ where Represet the idices ad as +, +, Cooley CooleyTuey Tuey FFT Algorithms FFT Algorithms Usig these
More informationSolutions to Exercises Chapter 3: Subsets, partitions, permutations
Solutios to Exercises Chapter 3: Subsets, partitios, permutatios 1 A restaurat ear Vacouver offered Dutch pacaes with a thousad ad oe combiatios of toppigs. What do you coclude? Sice 1001 ( 14 4, it is
More informationFigure 40.1. Figure 40.2
40 Regular Polygos Covex ad Cocave Shapes A plae figure is said to be covex if every lie segmet draw betwee ay two poits iside the figure lies etirely iside the figure. A figure that is ot covex is called
More information+ 1= x + 1. These 4 elements form a field.
Itroductio to fiite fields II Fiite field of p elemets F Because we are iterested i doig computer thigs it would be useful for us to costruct fields havig elemets. Let s costruct a field of elemets; we
More information1. a n = 2. a n = 3. a n = 4. a n = 5. a n = 6. a n =
Versio PREVIEW Homework Berg (5860 This pritout should have 9 questios. Multiplechoice questios may cotiue o the ext colum or page fid all choices before aswerig. CalCb0b 00 0.0 poits Rewrite the fiite
More informationCombinatorics II. Combinatorics. Product Rule. Sum Rule II. Theorem (Product Rule) Theorem (Sum Rule)
Combiatorics Combiatorics I Slides by Christopher M. Bourke Istructor: Berthe Y. Choueiry Sprig 26 Computer Sciece & Egieerig 235 to Discrete Mathematics Sectios 4.4.6 & 6.56.6 of Rose cse235@cse.ul.edu
More informationFast evaluation and interpolation
Caregie Mello Uiversity Research Showcase @ CMU Computer Sciece Departmet School of Computer Sciece 1973 Fast evaluatio ad iterpolatio H. T. Kug Caregie Mello Uiversity Follow this ad additioal works at:
More informationTHE 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 information0.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 KolmogorovSmirov 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 informationLecture 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 BruMikowski iequality for boxes. Today we ll go over the
More information8.1 Arithmetic Sequences
MCR3U Uit 8: Sequeces & Series Page 1 of 1 8.1 Arithmetic Sequeces Defiitio: A sequece is a comma separated list of ordered terms that follow a patter. Examples: 1, 2, 3, 4, 5 : a sequece of the first
More informationWHEN 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 informationLecture 10: Ray Tracing and Constructive Solid Geometry. Interactive Computer Graphics. Ray tracing with secondary rays. Ray tracing: Shadows
Iteractive Computer Graphics Lecture 10: Ray Tracig ad Costructive Solid Geometry Ray tracig with secodary rays Ray tracig usig just primary rays produces images similar to ormal polygo rederig techiques
More informationLecture 4: Cauchy sequences, BolzanoWeierstrass, and the Squeeze theorem
Lecture 4: Cauchy sequeces, BolzaoWeierstrass, 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
More informationLecture 4: Cheeger s Inequality
Spectral Graph Theory ad Applicatios WS 0/0 Lecture 4: Cheeger s Iequality Lecturer: Thomas Sauerwald & He Su Statemet of Cheeger s Iequality I this lecture we assume for simplicity that G is a dregular
More informationYour grandmother and her financial counselor
Sectio 10. Arithmetic Sequeces 963 Objectives Sectio 10. Fid the commo differece for a arithmetic sequece. Write s of a arithmetic sequece. Use the formula for the geeral of a arithmetic sequece. Use the
More informationREACHABILITY AND OBSERVABILITY
Updated: Saturday October 4 8 Copyright F.L. Lewis ll rights reserved RECHILIY ND OSERVILIY Cosider a liear statespace system give by x x + u y Cx + Du m with x t R the iteral state u t R the cotrol iput
More information