#A46 INTEGERS 18 (2018) JACOBI-TYPE CONTINUED FRACTIONS AND CONGRUENCES FOR BINOMIAL COEFFICIENTS

Size: px
Start display at page:

Download "#A46 INTEGERS 18 (2018) JACOBI-TYPE CONTINUED FRACTIONS AND CONGRUENCES FOR BINOMIAL COEFFICIENTS"

Transcription

1 #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 Received: //7, Revised: /0/8, Accepted: 5//8, Published: 5/8/8 Abstract We prove two ew forms of Jacobi-type J-fractio epasios geeratig the biomial coe ciets, ad, over all 0. Withi the article we establish ew forms of iteger cogrueces for these biomial coe ciet variatios modulo ay (prime or composite) h ad compare our results with kow idetities for the biomial coe ciets modulo primes p ad prime powers p k. We also prove ew eact formulas for these biomial coe ciet cases from the epasios of the h th coverget fuctios to the ifiite J-fractio series geeratig these coe ciets for all.. Itroductio.. Cogrueces for Biomial Coe ciets Modulo Primes ad Prime Powers There are may well-kow results providig cogrueces for the biomial coe - ciets modulo primes ad prime powers. For eample, we ca state Lucas s theorem i the followig form for p prime ad, m N where = 0 p d p d ad m = m 0 m p m d p d for 0 apple i, m i < p [3]: 0 d (mod p). (Lucas Theorem) m m 0 m m d We also have kow results providig decompositios, or reductios of order, of the et biomial coe ciets modulo the prime powers, p k [5]: p k 0 p 0 mp k (mod p k ). m 0 mp m 0 Similarly, we ca decompose liear ad quadratic (ad more geeral) polyomial iputs to the lower biomial coe ciet idices as the cogruece factors give by

2 INTEGERS: 8 (08) [5, 3.]: p p (r ) rp s r s p p mp (m ) rp s m rp s (mod p ), (mod p 3 ). Withi the cotet of this article, we are motivated to establish meaigful, otrivial iteger cogrueces for the two idetermiate biomial coe ciet sequece variats, ad, modulo both prime ad composite bases h by usig ew epasios of the Jacobi-type cotiued fractios geeratig these biomial coe ciet variats that we prove i Sectio ad i Sectio 3. The et subsectio establishes related kow cotiued fractios ad iteger cogruece properties for the geeral forms of Jacobi-type J-fractios of which our ew results are special cases... Jacobi-Type Cotiued Fractio Epasios... Cotiued Fractios Geeratig the Biomial Coe ciets I this article, we study ew properties ad cogruece relatios satisfied by the iteger-order biomial coe ciets through two specific, ad apparetly ew, Jacobitype cotiued fractio epasios of a formal power series i z. The epasios of these J-fractios are similar i form to a kow Stieltjes-type cotiued fractio, or S-fractio, epasio give i Wall s book as [0, p. 343] ( z) k = kz (k) z ( k) 3 z (k) 3 4 z. (Biomial Series S-Fractio)... Jacobi-Type J-Fractios for Geeralized Factorial Fuctios The loosely-termed o-epoetial forms of a geeralized class of biomialcoe ciet-related geeralized factorial fuctios, p (, R), defied as, p (, R) := R(R )(R ) (R ( ) ), where the special cases of = p (, ), ( ) ( ) /, ad p (, R)/ ( ) R/ whe () = () ( ) deotes the Pochhammer symbol, are studied i [9]. Epoetial geeratig fuctios for the geeralized symbolic

3 INTEGERS: 8 (08) 3 product fuctios, p (, R), with respect to, are kow ad give i closed-form by X 0 p (, R ) z = ( z) (R)/, where the correspodig geeralized forms of the Stirlig umbers of the first kid, or -factorial coe ciets, are defied by the geeratig fuctios [8, cf. -3] X [R m ]p (, R ) z = ( )m m ( z) Log( z) m, for m Z. m 0 The power series epasios of the ordiary geeratig fuctios for these factorial fuctios, which typically coverge oly for z = 0 whe the parameter R is a fuctio of, are defied formally i [9] by ifiite J-fractios of the form Cov (, R; z) = R z (R ) z R z (R 4 ) z (R ) z 3 (R ) z These typically diverget ordiary geeratig fuctios are usually oly epaded as power series i z by regularized Borel sums ivolvig reciprocal powers of z (ad z) such as those give as eamples i the itroductio to [9]. This referece proves ew idetities for the geeralized factorial fuctios p (, R) by cosiderig the coe ciets of the ratioal h th covergets to the diverget power series defied oly formally by the previous equatio which are h order accurate i approimatig these geeratig fuctios. We employ a similar approach to eumeratig ew eact idetities ad cogruece properties of the biomial coe ciets i this article based o a formal treatmet of the ratioal covergets to the geeratig fuctios defied by two special cases of the ifiite Jacobi-type J-fractios defied i the et subsectio...3. Properties of the Epasios of Geeral J-Fractio Series More geerally, Jacobi-type J-fractios correspod to power series defied by ifiite cotiued fractio epasios of the form J [] (z) = c z c z ab z ab z,. (J-Fractio Epasios) for some sequeces {c i } i ad {ab i } i, ad some (typically formal) series variable z C [6, cf. 3.0] [0,, ]. The formal series eumerated by special cases of the

4 INTEGERS: 8 (08) 4 trucated ad ifiite cotiued fractio series of this form iclude ordiary (as opposed to typically closed-form epoetial) geeratig fuctios for may oe ad two-ide combiatorial sequeces icludig the geeralized factorial fuctios studied i [,, 4, 9]. The h th covergets, Cov h (z), to the J-fractio epasios of the form i the previous equatio have several useful characteristic properties: (A) The h th coverget fuctios eactly eumerate the coe ciets of the ifiite cotiued fractio series as [z ]J [] (z) = [z ] Cov h (z) for all 0 apple < h. (B) The coverget fuctio compoet umerator ad deomiator sequeces are each easily defied recursively by the same secod-order recurrece i h with di erig iitial coditios. The h th coverget fuctios are always ratioal i z which implies a evetually periodic ature to their coe ciets, as well as h-order fiite di erece equatios satisfied by the coe ciets of these trucated series approimatios. (C) If M h := ab ab h deotes the h th modulus of the geeralized J-fractio epasio defied above, the sequece of coe ciets eumerated by the h th coverget fuctio is evetually periodic modulo M h ad satisfies a fiite di erece equatio of order at most h [, Thm. ]. Moreover, if M m is itegervalued ad h divides M m for some m h, the [z ]J [] [z ] Cov m (z) (mod h) [4, 5.7]. Typically we are oly iterested i the cogrueces formed by the h th coverget fuctios for the coe ciets of z the ifiite series, J [] (z) i z for 0 apple apple h, which are i fact eactly eumerated by these coverget fuctios. Other properties of the coverget fuctios, such as fiite di erece equatios satisfied by their coe ciets, suggest other o-obvious ad o-trivial properties of the resultig cogrueces guarateed by the coverget fuctios..3. Orgaizatio of the Article We provide two ew forms of ifiite J-fractios geeratig the biomial coe ciets, ad, for 0 ad ay o-zero idetermiate i the et sectios of the article. These ew cotiued fractio results lead to ew eact formulas ad fiite di erece equatios for these biomial coe ciet variats, ad ew cogrueces for the biomial coe ciets modulo ay (prime or composite) itegers h wheever h h h h 3 / Z. h h Additio formulas for these J-fractios imply ew idetities for reductios of order of the upper ide,, comparable to the statemets of Lucas theorem ad the other results modulo primes p ad prime powers p k give i Sectio..

5 INTEGERS: 8 (08) 5 The proofs of these ew cotiued fractio epasios mostly follow by iductive argumets applied to kow recurrece relatios for the h th umerator ad deomiator coverget fuctio sequeces. The proofs that these ifiite J-fractio epasios eactly eumerate our biomial coe ciet variats of iterest follow from the ratioality of the h th coverget fuctios i z for all h. Cosequeces of the proofs of our mai theorems iclude ew eact formulas for the biomial coe - ciets, ad, ad ew cogruece properties for these biomial coe ciet variats. Sice the proofs of the correspodig results i each case give i Sectio ad Sectio 3, respectively, are so similar, we give careful proofs of the results for the case of the J-fractios geeratig state the aalogous results for the case of of epositio. h P,h(, z) z 3 ( )z ( )( )z ( 3)z ( 4)z 5 ( 3)( )z ( 3)( )( )z3 0 ( 4)( 3)z ( 4)( 3)( 6 )z3 ( 5)z ( 5)( 4)z 99 ( 5)( 4)( 3)z3 ( 5)( 4)( 3)( )( ) z 5 i the first sectio, ad choose to oly i the secod sectio below for clarity ( 4)( 3)( )( ) z ( 5)( 4)( 3)( ) z h (h ) P,h(, z) ( )z ( )z 6( )( )z ( 3)z 360( 3)( )z 4( 3)( )( )z ( 4)z 3040( 4)( 3)z 880( 4)( 3)( )z 3 0( 4)( 3)( )( )z ( 5)z ( 5)( 4)z 40300( 5)( 4)( 3)z 3 500( 5)( 4)( 3)( )z 4 70( 5)( 4)( 3)( )( )z 5 Table : The Numerator Coverget Fuctios, P,h (, z), Geeratig the Biomial Coe ciets,

6 INTEGERS: 8 (08) 6 h Q,h (, z) ( )z ( )z ( )( )z ( 3)z 3 ( )( 5 0 3)z ( )( )( 3)z ( 4)z ( 3)( 7 7 4)z ( )( 3)( 4)z ( )( )( 3)( 4)z4 5 5 ( 5)z 5 ( 4)( )z 5 ( 3)( 4)( 5 5)z3 5()(3)(4)(5) z ()()(3)(4)(5) z ( 6)z 3 ( 5)( 6)z ( 4)( 5)( 6)z3 99 ( 3)( 4)( 5)( 58 6)z4 ()(3)(4)(5)(6) z ()()(3)(4)(5)(6) z h (h ) Q,h (, z) ( )z 6 4( )z ( )( )z 3 0 7( 3)z 8( )( 3)z ( )( )( 3)z ( 4)z 70( 3)( 4)z 96( )( 3)( 4)z 3 6( )( )( 3)( 4)z ( 5)z 50400( 4)( 5)z 700( 3)( 4)( 5)z 3 600( )( 3)( 4)( 5)z 4 4( )( )( 3)( 4)( 5)z ( 6)z ( 5)( 6)z ( 4)( 5)( 6)z ( 3)( 4)( 5)( 6)z 4 430( )( 3)( 4)( 5)( 6)z 5 0( )( )( 3)( 4)( 5)( 6)z 6 Table : The Deomiator Coverget Fuctios, Q,h (, z), Geeratig the Biomial Coe ciets,. J-Fractio Epasios for the Biomial Coe ciets, Defiitio (Compoet Sequeces ad Coverget Fuctios for ). For a o-zero idetermiate, let the sequeces, c (),i ad ab(),i, be defied over i as follows: c (),i := ab (),i := 8 >< ( (i )i ), (i )(i 3) 4(i 3) ( i )( i ) if i 3 ( ) if i = >: 0 otherwise.

7 INTEGERS: 8 (08) 7 We the defie the h th coverget fuctios, Cov,h (, z) := P,h (, z)/ Q,h (, z), through the compoet umerator ad deomiator fuctios give recursively by P,h (, z) = ( c (),h z) P,h (, z) ab (),h z P,h (, z) [h = ] () Q,h (, z) = ( c (),h z) Q,h (, z) ab (),h z Q,h (, z) ( c (),z) [h = ] [h = 0]. Listigs of the first several cases of the umerator ad deomiator coverget fuctios, P,h (, z) ad Q,h (, z), are give i Table ad Table, respectively. Propositio (Formulas for the Numerator Coverget Fuctios). For all h ad idetermiate, the umerator coverget fuctios, P,h (, z), have the followig formulas: P h (, z) = =0 h (h ) (h ) (h ) (h ) ( z) = =0 h h h ( z). Proof. The proof follows from () of Defiitio by iductio o h. The claimed formula holds for h = 0,, by the computatios give i Table. Suppose that h 3 ad that the two equivalet formulas stated i the propositio for P,k (, z) are correct for all k < h. I particular, the stated formula holds whe k = h, h. The by epadig () usig our hypothesis, we have that P,k (, z) = ( h(h ) )z (h )(h 3) =0 h h h 3 ( z) ( h)( h )z 4(h 3) 3 =0 h h 3 h 5 ( z), which the implies the followig epasios:

8 INTEGERS: 8 (08) 8 h h 3 P,k (, z) = ( z) =0 h ( h(h ) ) X h h h 3 ( z) (h )(h 3) = h ( h)( h ) X h h 3 h 5 4(h 3) ( z) = h h h 3 ( h(h ) ) = ( z) (h )(h 3) ( h)( h ) h 3 h 5 4(h 3) h 3 h 3 h 3 h h 3 ( z) h h h h h h h (h )(h )( h) (h )(h )( h) i= ( h(h ) ) (h 3)(h )( h) ( )(h )( h)( h) (h 3)(h )(h )( h)( h) Fially, we ca simplify the last equatio ito the form of h h h P,k (, z) = h h h = ( z) ( z). ( z). h h ( z) h h h h The et idetity is used to prove Theorem below. I particular, the coe of the powers of z o the right-had-sides of the stated formulas satisfy ciets h h h ( ) () X i h h (h i) = ( ) i, i i (h i) (h ) i=0 which is proved directly by summig the correspodig hypergeometric terms eactly with Mathematica. Propositio (Formulas for the Deomiator Coverget Fuctios). For all h 0 ad fied idetermiates, we have that the deomiator coverget

9 INTEGERS: 8 (08) 9 fuctios, Q,h (, z), satisfy the followig formula: Q h (, z) = h i=0 i h (h i) z i. (h i) (h ) Proof. The proof agai follows from () of Defiitio by iductio o h. The claimed formula holds whe h = 0,, by the computatios give i Table. Net, we suppose that h 3 ad that the formula stated i the propositio for Q,k (, z) is correct for all k < h. I particular, the stated formulas hold whe k = h, h. The by epadig () usig our iductive hypothesis, we have that h (h ) (h 3 i) Q,h (, z) = z i i (h i) (h 3) i=0 ( h(h ) ) h (h ) (h )(h 3) i (h i) i= ( h)( h ) h 4(h 3) i i= = h hz (h ) h h(h )z h h (h ) = i=0 i= h i h (h i) (h ) (h i) (h i) z i (h 3) (h 3 i) z i (h 5) (h i) z i (h )(h )(h i)( h i) (h ) h(h i)(h i)(h ) (h )i( h(h ) ) h(h 3)(h i)(h ) (h )(h )(i(i )( h) h(h 3)(h i)(h i)(h ) h h (h i) z i. i (h i) (h ) The epasios of the J-fractios ad, more geerally, for ay cotiued fractio whose covergets are defied by the ratio of terms defied recursively as i (), provide additioal recurrece relatios ad eact fiite sums for the h th coverget fuctios, Cov,h (, z), give by [6,.]: Cov,h (, z) = Cov,h (, z) ( )h ab, ab,3 ab,h z h Q,h (, z) Q,h (, z) = ( )z i= ( ) i i i i i 3 i Q,i (, z) Q,i (, z) z i.

10 INTEGERS: 8 (08) 0 Theorem (Mai Theorem I). For itegers h, we have that the h th coverget fuctios, Cov,h (, z), eactly geerate the biomial coe ciets for all 0 apple apple h as [z ] Cov,h (, z) =. Proof. Sice Cov,h (, z) is ratioal i z for all h, Propositio ad Propositio imply the followig fiite di erece equatios for the coe ciets of the coverget fuctios, Cov,h (, z), whe 0 [4,.3]: [z ] Cov,h (, z) = mi(,h) X i= h [z i ] Cov,h (, z) h i (h i) [z ] P,h (, z) [0 apple < h]. (h i) ( ) i (h ) We must show that [z ] Cov,h (, z) = i the separate cases where 0 apple < h ad whe = h. For the first case, we use iductio o to show our result. Sice [z 0 ]F (z)/g(z) = F (0)/G(0) for ay fuctios, F (z) ad G(z), with a power series epasio i z about zero, we have by the two propositios above that [z 0 ] Cov,h (, z) = 0 0 for all h. Net, we suppose that for h > ad all k <, [z k ] Cov,h (, z) = k k. Sice 0 apple i < for all i i the right-had-side sum of (3), we ca apply the iductive hypothesis, combied with the observatio i () from the proof of Propositio, to the recurrece relatio i the previous equatio to obtai that whe < h we have X h i h [z (h i) ] Cov,h (, z) = ( ) i i i (h i) (h ) i= X h i h (h i) ( ) i i i (h i) (h ) i=0 =. To prove the claim i the first special case of (3) where [z ] P,h (, z) 0, i.e., precisely whe = h, we use a alterate approach to evaluatig these sums by eactly summig with Mathematica as X h i h [z (h i) ] Cov,h (, z) = ( ) i i i (h i) (h ) i= = ( 3 F ( h,, ( h); h, ( ); ), ) where p F q (a,..., a p ; b,..., b q ; z) deotes the geeralized hypergeometric fuctio whose coe ciets whe epaded i powers of z are give by the et Pochhammer (3)

11 INTEGERS: 8 (08) symbol products [6, 6]: pf q (a,..., a p ; b,..., b q ; z) = X k 0 (a ) k (a p ) k k (b ) k (b q ) k z k. Whe h =, the terms cotributed by the geeralized hypergeometric fuctio i the previous equatio are zero-valued. Therefore whe = h, we have that [z ] Cov,h (, z) =. We ca actually prove a stroger statemet of Theorem which provides that [z ] Cov,h (, z) = for all 0 apple < h, though for the purposes of showig that our J-fractio epasios defied by Defiitio are correct, the proof of the theorem give above su ces to show the result. Oe cosequece of the theorem is that we have the followig fiite sums eactly geeratig,, for ay ad all 0, i.e., i the case of (3) where h = : = i= X i ( ) i [ = 0]. i i i i Corollary (Cogrueces for Modulo Itegers h ). For h, let h() := Q h i= ab,i, or equivaletly, let h() ( )h h h h / h 3 h. For all h, m h, 0 apple apple h, ad 0, wheever m() Z ad h m(), we have the followig cogrueces cogrueces for the biomial coe ciets modulo h: X m i m (m i) ( ) i i i (m i) (m ) i= m m m [0 apple < m] (mod h). Proof. The result is a immediate corollary of (3) from the proof of Theorem ad the J-fractio coe ciet cogruece properties cited i property (C) of Sectio. i the itroductio [] [4, cf. 5.7]. Remark 3 (Eact Cogrueces for the Biomial Coe ciets). We cojecture that i fact for all h, h > 0, ad < h, which typically correspods to the cases of the biomial coe ciets that we actually wish to evaluate modulo i.e., sice ( ) k = 0 for all k 0 ad where for all itegers the et hypergeometric sum is evaluated eactly with Mathematica as X ( ) k k ( k) = 0. k ( ) k=0

12 INTEGERS: 8 (08) h, that h i i i= i h (h i) (h i) ( ) i (mod h), (h ) (4) at a miimum for ay such that h evely divides h() as a iteger factor, though other choices of the idetermiate may correctly yield cogruece modulo h. Give this restrictio o the modulo each h, we the defie the correspodig ide sets ( h h 3 M h := Z : Z). h h h h The first few particular special cases of these restricted ide sets iclude ( ) M = : Z = { : 0, 3 mod 4} 4 ( )( )( ) M 3 = : Z 6 = { : 0,, 7, 0, 6, 9, 5, 6 mod 7} ( )( )( )( )( 3) M 4 = : Z 8800 = { : 0,,, 7,, 7,, 3, 4 mod 5} \ { : 0,,, 3, 4, 7, 8, 9, 30, 3 mod 3} ( )( )( )( )( )( 3)( 4) M 5 = : Z = { : 0,,, 3,,, 3, 4 mod 5} \ { : 0,,, 3, 0, 7, 4, 3, 38, 45, 46, 47, 48 mod 49}. Now usig these results, we ca epad these special case cogrueces for modulo, 3, 4, ad 5 as follows: ( ) ( )( ) (mod ), 3 6 3( 3) 5 3( )( 3) 0 3 ( )( )( 3) 60 3 for all M (mod 3), for all M 3

13 INTEGERS: 8 (08) 3 4( 4) 7 ( 3)( 4) 7 3 ( )( 3)( 4) 05 ( )( )( 3)( 4) ( 5) 5( 4)( 5) ( 3)( 4)( 5) ( )( 3)( 4)( 5) ( )( )( 3)( 4)( 5) (mod 4), for all M 4 (mod 5), for all M 5. We also otice that oce we kow the restricted sets M h for ay h, the cogrueces epaded above provide us with ew iformatio about the cetral biomial coe ciets, for M h \ N, modulo prime ad composite choices of h. Eample 4 (Divisors of the Cetral Biomial Coe ciets). Oe famous eample of a problem we ca approach usig the ew machiery proved i this article is stated i [7, 4]. The problem (ad its prize) due to Ro Graham is to determie whether there are ifiitely may such that is relatively prime to 05, or equivaletly, to fid the sequece of such that oe of the idividual prime factors divide the th cetral biomial coe ciet: 3, 5, 7 -. Two of the cogrueces eplicitly epaded i the previous equatios imply ew geeratig fuctios for two of the three cases we eed to cosider i Graham s problem. For ay iteger modulus h, we set B cet,h (z) := X (mod p) z. M p\n We ca easily compute (i.e., usig Mathematica) that the o-idetically-zero coe ciets of the et geeratig fuctios, deoted by B e cet,h (z), are cogruet to the respective coe ciets of B cet,h (z) defied i the last equatio. For h {, 3}, particular cocrete eamples of these geeratig fuctios are epaded as eb cet, (z) = ˆB(z) 3 ˆB(z) 5 3 ˆB(z) 3 3 ˆB(z) 5 eb cet,3 (z) = 5 z ˆB(z) 64 ˆB(z) ˆB(z) ˆB(z) 5 56 ˆB(z) 7,

14 INTEGERS: 8 (08) 4 i powers of the ordiary geeratig fuctio for the cetral biomial coe defied by ˆB(z) := X z = p. 0 4z ciets It is easy to see by iductio from (4) that for higher-order h > 5, a geeral formula for the epasios of the geeratig fuctios B e cet,h (z) ca be epressed as a sum of a ratioal fuctio of z of small degree less tha h plus a fiite sum of odd powers of ˆB(z) m for m [, h ] \ Z \ Z. We ca the obtai formulas for most of the mod h whe M h by Faà di Bruo s formula or directly by takig the Cauchy products correspodig to multiple covolutios of the cetral biomial geeratig fuctio defied above. Corollary (Reductio of Order of the Biomial Coe ciets). For itegers r, p such that p r 0, let the sequeces, k r,p (), be defied as p r p r k r,p () = ( ) p r. p r r r For all itegers p, q 0, we have a additio theorem for the biomial coe ciets give by mi(p,q) p q X ( ) pq = k 0,p ()k 0,q () p q i= i()k i,p ()k i,q (), where h() is defied as i Corollary. Proof. We ca prove the result usig the matri method from [,, p. 33] ad [0, ]. I particular, for itegers p r 0, let the fuctios, e k r,p (), deote the solutios to the matri equatio 3 e k0, () e k, () 0 0 e k0, () e k, () e k, () e k0,3 () e k,3 () e k,3 () e k3,3 () e k0,0 () c, 0 0 e = k0, () e k, () 0 0 ab, c, e k0, () e k, () e k, () ab,3 c,3 7 5, (5) where here we defie e k 0,p () := p p for all p 0. We claim that for all itegers p, r 0 with p r 0, the two fuctios, k r,p () ad e k r,p (), are equal. To prove

15 INTEGERS: 8 (08) 5 the claim, we otice that for fied p, equatio (5) implies recurrece relatios over r give by e k,p () = ab, ek0,p () e kr,p () = c, ek 0,p (), p ab,r ekr,p () e kr,p () c,r ek r,p (), p > r. The first recurrece relatio provides that for p e p p k,p = ( ) p ( ) p ( ) ( ) p p = ( )p (p ) ( )(p ) ( p ) (p )( )(p ) p p ( )p p =, (p ) p which is the same as the formula for k,p () stated above. We ca the use the secod recurrece relatio to complete the proof of the claim by iductio o r. Whe r = 0,, we have that the two formulas for k r,p () ad e k r,p () coicide. We suppose that the claim is true for some r, which by the previous recurrece relatio i tur implies that e kr,p() = 4 (r ) ( r)( r ) = ( ) p r p p r ( ) p r p p r p p r p p ( ) r p p r p r p r r r ( )p r ( (r )(r ) ) p (r )(r ) p r r p r 4(r ) r r (r )( r ) p p r p p (p )(p )(r ) (p r)(p r)(r )(r ) (p r)(p r)(r )(r ) 4(p r)(p r)(r )(r ) ( (r )(r ) )(p r)(r ) (p r)(r )(r ) = ( ) p r p r p r. p r r r Sice the two formulas are equivalet, we obtai the et form of the additio formula, or alterately, a formula providig a reductio of the order of the upper

16 INTEGERS: 8 (08) 6 ad lower idices to the biomial coe ciets,, give by the epasio i the refereces i the followig forms for all itegers p, q 0: ( ) pq p q = k 0,pk 0,q ab, k,pk,q ab, ab,3 k,pk,q p q = ( ) pq p p mi(p,q) q q X ( ) pq i() i= p p i q q i i i p i q i. i i Eample 5. We otice that this result provides eact fiite sum epasios of the biomial coe ciets,, for ay ad 0 which hold modulo ay itegers h (prime or composite), ad compare the reductio i the upper ad lower coe ciet idices to the cogruece result provided by Lucas theorem ad its related variats stated i the itroductio. For a cocrete eample, let p = q = i Corollary. The we obtai that 4 = ( ) ( ) ( ( )( )( ) ) ( ) 7 ( 4)( 3)( )( ) =. 4 Furthermore, if we let Z ad specialize = p = q := i the corollary above, we are able to obtai the ew sum 3 X i = ( ) i i i i i= 6 = ( ). Related idetities ad cogrueces are formulated similarly by takig each of, p, q to be iteger multiples of the positive iteger specified i the previous eample. 3. J-Fractio Epasios for the Biomial Coe ciets, We ca costruct (ad formally prove) similar coverget-based J-fractio costructios eumeratig the biomial coe ciets,, for a idetermiate ad 0. Sice the proofs for the propositios, theorem, ad corollaries i this sectio are almost idetical to those give i the case of the biomial coe ciet variats,, i Sectio, we omit the proofs of the et results stated below. We begi with

17 INTEGERS: 8 (08) 7 the defiitio of the compoet sequeces ad coverget fuctios correspodig to the J-fractios geeratig the biomial coe ciets,, i this case. Defiitio 6 (Compoet Sequeces ad Coverget Fuctios for ). For a fied o-zero idetermiate ad i, we defie the compoet sequeces,, as follows: c (),i ad ab(),i c (),i := ab (),i := 8 >< (i )(i 3) (i ) 4(i 3) ( i )( i ) if i 3 ( ) if i = >: 0 otherwise. For h 0, we defie the h th coverget fuctios, Cov,h (, z) := P,h (, z)/ Q,h (, z), recursively through the compoet fuctios i the forms of P,h (, z) = ( c (),h z) P,h (, z) ab (),h z P,h (, z) [h = ] (6) Q,h (, z) = ( c (),h z) Q,h (, z) ab (),h z Q,h (, z) ( c (),z) [h = ] [h = 0]. Listigs of the first several cases of the umerator ad deomiator coverget fuctios, P,h (, z) ad Q,h (, z), are give i Table 3 ad Table 4, respectively. h P,h (, z) z 3 5 ( 3)z 0 ( )( 3)z ( 4)z 4 ( 3)( 4)z 0 ( )( 3)( 4)z ( 5)z ( 4)( 5)z 6 ( 3)( 4)( 5)z3 ()(3)(4)(5) 304 z ( 6)z ( 5)( 6)z 99 ( 4)( 5)( 6)z3 (3)(4)(5)(6) 584 z 4 ()(3)(4)(5)(6) z 5 Table 3: The Numerator Coverget Fuctios, P,h (, z), Geeratig the Biomial Coe ciets,

18 INTEGERS: 8 (08) 8 h Q,h (, z) z 3 4 ( 3 )z ( 6 )z 3 5 )z 3 ( 0 )( )z ( 60 )( )z3 4 ( 3)( )z ( )( )( )z3 ( 3)( )( )z ( 4)z 5 5 ( 4)( 3)z ( 4)( 3)( )z ( 4)( 3)( )( ) ( 4)( 3)( )( ) z z ( 5)z 3 ( 5)( 4)z ( 5)( 4)( 3)z3 99 ( 5)( 4)( 3)( )( ) ( 5)( 4)( 3)( )z4 58 ( 5)( 4)( 3)( )( ) z z 5 Table 4: The Deomiator Coverget Fuctios, Q,h (, z), Geeratig the Biomial Coe ciets, Propositio 3 (Coverget Fuctio Formulas). For all h ad a fied idetermiate, the umerator ad deomiator coverget fuctios, P,h (, z) ad Q,h (, z), each satisfy the followig respective formulas: h (h ) (h ) P,h (, z) = z (h ) (h ) =0 h h h = z =0 h i h (h i) Q,h (, z) = ( z) i. i (h i) (h ) i=0 Theorem 7 (Mai Theorem II). For all itegers h ad 0 apple apple h, we have that the h th coverget fuctios, Cov,h (, z), eactly geerate the biomial coe ciets as [z ] Cov,h (, z) =. As i Sectio, we remark that oe cosequece of the secod mai theorem resultig from the propositio above is that we have a ew proof of the et eact formula geeratig the biomial coe ciets,, for ay ad all 0: = X i= i i ( ) i [ = 0]. i i i Corollary 3 (Cogrueces for Modulo Itegers h ). Let the hth modulus, h(), of the J-fractio defied by Defiitio 6 correspod to the defiitios

19 INTEGERS: 8 (08) 9 give i Corollary. For all h, m h, 0 apple apple h, ad 0, wheever m() Z ad h m(), we have the followig cogrueces cogrueces for the biomial coe ciets,, modulo h: X m i m (m i) ( ) i i i (m i) (m ) i= m m m [0 apple < m] (mod h). Remark 8 (Eact Cogrueces for Special Cases). We agai cojecture that for all h ad all, 0, we have cogrueces for the biomial coe ciets,, of the form h i h h i i i i ( ) i h h h i= (mod h), for all M h, where the sets M h are defied as i Remark 3 of the previous sectio. We ca the epad the first several special cases of these cogrueces usig this result as follows: ( ) 3 3( ) 5 4( 3) 7 5( 4) 9 ( ) ( )( 3) [ apple ] (mod ), for all M 6 6 3( )( ) ( )( ) ( 3)( 4)( 5) 3 [ apple ] (mod 3), for all M 3 60 ( )( 3) ( )( )( 3) ( )( )( 3) ( 4)( 5)( 6)( 7) 4 [ apple 3] (mod 4), for all M ( 3)( 4) 5( )( 3)( 4) ( )( )( 3)( 4) ( )( )( 3)( 4) 50 5 ( 5)( 6)( 7)( 8)( 9) 5 [ apple 4] (mod 5), for all M Corollary 4 (Reductio Formulas for ). Let the fuctios, k r,s() be defied for all s r 0 as r r r s k r,s () =. s r r r

20 INTEGERS: 8 (08) 0 We have a correspodig additio, or lower ide reductio, formula for the biomial coe ciets,, give by the followig equatios for itegers p, q 0: p q pq mi(p,q) X = k 0,p ()k 0,q () = p q mi(p,q) X i= i= ( ) i i p i i()k i,p ()k i,q () pi i i q i qi i i i i i i i i. We ca agai compare the statemets of the two summatio formulas i the corollary to the biomial coe ciet epasios i the statemet of Lucas theorem from the itroductio modulo ay prime p. 4. Coclusios We have established the forms of two ew Jacobi-type J-fractio epasios providig ordiary geeratig fuctios for the biomial coe ciets, ad, for ay ad all 0. The key igrediets to the proofs of these series epasios are the ratioality of the h th covergets, Cov i,h (, z), for all h ad closed-form formulas for the correspodig umerator ad deomiator fuctio sequeces, which are fiite-degree polyomials i z with deg z {P i,h (, z)} = h ad deg z {Q i,h (, z)} = h for all h whe i =,. The fiite di erece equatios implied by the ratioality of the h th coverget fuctios at each h lead to ew eact formulas for, ad ew cogrueces satisfied by, the two biomial coe ciet variats studied withi the article. We ote that ulike the J-fractio epasios eumeratig the geeralized factorial fuctios studied i [9], the h th modulus, h(), of these J-fractios defied i Corollary is ot strictly iteger-valued for all ad h, which complicates the formulatios of the ew cogruece properties for the biomial coe ciet variats cosidered i the article. We also compare the two forms of the additio, or reductio of ide, formulas for these coe ciets stated i Corollary ad i Corollary 4 to the forms of Lucas s theorem ad to the prime power cogrueces cited i the itroductio, which similarly reduce the upper ad lower idices to these sequeces with respect to powers of prime moduli. New research directios based o the results i this article iclude further study of the biomial coe ciet cogrueces give i Sectio ad Sectio 3 modulo composite itegers h 4. I particular, oe directio for future research based o these topics is to fid eact formulas for doubly-ideed sequeces of multipliers, em i,h,, such that em,h, [z ] Cov,h (, z) (mod h) ad em,h,[z ] Cov,h (, z) (mod h) for all itegers, 0. This applicatio is surely a o-trivial task worthy of further study ad cosideratio based o the results we prove here.

21 INTEGERS: 8 (08) Refereces [] P. Flajolet, Combiatorial aspects of cotiued fractios, Discrete Math. 3 (980), 5 6. [] P. Flajolet, O cogrueces ad cotiued fractios for some classical combiatorial quatities, Discrete Math. 4 (98), [3] A. Graville, Biomial coe ciets modulo prime powers, adrew/biomial/ (996). [4] S. K. Lado, Lectures o Geeratig Fuctios, America Mathematical Society, USA, 00. [5] R. Me strović, Lucas theorem: Its geeralizatios, etesios ad applicatios (878 04), (04). [6] F. W. J. Olver, D. W. Lozier, R. F. Boisvert, ad C. W. Clark, NIST Hadbook of Mathematical Fuctios, Cambridge Uiversity Press, 00. [7] C. Pomerace, Divisors of the middle biomial coe ciet, Amer. Math. Mothly (04). [8] M. D. Schmidt, Geeralized j factorial fuctios, polyomials, ad applicatios, J. Iteger Seq. 3 (00). [9] M. D. Schmidt, Jacobi-type cotiued fractios for the ordiary geeratig fuctios of geeralized factorial fuctios, J. Iteger Seq. 0 (07). [0] H. S. Wall, Aalytic Theory of Cotiued Fractios, Chelsea Publishig Compay, 948.

1 Generating functions for balls in boxes

1 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 information

Continued Fractions and Pell s Equation

Continued Fractions and Pell s Equation Max Lah Joatha Spiegel May, 06 Abstract Cotiued fractios provide a useful, ad arguably more atural, way to uderstad ad represet real umbers as a alterative to decimal expasios I this paper, we eumerate

More information

FLOOR AND ROOF FUNCTION ANALOGS OF THE BELL NUMBERS. H. W. Gould Department of Mathematics, West Virginia University, Morgantown, WV 26506, USA

FLOOR AND ROOF FUNCTION ANALOGS OF THE BELL NUMBERS. H. W. Gould Department of Mathematics, West Virginia University, Morgantown, WV 26506, USA 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

More information

#A51 INTEGERS 14 (2014) MULTI-POLY-BERNOULLI-STAR NUMBERS AND FINITE MULTIPLE ZETA-STAR VALUES

#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

Comparison Study of Series Approximation. and Convergence between Chebyshev. and Legendre Series

Comparison Study of Series Approximation. and Convergence between Chebyshev. and Legendre Series Applied Mathematical Scieces, Vol. 7, 03, o. 6, 3-337 HIKARI Ltd, www.m-hikari.com http://d.doi.org/0.988/ams.03.3430 Compariso Study of Series Approimatio ad Covergece betwee Chebyshev ad Legedre Series

More information

CSE 1400 Applied Discrete Mathematics Number Theory and Proofs

CSE 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 information

Section 1 of Unit 03 (Pure Mathematics 3) Algebra

Section 1 of Unit 03 (Pure Mathematics 3) Algebra Sectio 1 of Uit 0 (Pure Mathematics ) Algebra Recommeded Prior Kowledge Studets should have studied the algebraic techiques i Pure Mathematics 1. Cotet This Sectio should be studied early i the course

More information

Course : Algebraic Combinatorics

Course : Algebraic Combinatorics Course 8.32: Algebraic Combiatorics Lecture Notes # Addedum by Gregg Musier February 4th - 6th, 2009 Recurrece Relatios ad Geeratig Fuctios Give a ifiite sequece of umbers, a geeratig fuctio is a compact

More information

MATH 324 Summer 2006 Elementary Number Theory Solutions to Assignment 2 Due: Thursday July 27, 2006

MATH 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 information

Some p-adic congruences for p q -Catalan numbers

Some 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 information

MATH 304: MIDTERM EXAM SOLUTIONS

MATH 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 information

Factors of sums and alternating sums involving binomial coefficients and powers of integers

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

PROBLEM SET 5 SOLUTIONS 126 = , 37 = , 15 = , 7 = 7 1.

PROBLEM SET 5 SOLUTIONS 126 = , 37 = , 15 = , 7 = 7 1. Math 7 Sprig 06 PROBLEM SET 5 SOLUTIONS Notatios. Give a real umber x, we will defie sequeces (a k ), (x k ), (p k ), (q k ) as i lecture.. (a) (5 pts) Fid the simple cotiued fractio represetatios of 6

More information

REGULARIZATION OF CERTAIN DIVERGENT SERIES OF POLYNOMIALS

REGULARIZATION OF CERTAIN DIVERGENT SERIES OF POLYNOMIALS REGULARIZATION OF CERTAIN DIVERGENT SERIES OF POLYNOMIALS LIVIU I. NICOLAESCU ABSTRACT. We ivestigate the geeralized covergece ad sums of series of the form P at P (x, where P R[x], a R,, ad T : R[x] R[x]

More information

MAT1026 Calculus II Basic Convergence Tests for Series

MAT1026 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 information

A.1 Algebra Review: Polynomials/Rationals. Definitions:

A.1 Algebra Review: Polynomials/Rationals. Definitions: MATH 040 Notes: Uit 0 Page 1 A.1 Algera Review: Polyomials/Ratioals Defiitios: A polyomial is a sum of polyomial terms. Polyomial terms are epressios formed y products of costats ad variales with whole

More information

n=1 a n is the sequence (s n ) n 1 n=1 a n converges to s. We write a n = s, n=1 n=1 a n

n=1 a n is the sequence (s n ) n 1 n=1 a n converges to s. We write a n = s, n=1 n=1 a n Series. Defiitios ad first properties A series is a ifiite sum a + a + a +..., deoted i short by a. The sequece of partial sums of the series a is the sequece s ) defied by s = a k = a +... + a,. k= Defiitio

More information

Infinite Series and Improper Integrals

Infinite Series and Improper Integrals 8 Special Fuctios Ifiite Series ad Improper Itegrals Ifiite series are importat i almost all areas of mathematics ad egieerig I additio to umerous other uses, they are used to defie certai fuctios ad to

More information

Sequences of Definite Integrals, Factorials and Double Factorials

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

Infinite Sequences and Series

Infinite 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 information

Once we have a sequence of numbers, the next thing to do is to sum them up. Given a sequence (a n ) n=1

Once 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 information

Series with Central Binomial Coefficients, Catalan Numbers, and Harmonic Numbers

Series 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 information

Math 220A Fall 2007 Homework #2. Will Garner A

Math 220A Fall 2007 Homework #2. Will Garner A Math 0A Fall 007 Homewor # Will Garer Pg 3 #: Show that {cis : a o-egative iteger} is dese i T = {z œ : z = }. For which values of q is {cis(q): a o-egative iteger} dese i T? To show that {cis : a o-egative

More information

The Structure of Z p when p is Prime

The Structure of Z p when p is Prime LECTURE 13 The Structure of Z p whe p is Prime Theorem 131 If p > 1 is a iteger, the the followig properties are equivalet (1) p is prime (2) For ay [0] p i Z p, the equatio X = [1] p has a solutio i Z

More information

We are mainly going to be concerned with power series in x, such as. (x)} converges - that is, lims N n

We are mainly going to be concerned with power series in x, such as. (x)} converges - that is, lims N n Review of Power Series, Power Series Solutios A power series i x - a is a ifiite series of the form c (x a) =c +c (x a)+(x a) +... We also call this a power series cetered at a. Ex. (x+) is cetered at

More information

In number theory we will generally be working with integers, though occasionally fractions and irrationals will come into play.

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

and each factor on the right is clearly greater than 1. which is a contradiction, so n must be prime.

and each factor on the right is clearly greater than 1. which is a contradiction, so n must be prime. MATH 324 Summer 200 Elemetary Number Theory Solutios to Assigmet 2 Due: Wedesday July 2, 200 Questio [p 74 #6] Show that o iteger of the form 3 + is a prime, other tha 2 = 3 + Solutio: If 3 + is a prime,

More information

Harmonic Number Identities Via Euler s Transform

Harmonic 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 information

Math 475, Problem Set #12: Answers

Math 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 information

arxiv: v1 [math.nt] 10 Dec 2014

arxiv: 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

SOME TRIBONACCI IDENTITIES

SOME 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 information

Hoggatt and King [lo] defined a complete sequence of natural numbers

Hoggatt 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 information

The log-behavior of n p(n) and n p(n)/n

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

Mathematics review for CSCI 303 Spring Department of Computer Science College of William & Mary Robert Michael Lewis

Mathematics 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 information

Q-BINOMIALS AND THE GREATEST COMMON DIVISOR. Keith R. Slavin 8474 SW Chevy Place, Beaverton, Oregon 97008, USA.

Q-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 information

Some identities involving Fibonacci, Lucas polynomials and their applications

Some 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 information

7.1 Convergence of sequences of random variables

7.1 Convergence of sequences of random variables Chapter 7 Limit Theorems Throughout this sectio we will assume a probability space (, F, P), i which is defied a ifiite sequece of radom variables (X ) ad a radom variable X. The fact that for every ifiite

More information

k-generalized FIBONACCI NUMBERS CLOSE TO THE FORM 2 a + 3 b + 5 c 1. Introduction

k-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 information

Some remarks for codes and lattices over imaginary quadratic

Some remarks for codes and lattices over imaginary quadratic Some remarks for codes ad lattices over imagiary quadratic fields Toy Shaska Oaklad Uiversity, Rochester, MI, USA. Caleb Shor Wester New Eglad Uiversity, Sprigfield, MA, USA. shaska@oaklad.edu Abstract

More information

3 Gauss map and continued fractions

3 Gauss map and continued fractions ICTP, Trieste, July 08 Gauss map ad cotiued fractios I this lecture we will itroduce the Gauss map, which is very importat for its coectio with cotiued fractios i umber theory. The Gauss map G : [0, ]

More information

Recurrence Relations

Recurrence 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 information

MT5821 Advanced Combinatorics

MT5821 Advanced Combinatorics MT5821 Advaced Combiatorics 9 Set partitios ad permutatios It could be said that the mai objects of iterest i combiatorics are subsets, partitios ad permutatios of a fiite set. We have spet some time coutig

More information

Practical Spectral Anaysis (continue) (from Boaz Porat s book) Frequency Measurement

Practical Spectral Anaysis (continue) (from Boaz Porat s book) Frequency Measurement Practical Spectral Aaysis (cotiue) (from Boaz Porat s book) Frequecy Measuremet Oe of the most importat applicatios of the DFT is the measuremet of frequecies of periodic sigals (eg., siusoidal sigals),

More information

CHAPTER 10 INFINITE SEQUENCES AND SERIES

CHAPTER 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 information

SOME TRIGONOMETRIC IDENTITIES RELATED TO POWERS OF COSINE AND SINE FUNCTIONS

SOME TRIGONOMETRIC IDENTITIES RELATED TO POWERS OF COSINE AND SINE FUNCTIONS Folia Mathematica Vol. 5, No., pp. 4 6 Acta Uiversitatis Lodziesis c 008 for Uiversity of Lódź Press SOME TRIGONOMETRIC IDENTITIES RELATED TO POWERS OF COSINE AND SINE FUNCTIONS ROMAN WITU LA, DAMIAN S

More information

Chapter 2. Periodic points of toral. automorphisms. 2.1 General introduction

Chapter 2. Periodic points of toral. automorphisms. 2.1 General introduction Chapter 2 Periodic poits of toral automorphisms 2.1 Geeral itroductio The automorphisms of the two-dimesioal torus are rich mathematical objects possessig iterestig geometric, algebraic, topological ad

More information

Roger Apéry's proof that zeta(3) is irrational

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 information

De la Vallée Poussin Summability, the Combinatorial Sum 2n 1

De 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 information

Find a formula for the exponential function whose graph is given , 1 2,16 1, 6

Find a formula for the exponential function whose graph is given , 1 2,16 1, 6 Math 4 Activity (Due by EOC Apr. ) Graph the followig epoetial fuctios by modifyig the graph of f. Fid the rage of each fuctio.. g. g. g 4. g. g 6. g Fid a formula for the epoetial fuctio whose graph is

More information

THE ASYMPTOTIC COMPLEXITY OF MATRIX REDUCTION OVER FINITE FIELDS

THE 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 information

Product measures, Tonelli s and Fubini s theorems For use in MAT3400/4400, autumn 2014 Nadia S. Larsen. Version of 13 October 2014.

Product 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 information

A LIMITED ARITHMETIC ON SIMPLE CONTINUED FRACTIONS - II 1. INTRODUCTION

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

Topics. Homework Problems. MATH 301 Introduction to Analysis Chapter Four Sequences. 1. Definition of convergence of sequences.

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

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

Problem. Consider the sequence a j for j N defined by the recurrence a j+1 = 2a j + j for j > 0

Problem. Consider the sequence a j for j N defined by the recurrence a j+1 = 2a j + j for j > 0 GENERATING FUNCTIONS Give a ifiite sequece a 0,a,a,, its ordiary geeratig fuctio is A : a Geeratig fuctios are ofte useful for fidig a closed forula for the eleets of a sequece, fidig a recurrece forula,

More information

Sequences A sequence of numbers is a function whose domain is the positive integers. We can see that the sequence

Sequences A sequence of numbers is a function whose domain is the positive integers. We can see that the sequence Sequeces A sequece of umbers is a fuctio whose domai is the positive itegers. We ca see that the sequece 1, 1, 2, 2, 3, 3,... is a fuctio from the positive itegers whe we write the first sequece elemet

More information

On Divisibility concerning Binomial Coefficients

On Divisibility concerning Binomial Coefficients A talk give at the Natioal Chiao Tug Uiversity (Hsichu, Taiwa; August 5, 2010 O Divisibility cocerig Biomial Coefficiets Zhi-Wei Su Najig Uiversity Najig 210093, P. R. Chia zwsu@ju.edu.c http://math.ju.edu.c/

More information

Physics 116A Solutions to Homework Set #1 Winter Boas, problem Use equation 1.8 to find a fraction describing

Physics 116A Solutions to Homework Set #1 Winter Boas, problem Use equation 1.8 to find a fraction describing Physics 6A Solutios to Homework Set # Witer 0. Boas, problem. 8 Use equatio.8 to fid a fractio describig 0.694444444... Start with the formula S = a, ad otice that we ca remove ay umber of r fiite decimals

More information

Notes on iteration and Newton s method. Iteration

Notes on iteration and Newton s method. Iteration Notes o iteratio ad Newto s method Iteratio Iteratio meas doig somethig over ad over. I our cotet, a iteratio is a sequece of umbers, vectors, fuctios, etc. geerated by a iteratio rule of the type 1 f

More information

Proc. Amer. Math. Soc. 139(2011), no. 5, BINOMIAL COEFFICIENTS AND THE RING OF p-adic INTEGERS

Proc. Amer. Math. Soc. 139(2011), no. 5, BINOMIAL COEFFICIENTS AND THE RING OF p-adic INTEGERS Proc. Amer. Math. Soc. 139(2011, o. 5, 1569 1577. BINOMIAL COEFFICIENTS AND THE RING OF p-adic INTEGERS Zhi-Wei Su* ad Wei Zhag Departmet of Mathematics, Naig Uiversity Naig 210093, People s Republic of

More information

David Vella, Skidmore College.

David 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 information

( ) ( ) ( ) ( ) ( + ) ( )

( ) ( ) ( ) ( ) ( + ) ( ) LSM Nov. 00 Cotet List Mathematics (AH). Algebra... kow ad use the otatio!, C r ad r.. kow the results = r r + + = r r r..3 kow Pascal's triagle. Pascal's triagle should be eteded up to = 7...4 kow ad

More information

Seunghee Ye Ma 8: Week 5 Oct 28

Seunghee 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 information

The Ratio Test. THEOREM 9.17 Ratio Test Let a n be a series with nonzero terms. 1. a. n converges absolutely if lim. n 1

The Ratio Test. THEOREM 9.17 Ratio Test Let a n be a series with nonzero terms. 1. a. n converges absolutely if lim. n 1 460_0906.qxd //04 :8 PM Page 69 SECTION 9.6 The Ratio ad Root Tests 69 Sectio 9.6 EXPLORATION Writig a Series Oe of the followig coditios guaratees that a series will diverge, two coditios guaratee that

More information

Math 155 (Lecture 3)

Math 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 information

6.3 Testing Series With Positive Terms

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

Math 2784 (or 2794W) University of Connecticut

Math 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 information

In algebra one spends much time finding common denominators and thus simplifying rational expressions. For example:

In algebra one spends much time finding common denominators and thus simplifying rational expressions. For example: 74 The Method of Partial Fractios I algebra oe speds much time fidig commo deomiators ad thus simplifyig ratioal epressios For eample: + + + 6 5 + = + = = + + + + + ( )( ) 5 It may the seem odd to be watig

More information

BINOMIAL PREDICTORS. + 2 j 1. Then n + 1 = The row of the binomial coefficients { ( n

BINOMIAL PREDICTORS. + 2 j 1. Then n + 1 = The row of the binomial coefficients { ( n BINOMIAL PREDICTORS VLADIMIR SHEVELEV arxiv:0907.3302v2 [math.nt] 22 Jul 2009 Abstract. For oegative itegers, k, cosider the set A,k = { [0, 1,..., ] : 2 k ( ). Let the biary epasio of + 1 be: + 1 = 2

More information

Benaissa Bernoussi Université Abdelmalek Essaadi, ENSAT de Tanger, B.P. 416, Tanger, Morocco

Benaissa Bernoussi Université Abdelmalek Essaadi, ENSAT de Tanger, B.P. 416, Tanger, Morocco EXTENDING THE BERNOULLI-EULER METHOD FOR FINDING ZEROS OF HOLOMORPHIC FUNCTIONS Beaissa Beroussi Uiversité Abdelmalek Essaadi, ENSAT de Tager, B.P. 416, Tager, Morocco e-mail: Beaissa@fstt.ac.ma Mustapha

More information

September 2012 C1 Note. C1 Notes (Edexcel) Copyright - For AS, A2 notes and IGCSE / GCSE worksheets 1

September 2012 C1 Note. C1 Notes (Edexcel) Copyright   - For AS, A2 notes and IGCSE / GCSE worksheets 1 September 0 s (Edecel) Copyright www.pgmaths.co.uk - For AS, A otes ad IGCSE / GCSE worksheets September 0 Copyright www.pgmaths.co.uk - For AS, A otes ad IGCSE / GCSE worksheets September 0 Copyright

More information

Subject: Differential Equations & Mathematical Modeling-III

Subject: Differential Equations & Mathematical Modeling-III Power Series Solutios of Differetial Equatios about Sigular poits Subject: Differetial Equatios & Mathematical Modelig-III Lesso: Power series solutios of differetial equatios about Sigular poits Lesso

More information

Applied Mathematics Letters. On the properties of Lucas numbers with binomial coefficients

Applied 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 information

Math 25 Solutions to practice problems

Math 25 Solutions to practice problems Math 5: Advaced Calculus UC Davis, Sprig 0 Math 5 Solutios to practice problems Questio For = 0,,, 3,... ad 0 k defie umbers C k C k =! k!( k)! (for k = 0 ad k = we defie C 0 = C = ). by = ( )... ( k +

More information

Math 104: Homework 2 solutions

Math 104: Homework 2 solutions Math 04: Homework solutios. A (0, ): Sice this is a ope iterval, the miimum is udefied, ad sice the set is ot bouded above, the maximum is also udefied. if A 0 ad sup A. B { m + : m, N}: This set does

More information

The Phi Power Series

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

Sequences, Mathematical Induction, and Recursion. CSE 2353 Discrete Computational Structures Spring 2018

Sequences, 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 information

A Note on the Symmetric Powers of the Standard Representation of S n

A Note on the Symmetric Powers of the Standard Representation of S n A Note o the Symmetric Powers of the Stadard Represetatio of S David Savitt 1 Departmet of Mathematics, Harvard Uiversity Cambridge, MA 0138, USA dsavitt@mathharvardedu Richard P Staley Departmet of Mathematics,

More information

Math 140A Elementary Analysis Homework Questions 1

Math 140A Elementary Analysis Homework Questions 1 Math 14A Elemetary Aalysis Homewor Questios 1 1 Itroductio 1.1 The Set N of Natural Numbers 1 Prove that 1 2 2 2 2 1 ( 1(2 1 for all atural umbers. 2 Prove that 3 11 (8 5 4 2 for all N. 4 (a Guess a formula

More information

COMPLEX FACTORIZATIONS OF THE GENERALIZED FIBONACCI SEQUENCES {q n } Sang Pyo Jun

COMPLEX FACTORIZATIONS OF THE GENERALIZED FIBONACCI SEQUENCES {q n } Sang Pyo Jun Korea J. Math. 23 2015) No. 3 pp. 371 377 http://dx.doi.org/10.11568/kjm.2015.23.3.371 COMPLEX FACTORIZATIONS OF THE GENERALIZED FIBONACCI SEQUENCES {q } Sag Pyo Ju Abstract. I this ote we cosider a geeralized

More information

(2) F j+2 = F J+1 + F., F ^ = 0, F Q = 1 (j = -1, 0, 1, 2, ). Editorial notes This is not our standard Fibonacci sequence.

(2) F j+2 = F J+1 + F., F ^ = 0, F Q = 1 (j = -1, 0, 1, 2, ). Editorial notes This is not our standard Fibonacci sequence. ON THE LENGTH OF THE EUCLIDEAN ALGORITHM E. P. IV1ERKES ad DAVSD MEYERS Uiversity of Ciciati, Ciciati, Ohio Throughout this article let a ad b be itegers, a > b >. The Euclidea algorithm geerates fiite

More information

A sequence of numbers is a function whose domain is the positive integers. We can see that the sequence

A sequence of numbers is a function whose domain is the positive integers. We can see that the sequence Sequeces A sequece of umbers is a fuctio whose domai is the positive itegers. We ca see that the sequece,, 2, 2, 3, 3,... is a fuctio from the positive itegers whe we write the first sequece elemet as

More information

NICK DUFRESNE. 1 1 p(x). To determine some formulas for the generating function of the Schröder numbers, r(x) = a(x) =

NICK 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 information

CSI 2101 Discrete Structures Winter Homework Assignment #4 (100 points, weight 5%) Due: Thursday, April 5, at 1:00pm (in lecture)

CSI 2101 Discrete Structures Winter Homework Assignment #4 (100 points, weight 5%) Due: Thursday, April 5, at 1:00pm (in lecture) CSI 101 Discrete Structures Witer 01 Prof. Lucia Moura Uiversity of Ottawa Homework Assigmet #4 (100 poits, weight %) Due: Thursday, April, at 1:00pm (i lecture) Program verificatio, Recurrece Relatios

More information

Some sufficient conditions of a given. series with rational terms converging to an irrational number or a transcdental number

Some sufficient conditions of a given. series with rational terms converging to an irrational number or a transcdental number Some sufficiet coditios of a give arxiv:0807.376v2 [math.nt] 8 Jul 2008 series with ratioal terms covergig to a irratioal umber or a trascdetal umber Yu Gao,Jiig Gao Shaghai Putuo college, Shaghai Jiaotog

More information

Mathematical Series (You Should Know)

Mathematical Series (You Should Know) Mathematical Series You Should Kow Mathematical series represetatios are very useful tools for describig images or for solvig/approimatig the solutios to imagig problems. The may be used to epad a fuctio

More information

11. FINITE FIELDS. Example 1: The following tables define addition and multiplication for a field of order 4.

11. FINITE FIELDS. Example 1: The following tables define addition and multiplication for a field of order 4. 11. FINITE FIELDS 11.1. A Field With 4 Elemets Probably the oly fiite fields which you ll kow about at this stage are the fields of itegers modulo a prime p, deoted by Z p. But there are others. Now although

More information

Lecture 1. January 8, 2018

Lecture 1. January 8, 2018 Lecture 1 Jauary 8, 018 1 Primes A prime umber p is a positive iteger which caot be writte as ab for some positive itegers a, b > 1. A prime p also have the property that if p ab, the p a or p b. This

More information

1 Counting and Stirling Numbers

1 Counting and Stirling Numbers 1 Coutig ad Stirlig Numbers Natural Numbers: We let N {0, 1, 2,...} deote the set of atural umbers. []: For N we let [] {1, 2,..., }. Sym: For a set X we let Sym(X) deote the set of bijectios from X to

More information

Different kinds of Mathematical Induction

Different kinds of Mathematical Induction Differet ids of Mathematical Iductio () Mathematical Iductio Give A N, [ A (a A a A)] A N () (First) Priciple of Mathematical Iductio Let P() be a propositio (ope setece), if we put A { : N p() is true}

More information

ON THE LEHMER CONSTANT OF FINITE CYCLIC GROUPS

ON THE LEHMER CONSTANT OF FINITE CYCLIC GROUPS ON THE LEHMER CONSTANT OF FINITE CYCLIC GROUPS NORBERT KAIBLINGER Abstract. Results of Lid o Lehmer s problem iclude the value of the Lehmer costat of the fiite cyclic group Z/Z, for 5 ad all odd. By complemetary

More information

WHAT ARE THE BERNOULLI NUMBERS? 1. Introduction

WHAT ARE THE BERNOULLI NUMBERS? 1. Introduction WHAT ARE THE BERNOULLI NUMBERS? C. D. BUENGER Abstract. For the "What is?" semiar today we will be ivestigatig the Beroulli umbers. This surprisig sequece of umbers has may applicatios icludig summig powers

More information

arxiv: v3 [math.nt] 24 Dec 2017

arxiv: v3 [math.nt] 24 Dec 2017 DOUGALL S 5 F SUM AND THE WZ-ALGORITHM Abstract. We show how to prove the examples of a paper by Chu ad Zhag usig the WZ-algorithm. arxiv:6.085v [math.nt] Dec 07 Keywords. Geeralized hypergeometric series;

More information

w (1) ˆx w (1) x (1) /ρ and w (2) ˆx w (2) x (2) /ρ.

w (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 information

Please do NOT write in this box. Multiple Choice. Total

Please do NOT write in this box. Multiple Choice. Total Istructor: Math 0560, Worksheet Alteratig Series Jauary, 3000 For realistic exam practice solve these problems without lookig at your book ad without usig a calculator. Multiple choice questios should

More information

10.1 Sequences. n term. We will deal a. a n or a n n. ( 1) n ( 1) n 1 2 ( 1) a =, 0 0,,,,, ln n. n an 2. n term.

10.1 Sequences. n term. We will deal a. a n or a n n. ( 1) n ( 1) n 1 2 ( 1) a =, 0 0,,,,, ln n. n an 2. n term. 0. Sequeces A sequece is a list of umbers writte i a defiite order: a, a,, a, a is called the first term, a is the secod term, ad i geeral eclusively with ifiite sequeces ad so each term Notatio: the sequece

More information

Assignment 5: Solutions

Assignment 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 information

Some Basic Diophantine Equations

Some Basic Diophantine Equations Some Basic iophatie Equatios R.Maikada, epartmet of Mathematics, M.I.E.T. Egieerig College, Tiruchirappalli-7. Email: maimaths78@gmail.com bstract- - I this paper we preset a method for solvig the iophatie

More information

TEACHER CERTIFICATION STUDY GUIDE

TEACHER CERTIFICATION STUDY GUIDE COMPETENCY 1. ALGEBRA SKILL 1.1 1.1a. ALGEBRAIC STRUCTURES Kow why the real ad complex umbers are each a field, ad that particular rigs are ot fields (e.g., itegers, polyomial rigs, matrix rigs) Algebra

More information

Chapter 8. Uniform Convergence and Differentiation.

Chapter 8. Uniform Convergence and Differentiation. Chapter 8 Uiform Covergece ad Differetiatio This chapter cotiues the study of the cosequece of uiform covergece of a series of fuctio I Chapter 7 we have observed that the uiform limit of a sequece of

More information