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

Size: px
Start display at page:

Download "Abstract. 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"

Transcription

1 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 biomial coefficiets ad Narayaa polyomials are momets of aalogues of Fiboacci ad Lucas polyomials ad related polyomials Itroductio This ote is a supplemet to part I ([4]) Let ( ) ( ) x F x () be Fiboacci polyomials ad defie a liear fuctioal L by The the momets L x are the Catala umbers L x L F ( ) [ ] x () C This well-ow fact is the special case t of the followig result (cf [4] ad the literature cited there): The Narayaa polyomials (3) C() t t (4) ca be represeted as momets Lx of the liear fuctioal L defied by L F ( ) [ ] x t where F ( x t) ( ) t x (5) are geeralized Fiboacci polyomials which satisfy the recurrece

2 F ( x t) xf ( x t) F ( x t) F ( x t) xf ( x t) tf ( x t) (6) Oe of our purposes is to give a ice aalogue of this result More precisely we defie ice polyomials F ( x t ) such that the liear fuctioal defied by LF ( ) x t [ ] has as momets the Narayaa polyomials Lx C( t ) t [ ] (7) which for t reduce to the Catala umbers C( ) C( ) [ ] (8) We will always suppose that ad use the otatios [ ] [ ] ad ; ; ; for It is well ow that for each seuece a with a such that all Hael determiats det ai there are uiuely defied moic polyomials p ( ) i x of degree which are orthogoal with respect to the liear fuctioal L defied by L x a Orthogoality meas that L ppm for m ad L p Sice p ( ) implies that Lp [ ] Moreover there are uiuely determied umbers a ( ) such that x this x a ( ) p( x) (9) By applyig L we see that a ( ) L x a For the polyomials F ( x t ) are the orthogoal polyomials with momets ( ) ad L x C x t L x Let ow L be the liear fuctioal defied by L x C ( t ) ad L x It would be temptig to cosider also i this case the correspodig orthogoal polyomials but it seems that there is o simple explicit formula or recurrece for them ot eve for t

3 I that case the first orthogoal polyomials are x x x 3 x x 4 4 x x x x 4 4 The first umbers a ( ) are Fortuately there also exist ice polyomials with the same momets Let us cosider first the case The orthogoal polyomials for the liear fuctioal L defied by L x C They satisfy L x are the Fiboacci polyomials F ( x) ( ) x a( ) F ( x) with a( ) ad x ad a ( ) else Let me setch how to fid a ice aalogue of this situatio It is easier to begi with a ( ) A atural aalogue is [ ] a( ) [ ] first terms are ad a ( ) else The Now we are looig for the polyomials F ( x ) such that x a( ) F ( x ) () 3

4 Their coefficiets are give by the iverse matrix ai ( ) Fortuately this also turs out to be ice The first terms are Thus the seuece F ( x ) x 3 x x begis with 4 x x x 5 3 x x x F ( ) x ca of course also be computed iductively by It is ow easy to guess that i geeral F ( x ) x a( ) F ( x ) Remar ( ) ( ) F x x () Note that these Fiboacci polyomials which have bee cosidered i [] ad [3] are ot orthogoal There are also ice orthogoal aalogues of the Fiboacci polyomials ( ) x Their momets are the ie the Carlitz Fiboacci polyomials Carlitz Catala umbers but ufortuately these have o closed formula I this ote we first recall some results about the above metioed class of o- orthogoal Fiboacci ad Lucas polyomials whose momets are Catala umbers ad cetral biomial coefficiets ad the propose ice aalogues of the geeralized Fiboacci ad Lucas polyomials of part I such that the correspodig momets are Narayaa polyomials C( t ) t [ ] ad M( t ) t 4

5 Some bacgroud material Let us first state some ow results (cf [][][3]) As already metioed the Fiboacci polyomials satisfy F ( x ) ( ) x () x F ( x ) () If we defie a liear fuctioal L by LF x ( ) [ ] the we get Lx C( ) (3) [ ] where C( ) is a aalogue of the Catala umbers [ ] C The Lucas polyomials for ad L ( x ) satisfy [ ] L ( x ) ( ) x [ ] (4) x L ( x ) (5) If we defie the liear fuctioal M by M L ( ) [ ] x the we get M x M( ) is a cetral biomial coefficiet (6) It is easy to verify that L x F x F x (7) ( ) ( ) ( ) for Moreover L( x ) F( x ) ad L( x ) F( x ) x 5

6 These results ca be proved with a iversio formula by L Carlitz [] Aother proof is i [] ad [3] Carlitz uses the fact that for mi( ) c ( ): ( ) (8) To prove this let U be the liear operator o ad U x defied by x x U for itegers ( ): ( ) The c U U U U because U Lemma (Carlitz [] Theorem 7) If u ( ) v ( ) the ( ) ( ) ( ) v u Proof ( ) u( ) ( ) v( ) v ( ) ( ) v ( ) v ( ) ( ) ( ) v ( ) by (8) If we choose u ( ) x we get () By (7) ad 6

7 we get L( x ) F( x ) F( x ) ( ) ( ) F x F x x ad thus also (5) Remar The simplest recursio for F ( x ) for a fixed umber x is (cf []) F ( x ) xf ( x ) xf ( x ) F ( x ) (9) Let us also ote that comparig coefficiets gives the recursio F ( x ) xf ( x ) F x () We will also cosider the polyomials ad P( x ) F x ( ) x () F x ( ) ( ) Q x x x () For these polyomials we get ad x P ( x ) (3) x Q ( x ) (4) 7

8 If we defie liear fuctioals L ad L by the (3) ad (4) give Aalogously let L P ( x ) [ ] L Q ( x ) [ ] L x C ( ) (5) (6) Lx C ( ) ad [ ] [ ] R( x ) L x ( ) x (7) L x [ ] S( x ) ( ) x x [ ] (8) This implies Let M R x ad ( ) [ ] x R ( x ) x S ( x ) M S ( x ) [ ] The we get (9) By comparig coefficiets we get M M x x () R x Q x Q x () ( ) ( ) ( ) 8

9 3 -Narayaa polyomials as momets I the followig we exted the above results by itroducig a ew parameter t as i part I I [4] we have defied F ( x t ) by the recursios F ( x t) xf ( x t) F ( x t) F ( x t) xf ( x t) tf ( x t) ad iitial values F ( x t) ad F( x t) x (3) If L deotes the liear fuctioal defied by LF x t ( ) [ ] the we have L x C () t ad L x (3) where C() t t (33) for ad C () t is a Narayaa polyomial Theorem Let () t ad () t t ad defie F ( x t ) by the recursio F ( xt ) xf ( xt ) ( tf ) ( xt ) (34) with iitial values F ( x t ) ad F( x t ) x These polyomials are explicitly give by ( ) ( ) ( ) ( ) ( ) ( ) F x t t x F x t t x If L deotes the liear fuctioal defied by LF x t where for is a Narayaa polyomial ( ) [ ] the we have (35) L x C ( t ) ad L x (36) C t t [ ] (37) Proof To prove (35) we have oly to show that (34) holds This follows by comparig coefficiets 9

10 a t we get by usig For a a ad the Vadermode formula ( ) ( ) ( ) ( )( ) ( ) ad aalogously ( ) This implies that ( ) F ( x ) F ( x ) (38) To prove (36) let at ( ) be the uiuely defied umbers such that By (34) we get atf ( ) ( xt ) x (39) a( t ) a( t ) ( t) a( t ) (3) with iitial values a ( t ) ad a( t ) [ ] This implies that ( ) a( t ) t ( ) a( t ) t ad at ( ) else (3) I order to show this we must verify that ad a( t ) a( t ) a( t ) (3) a( t ) a( t ) ta( t ) (33)

11 (3) follows from a( t ) a( t ) t t t a( t ) (33) follows from ( ) a( t ) ta( t ) t ( ) t t t a( t ) As special case we get for a( t ) t C ( t ) (34) C ( ) t is related to the Catala umbers c ( ; ) of J Fürliger ad J Hofbauer [5] They have show that C( ) C( ) [ ] This result follows agai from Theorem because of (38) ad (3) (35) Remar Let us also cosider the polyomials P( xt ) F xt F x t Q x t x ad

12 Corollary Let ad The with Q ( x t ) ( ) t x (36) B ( t) t (37) B ( tq ) ( xt ) x (38) t B( t) t C [ ] (39) Note that by [5] C C( ) i accordace with (6) B ( t ) ca also be writte as [ ] B ( t) t [ ] For t B ( t ) reduces to B Corollary Let ( ) ad The with ( ) (3) P ( x t ) ( ) t x A t t ( ) (3) A ( t ) P( x t ) x (3)

13 A( t ) t C ( t ) [ ] (33) The first terms of A ( t ) are -Narayaa polyomials of type B I [4] we have see that the orthogoal polyomials L ( x t ) whose momets are the Narayaa polyomials M() t t of type B satisfy the recurrece with iitial values L ( x t) ad L( x t) x Here we have L ( x t) xl ( x t) ( t) L ( x t) (34) () t t t () t t t t () t t for We ow show that there exists a atural aalogue of L ( x t ) with L( x t) L( x t) ad which for t reduces to the Lucas polyomials: Theorem Let ( t) t t ( t) t t t ( t) t (35) ad defie L ( x t ) by 3

14 with L ( x t ) ad L( x t ) x L( xt ) xl ( xt ) ( tl ) ( xt ) (36) Let M deote the liear fuctioal defied by M L ( ) [ ] x t the we get M x M ( t ) t (37) Proof Let at ( ) satisfy at ( ) a ( t ) ( ta ) ( t ) (38) with a ( t ) ad a( t ) [ ] The (36) implies that By iductio it is easy to verify that atl ( ) ( xt) x (39) a t t ( ) ( ) ( ) ( )( ) ( ) t ( ) ( ) t t t a t t t ad at ( ) else If M L ( ) [ ] x t the (39) implies M x a( t ) t M( t ) (33) By Vadermode we see that a( ) ad a( ) Comparig with (9) we coclude that L ( x ) is a Lucas polyomial Further it is clear that L ( x t) L ( x t) Let R xt L xt ( ) I order to get a formula for R ( xt ) observe that 4

15 B ( t ) D ( t ) td ( t ) (33) which is euivalet with the easily verified idetity [ ] [ ] By (38) this implies D ( t ) Q ( x t ) tq ( x t ) D ( tq ) ( xt ) td ( tq ) ( xt ) B ( tq ) ( xt ) x Comparig with (337) we see that if we let Q ( x t ) Q ( x t ) The first terms of ( ) R xt Q xt tq xt (33) R x t are ( ) ( ) ( ) From (33) ad (36) we get the formula with ( ) ( ) ( ) (333) R x t c t x ( ) ct ( ) t for (334) ct ( ) t This ca also be writte as R x t t x t ( ) ( ) ( ) ( ) (335) 5

16 By (39) ad (33) we get Corollary Let The ( ) D ( t ) a( t ) t (336) Let M be the liear fuctioal defied by D ( t ) R( x t ) x (337) M R ( x t ) [ ] The M x D ( t ) B ( t ) t (338) L xt Let ow S( x t ) x From (36) we get for Corollary Let t t S( x t ) t R x t R x x t (339) The E t a t t t (34) Let ( ) ( )( ) ( ) ( ) t M be the liear fuctioal defied by E ( t ) S( x t ) x (34) M S( x t ) [ ] The t M M x E( t ) t t t (34) 6

17 Remar For the umbers D ( t ) there exists a aalogue of the Catala-Stieltes matrix for orthogoal polyomials: ad D ( t) ( td ) ( t ) td ( t ) (343) D ( t ) D ( t ) t D ( t ) td ( t ) (344) Let us metio some curious coectures: Let t f() t operator with respect to the variable t The f () t f( t) ( t ) be the differetial m m m m m m t D ( x t) R( x t ) [ m]! cm t m x (345) Here c ( t m ) for c ( ) t m ad for For m we get m [ m] c ( t m ) t m m [ m] (346) c( t ) t C t [ ] Thus t D ( x t) R( x t ) C t x (347) It should be oted that the umbers are the coefficiets of the powers mm m c ( t m) t m m Cxt ( ) m of the geeratig fuctio Cxt ( ) C( tx ) of the Narayaa polyomials (cf [4]) Other such idetities are t B ( tq ) ( xt ) C t x t A ( tp ) ( xt ) C t x (348) (349) 7

18 m m m m m m m t A ( xt ) P ( x t ) [ ] c m tm x (35) m m m m m m t B xt Q x t c m tm x ( ) ( ) [ ] (35) Refereces [] L Carlitz Some iversio formulas Red Circ Palermo (963) [] J Cigler A ew class of Fiboacci polyomials Electr J Comb (3) R 9 [3] J Cigler Lucas polyomials ad associated Rogers-Ramaua type idetities arxiv: 9765 [4] J Cigler Some elemetary observatios o Narayaa polyomials ad related topics arxiv:655 [5] J Fürliger ad J Hofbauer Catala umbers J Comb Th A 4 (985)

Hankel determinants of some polynomial sequences. Johann Cigler

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

0,1,1, 2,3,5,8,13, 21,

0,1,1, 2,3,5,8,13, 21, Catala umbers, Hael determiats ad Fiboacci polyomials Joha Cigler Faultät für Mathemati Uiversität Wie joha.cigler@uivie.ac.at Abstract I this (partly expository) paper we cosider some Hael determiats

More information

q-lucas polynomials and associated Rogers-Ramanujan type identities

q-lucas polynomials and associated Rogers-Ramanujan type identities -Lucas polyomials associated Rogers-Ramauja type idetities Joha Cigler Faultät für Mathemati, Uiversität Wie johacigler@uivieacat Abstract We prove some properties of aalogues of the Fiboacci Lucas polyomials,

More information

Simple proofs of Bressoud s and Schur s polynomial versions of the. Rogers-Ramanujan identities. Johann Cigler

Simple proofs of Bressoud s and Schur s polynomial versions of the. Rogers-Ramanujan identities. Johann Cigler Simple proofs of Bressoud s ad Schur s polyomial versios of the Rogers-Ramaua idetities Joha Cigler Faultät für Mathemati Uiversität Wie A-090 Wie, Nordbergstraße 5 Joha Cigler@uivieacat Abstract We give

More information

q-fibonacci polynomials and q-catalan numbers Johann Cigler [ ] (4) I don t know who has observed this well-known fact for the first time.

q-fibonacci polynomials and q-catalan numbers Johann Cigler [ ] (4) I don t know who has observed this well-known fact for the first time. -Fiboacci polyoials ad -Catala ubers Joha Cigler The Fiboacci polyoials satisfy the recurrece F ( x s) = s x = () F ( x s) = xf ( x s) + sf ( x s) () with iitial values F ( x s ) = ad F( x s ) = These

More information

Sum of cubes: Old proofs suggest new q analogues

Sum of cubes: Old proofs suggest new q analogues Sum of cubes: Old proofs suggest ew aalogues Joha Cigler Faultät für Mathemati, Uiversität Wie ohacigler@uivieacat Abstract We show how old proofs of the sum of cubes suggest ew aalogues 1 Itroductio I

More information

Some Hankel determinants with nice evaluations. Johann Cigler Talk at the occasion of Peter Paule s 60 th birthday

Some Hankel determinants with nice evaluations. Johann Cigler Talk at the occasion of Peter Paule s 60 th birthday Some Hakel determiats with ice evaluatios Joha Cigler Talk at the occasio of Peter Paule s 6 th birthday Itroductio For each we cosider the Hakel determiat H ( a ) + = det. i j i, j= We are iterested i

More information

q-chebyshev polynomials

q-chebyshev polynomials -Chebyshev polyomials Joha Cigler Faultät für Mathemati, Uiversität Wie oha.cigler@uivie.ac.at Abstract I this overview paper a direct approach to Chebyshev polyomials ad their elemetary properties is

More information

Sum of cubes: Old proofs suggest new q analogues

Sum of cubes: Old proofs suggest new q analogues Sum of cubes: Old proofs suggest ew aalogues Joha Cigler Faultät für Mathemati, Uiversität Wie ohacigler@uivieacat Abstract We prove a ew aalogue of Nicomachus s theorem about the sum of cubes ad some

More information

Fibonacci polynomials, generalized Stirling numbers, and Bernoulli, Genocchi and tangent numbers

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

Some q-analogues of Fibonacci, Lucas and Chebyshev polynomials with nice moments

Some q-analogues of Fibonacci, Lucas and Chebyshev polynomials with nice moments Some -aaloges o Fiboacci, Lcas ad Chebyshev polyomials with ice momets Joha Cigler Faltät ür Mathemati, Uiversität Wie Ui Wie Rossa, Osar-Morgester-Platz, 090 Wie ohacigler@ivieacat http://homepageivieacat/ohacigler/

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

The r-generalized Fibonacci Numbers and Polynomial Coefficients

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

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

Finite q-identities related to well-known theorems of Euler and Gauss. Johann Cigler

Finite q-identities related to well-known theorems of Euler and Gauss. Johann Cigler Fiite -idetities elated to well-ow theoems of Eule ad Gauss Joha Cigle Faultät fü Mathemati Uivesität Wie A-9 Wie, Nodbegstaße 5 email: oha.cigle@uivie.ac.at Abstact We give geealizatios of a fiite vesio

More information

Fibonacci numbers and orthogonal polynomials

Fibonacci numbers and orthogonal polynomials Fiboacci umbers ad orthogoal polyomials Christia Berg April 10, 2006 Abstract We prove that the sequece (1/F +2 0 of reciprocals of the Fiboacci umbers is a momet sequece of a certai discrete probability,

More information

CHAPTER I: Vector Spaces

CHAPTER I: Vector Spaces CHAPTER I: Vector Spaces Sectio 1: Itroductio ad Examples This first chapter is largely a review of topics you probably saw i your liear algebra course. So why cover it? (1) Not everyoe remembers everythig

More information

Enumerative & Asymptotic Combinatorics

Enumerative & 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 information

with an even sum and for k 1mod4 1, 2,, n with an odd sum. ,, n of Pascal s triangle count the subsets of 1, 2,, n

with an even sum and for k 1mod4 1, 2,, n with an odd sum. ,, n of Pascal s triangle count the subsets of 1, 2,, n Some remars o Rogers-Szegö olyomials ad Losaitsch s triagle Joha Cigler Faultät für Mathemati Uiversität Wie johacigler@uivieacat Abstract I this exository aer we collect some simle facts about aalogues

More information

LINEAR RECURSION RELATIONS - LESSON FOUR SECOND-ORDER LINEAR RECURSION RELATIONS

LINEAR RECURSION RELATIONS - LESSON FOUR SECOND-ORDER LINEAR RECURSION RELATIONS LINEAR RECURSION RELATIONS - LESSON FOUR SECOND-ORDER LINEAR RECURSION RELATIONS BROTHER ALFRED BROUSSEAU St. Mary's College, Califoria Give a secod-order liear recursio relatio (.1) T. 1 = a T + b T 1,

More information

DIVISIBILITY PROPERTIES OF GENERALIZED FIBONACCI POLYNOMIALS

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

1. By using truth tables prove that, for all statements P and Q, the statement

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

2.4 - Sequences and Series

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

The log-concavity and log-convexity properties associated to hyperpell and hyperpell-lucas sequences

The log-concavity and log-convexity properties associated to hyperpell and hyperpell-lucas sequences Aales Mathematicae et Iformaticae 43 2014 pp. 3 12 http://ami.etf.hu The log-cocavity ad log-covexity properties associated to hyperpell ad hyperpell-lucas sequeces Moussa Ahmia ab, Hacèe Belbachir b,

More information

Lecture 7: Properties of Random Samples

Lecture 7: Properties of Random Samples Lecture 7: Properties of Radom Samples 1 Cotiued From Last Class Theorem 1.1. Let X 1, X,...X be a radom sample from a populatio with mea µ ad variace σ

More information

Homework 9. (n + 1)! = 1 1

Homework 9. (n + 1)! = 1 1 . Chapter : Questio 8 If N, the Homewor 9 Proof. We will prove this by usig iductio o. 2! + 2 3! + 3 4! + + +! +!. Base step: Whe the left had side is. Whe the right had side is 2! 2 +! 2 which proves

More information

On the Inverse of a Certain Matrix Involving Binomial Coefficients

On the Inverse of a Certain Matrix Involving Binomial Coefficients It. J. Cotemp. Math. Scieces, Vol. 3, 008, o. 3, 5-56 O the Iverse of a Certai Matrix Ivolvig Biomial Coefficiets Yoshiari Iaba Kitakuwada Seior High School Keihokushimoyuge, Ukyo-ku, Kyoto, 60-0534, Japa

More information

An enumeration of flags in finite vector spaces

An enumeration of flags in finite vector spaces A eumeratio of flags i fiite vector spaces C Rya Viroot Departmet of Mathematics College of William ad Mary P O Box 8795 Williamsburg VA 23187 viroot@mathwmedu Submitted: Feb 2 2012; Accepted: Ju 27 2012;

More information

ANOTHER GENERALIZED FIBONACCI SEQUENCE 1. INTRODUCTION

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

CERTAIN GENERAL BINOMIAL-FIBONACCI SUMS

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

CALCULATION OF FIBONACCI VECTORS

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

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

Polynomial Generalizations and Combinatorial Interpretations for Sequences Including the Fibonacci and Pell Numbers

Polynomial Generalizations and Combinatorial Interpretations for Sequences Including the Fibonacci and Pell Numbers Ope Joural o Discrete Mathematics,,, - http://dxdoiorg/46/odm6 Published Olie Jauary (http://wwwscirporg/oural/odm) Polyomial Geeralizatios ad Combiatorial Iterpretatios or Seueces Icludig the Fiboacci

More information

Bijective Proofs of Gould s and Rothe s Identities

Bijective Proofs of Gould s and Rothe s Identities ESI The Erwi Schrödiger Iteratioal Boltzmagasse 9 Istitute for Mathematical Physics A-1090 Wie, Austria Bijective Proofs of Gould s ad Rothe s Idetities Victor J. W. Guo Viea, Preprit ESI 2072 (2008 November

More information

A GENERALIZATION OF THE SYMMETRY BETWEEN COMPLETE AND ELEMENTARY SYMMETRIC FUNCTIONS. Mircea Merca

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

A proof of Catalan s Convolution formula

A proof of Catalan s Convolution formula A proof of Catala s Covolutio formula Alo Regev Departmet of Mathematical Scieces Norther Illiois Uiveristy DeKalb, IL regev@mathiuedu arxiv:11090571v1 [mathco] 2 Sep 2011 Abstract We give a ew proof of

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

arxiv: v1 [math.fa] 3 Apr 2016

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

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

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

On Generalized Fibonacci Numbers

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

AN ALMOST LINEAR RECURRENCE. Donald E. Knuth Calif. Institute of Technology, Pasadena, Calif.

AN ALMOST LINEAR RECURRENCE. Donald E. Knuth Calif. Institute of Technology, Pasadena, Calif. AN ALMOST LINEAR RECURRENCE Doald E. Kuth Calif. Istitute of Techology, Pasadea, Calif. form A geeral liear recurrece with costat coefficiets has the U 0 = a l* U l = a 2 " ' " U r - l = a r ; u = b, u,

More information

8. Applications To Linear Differential Equations

8. Applications To Linear Differential Equations 8. Applicatios To Liear Differetial Equatios 8.. Itroductio 8.. Review Of Results Cocerig Liear Differetial Equatios Of First Ad Secod Orders 8.3. Eercises 8.4. Liear Differetial Equatios Of Order N 8.5.

More information

Course : Algebraic Combinatorics

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

~W I F

~W I F A FIBONACCI PROPERTY OF WYTHOFF PAIRS ROBERT SILBER North Carolia State Uiversity, Raleigh, North Carolia 27607 I this paper we poit out aother of those fasciatig "coicideces" which are so characteristically

More information

Theorem: Let A n n. In this case that A does reduce to I, we search for A 1 as the solution matrix X to the matrix equation A X = I i.e.

Theorem: Let A n n. In this case that A does reduce to I, we search for A 1 as the solution matrix X to the matrix equation A X = I i.e. Theorem: Let A be a square matrix The A has a iverse matrix if ad oly if its reduced row echelo form is the idetity I this case the algorithm illustrated o the previous page will always yield the iverse

More information

Fibonacci numbers and orthogonal polynomials

Fibonacci numbers and orthogonal polynomials Fiboacci umbers ad orthogoal polyomials Christia Berg Jauary 17, 2011 Abstract We prove that the sequece (1/F +2 0 of reciprocals of the Fiboacci umbers is a momet sequece of a certai discrete probability,

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

GENERALIZED HARMONIC NUMBER IDENTITIES AND A RELATED MATRIX REPRESENTATION

GENERALIZED HARMONIC NUMBER IDENTITIES AND A RELATED MATRIX REPRESENTATION J Korea Math Soc 44 (2007), No 2, pp 487 498 GENERALIZED HARMONIC NUMBER IDENTITIES AND A RELATED MATRIX REPRESENTATION Gi-Sag Cheo ad Moawwad E A El-Miawy Reprited from the Joural of the Korea Mathematical

More information

Homework 3. = k 1. Let S be a set of n elements, and let a, b, c be distinct elements of S. The number of k-subsets of S is

Homework 3. = k 1. Let S be a set of n elements, and let a, b, c be distinct elements of S. The number of k-subsets of S is Homewor 3 Chapter 5 pp53: 3 40 45 Chapter 6 p85: 4 6 4 30 Use combiatorial reasoig to prove the idetity 3 3 Proof Let S be a set of elemets ad let a b c be distict elemets of S The umber of -subsets of

More information

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

Math 2112 Solutions Assignment 5

Math 2112 Solutions Assignment 5 Math 2112 Solutios Assigmet 5 5.1.1 Idicate which of the followig relatioships are true ad which are false: a. Z Q b. R Q c. Q Z d. Z Z Z e. Q R Q f. Q Z Q g. Z R Z h. Z Q Z a. True. Every positive iteger

More information

It is often useful to approximate complicated functions using simpler ones. We consider the task of approximating a function by a polynomial.

It is often useful to approximate complicated functions using simpler ones. We consider the task of approximating a function by a polynomial. Taylor Polyomials ad Taylor Series It is ofte useful to approximate complicated fuctios usig simpler oes We cosider the task of approximatig a fuctio by a polyomial If f is at least -times differetiable

More information

Fibonacci numbers and orthogonal polynomials

Fibonacci numbers and orthogonal polynomials Fiboacci umbers ad orthogoal polyomials Christia Berg Departmet of Mathematics, Uiversity of Copehage, Uiversitetspare 5, 2100 Købehav Ø, Demar Abstract We prove that the sequece (1/F +2 0 of reciprocals

More information

6 Integers Modulo n. integer k can be written as k = qn + r, with q,r, 0 r b. So any integer.

6 Integers Modulo n. integer k can be written as k = qn + r, with q,r, 0 r b. So any integer. 6 Itegers Modulo I Example 2.3(e), we have defied the cogruece of two itegers a,b with respect to a modulus. Let us recall that a b (mod ) meas a b. We have proved that cogruece is a equivalece relatio

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

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

SOME RELATIONS ON HERMITE MATRIX POLYNOMIALS. Levent Kargin and Veli Kurt

SOME RELATIONS ON HERMITE MATRIX POLYNOMIALS. Levent Kargin and Veli Kurt Mathematical ad Computatioal Applicatios, Vol. 18, No. 3, pp. 33-39, 013 SOME RELATIONS ON HERMITE MATRIX POLYNOMIALS Levet Kargi ad Veli Kurt Departmet of Mathematics, Faculty Sciece, Uiversity of Adeiz

More information

4.3 Growth Rates of Solutions to Recurrences

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

GENERALIZATIONS OF ZECKENDORFS THEOREM. TilVIOTHY J. KELLER Student, Harvey Mudd College, Claremont, California

GENERALIZATIONS OF ZECKENDORFS THEOREM. TilVIOTHY J. KELLER Student, Harvey Mudd College, Claremont, California GENERALIZATIONS OF ZECKENDORFS THEOREM TilVIOTHY J. KELLER Studet, Harvey Mudd College, Claremot, Califoria 91711 The Fiboacci umbers F are defied by the recurrece relatio Fi = F 2 = 1, F = F - + F 0 (

More information

, then cv V. Differential Equations Elements of Lineaer Algebra Name: Consider the differential equation. and y2 cos( kx)

, then cv V. Differential Equations Elements of Lineaer Algebra Name: Consider the differential equation. and y2 cos( kx) Cosider the differetial equatio y '' k y 0 has particular solutios y1 si( kx) ad y cos( kx) I geeral, ay liear combiatio of y1 ad y, cy 1 1 cy where c1, c is also a solutio to the equatio above The reaso

More information

Chapter 8. Euler s Gamma function

Chapter 8. Euler s Gamma function Chapter 8 Euler s Gamma fuctio The Gamma fuctio plays a importat role i the fuctioal equatio for ζ(s that we will derive i the ext chapter. I the preset chapter we have collected some properties of the

More information

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

Interesting Series Associated with Central Binomial Coefficients, Catalan Numbers and Harmonic Numbers 3 47 6 3 Joural of Iteger Sequeces Vol. 9 06 Article 6.. Iterestig Series Associated with Cetral Biomial Coefficiets Catala Numbers ad Harmoic Numbers Hogwei Che Departmet of Mathematics Christopher Newport

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

EXPANSION FORMULAS FOR APOSTOL TYPE Q-APPELL POLYNOMIALS, AND THEIR SPECIAL CASES

EXPANSION FORMULAS FOR APOSTOL TYPE Q-APPELL POLYNOMIALS, AND THEIR SPECIAL CASES LE MATEMATICHE Vol. LXXIII 208 Fasc. I, pp. 3 24 doi: 0.448/208.73.. EXPANSION FORMULAS FOR APOSTOL TYPE Q-APPELL POLYNOMIALS, AND THEIR SPECIAL CASES THOMAS ERNST We preset idetities of various kids for

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

Chapter 9 - CD companion 1. A Generic Implementation; The Common-Merge Amplifier. 1 τ is. ω ch. τ io

Chapter 9 - CD companion 1. A Generic Implementation; The Common-Merge Amplifier. 1 τ is. ω ch. τ io Chapter 9 - CD compaio CHAPTER NINE CD-9.2 CD-9.2. Stages With Voltage ad Curret Gai A Geeric Implemetatio; The Commo-Merge Amplifier The advaced method preseted i the text for approximatig cutoff frequecies

More information

THE N-POINT FUNCTIONS FOR INTERSECTION NUMBERS ON MODULI SPACES OF CURVES

THE N-POINT FUNCTIONS FOR INTERSECTION NUMBERS ON MODULI SPACES OF CURVES THE N-POINT FUNTIONS FOR INTERSETION NUMBERS ON MODULI SPAES OF URVES KEFENG LIU AND HAO XU Abstract. We derive from Witte s KdV equatio a simple formula of the -poit fuctios for itersectio umbers o moduli

More information

ON SOME DIOPHANTINE EQUATIONS RELATED TO SQUARE TRIANGULAR AND BALANCING NUMBERS

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

Application of Jordan Canonical Form

Application of Jordan Canonical Form CHAPTER 6 Applicatio of Jorda Caoical Form Notatios R is the set of real umbers C is the set of complex umbers Q is the set of ratioal umbers Z is the set of itegers N is the set of o-egative itegers Z

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

The Riemann Zeta Function

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

A q-analogue of some binomial coefficient identities of Y. Sun

A q-analogue of some binomial coefficient identities of Y. Sun A -aalogue of some biomial coefficiet idetities of Y. Su arxiv:008.469v2 [math.co] 5 Apr 20 Victor J. W. Guo ad Da-Mei Yag 2 Departmet of Mathematics, East Chia Normal Uiversity Shaghai 200062, People

More information

CALCULATING FIBONACCI VECTORS

CALCULATING FIBONACCI VECTORS THE GENERALIZED BINET FORMULA FOR CALCULATING FIBONACCI VECTORS Stuart D Aderso Departmet of Physics, Ithaca College 953 Daby Road, Ithaca NY 14850, USA email: saderso@ithacaedu ad Dai Novak Departmet

More information

ECE-S352 Introduction to Digital Signal Processing Lecture 3A Direct Solution of Difference Equations

ECE-S352 Introduction to Digital Signal Processing Lecture 3A Direct Solution of Difference Equations ECE-S352 Itroductio to Digital Sigal Processig Lecture 3A Direct Solutio of Differece Equatios Discrete Time Systems Described by Differece Equatios Uit impulse (sample) respose h() of a DT system allows

More information

EVALUATION OF SUMS INVOLVING PRODUCTS OF GAUSSIAN q-binomial COEFFICIENTS WITH APPLICATIONS

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

PERIODS OF FIBONACCI SEQUENCES MODULO m. 1. Preliminaries Definition 1. A generalized Fibonacci sequence is an infinite complex sequence (g n ) n Z

PERIODS OF FIBONACCI SEQUENCES MODULO m. 1. Preliminaries Definition 1. A generalized Fibonacci sequence is an infinite complex sequence (g n ) n Z PERIODS OF FIBONACCI SEQUENCES MODULO m ARUDRA BURRA Abstract. We show that the Fiboacci sequece modulo m eriodic for all m, ad study the eriod i terms of the modulus.. Prelimiaries Defiitio. A geeralized

More information

Bertrand s Postulate

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

GAMALIEL CERDA-MORALES 1. Blanco Viel 596, Valparaíso, Chile. s: /

GAMALIEL CERDA-MORALES 1. Blanco Viel 596, Valparaíso, Chile.  s: / THE GELIN-CESÀRO IDENTITY IN SOME THIRD-ORDER JACOBSTHAL SEQUENCES arxiv:1810.08863v1 [math.co] 20 Oct 2018 GAMALIEL CERDA-MORALES 1 1 Istituto de Matemáticas Potificia Uiversidad Católica de Valparaíso

More information

Binomial transform of products

Binomial transform of products Jauary 02 207 Bioial trasfor of products Khristo N Boyadzhiev Departet of Matheatics ad Statistics Ohio Norther Uiversity Ada OH 4580 USA -boyadzhiev@ouedu Abstract Give the bioial trasfors { b } ad {

More information

Sequence A sequence is a function whose domain of definition is the set of natural numbers.

Sequence A sequence is a function whose domain of definition is the set of natural numbers. Chapter Sequeces Course Title: Real Aalysis Course Code: MTH3 Course istructor: Dr Atiq ur Rehma Class: MSc-I Course URL: wwwmathcityorg/atiq/fa8-mth3 Sequeces form a importat compoet of Mathematical Aalysis

More information

a for a 1 1 matrix. a b a b 2 2 matrix: We define det ad bc 3 3 matrix: We define a a a a a a a a a a a a a a a a a a

a for a 1 1 matrix. a b a b 2 2 matrix: We define det ad bc 3 3 matrix: We define a a a a a a a a a a a a a a a a a a Math E-2b Lecture #8 Notes This week is all about determiats. We ll discuss how to defie them, how to calculate them, lear the allimportat property kow as multiliearity, ad show that a square matrix A

More information

1 Last time: similar and diagonalizable matrices

1 Last time: similar and diagonalizable matrices Last time: similar ad diagoalizable matrices Let be a positive iteger Suppose A is a matrix, v R, ad λ R Recall that v a eigevector for A with eigevalue λ if v ad Av λv, or equivaletly if v is a ozero

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

On the Jacobsthal-Lucas Numbers by Matrix Method 1

On the Jacobsthal-Lucas Numbers by Matrix Method 1 It J Cotemp Math Scieces, Vol 3, 2008, o 33, 1629-1633 O the Jacobsthal-Lucas Numbers by Matrix Method 1 Fikri Köke ad Durmuş Bozkurt Selçuk Uiversity, Faculty of Art ad Sciece Departmet of Mathematics,

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

A solid Foundation for q-appell Polynomials

A solid Foundation for q-appell Polynomials Advaces i Dyamical Systems ad Applicatios ISSN 0973-5321, Volume 10, Number 1, pp. 27 35 2015) http://campus.mst.edu/adsa A solid Foudatio for -Appell Polyomials Thomas Erst Uppsala Uiversity Departmet

More information

On q-analogs of recursions for the number of involutions and prime order elements in symmetric groups

On q-analogs of recursions for the number of involutions and prime order elements in symmetric groups O -aalogs of recursios for the umber of ivolutios ad prime order elemets i symmetric groups Max B Kutler ad C Rya Viroot Abstract The umber of elemets which suare to the idetity i the symmetric group S

More information

BINOMIAL COEFFICIENT AND THE GAUSSIAN

BINOMIAL COEFFICIENT AND THE GAUSSIAN BINOMIAL COEFFICIENT AND THE GAUSSIAN The biomial coefficiet is defied as-! k!(! ad ca be writte out i the form of a Pascal Triagle startig at the zeroth row with elemet 0,0) ad followed by the two umbers,

More information

A Note on Generating Functions and Summation Formulae for Meixner Polynomials of One and Two variables

A Note on Generating Functions and Summation Formulae for Meixner Polynomials of One and Two variables Chapter 5 A Note o Geeratig Fuctios ad Summatio Formulae for Meixer Polyomials of Oe ad Two variables Abstract: The preset chapter is a study of Meixer polyomials of oe ad two variables. This chapter deals

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

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

A New Statistic on Linear and Circular r-mino Arrangements

A New Statistic on Linear and Circular r-mino Arrangements A New Statistic o Liear ad Circular r-mio Arragemets Mar A Shattuc Mathematics Departmet Uiversity of Teessee Koxville, TN 37996-1300 shattuc@mathutedu Carl G Wager Mathematics Departmet Uiversity of Teessee

More information