FLOOR AND ROOF FUNCTION ANALOGS OF THE BELL NUMBERS. H. W. Gould Department of Mathematics, West Virginia University, Morgantown, WV 26506, USA
|
|
- Irene Merritt
- 5 years ago
- Views:
Transcription
1 INTEGERS: ELECTRONIC JOURNAL OF COMBINATORIAL NUMBER THEORY 7 (2007), #A58 FLOOR AND ROOF FUNCTION ANALOGS OF THE BELL NUMBERS H. W. Gould Departmet of Mathematics, West Virgiia Uiversity, Morgatow, WV 26506, USA gould@math.wvu.edu Jocely Quaitace Departmet of Mathematics, West Virgiia Uiversity, Morgatow, WV 26506, USA jquaita@math.wvu.edu Received: 9/1/07, Revised: 11/12/07, Accepted: 12/6/07, Published: 12/20/07 Abstract Defie {}, the floor sequece, by the liear recurrece f( + 1) = f(), f(1) = 1. Similarly, defie {g()}, the roof sequece, by the liear recurrece g( + 1) = g(), g(1) = 1. This paper studies various properties of these two sequeces, icludig prime criteria, asymptotic approximatios of { f(+1) } ad { g(+1) g(), ad the iteratio coefficiets associated with f( + r) ad g( + r), for ay r 1. } 1. Itroductio The Bell umbers may be defied by the liear recurrece B( + 1) = ( =0 ) B(), (1.1) with the iitial coditio that B(0) = 1. These umbers, 1, 1, 2, 5, 15, 52, 203, 877, 4140, 21147,... have bee extesively studied i [2]. They may also be defied by the expoetial geeratig
2 INTEGERS:ELECTRONIC JOURNAL OF COMBINATORIAL NUMBER THEORY 7 (2007), #A58 2 fuctio =0 B() t! = exp(et 1). (1.2) I [7], we studied the followig geeralizatio of Equatio (1.1). Let {h()} =0 be the sequece defied by the liear differece equatio ( ) h( + 1) = h(), (1.3) =0 where h(0) = a ad h(1) = b. Note, if h(0) = 1 ad h(1) = 1, Equatio (1.3) becomes (1.1). Through successive iteratios of (1.3), we were able to show that h( + r) = r 1 ( + j h() A r j() j=0 where the A r j() are polyomials i that satisfy A r+1 j () = r j 1 i=0 ( + r i ), r 1, 1, (1.4) ) A r i j (). (1.5) Oe reaso the A r j() are importat is that they provide a ew partitio of the Bell umbers which is remiiscet of the formula B() = S(, ). (1.6) I Equatio (1.6), S(, ) is the appropriate Stirlig umber of the secod id. I particular, we have show that [7] =0 1 B() = A j (0) (1.7) j=0 B() = A +1 0 ( 1). (1.8) ( ) Whe aalyzig the proof of Equatio (1.4), we realized that the i (1.3) ca be ( ) replaced by A(, ), where A(, ) is a arbitrary fuctio of [3]. Because is closely related to by the relatio [1] ( ) we thought it would be atural to let A(, ) =. mod, (1.9)
3 INTEGERS:ELECTRONIC JOURNAL OF COMBINATORIAL NUMBER THEORY 7 (2007), #A58 3 Thus, we decided to study two particular fuctios. aalog of (1.1), is defied by f( + 1) = f() = The first fuctio, a floor fuctio f(d), (1.10) with the iitial coditio of f(1) = 1. The so geerated, 1, 1, 3, 7, 16, 33, 71, 143, 295, 594, 1206, 2413, 4871, 9743, 19559,..., evidetly have ot bee studied i the literature ad were ot foud i the Olie Ecyclopedia of Iteger Sequeces (OEIS). We will call the {} the floor sequece. We also defie a roof fuctio aalog of (1.1), amely j=1 d j g( + 1) = g(), (1.11) with the iitial coditio that g(1) = 1. Recall that deotes the least iteger greater tha or equal to. The g() so geerated by 1, 1, 3, 8, 20, 50, 121, 297, 716, 1739, 4198, 10157,... behave somewhat differetly tha the. They also were ot foud i the OEIS. We call {g()} the roof sequece. Because x = x, there are iterestig relatioships betwee floor ad roof. Note that give positive itegers ad, it is easy to verify that = = + 1. (1.12) Equatio (1.12) allows us to form a alterative recurrece formula for the roof sequece, amely g( + 1) = 1 1 g() + g(), 2. (1.13) If we adopt the covetio that the secod sum o the right is vacuous whe = 1, Relatio (1.13) is true for 1. This paper has four mai sectios. I Sectio 2, we prove prime criteria for the floor sequece ad the roof sequece. These criteria are remiiscet of the prime criteria discussed i [4] ad [5]. I Sectio 3, we discuss the asymptotic ature of ad g(). I Sectio 4, we aalyze the ordiary geeratig fuctios associated with ad g(). Fially, i Sectio 5, we give formulas that relate f( + r) ad g( + r) bac to ad g(). These iteratio formulas are similar to Equatios (1.3) ad (1.4).
4 INTEGERS:ELECTRONIC JOURNAL OF COMBINATORIAL NUMBER THEORY 7 (2007), #A Prime Number Criteria for the Floor ad Roof Sequeces For the floor sequece defied by (1.10), we state a useful prime umber criterio. The proof of this criterio uses the followig lemma. Lemma 2.1 Let be as defied by (1.10). The, for 2, f( + 1) = d f(d) (2.1) Proof of Lemma 2.1. We have f( + 1) = = 1 f() ( 1 = d f(d). 1 ) f() f() The last equality follows because 1 = { 1, if ; 0, if. Remar 2.1 Lemma 2.1 is a alterative recurrece that shows how to calculate f( + 1) from. Theorem 2.1 (Prime umber criterio for the floor sequece) Let be the fuctio defied by Equatio (1.10). The is prime if ad oly if f( + 1) = (2.2) Proof of Theorem 2.1. Whe is prime, the oly divisors of are itself ad 1. Thus, Equatio (2.1) implies f( + 1) = d f(d) = f(1) +, which is simply Equatio (2.2) restated. O the other had, if is ot prime the at least oe of the positive summads o the right side of Equatio (2.1), other tha d = 1 ad d =, is o-zero. This meas that Equatio (2.2) could ot hold.
5 INTEGERS:ELECTRONIC JOURNAL OF COMBINATORIAL NUMBER THEORY 7 (2007), #A58 5 Remar 2.2 Relatios (2.1) ad (2.2) show that the sequece defied by icreases somewhat faster tha 2 1 for 6. We ow tur to the roof sequece, amely g() defied by (1.11), ad fid the correspodig versios of Lemma 2.1 ad Theorem 2.2. Lemma 2.2 Let g() be as defied by (1.11). The, for 2, g( + 1) = 2g() + g(d) (2.3) d ( 1) Proof of Lemma 2.2. We have g( + 1) g() = The last equality follows because 1 g() 1 g() 1 ( ) 1 = g() + g() = g() + g(d) 1 = d ( 1) { 1, if ( 1); 0, if ( 1). We o loger detect a simple prime criterio for the roof sequece. We shall be cotet with just the followig theorem, whose proof follows directly from Lemma 2.2. Theorem 2.2 (Prime umber criterio for roof sequece) Let g() be the fuctio defied by Equatio (1.11). The 1 is prime if ad oly if g( + 1) = 2g() + g( 1) + 1. (2.4) Remar 2.3 We see from Relatios (2.3) ad (2.4) that g() icreases cosiderably faster tha 2 1 for 5.
6 INTEGERS:ELECTRONIC JOURNAL OF COMBINATORIAL NUMBER THEORY 7 (2007), #A Growth Estimates for ad g() Usig a Third Sequece We defie a fractio aalog h() of (1.10) ad (1.11) by h( + 1) = h(), (3.1) with the iitial coditio that h(1) = 1. Sice we are worig with all positive umbers, the, (3.2) The first few values of the h sequece are 1, 1, 3, 7.5, 17.5, , , , ad Theorem 3.1 (Recurrece relatio for h()) For all 2, Proof of Theorem 3.1. By (3.1), we have h( + 1) = 2 1 h(). (3.3) 1 h( + 1) = 1 h() = h() + h() = h() h() = h() + 1 h() = h(), which is precisely (3.3). From (3.3), we have immediately obtai h(+1) h() = 2 1, givig us the followig result. 1 { } Theorem 3.2 (Limit of h(+1) ) The sequece h(+1) h() h() =3 approaches 2 as. is a decreasig sequece that Applyig (3.3) iteratively leads to the explicit formula give i the ext theorem. Theorem 3.3 (Explicit formula for h()) For all 0, h( + 2) = (2+2)!!(+1)!2 +1.
7 INTEGERS:ELECTRONIC JOURNAL OF COMBINATORIAL NUMBER THEORY 7 (2007), #A58 7 Remar 3.1 Substitutig (3.4) bac ito (3.1) gives the biomial idetity + =2 (2 2)! ( 2)!( 1)!2 = (2)! 1 ( 1)!!2 for 2. This may be restated i biomial coefficiet form as =2 ( 2 2 ) ( = ) 2 (3.4) for 2, ad does ot appear i [8]. The idetity may be proved quicly by iductio. It is a routie calculatio with the biomial series to use (3.4) to establish the followig geeratig fuctio result. Theorem 3.4 (Geeratig fuctio for h()) h( + 1)x = x. (3.5) (1 2x) 3 2 Remar 3.2 I aalogy to (3.1), (3.2), ad (3.3), it is ot difficult to use the biomial expasio (4.1) to obtai a geeratig fuctio for. = x = 1 1 x + x (1 x). (3.6) 2 From these results, ad umerical tables, we are led to the followig result. Theorem 3.5 (Bouds for ratios of successive terms) For all 4, the sequeces f, h, ad g satisfy Moreover, for all for 4, we have < h() < g() (3.7) 2 < f( + 1) < h( + 1) h() < g( + 1). (3.8) g() Furthermore, lim f(+1) = 2 ad lim h(+1) h() = 2. Table 2 exhibits values of the ratios i Equatio (3.8) for = 1, 2,..., 24.
8 INTEGERS:ELECTRONIC JOURNAL OF COMBINATORIAL NUMBER THEORY 7 (2007), #A58 8 The followig 4 lemmas will prove Theorem 3.5. Lemma 3.1 Let, g(), ad h() be as previously defied. The, for 4, < h() < g(). Proof of Lemma 3.1. The proof will use mathematical iductio. For example, i order to show that < h(), we ote that f(4) = 7 < 7.5 = h(4). We ow assume the iductio hypothesis, i.e., for all iteger values greater tha 4 ad less the or equal to, < h(). Thus, f( + 1) = 1 f() = f(1) + f() + f(1) + 1 =2 1 < h(1) + =2 1 < h(1) + =2 =2 f() + f() + h() h() + h() = h( + 1). The iequality betwee the first ad secod lies comes from (3.2), while the other two iequalities are a result of the iductio hypothesis. The proof of h() < g() is similar ad will be omitted. Lemma 3.2 For 4, we have 2 < f(+1). Proof of Lemma 3.2. We wat to show f(+1) > = ; that is, we wat to show 1 1 f( + 1) 2 1 > 1 1. (3.9) However, the calculatios of Theorem 2.1 imply, for 4, that f( + 1) 2 > 0. Thus, f( + 1) 2 = f( + 1) = f( + 1) > 0. The right had iequality is simply a restatemet of (3.10), which proves our claim. Lemma 3.3 For 4, we have f(+1) < h(+1) h().
9 INTEGERS:ELECTRONIC JOURNAL OF COMBINATORIAL NUMBER THEORY 7 (2007), #A58 9 Proof of Lemma 3.3. Table 2 shows, for 4 < 15, that f(+1) 15. By Equatio (3.3), it is sufficiet to show f(+1) show < h(+1). So we ow assume h() < 0, i.e., it is sufficiet to f( + 1) 2 < 1. (3.10) By Equatio (2.1), we ow f( + 1) 2 = 1 + d f(d). Thus, (3.11) becomes d 1, Sice the largest possible divisor i 1 + d d 1, We claim that ( 1) 1 + f(d) < = 1 1 d d 1, f(d) = d d [ 1 + ] d f(d) is 2, we have d 1, ( ) ( ) 2 f(d) f 1 f 1 = 2 2 d d i=1 f(). (3.11) ( ) f. 2 2 ( ) ( 1) f < f( 1), 15 (3.12) 2 2 The justificatio for (3.12) is as follows. First, rewrite Equatio (3.12) as By Remar 2.2, we ow ( 1) < 2 f( 1) f ( ). (3.13) f( 1) < f ( ), 12. (3.14) 2 The by a simple iductio argumet, it is easy to show, for 15, that ( 1) < f( 1) < 2 f ( ). 2 By combiig the previous calculatios, we have, for 15, ( 1) 1 + f(d) ( ) ( 1) 1 f < f( 1) 2 2 d d 1, which is Equatio (3.12). 1 =,
10 INTEGERS:ELECTRONIC JOURNAL OF COMBINATORIAL NUMBER THEORY 7 (2007), #A58 10 Remar 3.3 I the proof of Lemma 3.3, we showed that {} is a icreasig sequece. Remar 3.4 Usig Theorem 3.2, Lemma 3.2, Lemma 3.3, ad The Squeeze Theorem, we teds to the limit 2 as icreases idefiitely. f(+1) Lemma 3.4 For 4, we have h( + 1) h() < g( + 1). g() Proof of Lemma 3.4. The result is clearly true whe = 4. We ow assume > 4. Usig Theorem 3.2, it suffices to show that g(+1) > 2 1 i.e., it suffices to show g() 1 By (2.4), we ca rewrite (3.15) as g( + 1) g() > g() 1. (3.15) ( 1) d ( 1) g(d) > g(). (3.16) Clearly, ( 1) d ( 1) g(d) ( 1)g( 1). (3.17) Thus, we ow wat to show ( 1)g( 1) > g(). (3.18) I order to prove (3.18), ad thus fiish the proof of Lemma 3.4, we first ote that (3.18) is equivalet to i.e., 2 1 g( 1) g( 1) > g( 1) + g(), Thus, provig (3.18) is equivalet to provig 2 1 g( 1) > 2g( 1) + g() g() < ( 2) g(). (3.19)
11 INTEGERS:ELECTRONIC JOURNAL OF COMBINATORIAL NUMBER THEORY 7 (2007), #A58 11 A term-by-term compariso of the sums i (3.19) implies that we must show 1 2 < ( 2). (3.20) Note that 1 = Usig properties of the floor ad the fact that x = x, it is easy to show that for all real umbers a ad b, a+b a + b. Thus, the previous lie implies, sice 1 2, < ( 2), which is a restatemet of (3.20) Ope Questios By aalyzig the ratios i Table 2, we form the followig cojectures, whose proofs remai ope questios. Cojecture 3.1 The sequece Cojecture 3.2 The sequece of A plausibility argumet for the limit g(+1) g() = p beig a prime, we fid { } f(+1) alterately icreases the decreases to its limit. =4 { } g(+1) alterately icreases the decreases to the limit g() =4 g(p + 2) g(p + 1) = g(p+1) g(p) may ru as follows. From Equatio (2.4), with It is easy to show that g(p) is a icreasig sequece. Thus, if g(+1) g() to the equatio L = 2 + 1, from which we deduce that L = L Oe possible way to compute the limit of sequece for g(). I particular g( + 1) = 1 < 1 g() = 1 { g(+1) g() + } 1 g() + g() = =4 1 g(p + 1). (3.21) has limit L, we are led is to use (1.13) to obtai a boudig g() + 1 g() 1 + g() + g().
12 INTEGERS:ELECTRONIC JOURNAL OF COMBINATORIAL NUMBER THEORY 7 (2007), #A58 12 We may the defie a boudig sequece M() as follows: M( + 1) = M() + M(), (3.22) with iitial coditio that M(1) = 1. The, g() < M() for all 5. This sequece has the values 1, 1, 3, 8, 20.5, 51.5, 128, 316.1,... Lemma 3.5 (Limit of M(+1) ) If M() ad lim 1 M( + 2) M() = 0 (3.23) M( + 1) lim = L (3.24) M() exist, the L = Proof of Lemma 3.5. From (3.23), we have M( + 1) = 1 2 M() = Subtractig (3.25) from (3.26), we fid which the gives M( + 1) M() = This the yields the relatio M() + M(), (3.25) 1 M() + M(). (3.26) 2 M() M( + 1) = 2M() + M( 1) + 2 M() + M(), 2 M(). M( + 1) M() = M() M( 1) M() M(). (3.27) Therefore, if we assume the limit (3.24) exists ad that M(+1) M() that L = 2 + 1/L, which gives L = approaches a limit L, we fid
13 INTEGERS:ELECTRONIC JOURNAL OF COMBINATORIAL NUMBER THEORY 7 (2007), #A58 13 Remar 3.5 (The coverse of Lemma 3.5) We fid from (3.28) that if M( + 1)/M() approaches a limit L, ad if the limit i (3.24) is R, the R = L 2 1/L, from which we could compute L if we ew R. Thus, from Lemma 3.5, we see that the M() sequece would be useful if we could show that < g( + 1) g() < M( + 1). M() The, by the Squeeze Theorem, we would a have a proof of Cojecture Asymptotic Tables Table 1 below gives values for the four sequeces. Table 2 gives values of the ratios i (3.9) ad M(+1) M(). f h g M() Table 1: The Sequeces, h(), g(), ad M() for = 1, 2, 3,...24
14 INTEGERS:ELECTRONIC JOURNAL OF COMBINATORIAL NUMBER THEORY 7 (2007), #A58 14 f(+1) h(+1) h() g(+1) g() M(+1) M() Table 2: The Ratios f(+1), h(+1) h(), g(+1) g(), M(+1) M() for = 1, 2, 3, Geeratig Fuctios for the Floor ad Roof Sequeces Recall that a variatio of the biomial theorem ([1]) is ( ) x 1 =. (4.1) (1 x) +1 = The floor fuctio aalog of Equatio (4.1) ([1]) is = x = 1 (1 x)(1 x ), (4.2)
15 INTEGERS:ELECTRONIC JOURNAL OF COMBINATORIAL NUMBER THEORY 7 (2007), #A58 15 while the roof fuctio aalog of (4.1) is = x = 1 + x x (1 x)(1 x ). (4.3) Remar 4.1 The idea of studyig the floor sum i Equatio (1.10) is ot etirely ew. Relatio (4.2) was used i [6] to study the series trasform G() = F (), 1, (4.4) which has the iverse F () = d ( ) µ [G(d) G(d 1)], 1. (4.5) d What is ovel ow is whe, i Equatio (4.4), we mae G() = F (), Equatio (4.5) does ot hold. For the defied by (1.10), we defie the ordiary geeratig fuctio Usig (4.2), we fid t f( + 1) = t = 1 = 1 F (t) = t. (4.6) f() = f()t = t f()t = 1 f() + 1 f()(t r ) = 1 F (t r ). r=1 r=1 f() O the other had t f( + 1) = =2 t 1 = 1 t t 1 = 1 F (t) 1, t so that the geeratig fuctio for the floor sequece must satisfy the fuctioal equatio 1 t F (t) 1 = 1 F (t r ). (4.7) r=1
16 INTEGERS:ELECTRONIC JOURNAL OF COMBINATORIAL NUMBER THEORY 7 (2007), #A58 16 For the g() defied by (1.11), we defie the ordiary geeratig fuctio Equatio (4.3) implies t g( + 1) = O the other had, t = 1 = 1 G(t) = g()t. (4.8) g() = g()t = t + t + 2 g() g()t t g() + g()(t r ) = G(t) + t = G(t) + t r=1 G(t r ). r=1 t t g() t g( + 1) = =2 t 1 g() = 1 t t g() 1 = 1 G(t) 1. t Thus, the geeratig fuctio for the roof sequece must satisfy 1 2t t() G(t) 1 = t G(t r ). (4.9) r=1 5. Expasios Ivolvig f( + r) ad g( + r) I [3], we studied a class of fuctios, H, defied by the relatioship H( + 1) = A(, )H(), (5.1) =0 where A(, ) is a arbitrary fuctio of. I this situatio, we ca let A(, ) =, H(0) = 0, ad H(1) = 1 or A(, ) =, H(0) = 0, ad H(1) = 1. It is a easy exercise to restate Theorems 2.1 to 2.4 of [3] i the cotext of the floor fuctio ad the roof fuctio. These restatemets are recorded below as Corollaries 5.1 to 5.5 respectively.
17 INTEGERS:ELECTRONIC JOURNAL OF COMBINATORIAL NUMBER THEORY 7 (2007), #A58 17 Corollary 5.1 Let f be the fuctio defied by Equatio (1.10). Let g be the fuctio defied by Equatio (1.11). Let r be a positive iteger. There exist fuctios of, amely A r j() ad Cj r (), such that, f( + r) = g( + r) = r 1 + j f() A r j() j=0 r 1 + j g() Cj r () j=0 where A r j() ad C r j () satisfy the recurrece relatios r j 1 A r+1 j () = A r i j () i=0 r j 1 C r+1 j () = i=0 C r i j () + r + r i + r + r i, r 1, 1, (5.2), r 1, 1, (5.3), 0 j r 1, (5.4), 0 j r 1. (5.5) Note that A r r 1() = 1 ad A r j() = 0 if j < 0 or j > r 1. A similar statemet holds for the C r j (). Corollary 5.2 (The Shift Theorem of [3]) The A r j() (ad C r j ()) coefficiets satisfy the relatio A r+1 j+1 () = Ar j( + 1), j 1, r 0. (5.6) Corollary 5.3 r 1 j A r 1(0) = A r j(0), 0 < < r 1 (5.7) j= r 1 j C 1(0) r = Cj r (0), 0 < < r 1. (5.8) j= Corollary 5.4 (The Iversio Theorem for the Floor Fuctio) We have r 1 F (r) = A r j(0)g(j), r 1 (5.9) j=0 if ad oly if G(r) = F (r + 1) r j=1 r F (j), with G(0) = F (1). (5.10) j
18 INTEGERS:ELECTRONIC JOURNAL OF COMBINATORIAL NUMBER THEORY 7 (2007), #A58 18 Corollary 5.5 (The Iversio Theorem for the Roof Fuctio) We have r 1 F (r) = Cj r (0)G(j), r 1 (5.11) j=0 if ad oly if G(r) = F (r + 1) r j=1 r F (j), with G(0) = F (1). (5.12) j Below we provide a table of the A r j(0) ad a table of the C r j (0). Usig Equatios (5.4) ad (5.5) it is easy to show that = A 0(0) ad g() = C 0 (0). I other words, ote that the left most diagoal of the table is our sequece or g() Table 3: Values of A r j (0) Table 4: Values of C r j (0) For Tables 3 ad 4, rows correspod to r = 1, 2, 3,... ad diagoals to j = 0, 1,..., r 1. Ispectio of Tables 3 ad 4 suggests that as, the rows ted to stabilize to a fixed sequece. I the case of Table 3, the fixed sequece is b = 2. Thus, we have the followig theorem.
19 INTEGERS:ELECTRONIC JOURNAL OF COMBINATORIAL NUMBER THEORY 7 (2007), #A58 19 Theorem 5.1 Let 0. The, A 2+2 (0) = 2. For Table 4, the stabilizatio sequece is more complicated. followig theorem. I particular, we have the Theorem 5.2 Let a be the sequece defied by the recursio a = 2a 1 + a 2, a 0 = 1, a 1 = 1. The, for 2, C (0) = a. We will prove Theorem 5.2. Sice the proof of Theorem 5.1 is similar, its proof is omitted. I order to prove Theorem 5.2, we will eed the followig two lemmas. Lemma 5.1 Let 2. Let i 0 ad 0. The, 2 + i 2 = 2 + i 2 (5.13) Proof of Lemma 5.1. Clearly Equatio (5.13) is true whe = 0. Now we assume 1, or equivaletly, 1. By addig 2 to each term of the iequality, we obtai 2 > I other words, 1 2 < Multiply each term i the above iequality by 2 to obtai 1 < Thus, Equatio (5.14) implies that if 1, 2 = (5.14) We ow wat to obtai the left side of (5.13). Oce agai, assume 1, or equivaletly. 1. Add 2 +i to each term ad obtai 2 +i > 2 +i 1 2 +i +i. 1 Thus, < Multiply each term i the above iequality by 2 + i 2+i 2+i 1 2+i +i to obtai 1 < 2 + i 2 + i i 2 + i 2 + i + i = 2 i + i 2. (5.15) Thus, Equatio (5.15) implies that if 1, 2+i = 2. Combiig (5.14) ad (5.15) proves the lemma. Lemma 5.2 (Stabilizatio of the left to right diagoal) Let 2 ad i 0. The, C (0) = C 2 1+i (0). (5.16) 2+i
20 INTEGERS:ELECTRONIC JOURNAL OF COMBINATORIAL NUMBER THEORY 7 (2007), #A58 20 Proof of Lemma 5.2. We use iductio o. If = 2, it easy to show, via Equatio (5.5), that C0(0) 3 = 3 = C 3+i i (0). We ow assume (5.16) is true for all iteger values less tha or equal to. I otherwords, we assume the first left to right diagoals of Table 4 stabilize to a fixed umber. By Equatio (5.5), 2 + i C 2+1+i 1+i (0) = C 2+i 1+i (0) 2 + i =0 2 + i = C 1 2 (0), iductive hypothesis 2 + i =0 2 = C 1 2 (0), by, Lemma =0 = C (0) by (5.5). The above calculatios prove the lemma. Remar 5.1 Lemma 5.2 implies that for 4, ad i 0, C (0) = C 2 5+i 4+i (0). Proof of Theorem 5.2. Note that C 3 0(0) = 3 = a 2 ad C 5 1(0) = 7 = a 3. If we ca show, for 4, that C (0) = 2C (0) + C (0), (5.17) we will prove the theorem, sice both the C (0) ad a obey the same recursio relatio ad have the same iitial coditios. By Equatio (5.8), C (0) = 2 2 j= 1 C 2 1 j (0) j= 2 j 1 = C (0) + 2C 2 1 (0) j=+1 The last equality is a simple adaptatio of Lemma 5.1. Also, by (5.8), we have 2 4 j C (0) = C 2 3 j (0) 2 = C (0) + 2 = C 2 1 (0) j= j= 1 C 2 3 j (0) C 2 1 j+2 (0) = C2 1 (0) j=+1 C 2 1 j (0). (5.18) C 2 1 j (0). The third equality comes from lettig i = 2 i Remar 5.1. Thus, the precedig calculatios imply that (5.18) is, i fact, C (0) = C (0) + C 2 1 (0) + C (0). By repeated applicatios of Lemma 5.2, the above equatio becomes C (0) = C (0) + C 2 1 (0) + C (0) = 2C (0) + C (0). which is exactly Equatio (5.17)..
21 INTEGERS:ELECTRONIC JOURNAL OF COMBINATORIAL NUMBER THEORY 7 (2007), #A58 21 Remar 5.2 Lemma 5.2 implies, that for all i 0, a = C (0) = C 2 1+i 2+i (0). Thus, the proof of Theorem 5.2 shows that a = C 2 1+i 2+i (0), wheever i 0 ad 2. Similiarly, we ca show that wheever i 0, A 2+2+i +i (0) = 2. We ed this sectio with Corollary 5.6, which is a result of Theorems 5.1 ad 5.2. This corollary states that the limitig sequece is the cetral colum of Tables 3 ad 4. Corollary 5.6 Let 0. Let a ad b be as defied i Theorems 5.1 ad 5.2. The, b = A 2+1 (0) ad a = C 2+1 (0). 6. Closig Remars: A Combiatorial Questio There remais the problem of determiig combiatorial structures eumerated by ad g(). Although h() is fractioal, removig the powers of 2 i (3.4) ad relabelig, the sequece a() = ( ) 2, which has the values 2, 12, 60, 280, 1260, 5544, 24024, ,... does have some iterest. This sequece is A i the OEIS ad the umbers are sometimes called Apery umbers sice they occur i Roger Apery s proof of the irratioality of ζ(3). Refereces 1. H. W. Gould, Biomial Coefficiets, the Bracet Fuctio, ad Compositios with Relatively Prime Summads, Fiboacci Quarterly, 2 (1964), H. W. Gould, Bell ad Catala Numbers - Research Bibliography of Two Special Number Sequeces, Fifth Editio, 22 April x + 43pp. Published by the author, Morgatow, W. Va. 3. H. W. Gould ad Jocely Quaitace, The Geeralized Bell Number Recurrece ad The Geeralized Catala Recurrece, Applicable Aalysis ad Discrete Mathematics, to appear 4. Temba Shohiwa, Ivestigatios i Number Theoretic Fuctios, Ph.D. Dissertatio, West Virgiia Uiversity Temba Shohiwa, O a Class of Prime-Detectig Cogrueces, Discrete Math, 204 (1999), H. W. Gould, A Bracet Fuctio Trasform ad Its Iverse, Fiboacci Quarterly, 32 (1994), H. W. Gould ad Jocely Quaitace, A Liear Biomial Recurrece ad the Bell Numbers ad Polyomials, Applicable Aalysis ad Discrete Mathematics, 1, (2007), No. 2. Available at 8. H. W. Gould, Combiatorial Idetities, A Stadardized Set of Tables Listig 500 Biomial Coefficiet Summatios, Secod Editio, 1972, viii pp., Published by the author, Morgatow, W.Va.
Roger Apéry's proof that zeta(3) is irrational
Cliff Bott cliffbott@hotmail.com 11 October 2011 Roger Apéry's proof that zeta(3) is irratioal Roger Apéry developed a method for searchig for cotiued fractio represetatios of umbers that have a form such
More informationHarmonic Number Identities Via Euler s Transform
1 2 3 47 6 23 11 Joural of Iteger Sequeces, Vol. 12 2009), Article 09.6.1 Harmoic Number Idetities Via Euler s Trasform Khristo N. Boyadzhiev Departmet of Mathematics Ohio Norther Uiversity Ada, Ohio 45810
More informationMath 155 (Lecture 3)
Math 55 (Lecture 3) September 8, I this lecture, we ll cosider the aswer to oe of the most basic coutig problems i combiatorics Questio How may ways are there to choose a -elemet subset of the set {,,,
More informationThe log-behavior of n p(n) and n p(n)/n
Ramauja J. 44 017, 81-99 The log-behavior of p ad p/ William Y.C. Che 1 ad Ke Y. Zheg 1 Ceter for Applied Mathematics Tiaji Uiversity Tiaji 0007, P. R. Chia Ceter for Combiatorics, LPMC Nakai Uivercity
More informationAssignment 5: Solutions
McGill Uiversity Departmet of Mathematics ad Statistics MATH 54 Aalysis, Fall 05 Assigmet 5: Solutios. Let y be a ubouded sequece of positive umbers satisfyig y + > y for all N. Let x be aother sequece
More informationA GENERALIZATION OF THE SYMMETRY BETWEEN COMPLETE AND ELEMENTARY SYMMETRIC FUNCTIONS. Mircea Merca
Idia J Pure Appl Math 45): 75-89 February 204 c Idia Natioal Sciece Academy A GENERALIZATION OF THE SYMMETRY BETWEEN COMPLETE AND ELEMENTARY SYMMETRIC FUNCTIONS Mircea Merca Departmet of Mathematics Uiversity
More informationMathematics review for CSCI 303 Spring Department of Computer Science College of William & Mary Robert Michael Lewis
Mathematics review for CSCI 303 Sprig 019 Departmet of Computer Sciece College of William & Mary Robert Michael Lewis Copyright 018 019 Robert Michael Lewis Versio geerated: 13 : 00 Jauary 17, 019 Cotets
More informationBertrand s Postulate
Bertrad s Postulate Lola Thompso Ross Program July 3, 2009 Lola Thompso (Ross Program Bertrad s Postulate July 3, 2009 1 / 33 Bertrad s Postulate I ve said it oce ad I ll say it agai: There s always a
More informationSeries with Central Binomial Coefficients, Catalan Numbers, and Harmonic Numbers
3 47 6 3 Joural of Iteger Sequeces, Vol. 5 (0), Article..7 Series with Cetral Biomial Coefficiets, Catala Numbers, ad Harmoic Numbers Khristo N. Boyadzhiev Departmet of Mathematics ad Statistics Ohio Norther
More informationAn analog of the arithmetic triangle obtained by replacing the products by the least common multiples
arxiv:10021383v2 [mathnt] 9 Feb 2010 A aalog of the arithmetic triagle obtaied by replacig the products by the least commo multiples Bair FARHI bairfarhi@gmailcom MSC: 11A05 Keywords: Al-Karaji s triagle;
More informationw (1) ˆx w (1) x (1) /ρ and w (2) ˆx w (2) x (2) /ρ.
2 5. Weighted umber of late jobs 5.1. Release dates ad due dates: maximimizig the weight of o-time jobs Oce we add release dates, miimizig the umber of late jobs becomes a sigificatly harder problem. For
More informationAbstract. 1. Introduction This note is a supplement to part I ([4]). Let. F x (1.1) x n (1.2) Then the moments L x are the Catalan numbers
Abstract Some elemetary observatios o Narayaa polyomials ad related topics II: -Narayaa polyomials Joha Cigler Faultät für Mathemati Uiversität Wie ohacigler@uivieacat We show that Catala umbers cetral
More informationCSE 1400 Applied Discrete Mathematics Number Theory and Proofs
CSE 1400 Applied Discrete Mathematics Number Theory ad Proofs Departmet of Computer Scieces College of Egieerig Florida Tech Sprig 01 Problems for Number Theory Backgroud Number theory is the brach of
More informationCALCULATION OF FIBONACCI VECTORS
CALCULATION OF FIBONACCI VECTORS Stuart D. Aderso Departmet of Physics, Ithaca College 953 Daby Road, Ithaca NY 14850, USA email: saderso@ithaca.edu ad Dai Novak Departmet of Mathematics, Ithaca College
More informationP. Z. Chinn Department of Mathematics, Humboldt State University, Arcata, CA
RISES, LEVELS, DROPS AND + SIGNS IN COMPOSITIONS: EXTENSIONS OF A PAPER BY ALLADI AND HOGGATT S. Heubach Departmet of Mathematics, Califoria State Uiversity Los Ageles 55 State Uiversity Drive, Los Ageles,
More informationON MONOTONICITY OF SOME COMBINATORIAL SEQUENCES
Publ. Math. Debrece 8504, o. 3-4, 85 95. ON MONOTONICITY OF SOME COMBINATORIAL SEQUENCES QING-HU HOU*, ZHI-WEI SUN** AND HAOMIN WEN Abstract. We cofirm Su s cojecture that F / F 4 is strictly decreasig
More informationMath 2784 (or 2794W) University of Connecticut
ORDERS OF GROWTH PAT SMITH Math 2784 (or 2794W) Uiversity of Coecticut Date: Mar. 2, 22. ORDERS OF GROWTH. Itroductio Gaiig a ituitive feel for the relative growth of fuctios is importat if you really
More informationMAT1026 Calculus II Basic Convergence Tests for Series
MAT026 Calculus II Basic Covergece Tests for Series Egi MERMUT 202.03.08 Dokuz Eylül Uiversity Faculty of Sciece Departmet of Mathematics İzmir/TURKEY Cotets Mootoe Covergece Theorem 2 2 Series of Real
More informationCERTAIN GENERAL BINOMIAL-FIBONACCI SUMS
CERTAIN GENERAL BINOMIAL-FIBONACCI SUMS J. W. LAYMAN Virgiia Polytechic Istitute State Uiversity, Blacksburg, Virgiia Numerous writers appear to have bee fasciated by the may iterestig summatio idetitites
More informationMATH 304: MIDTERM EXAM SOLUTIONS
MATH 304: MIDTERM EXAM SOLUTIONS [The problems are each worth five poits, except for problem 8, which is worth 8 poits. Thus there are 43 possible poits.] 1. Use the Euclidea algorithm to fid the greatest
More informationSequences of Definite Integrals, Factorials and Double Factorials
47 6 Joural of Iteger Sequeces, Vol. 8 (5), Article 5.4.6 Sequeces of Defiite Itegrals, Factorials ad Double Factorials Thierry Daa-Picard Departmet of Applied Mathematics Jerusalem College of Techology
More informationSequences. Notation. Convergence of a Sequence
Sequeces A sequece is essetially just a list. Defiitio (Sequece of Real Numbers). A sequece of real umbers is a fuctio Z (, ) R for some real umber. Do t let the descriptio of the domai cofuse you; it
More informationConvergence of random variables. (telegram style notes) P.J.C. Spreij
Covergece of radom variables (telegram style otes).j.c. Spreij this versio: September 6, 2005 Itroductio As we kow, radom variables are by defiitio measurable fuctios o some uderlyig measurable space
More informationMATH 324 Summer 2006 Elementary Number Theory Solutions to Assignment 2 Due: Thursday July 27, 2006
MATH 34 Summer 006 Elemetary Number Theory Solutios to Assigmet Due: Thursday July 7, 006 Departmet of Mathematical ad Statistical Scieces Uiversity of Alberta Questio [p 74 #6] Show that o iteger of the
More informationTopic 1 2: Sequences and Series. A sequence is an ordered list of numbers, e.g. 1, 2, 4, 8, 16, or
Topic : Sequeces ad Series A sequece is a ordered list of umbers, e.g.,,, 8, 6, or,,,.... A series is a sum of the terms of a sequece, e.g. + + + 8 + 6 + or... Sigma Notatio b The otatio f ( k) is shorthad
More information(A sequence also can be thought of as the list of function values attained for a function f :ℵ X, where f (n) = x n for n 1.) x 1 x N +k x N +4 x 3
MATH 337 Sequeces Dr. Neal, WKU Let X be a metric space with distace fuctio d. We shall defie the geeral cocept of sequece ad limit i a metric space, the apply the results i particular to some special
More informationSOME TRIBONACCI IDENTITIES
Mathematics Today Vol.7(Dec-011) 1-9 ISSN 0976-38 Abstract: SOME TRIBONACCI IDENTITIES Shah Devbhadra V. Sir P.T.Sarvajaik College of Sciece, Athwalies, Surat 395001. e-mail : drdvshah@yahoo.com The sequece
More informationNEW FAST CONVERGENT SEQUENCES OF EULER-MASCHERONI TYPE
UPB Sci Bull, Series A, Vol 79, Iss, 207 ISSN 22-7027 NEW FAST CONVERGENT SEQUENCES OF EULER-MASCHERONI TYPE Gabriel Bercu We itroduce two ew sequeces of Euler-Mascheroi type which have fast covergece
More information1 6 = 1 6 = + Factorials and Euler s Gamma function
Royal Holloway Uiversity of Lodo Departmet of Physics Factorials ad Euler s Gamma fuctio Itroductio The is a self-cotaied part of the course dealig, essetially, with the factorial fuctio ad its geeralizatio
More informationQ-BINOMIALS AND THE GREATEST COMMON DIVISOR. Keith R. Slavin 8474 SW Chevy Place, Beaverton, Oregon 97008, USA.
INTEGERS: ELECTRONIC JOURNAL OF COMBINATORIAL NUMBER THEORY 8 2008, #A05 Q-BINOMIALS AND THE GREATEST COMMON DIVISOR Keith R. Slavi 8474 SW Chevy Place, Beaverto, Orego 97008, USA slavi@dsl-oly.et Received:
More informationCHAPTER 10 INFINITE SEQUENCES AND SERIES
CHAPTER 10 INFINITE SEQUENCES AND SERIES 10.1 Sequeces 10.2 Ifiite Series 10.3 The Itegral Tests 10.4 Compariso Tests 10.5 The Ratio ad Root Tests 10.6 Alteratig Series: Absolute ad Coditioal Covergece
More informationA LIMITED ARITHMETIC ON SIMPLE CONTINUED FRACTIONS - II 1. INTRODUCTION
A LIMITED ARITHMETIC ON SIMPLE CONTINUED FRACTIONS - II C. T. LONG J. H. JORDAN* Washigto State Uiversity, Pullma, Washigto 1. INTRODUCTION I the first paper [2 ] i this series, we developed certai properties
More informationCourse : Algebraic Combinatorics
Course 18.312: Algebraic Combiatorics Lecture Notes # 18-19 Addedum by Gregg Musier March 18th - 20th, 2009 The followig material ca be foud i a umber of sources, icludig Sectios 7.3 7.5, 7.7, 7.10 7.11,
More information62. Power series Definition 16. (Power series) Given a sequence {c n }, the series. c n x n = c 0 + c 1 x + c 2 x 2 + c 3 x 3 +
62. Power series Defiitio 16. (Power series) Give a sequece {c }, the series c x = c 0 + c 1 x + c 2 x 2 + c 3 x 3 + is called a power series i the variable x. The umbers c are called the coefficiets of
More informationarxiv: v1 [math.fa] 3 Apr 2016
Aticommutator Norm Formula for Proectio Operators arxiv:164.699v1 math.fa] 3 Apr 16 Sam Walters Uiversity of Norther British Columbia ABSTRACT. We prove that for ay two proectio operators f, g o Hilbert
More information1. By using truth tables prove that, for all statements P and Q, the statement
Author: Satiago Salazar Problems I: Mathematical Statemets ad Proofs. By usig truth tables prove that, for all statemets P ad Q, the statemet P Q ad its cotrapositive ot Q (ot P) are equivalet. I example.2.3
More informationHankel determinants of some polynomial sequences. Johann Cigler
Hael determiats of some polyomial sequeces Joha Cigler Faultät für Mathemati, Uiversität Wie ohacigler@uivieacat Abstract We give simple ew proofs of some Catala Hael determiat evaluatios by Ömer Eğecioğlu
More informationDavid Vella, Skidmore College.
David Vella, Skidmore College dvella@skidmore.edu Geeratig Fuctios ad Expoetial Geeratig Fuctios Give a sequece {a } we ca associate to it two fuctios determied by power series: Its (ordiary) geeratig
More informationENGI Series Page 6-01
ENGI 3425 6 Series Page 6-01 6. Series Cotets: 6.01 Sequeces; geeral term, limits, covergece 6.02 Series; summatio otatio, covergece, divergece test 6.03 Stadard Series; telescopig series, geometric series,
More informationA Simplified Binet Formula for k-generalized Fibonacci Numbers
A Simplified Biet Formula for k-geeralized Fiboacci Numbers Gregory P. B. Dresde Departmet of Mathematics Washigto ad Lee Uiversity Lexigto, VA 440 dresdeg@wlu.edu Zhaohui Du Shaghai, Chia zhao.hui.du@gmail.com
More informationRecurrence Relations
Recurrece Relatios Aalysis of recursive algorithms, such as: it factorial (it ) { if (==0) retur ; else retur ( * factorial(-)); } Let t be the umber of multiplicatios eeded to calculate factorial(). The
More informationSome identities involving Fibonacci, Lucas polynomials and their applications
Bull. Math. Soc. Sci. Math. Roumaie Tome 55103 No. 1, 2012, 95 103 Some idetities ivolvig Fiboacci, Lucas polyomials ad their applicatios by Wag Tigtig ad Zhag Wepeg Abstract The mai purpose of this paper
More informationk-generalized FIBONACCI NUMBERS CLOSE TO THE FORM 2 a + 3 b + 5 c 1. Introduction
Acta Math. Uiv. Comeiaae Vol. LXXXVI, 2 (2017), pp. 279 286 279 k-generalized FIBONACCI NUMBERS CLOSE TO THE FORM 2 a + 3 b + 5 c N. IRMAK ad M. ALP Abstract. The k-geeralized Fiboacci sequece { F (k)
More information1 Generating functions for balls in boxes
Math 566 Fall 05 Some otes o geeratig fuctios Give a sequece a 0, a, a,..., a,..., a geeratig fuctio some way of represetig the sequece as a fuctio. There are may ways to do this, with the most commo ways
More informationIn number theory we will generally be working with integers, though occasionally fractions and irrationals will come into play.
Number Theory Math 5840 otes. Sectio 1: Axioms. I umber theory we will geerally be workig with itegers, though occasioally fractios ad irratioals will come ito play. Notatio: Z deotes the set of all itegers
More information4.3 Growth Rates of Solutions to Recurrences
4.3. GROWTH RATES OF SOLUTIONS TO RECURRENCES 81 4.3 Growth Rates of Solutios to Recurreces 4.3.1 Divide ad Coquer Algorithms Oe of the most basic ad powerful algorithmic techiques is divide ad coquer.
More informationMath 475, Problem Set #12: Answers
Math 475, Problem Set #12: Aswers A. Chapter 8, problem 12, parts (b) ad (d). (b) S # (, 2) = 2 2, sice, from amog the 2 ways of puttig elemets ito 2 distiguishable boxes, exactly 2 of them result i oe
More informationSequences, Mathematical Induction, and Recursion. CSE 2353 Discrete Computational Structures Spring 2018
CSE 353 Discrete Computatioal Structures Sprig 08 Sequeces, Mathematical Iductio, ad Recursio (Chapter 5, Epp) Note: some course slides adopted from publisher-provided material Overview May mathematical
More informationANOTHER GENERALIZED FIBONACCI SEQUENCE 1. INTRODUCTION
ANOTHER GENERALIZED FIBONACCI SEQUENCE MARCELLUS E. WADDILL A N D LOUIS SACKS Wake Forest College, Wisto Salem, N. C., ad Uiversity of ittsburgh, ittsburgh, a. 1. INTRODUCTION Recet issues of umerous periodicals
More informationSome p-adic congruences for p q -Catalan numbers
Some p-adic cogrueces for p q -Catala umbers Floria Luca Istituto de Matemáticas Uiversidad Nacioal Autóoma de México C.P. 58089, Morelia, Michoacá, México fluca@matmor.uam.mx Paul Thomas Youg Departmet
More informationAsymptotic Formulae for the n-th Perfect Power
3 47 6 3 Joural of Iteger Sequeces, Vol. 5 0, Article.5.5 Asymptotic Formulae for the -th Perfect Power Rafael Jakimczuk Divisió Matemática Uiversidad Nacioal de Lujá Bueos Aires Argetia jakimczu@mail.ulu.edu.ar
More informationHoggatt and King [lo] defined a complete sequence of natural numbers
REPRESENTATIONS OF N AS A SUM OF DISTINCT ELEMENTS FROM SPECIAL SEQUENCES DAVID A. KLARNER, Uiversity of Alberta, Edmoto, Caada 1. INTRODUCTION Let a, I deote a sequece of atural umbers which satisfies
More information2.4 - Sequences and Series
2.4 - Sequeces ad Series Sequeces A sequece is a ordered list of elemets. Defiitio 1 A sequece is a fuctio from a subset of the set of itegers (usually either the set 80, 1, 2, 3,... < or the set 81, 2,
More informationEnumerative & Asymptotic Combinatorics
C50 Eumerative & Asymptotic Combiatorics Notes 4 Sprig 2003 Much of the eumerative combiatorics of sets ad fuctios ca be geeralised i a maer which, at first sight, seems a bit umotivated I this chapter,
More informationTR/46 OCTOBER THE ZEROS OF PARTIAL SUMS OF A MACLAURIN EXPANSION A. TALBOT
TR/46 OCTOBER 974 THE ZEROS OF PARTIAL SUMS OF A MACLAURIN EXPANSION by A. TALBOT .. Itroductio. A problem i approximatio theory o which I have recetly worked [] required for its solutio a proof that the
More informationMathematical Induction
Mathematical Iductio Itroductio Mathematical iductio, or just iductio, is a proof techique. Suppose that for every atural umber, P() is a statemet. We wish to show that all statemets P() are true. I a
More informationTHE ASYMPTOTIC COMPLEXITY OF MATRIX REDUCTION OVER FINITE FIELDS
THE ASYMPTOTIC COMPLEXITY OF MATRIX REDUCTION OVER FINITE FIELDS DEMETRES CHRISTOFIDES Abstract. Cosider a ivertible matrix over some field. The Gauss-Jorda elimiatio reduces this matrix to the idetity
More information3. Z Transform. Recall that the Fourier transform (FT) of a DT signal xn [ ] is ( ) [ ] = In order for the FT to exist in the finite magnitude sense,
3. Z Trasform Referece: Etire Chapter 3 of text. Recall that the Fourier trasform (FT) of a DT sigal x [ ] is ω ( ) [ ] X e = j jω k = xe I order for the FT to exist i the fiite magitude sese, S = x [
More informationIf a subset E of R contains no open interval, is it of zero measure? For instance, is the set of irrationals in [0, 1] is of measure zero?
2 Lebesgue Measure I Chapter 1 we defied the cocept of a set of measure zero, ad we have observed that every coutable set is of measure zero. Here are some atural questios: If a subset E of R cotais a
More information[ 11 ] z of degree 2 as both degree 2 each. The degree of a polynomial in n variables is the maximum of the degrees of its terms.
[ 11 ] 1 1.1 Polyomial Fuctios 1 Algebra Ay fuctio f ( x) ax a1x... a1x a0 is a polyomial fuctio if ai ( i 0,1,,,..., ) is a costat which belogs to the set of real umbers ad the idices,, 1,...,1 are atural
More informationEnumerative & Asymptotic Combinatorics
C50 Eumerative & Asymptotic Combiatorics Stirlig ad Lagrage Sprig 2003 This sectio of the otes cotais proofs of Stirlig s formula ad the Lagrage Iversio Formula. Stirlig s formula Theorem 1 (Stirlig s
More informationMath 451: Euclidean and Non-Euclidean Geometry MWF 3pm, Gasson 204 Homework 3 Solutions
Math 451: Euclidea ad No-Euclidea Geometry MWF 3pm, Gasso 204 Homework 3 Solutios Exercises from 1.4 ad 1.5 of the otes: 4.3, 4.10, 4.12, 4.14, 4.15, 5.3, 5.4, 5.5 Exercise 4.3. Explai why Hp, q) = {x
More informationFibonacci polynomials, generalized Stirling numbers, and Bernoulli, Genocchi and tangent numbers
Fiboacci polyomials, geeralied Stirlig umbers, ad Beroulli, Geocchi ad taget umbers Joha Cigler oha.cigler@uivie.ac.at Abstract We study matrices hich trasform the sequece of Fiboacci or Lucas polyomials
More informationProduct measures, Tonelli s and Fubini s theorems For use in MAT3400/4400, autumn 2014 Nadia S. Larsen. Version of 13 October 2014.
Product measures, Toelli s ad Fubii s theorems For use i MAT3400/4400, autum 2014 Nadia S. Larse Versio of 13 October 2014. 1. Costructio of the product measure The purpose of these otes is to preset the
More informationMDIV. Multiple divisor functions
MDIV. Multiple divisor fuctios The fuctios τ k For k, defie τ k ( to be the umber of (ordered factorisatios of ito k factors, i other words, the umber of ordered k-tuples (j, j 2,..., j k with j j 2...
More informationOn Generalized Fibonacci Numbers
Applied Mathematical Scieces, Vol. 9, 215, o. 73, 3611-3622 HIKARI Ltd, www.m-hikari.com http://dx.doi.org/1.12988/ams.215.5299 O Geeralized Fiboacci Numbers Jerico B. Bacai ad Julius Fergy T. Rabago Departmet
More informationThe r-generalized Fibonacci Numbers and Polynomial Coefficients
It. J. Cotemp. Math. Scieces, Vol. 3, 2008, o. 24, 1157-1163 The r-geeralized Fiboacci Numbers ad Polyomial Coefficiets Matthias Schork Camillo-Sitte-Weg 25 60488 Frakfurt, Germay mschork@member.ams.org,
More informationInfinite Sequences and Series
Chapter 6 Ifiite Sequeces ad Series 6.1 Ifiite Sequeces 6.1.1 Elemetary Cocepts Simply speakig, a sequece is a ordered list of umbers writte: {a 1, a 2, a 3,...a, a +1,...} where the elemets a i represet
More informationDIVISIBILITY PROPERTIES OF GENERALIZED FIBONACCI POLYNOMIALS
DIVISIBILITY PROPERTIES OF GENERALIZED FIBONACCI POLYNOMIALS VERNER E. HOGGATT, JR. Sa Jose State Uiversity, Sa Jose, Califoria 95192 ad CALVIN T. LONG Washigto State Uiversity, Pullma, Washigto 99163
More informationSeunghee Ye Ma 8: Week 5 Oct 28
Week 5 Summary I Sectio, we go over the Mea Value Theorem ad its applicatios. I Sectio 2, we will recap what we have covered so far this term. Topics Page Mea Value Theorem. Applicatios of the Mea Value
More informationTopics. Homework Problems. MATH 301 Introduction to Analysis Chapter Four Sequences. 1. Definition of convergence of sequences.
MATH 301 Itroductio to Aalysis Chapter Four Sequeces Topics 1. Defiitio of covergece of sequeces. 2. Fidig ad provig the limit of sequeces. 3. Bouded covergece theorem: Theorem 4.1.8. 4. Theorems 4.1.13
More informationOn a Smarandache problem concerning the prime gaps
O a Smaradache problem cocerig the prime gaps Felice Russo Via A. Ifate 7 6705 Avezzao (Aq) Italy felice.russo@katamail.com Abstract I this paper, a problem posed i [] by Smaradache cocerig the prime gaps
More informationPellian sequence relationships among π, e, 2
otes o umber Theory ad Discrete Mathematics Vol. 8, 0, o., 58 6 Pellia sequece relatioships amog π, e, J. V. Leyedekkers ad A. G. Shao Faculty of Sciece, The Uiversity of Sydey Sydey, SW 006, Australia
More informationA Study on Some Integer Sequences
It. J. Cotemp. Math. Scieces, Vol. 3, 008, o. 3, 03-09 A Study o Some Iteger Sequeces Serpil Halıcı Sakarya Uiversity, Departmet of Mathematics Esetepe Campus, Sakarya, Turkey shalici@sakarya.edu.tr Abstract.
More informationComplex Analysis Spring 2001 Homework I Solution
Complex Aalysis Sprig 2001 Homework I Solutio 1. Coway, Chapter 1, sectio 3, problem 3. Describe the set of poits satisfyig the equatio z a z + a = 2c, where c > 0 ad a R. To begi, we see from the triagle
More informationSolutions to Final Exam
Solutios to Fial Exam 1. Three married couples are seated together at the couter at Moty s Blue Plate Dier, occupyig six cosecutive seats. How may arragemets are there with o wife sittig ext to her ow
More informationOnce we have a sequence of numbers, the next thing to do is to sum them up. Given a sequence (a n ) n=1
. Ifiite Series Oce we have a sequece of umbers, the ext thig to do is to sum them up. Give a sequece a be a sequece: ca we give a sesible meaig to the followig expressio? a = a a a a While summig ifiitely
More information6.3 Testing Series With Positive Terms
6.3. TESTING SERIES WITH POSITIVE TERMS 307 6.3 Testig Series With Positive Terms 6.3. Review of what is kow up to ow I theory, testig a series a i for covergece amouts to fidig the i= sequece of partial
More informationsin(n) + 2 cos(2n) n 3/2 3 sin(n) 2cos(2n) n 3/2 a n =
60. Ratio ad root tests 60.1. Absolutely coverget series. Defiitio 13. (Absolute covergece) A series a is called absolutely coverget if the series of absolute values a is coverget. The absolute covergece
More informationApplied Mathematics Letters. On the properties of Lucas numbers with binomial coefficients
Applied Mathematics Letters 3 (1 68 7 Cotets lists available at ScieceDirect Applied Mathematics Letters joural homepage: wwwelseviercom/locate/aml O the properties of Lucas umbers with biomial coefficiets
More informationNUMERICAL METHODS FOR SOLVING EQUATIONS
Mathematics Revisio Guides Numerical Methods for Solvig Equatios Page 1 of 11 M.K. HOME TUITION Mathematics Revisio Guides Level: GCSE Higher Tier NUMERICAL METHODS FOR SOLVING EQUATIONS Versio:. Date:
More information#A51 INTEGERS 14 (2014) MULTI-POLY-BERNOULLI-STAR NUMBERS AND FINITE MULTIPLE ZETA-STAR VALUES
#A5 INTEGERS 4 (24) MULTI-POLY-BERNOULLI-STAR NUMBERS AND FINITE MULTIPLE ZETA-STAR VALUES Kohtaro Imatomi Graduate School of Mathematics, Kyushu Uiversity, Nishi-ku, Fukuoka, Japa k-imatomi@math.kyushu-u.ac.p
More information#A46 INTEGERS 18 (2018) JACOBI-TYPE CONTINUED FRACTIONS AND CONGRUENCES FOR BINOMIAL COEFFICIENTS
#A46 INTEGERS 8 (08) JACOBI-TYPE CONTINUED FRACTIONS AND CONGRUENCES FOR BINOMIAL COEFFICIENTS Maie D. Schmidt School of Mathematics, Georgia Istitute of Techology, Atlata, Georgia maieds@gmail.com ; mschmidt34@gatech.edu
More informationZeros of Polynomials
Math 160 www.timetodare.com 4.5 4.6 Zeros of Polyomials I these sectios we will study polyomials algebraically. Most of our work will be cocered with fidig the solutios of polyomial equatios of ay degree
More informationThe Boolean Ring of Intervals
MATH 532 Lebesgue Measure Dr. Neal, WKU We ow shall apply the results obtaied about outer measure to the legth measure o the real lie. Throughout, our space X will be the set of real umbers R. Whe ecessary,
More informationNICK DUFRESNE. 1 1 p(x). To determine some formulas for the generating function of the Schröder numbers, r(x) = a(x) =
AN INTRODUCTION TO SCHRÖDER AND UNKNOWN NUMBERS NICK DUFRESNE Abstract. I this article we will itroduce two types of lattice paths, Schröder paths ad Ukow paths. We will examie differet properties of each,
More informationFactors of sums and alternating sums involving binomial coefficients and powers of integers
Factors of sums ad alteratig sums ivolvig biomial coefficiets ad powers of itegers Victor J. W. Guo 1 ad Jiag Zeg 2 1 Departmet of Mathematics East Chia Normal Uiversity Shaghai 200062 People s Republic
More information1 Approximating Integrals using Taylor Polynomials
Seughee Ye Ma 8: Week 7 Nov Week 7 Summary This week, we will lear how we ca approximate itegrals usig Taylor series ad umerical methods. Topics Page Approximatig Itegrals usig Taylor Polyomials. Defiitios................................................
More informationDe la Vallée Poussin Summability, the Combinatorial Sum 2n 1
J o u r a l of Mathematics ad Applicatios JMA No 40, pp 5-20 (2017 De la Vallée Poussi Summability, the Combiatorial Sum 1 ( 2 ad the de la Vallée Poussi Meas Expasio Ziad S. Ali Abstract: I this paper
More informationFactors of alternating sums of products of binomial and q-binomial coefficients
ACTA ARITHMETICA 1271 (2007 Factors of alteratig sums of products of biomial ad q-biomial coefficiets by Victor J W Guo (Shaghai Frédéric Jouhet (Lyo ad Jiag Zeg (Lyo 1 Itroductio I 1998 Cali [4 proved
More informationIntegrable Functions. { f n } is called a determining sequence for f. If f is integrable with respect to, then f d does exist as a finite real number
MATH 532 Itegrable Fuctios Dr. Neal, WKU We ow shall defie what it meas for a measurable fuctio to be itegrable, show that all itegral properties of simple fuctios still hold, ad the give some coditios
More informationThe Phi Power Series
The Phi Power Series I did this work i about 0 years while poderig the relatioship betwee the golde mea ad the Madelbrot set. I have fially decided to make it available from my blog at http://semresearch.wordpress.com/.
More informationarxiv: v1 [math.nt] 28 Apr 2014
Proof of a supercogruece cojectured by Z.-H. Su Victor J. W. Guo Departmet of Mathematics, Shaghai Key Laboratory of PMMP, East Chia Normal Uiversity, 500 Dogchua Rd., Shaghai 0041, People s Republic of
More informationEVALUATION OF SUMS INVOLVING PRODUCTS OF GAUSSIAN q-binomial COEFFICIENTS WITH APPLICATIONS
EALATION OF SMS INOLING PRODCTS OF GASSIAN -BINOMIAL COEFFICIENTS WITH APPLICATIONS EMRAH KILIÇ* AND HELMT PRODINGER** Abstract Sums of products of two Gaussia -biomial coefficiets are ivestigated oe of
More informationConcavity of weighted arithmetic means with applications
Arch. Math. 69 (1997) 120±126 0003-889X/97/020120-07 $ 2.90/0 Birkhäuser Verlag, Basel, 1997 Archiv der Mathematik Cocavity of weighted arithmetic meas with applicatios By ARKADY BERENSTEIN ad ALEK VAINSHTEIN*)
More informationThe Riemann Zeta Function
Physics 6A Witer 6 The Riema Zeta Fuctio I this ote, I will sketch some of the mai properties of the Riema zeta fuctio, ζ(x). For x >, we defie ζ(x) =, x >. () x = For x, this sum diverges. However, we
More informationON SOME DIOPHANTINE EQUATIONS RELATED TO SQUARE TRIANGULAR AND BALANCING NUMBERS
Joural of Algebra, Number Theory: Advaces ad Applicatios Volume, Number, 00, Pages 7-89 ON SOME DIOPHANTINE EQUATIONS RELATED TO SQUARE TRIANGULAR AND BALANCING NUMBERS OLCAY KARAATLI ad REFİK KESKİN Departmet
More informationBertrand s Postulate. Theorem (Bertrand s Postulate): For every positive integer n, there is a prime p satisfying n < p 2n.
Bertrad s Postulate Our goal is to prove the followig Theorem Bertrad s Postulate: For every positive iteger, there is a prime p satisfyig < p We remark that Bertrad s Postulate is true by ispectio for,,
More informationMAS111 Convergence and Continuity
MAS Covergece ad Cotiuity Key Objectives At the ed of the course, studets should kow the followig topics ad be able to apply the basic priciples ad theorems therei to solvig various problems cocerig covergece
More informationarxiv: v1 [math.nt] 10 Dec 2014
A DIGITAL BINOMIAL THEOREM HIEU D. NGUYEN arxiv:42.38v [math.nt] 0 Dec 204 Abstract. We preset a triagle of coectios betwee the Sierpisi triagle, the sum-of-digits fuctio, ad the Biomial Theorem via a
More information