ANOTHER GENERALIZED FIBONACCI SEQUENCE 1. INTRODUCTION

Size: px
Start display at page:

Download "ANOTHER GENERALIZED FIBONACCI SEQUENCE 1. INTRODUCTION"

Transcription

1 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 have give idicatio of a reewed iterest i the well-kow Fiboacci sequece, amely (1) 1, 1, 2, 3, 5, 8, -, C, where C C ' + C. > 3, with C 1 Cl -i -2 * 2 1. Some recet geeralizatios have produced a variety of ew ad exteded results. A search of the literature seems to reveal that efforts to geeralize the Fiboacci sequece have cosisted of either (a) chagig the recurrece relatio while preservig the iitial terms, or (b) alterig the iitial terms but maitaiig the recurrece relatio. will be employed here. A combiatio of these two techiques Heretofore, all geeralizatios of the Fiboacci sequece appear to have restricted ay give term to beig a fuctio (usually sum) of the two precedig terms. I this paper we shall exted this by cosiderig sequeces i which ay give term is the sum of the three precedig it. Sice the set of all algebraic itegers, i.e., all y such that y satisfies some moic polyomial equatio, / \, c\ p(x) x + a x + *» < > + a i X + aq o, with itegral coefficiets ad of degree greater tha zero, is a itegral domai uder the operatios of additio ad multiplicatio, it was cosidered worthwhile to examie sequeces i which the iitial terms (hece all succeedig terms) are algebraic itegers. It will be show that certai special cases of such sequeces are especially useful i the examiatio of the more geeral case. 29

2 21 ANOTHER GENERALIZED FIBONACCI SEQUENCE [Oct. 2. THE GENERALIZED SEQUENCE { } Specifically we cosider the sequece (2), i, 2,,, where, i, 2 a r e give, a r b i t r a r y algebraic itegers, ot all zero, ad (3) + +. > 3. - l -2-3' It will also be coveiet to cosider a compaio sequece, so to speak, (4) { R j R, Ri, R 2.. R > ", where R i -, Ri 2 - i. ad for > 2, (5) R, + - l -2 F r o m (5) ad (3), whe > 5, we have R + ( + J + ( + ) + ( + J - l R + R + R - l -2-3 Usig (5) ad (3) further, we have R4 R3 R3 + R 2 + Ri R 2 + Rj + RQ Hece for > 3, (6) R R + R + R. -l -2-3

3 1967] ANOTHER GENERALIZED FIBONACCI SEQUENCE 211 Thus R is actually the special c a s e of (2) i which R i -, -Rl p 2 - p i» R 2 p + l p T e o evidet i the developmet of j usefuless of the sequece j R i will be I that follows. Two other special c a s e s of (2) should be metioed at this time; amely the c a s e s i which, j 2 1 ad 1, ~ t, 2 1 r e - spectively, to give the sequeces (7), 1, 1, 2, 4, 7, 13, 24, 44,, K,, ad (8) 1,, 1, 2, 3, 6, 11, 2, 37, e ', L, '. We s e e immediately that L Ki - K, Lj K 2 - K^, ad for > 2, (9) L K + K. -l -2 Hece we might call J K } a -type sequece ad J L a R - t y p e sequece,, Til. The sequece JK was defied ad discussed briefly by M. Agroomoff The followig t h r e e relatios ivolvig various t e r m s of this sequece w e r e discovered ad proved by him: (1) K K K + (K + K )K + K K, x ' +p p+l p - l p - i p -2 (11) x ' K 2ri <* K 2 - i, + K (K + K + K ), x +i - 1 _ 2 ' (12) K, K 2 + K 2 + 2K K x ' 2-l - l - i -2 T h e r e is oly oe basic idetity h e r e because the latter two a r e evidetly special c a s e s of the first oe upo settig p ad p - 1 respectively. F u r t h e r, it was cojectured i [ l ] that eve though the sequece (7) was a Fiboacci-type sequece, it quite possibly would p o s s e s s few of the i t e r e s t - ig p r o p e r t i e s which the Fiboacci sequece has, ad eve if it should, such properties would be much m o r e difficult to fid due to the m o r e complex ature of the r e c u r r e c e relatio determiig the sequece.

4 212 ANOTHER GENERALIZED FIBONACCI SEQUENCE [Oct. We tur ow to a ivestigatio of the sequece (2) ad cosider, amog other facts, how (1), (11), ad (12) occur as special c a s e s of m o r e geeral relatios,, arallelig the usual treatmet of the Fiboacci sequece, we obtai a closed expressio for sice J I satisfies a differece equatio. Thus (13) B ^ + B 2 x* + B 3 x^ where xj,, x 2, x 3 a r e the t h r e e distict roots of the equatio x 3 - x 2 - x - 1, ad Bj, B 2, B 3 a r e costats depedig o these roots as well as, i, 2, ad a r e determied by the system i Bt + B 2 + B3 BtX! + B 2 x 2 + B 3 x 3 i 2 Bpdj + B 2 x + B 3 x 3 2. The values of x*, x 2, x 3, Bj, B 2, B 3 a r e such as to make (12) too c u m b e r - some to be of ay further practical u s e i the succeedig developmet ad hece will ot be writte h e r e. A much m o r e useful way of represetig the r e c u r r e c e relatiofor j J may be foud as follows: I the otatio of vectors ad m a t r i c e s, we have by (3), ("s" p 2 L i. " 1 1 1"] 1. 1 oj 2 1 i LOJ pr p 3 " l i i i 1 ps" p 2 " i l l " 1 2 "p 2 ] i L 2. _ 1 Oj L I 1 _.oj

5 1967] ANOTHER GENERALIZED FIBONACCI SEQUENCE ad by fiite iductio (14) rp -i " " -2 " 2 ] l. p o J 213 F u r t h e r, a simple iductio proof gives (15) "1 1 f 1 p 1 q. K, _, L.. K +1 +l K L K 1 -l - K -i L -i K -J so it might be said that j K I ad i L a r i s e " aturally" i t h e ivestigatio of { j. Usig (14) ad (15), we fid for, p positive itegers that (16) " +p "+p-i L +p-2. L K "K p+l ^ p+i ^ p K L K.,, x H - 1 II - i K L K p-i p-i p - 2 J U -2 from which we immediately see that (17) (18) ^ K ^J + L, + K +p p+l p+l - l p -2 K + L + K 2 +i +l -l -2 K + (K + K ) + K o +l -l - l -2 (19) K + (K + K J + K. 2-i -l - 2 ' - l - i -2 Now settig, j 2 1, we have (1), (11), (12) as special c a s e s of (17), (18), ad (19), respectively, Sice

6 214 ANOTHER GENERALIZED FIBONACCI SEQUENCE [Oct. +p +p-i K... L., J K. p+r+1 p+r+1 p+r K ^ L ^ K _,_ p+r p+r p + r - i - r " - r - i we also have L +p-2 J p+r--i p + r - i p+r-2j - r - 2 (2) u. K ^ _, + L ^ + K ^ +p p+r+i - r p+r+1 - r - i p+r - r - 2 for, p, r positive itegers, r < - 2, Similarly for, h, k positive itegers, we ca show that (21) +h+k * h+k+i + L h +k+l - i + +k - l Usig (2) ad (21), we have the followig useful expressio: (22) "+h+k L +h K -,-2 xx u h+k+i hi+k+i^+k 1 ri I r " p 2 K h+i L h+i K h 1 J 1 i L i _. p o It ca be show quite easily that the sequece (23) l f R 2, 2, R 3, 3, ',, R + 1, is geerated by the matrix ri i [ i i 1 1 OJ that is, (24) r p i R. L ri-i-j "I 1 <r -2 " 2 l R2. i J

7 1967] ANOTHER GENERALIZED FIBONACCI SEQUENCE 215 It is a iterestig ad useful fact that this matrix is the traspose of the geeratig matrix for J }. Usig (24) i away aalogous to that i which we established (21), we prove that (25) a.^, K. M _^ + K, _,. R + IC, A +h+k h+k+l h+k li+k-i -l (26) R +h+k L h+k+i + L h+k R + ^ k ^ - i two relatios which are ot oly iterestig i themselves but which also give +h+k K h+k+i K h+k K h + k - i ] ri i o" 1 1 <U " p 2 (27) R +h L h+i \ L h - i 1 1 R 2 «- 1 J [i o o,. i i the form hi order to defie for egative, we use (14) for > writte (28) r p - k + i L +2 J " 1 " "ol 1 _1 1 1_ i J>i\ Replacig by - i (28), we have for >, (29) r p i L -+2- i ro i o* 1 I I \ i i "o" i fol 1 i. J which together with (14) determies for all sice? j, 2 are give. The same result is obtaied upo replacig by - i (3) to get (3) J J J. - J -+1. ^ > 8

8 216 ANOTHER GENERALIZED FIBONACCI SEQUENCE [Oct. R is also defied for egative by (29) ad (3) sice R + -l -2 This allows us to remove the restrictio placed o, p, r, h, k above. 3 LINEAR SUMS A large umber of what we shall call liear sum relatios o t e r m s of the sequeces j R ad j f w e r e foud ad proved. Sice a exhaustive list is ot our aim, oly a few of the m o r e iterestig oes a r e listed. No proofs will be give h e r e sice the proofs may all be made r a t h e r easily by fiite iductio. 1 (31) T. -i ( ) u f-' l 2 +2 * 1 3-i (32) E 3i E?i + o, ii io < 33 > E ^3i s " o» ii (34) E R 3i+l s+l " i ii T h e s e relatios obviously have special cases for the sequeces K ad L F o r example (33) becomes (33 E Lsi K 3. ii

9 1967] ANOTHER GENERALIZED FIBONACCI SEQUENCE QUADRATIC AND CUBIC RELATIONS A attempt to parallel the quadratic relatios of the Fiboacci sequece failed. A differet approach was e c e s s a r y ad this was foud i the u s e of the v e c t o r - m a t r i x represetatio of. We have the followig iterestig quadratic form: (35) ^ + ^ i _ _ 2 + R i 2 _ 4. The proof of (35) follows by cosiderig the left side of the relatio as the s c a l a r product of the vectors f p, R,,1 ad f p,, 1 ^ L - i j L J - i ' -2 J (recall R + ), ad the usig (14) ad (24), we have - i -2 p2 + p2 + 2 f p, R, J - i - i -2 I - l j ' - i -2-1 ri i r T 2, R 2, J "2 "j i L i. oj [p 2, R 2J t] rp 2 - p L p 2- " 2 1 -*J 2?2-2 + Rj^Z-S + l 2-4 F o r, A 2 1, (35) becomes (35* K 2 + K 2 + 2K K K H - l -l -2 2-l which is (12), It was show that (12) is also a special c a s e of (19), but (35) is ot obtaiable from (19) or vice v e r s a. Oe of the most iterestig relatios ivolvig t e r m s of the Fiboacci sequece is the oe C c - C 2 ( - l ) - i +i

10 218 ANOTHER GENERALIZED FIBONACCI SEQUENCE [Oct. T h e r e is a relatio of this ature for the sequece j 1; however as may have bee suspected, it has a cubic r a t h e r tha a quadratic form,, The desired relatio is (36) ^ -3 - l -2 +i H - 2 +i - l -3 - l f i i !i - 2 i 2 - ^ Before provig (36), we ote that for, V 1 2 1, (36) becomes (37) K 2 K + K 3 + K 2 K - K K K - 2 K K K i -2 +i +l - l -3 - l -2 sice The proof of (37) follows from (9) ad (15) by the use of determiats K 2 K + K 3 + K 2 K _, - K ^ K K - 2K K K -3 - l -2 +l +i - l -3 -l -2 K K K +l - l K -2 - l K K K - l -3-2 K L ^ a., K +l +l K L K H - l K L K - l - l roof of (36): Eve though (36) may be verified i v e r y much the s a m e maer as (37), we adopt a differet method of proof sice this is m o r e easily used i a geeralized versio of (36). F i r s t, we state the followig l e m m a whose proof the r e a d e r ca readily supply, Lemma: Let A be ay 3 x 3 m a t r i x ad let x ad y be three-dimesioal vectors; the the c r o s s product (Ax) X (Ay) is equal to the cofactor matrix of A multiplied by x X y; i» e., (Ax) X (Ay) - (cofactor A) (x X y). Now the left side of (36) ca be cosidered as the triple s c a l a r product of the t h r e e vectors,., 1,., 1, ad fp,, 1. L +l - i j [_ - l -2-3j _ " 1 " 2 J By (14) ad the lemma,

11 1967] ANOTHER GENERALIZED FIBONACCI SEQUENCE 219 rp i - i -2 L - 3 J X " L - i * 1 1 f -3 " 2 " 1 i o - X " i l l " " J v\ i Therefore p 2 p -3 "-i + : -2 +l r p -1 +i L -i-, - 2 +i - l -3 -i -2 " - i " -2 L -3 J [ p 4, p s> p 2 ] X rp 1 - i. -J ri 1 o" L "? !_ p s p, 3-^ l 2 p i ( 2 i - 2 ) + 3( 3 o - 21) + 2 (! - 31). J which reduces to the right side of (36) becomes Example: Suppose we let, I > 1 1; the the right side of (36) o - 2o + 2. Settig this expressio equal to zero ad solvig for 2, we see that t h e r e exist algebraic itegers, say 3 l 3 2 s such that for the sequece J \, p 2 p + p 3 + p 2 p -3 - l -2 +l + 2 +l - i -3 - i -2

12 22 ANOTHER GENERALIZED FIBONACCI SEQUENCE [Oct. The l e m m a ad (22) may be used a s i the previous method of proof to show that for h, k,, m, t itegers (38) + + v ; +h +m +h+k+t +h+t +h+k+m +t +h+k +h+m h+m +h+k+t +m +h+k +h+t +h +t +h+k+m (K h L h+k+i K h + k L h + i ) [ t + 2 ^ l m ' o p m + i ) + t+i(o p m+2 2 m ) + p t ( p 2 p m + i - p i p m + 2 ) ] T h e r e a r e may iterestig special c a s e s of this relatio,, a few. If, t 2 1, (38) becomes We metio (39) K,,K. K.,,,,, + K K ^ J K ^UjLl ^ + K ^ K ^ ^ K ^, ^ v ' +h +m +h+k+t +h+t +h+k+m +t +h+k +h+m +h+m +h+k+t +m +h+k +h+t +h +t +h+k+m v h h+k~i h+k h - l / v t-i m t m - r If k h t, m 1, (39) becomes (4) K, K _,_, K., + K K K _, + K ^. K. ^ K _ - K K ^. K.. v ; +i +h +3h +2h +2h+i +h +h+i +2h +h+i +3h - K K 2 _ K 2, K _,_,_, K. K, K, - K 2 K, ; +i +2h +h +2h+i - i h 2h-l h-i 2h ad if t h, k m - h, (39) reduces to (41) K K _,_, K ^ + 2K ^, K ^ K ^, ^ - K K 2 ^ - K 2 K _ v ' +2h +2m +h +m +h+m +h+m +m +2h - K 2 K ^ - -(K.K - K K J 2 +h +2m \ h m - i m - i ' that I o r d e r that the above r e s u l t s be valid, we must choose h ad k so K K + k - i " K h + k K h - i " K h L h+k+i " K h+k L h+i * '

13 1967] ANOTHER GENERALIZED FIBONACCI SEQUENCE 221 for i the proof of (38), we a s s u m e that the matrix K h+k+i L h+k+i K h+k h+i L i L h+i K h is o-sigular Usig (27) we ca fid relatioships ivolvig t e r m s of both the sequeces R J ad j which reduce to a expressio idepedet of For e x - ample, it may be proved that \ ) +h+k+t^ -tfi +m +h+r +h+t^ +h+k+m +m +h+k' 4- p C R - R ] ~ ^ h + k - i ^ ' V k V i ' +t v +h+k +h+m +h +h+k+m [p^^m - m+i) + t + 1 ( m ^ - 2 m ) + t ( 2 m + i " p i p m + 2 ) ] It should be oted that o t e r m s of the sequece j R I appear o the right side of (42) ad also that the secod factor o the right side of the equality sig i (42) is the same as the secod factor o the right side of (38). 5. MISCELLANEOUS RESULTS We coclude with some miscellaeous r e s u l t s. The followig limitig relatios may be established usig (13) ad the fact that r l9 r 2, the two c o m - plex roots of x 3 - x 2 - x - 1, a r e such that r, ro < 1 (43) (44) V limit >oo ' limit - i > oo "+h V3V V V V 3 yg3" V Vg3 3 )

14 222 ANOTHER GENERALIZED FIBONACCI SEQUENCE Oct By iductio the followig theorem may be established: T h e o r e m : F o r every positive, K 4 K A _ t (mod 2) K 4-2 K ( m o d 2 ) K 4 (mod 4) If we let D(, j, 2,, ) be the determiat o i 2 i.., I ^ 2 +i +i +2 m it ca be show that for > 3, D(, l f 2, -, ) This material is take from Some Geeralizatios ad Extesios of the Fiboacci Sequece, a thesis submitted to the Uiversity of ittsburgh by the first author i partial fulfillmet of requiremets for the h D. degree. REFERENCE 1. M. Agroomoff, p M Ue s e r i e r e c u r r e t e, " Mathesis, ser. 4, vol. 4 (1914),

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

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

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

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

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

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

A FIBONACCI MATRIX AND THE PERMANENT FUNCTION

A FIBONACCI MATRIX AND THE PERMANENT FUNCTION A FIBONACCI MATRIX AND THE PERMANENT FUNCTION BRUCE W. KING Burt Hiils-Ballsto Lake High School, Ballsto Lake, New York ad FRANCIS D. PARKER The St. Lawrece Uiversity, Cato, New York The permaet of a -square

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

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

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

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

GENERATING IDENTITIES FOR FIBONACCI AND LUCAS TRIPLES

GENERATING IDENTITIES FOR FIBONACCI AND LUCAS TRIPLES GENERATING IDENTITIES FOR FIBONACCI AND UCAS TRIPES RODNEY T. HANSEN Motaa State Uiversity, Bozema, Motaa Usig the geeratig fuctios of {F A f ad { x f, + m + m where F ^ _ deotes the ( + m) Fiboacci umber

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

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

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

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

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

A TYPE OF PRIMITIVE ALGEBRA*

A TYPE OF PRIMITIVE ALGEBRA* A TYPE OF PRIMITIVE ALGEBRA* BT J. H. M. WEDDERBURN I a recet paper,t L. E. Dickso has discussed the liear associative algebra, A, defied by the relatios xy = yo(x), y = g, where 8 ( x ) is a polyomial

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

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

~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

Polynomials with Rational Roots that Differ by a Non-zero Constant. Generalities

Polynomials with Rational Roots that Differ by a Non-zero Constant. Generalities Polyomials with Ratioal Roots that Differ by a No-zero Costat Philip Gibbs The problem of fidig two polyomials P(x) ad Q(x) of a give degree i a sigle variable x that have all ratioal roots ad differ by

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

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

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

3. Z Transform. Recall that the Fourier transform (FT) of a DT signal xn [ ] is ( ) [ ] = In order for the FT to exist in the finite magnitude sense,

3. Z Transform. Recall that the Fourier transform (FT) of a DT signal xn [ ] is ( ) [ ] = In order for the FT to exist in the finite magnitude sense, 3. Z Trasform Referece: Etire Chapter 3 of text. Recall that the Fourier trasform (FT) of a DT sigal x [ ] is ω ( ) [ ] X e = j jω k = xe I order for the FT to exist i the fiite magitude sese, S = x [

More information

You may work in pairs or purely individually for this assignment.

You may work in pairs or purely individually for this assignment. CS 04 Problem Solvig i Computer Sciece OOC Assigmet 6: Recurreces You may work i pairs or purely idividually for this assigmet. Prepare your aswers to the followig questios i a plai ASCII text file or

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

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

#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

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

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

M A T H F A L L CORRECTION. Algebra I 1 4 / 1 0 / U N I V E R S I T Y O F T O R O N T O

M A T H F A L L CORRECTION. Algebra I 1 4 / 1 0 / U N I V E R S I T Y O F T O R O N T O M A T H 2 4 0 F A L L 2 0 1 4 HOMEWORK ASSIGNMENT #4 CORRECTION Algebra I 1 4 / 1 0 / 2 0 1 4 U N I V E R S I T Y O F T O R O N T O P r o f e s s o r : D r o r B a r - N a t a Correctio Homework Assigmet

More information

(6), (7) and (8) we have easily, if the C's are cancellable elements of S,

(6), (7) and (8) we have easily, if the C's are cancellable elements of S, VIOL. 23, 1937 MA THEMA TICS: H. S. VANDIVER 555 where the a's belog to S'. The R is said to be a repetitive set i S, with respect to S', ad with multiplier M. If S cotais a idetity E, the if we set a,

More information

Dirichlet s Theorem on Arithmetic Progressions

Dirichlet s Theorem on Arithmetic Progressions Dirichlet s Theorem o Arithmetic Progressios Athoy Várilly Harvard Uiversity, Cambridge, MA 0238 Itroductio Dirichlet s theorem o arithmetic progressios is a gem of umber theory. A great part of its beauty

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

1. INTRODUCTION. P r e s e n t e d h e r e is a generalization of Fibonacci numbers which is intimately connected with the arithmetic triangle.

1. INTRODUCTION. P r e s e n t e d h e r e is a generalization of Fibonacci numbers which is intimately connected with the arithmetic triangle. A GENERALIZATION OF FIBONACCI NUMBERS V.C. HARRIS ad CAROLYN C. STYLES Sa Diego State College ad Sa Diego Mesa College, Sa Diego, Califoria 1. INTRODUCTION P r e s e t e d h e r e is a geeralizatio of

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

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

Chapter 4. Fourier Series

Chapter 4. Fourier Series Chapter 4. Fourier Series At this poit we are ready to ow cosider the caoical equatios. Cosider, for eample the heat equatio u t = u, < (4.) subject to u(, ) = si, u(, t) = u(, t) =. (4.) Here,

More information

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

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 Abstract Some elemetary observatios o Narayaa polyomials ad related topics II: -Narayaa polyomials Joha Cigler Faultät für Mathemati Uiversität Wie ohacigler@uivieacat We show that Catala umbers cetral

More information

Recursive Algorithms. Recurrences. Recursive Algorithms Analysis

Recursive Algorithms. Recurrences. Recursive Algorithms Analysis Recursive Algorithms Recurreces Computer Sciece & Egieerig 35: Discrete Mathematics Christopher M Bourke cbourke@cseuledu A recursive algorithm is oe i which objects are defied i terms of other objects

More information

Chimica Inorganica 3

Chimica Inorganica 3 himica Iorgaica Irreducible Represetatios ad haracter Tables Rather tha usig geometrical operatios, it is ofte much more coveiet to employ a ew set of group elemets which are matrices ad to make the rule

More information

[ 11 ] z of degree 2 as both degree 2 each. The degree of a polynomial in n variables is the maximum of the degrees of its terms.

[ 11 ] z of degree 2 as both degree 2 each. The degree of a polynomial in n variables is the maximum of the degrees of its terms. [ 11 ] 1 1.1 Polyomial Fuctios 1 Algebra Ay fuctio f ( x) ax a1x... a1x a0 is a polyomial fuctio if ai ( i 0,1,,,..., ) is a costat which belogs to the set of real umbers ad the idices,, 1,...,1 are atural

More information

MAT 271 Project: Partial Fractions for certain rational functions

MAT 271 Project: Partial Fractions for certain rational functions MAT 7 Project: Partial Fractios for certai ratioal fuctios Prerequisite kowledge: partial fractios from MAT 7, a very good commad of factorig ad complex umbers from Precalculus. To complete this project,

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

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

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

SEQUENCES AND SERIES

SEQUENCES AND SERIES 9 SEQUENCES AND SERIES INTRODUCTION Sequeces have may importat applicatios i several spheres of huma activities Whe a collectio of objects is arraged i a defiite order such that it has a idetified first

More information

It is always the case that unions, intersections, complements, and set differences are preserved by the inverse image of a function.

It is always the case that unions, intersections, complements, and set differences are preserved by the inverse image of a function. MATH 532 Measurable Fuctios Dr. Neal, WKU Throughout, let ( X, F, µ) be a measure space ad let (!, F, P ) deote the special case of a probability space. We shall ow begi to study real-valued fuctios defied

More information

subcaptionfont+=small,labelformat=parens,labelsep=space,skip=6pt,list=0,hypcap=0 subcaption ALGEBRAIC COMBINATORICS LECTURE 8 TUESDAY, 2/16/2016

subcaptionfont+=small,labelformat=parens,labelsep=space,skip=6pt,list=0,hypcap=0 subcaption ALGEBRAIC COMBINATORICS LECTURE 8 TUESDAY, 2/16/2016 subcaptiofot+=small,labelformat=pares,labelsep=space,skip=6pt,list=0,hypcap=0 subcaptio ALGEBRAIC COMBINATORICS LECTURE 8 TUESDAY, /6/06. Self-cojugate Partitios Recall that, give a partitio λ, we may

More information

Inverse Matrix. A meaning that matrix B is an inverse of matrix A.

Inverse Matrix. A meaning that matrix B is an inverse of matrix A. Iverse Matrix Two square matrices A ad B of dimesios are called iverses to oe aother if the followig holds, AB BA I (11) The otio is dual but we ofte write 1 B A meaig that matrix B is a iverse of matrix

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

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

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

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

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

The Growth of Functions. Theoretical Supplement

The Growth of Functions. Theoretical Supplement The Growth of Fuctios Theoretical Supplemet The Triagle Iequality The triagle iequality is a algebraic tool that is ofte useful i maipulatig absolute values of fuctios. The triagle iequality says that

More information

CHAPTER 5. Theory and Solution Using Matrix Techniques

CHAPTER 5. Theory and Solution Using Matrix Techniques A SERIES OF CLASS NOTES FOR 2005-2006 TO INTRODUCE LINEAR AND NONLINEAR PROBLEMS TO ENGINEERS, SCIENTISTS, AND APPLIED MATHEMATICIANS DE CLASS NOTES 3 A COLLECTION OF HANDOUTS ON SYSTEMS OF ORDINARY DIFFERENTIAL

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

NEW FAST CONVERGENT SEQUENCES OF EULER-MASCHERONI TYPE

NEW FAST CONVERGENT SEQUENCES OF EULER-MASCHERONI TYPE UPB Sci Bull, Series A, Vol 79, Iss, 207 ISSN 22-7027 NEW FAST CONVERGENT SEQUENCES OF EULER-MASCHERONI TYPE Gabriel Bercu We itroduce two ew sequeces of Euler-Mascheroi type which have fast covergece

More information

Proof of Fermat s Last Theorem by Algebra Identities and Linear Algebra

Proof of Fermat s Last Theorem by Algebra Identities and Linear Algebra Proof of Fermat s Last Theorem by Algebra Idetities ad Liear Algebra Javad Babaee Ragai Youg Researchers ad Elite Club, Qaemshahr Brach, Islamic Azad Uiversity, Qaemshahr, Ira Departmet of Civil Egieerig,

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

Appendix: The Laplace Transform

Appendix: The Laplace Transform Appedix: The Laplace Trasform The Laplace trasform is a powerful method that ca be used to solve differetial equatio, ad other mathematical problems. Its stregth lies i the fact that it allows the trasformatio

More information

REVISION SHEET FP1 (MEI) ALGEBRA. Identities In mathematics, an identity is a statement which is true for all values of the variables it contains.

REVISION SHEET FP1 (MEI) ALGEBRA. Identities In mathematics, an identity is a statement which is true for all values of the variables it contains. The mai ideas are: Idetities REVISION SHEET FP (MEI) ALGEBRA Before the exam you should kow: If a expressio is a idetity the it is true for all values of the variable it cotais The relatioships betwee

More information

Continuous Functions

Continuous Functions Cotiuous Fuctios Q What does it mea for a fuctio to be cotiuous at a poit? Aswer- I mathematics, we have a defiitio that cosists of three cocepts that are liked i a special way Cosider the followig defiitio

More information

Axioms of Measure Theory

Axioms of Measure Theory MATH 532 Axioms of Measure Theory Dr. Neal, WKU I. The Space Throughout the course, we shall let X deote a geeric o-empty set. I geeral, we shall ot assume that ay algebraic structure exists o X so that

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

Solutions to Math 347 Practice Problems for the final

Solutions to Math 347 Practice Problems for the final Solutios to Math 347 Practice Problems for the fial 1) True or False: a) There exist itegers x,y such that 50x + 76y = 6. True: the gcd of 50 ad 76 is, ad 6 is a multiple of. b) The ifiimum of a set is

More information

The Jordan Normal Form: A General Approach to Solving Homogeneous Linear Systems. Mike Raugh. March 20, 2005

The Jordan Normal Form: A General Approach to Solving Homogeneous Linear Systems. Mike Raugh. March 20, 2005 The Jorda Normal Form: A Geeral Approach to Solvig Homogeeous Liear Sstems Mike Raugh March 2, 25 What are we doig here? I this ote, we describe the Jorda ormal form of a matrix ad show how it ma be used

More information

NOTE ON THE NUMERICAL TRANSCENDENTS S AND s = - 1. n n n BY PROFESSOR W. WOOLSEY JOHNSON.

NOTE ON THE NUMERICAL TRANSCENDENTS S AND s = - 1. n n n BY PROFESSOR W. WOOLSEY JOHNSON. NOTE ON THE NUMBERS S AND S =S l. 477 NOTE ON THE NUMERICAL TRANSCENDENTS S AND s = - 1. BY PROFESSOR W. WOOLSEY JOHNSON. 1. The umbers defied by the series 8 =l4--+-4--4-... ' O 3 W 4 W } where is a positive

More information

Regent College Maths Department. Further Pure 1. Proof by Induction

Regent College Maths Department. Further Pure 1. Proof by Induction Reget College Maths Departmet Further Pure Proof by Iductio Further Pure Proof by Mathematical Iductio Page Further Pure Proof by iductio The Edexcel syllabus says that cadidates should be able to: (a)

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

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

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

ON MATRICES WHOSE COEFFICIENTS ARE FUNCTIONS OF A SINGLE VARIABLE

ON MATRICES WHOSE COEFFICIENTS ARE FUNCTIONS OF A SINGLE VARIABLE ON MATRICES WHOSE COEFFICIENTS ARE FUNCTIONS OF A SINGLE VARIABLE BY J. H. M. WEDDERBURN 1. The methods usually* employed i reducig to its ormal form a matrix whose coefficiets are polyomials i a variable

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

Chapter 3. Strong convergence. 3.1 Definition of almost sure convergence

Chapter 3. Strong convergence. 3.1 Definition of almost sure convergence Chapter 3 Strog covergece As poited out i the Chapter 2, there are multiple ways to defie the otio of covergece of a sequece of radom variables. That chapter defied covergece i probability, covergece i

More information

2.4.2 A Theorem About Absolutely Convergent Series

2.4.2 A Theorem About Absolutely Convergent Series 0 Versio of August 27, 200 CHAPTER 2. INFINITE SERIES Add these two series: + 3 2 + 5 + 7 4 + 9 + 6 +... = 3 l 2. (2.20) 2 Sice the reciprocal of each iteger occurs exactly oce i the last series, we would

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

Generating Functions. 1 Operations on generating functions

Generating Functions. 1 Operations on generating functions Geeratig Fuctios The geeratig fuctio for a sequece a 0, a,..., a,... is defied to be the power series fx a x. 0 We say that a 0, a,... is the sequece geerated by fx ad a is the coefficiet of x. Example

More information

CHAPTER 1 SEQUENCES AND INFINITE SERIES

CHAPTER 1 SEQUENCES AND INFINITE SERIES CHAPTER SEQUENCES AND INFINITE SERIES SEQUENCES AND INFINITE SERIES (0 meetigs) Sequeces ad limit of a sequece Mootoic ad bouded sequece Ifiite series of costat terms Ifiite series of positive terms Alteratig

More information

Stochastic Matrices in a Finite Field

Stochastic Matrices in a Finite Field Stochastic Matrices i a Fiite Field Abstract: I this project we will explore the properties of stochastic matrices i both the real ad the fiite fields. We first explore what properties 2 2 stochastic matrices

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

Matrix representations of Fibonacci-like sequences

Matrix representations of Fibonacci-like sequences NTMSCI 6, No. 4, 03-0 08 03 New Treds i Mathematical Scieces http://dx.doi.org/0.085/tmsci.09.33 Matrix represetatios of Fiboacci-like sequeces Yasemi Tasyurdu Departmet of Mathematics, Faculty of Sciece

More information

Polynomial identity testing and global minimum cut

Polynomial identity testing and global minimum cut CHAPTER 6 Polyomial idetity testig ad global miimum cut I this lecture we will cosider two further problems that ca be solved usig probabilistic algorithms. I the first half, we will cosider the problem

More information

Chapter 6. Advanced Counting Techniques

Chapter 6. Advanced Counting Techniques Chapter 6 Advaced Coutig Techiques 6.: Recurrece Relatios Defiitio: A recurrece relatio for the sequece {a } is a equatio expressig a i terms of oe or more of the previous terms of the sequece: a,a2,a3,,a

More information

A Simplified Binet Formula for k-generalized Fibonacci Numbers

A Simplified Binet Formula for k-generalized Fibonacci Numbers A Simplified Biet Formula for k-geeralized Fiboacci Numbers Gregory P. B. Dresde Departmet of Mathematics Washigto ad Lee Uiversity Lexigto, VA 440 dresdeg@wlu.edu Zhaohui Du Shaghai, Chia zhao.hui.du@gmail.com

More 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

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

Linearly Independent Sets, Bases. Review. Remarks. A set of vectors,,, in a vector space is said to be linearly independent if the vector equation

Linearly Independent Sets, Bases. Review. Remarks. A set of vectors,,, in a vector space is said to be linearly independent if the vector equation Liearly Idepedet Sets Bases p p c c p Review { v v vp} A set of vectors i a vector space is said to be liearly idepedet if the vector equatio cv + c v + + c has oly the trivial solutio = = { v v vp} The

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

REVISION SHEET FP1 (MEI) ALGEBRA. Identities In mathematics, an identity is a statement which is true for all values of the variables it contains.

REVISION SHEET FP1 (MEI) ALGEBRA. Identities In mathematics, an identity is a statement which is true for all values of the variables it contains. the Further Mathematics etwork wwwfmetworkorguk V 07 The mai ideas are: Idetities REVISION SHEET FP (MEI) ALGEBRA Before the exam you should kow: If a expressio is a idetity the it is true for all values

More information

Chapter 6 Infinite Series

Chapter 6 Infinite Series Chapter 6 Ifiite Series I the previous chapter we cosidered itegrals which were improper i the sese that the iterval of itegratio was ubouded. I this chapter we are goig to discuss a topic which is somewhat

More information

PAijpam.eu ON DERIVATION OF RATIONAL SOLUTIONS OF BABBAGE S FUNCTIONAL EQUATION

PAijpam.eu ON DERIVATION OF RATIONAL SOLUTIONS OF BABBAGE S FUNCTIONAL EQUATION Iteratioal Joural of Pure ad Applied Mathematics Volume 94 No. 204, 9-20 ISSN: 3-8080 (prited versio); ISSN: 34-3395 (o-lie versio) url: http://www.ijpam.eu doi: http://dx.doi.org/0.2732/ijpam.v94i.2 PAijpam.eu

More information

Lecture 6 Chi Square Distribution (χ 2 ) and Least Squares Fitting

Lecture 6 Chi Square Distribution (χ 2 ) and Least Squares Fitting Lecture 6 Chi Square Distributio (χ ) ad Least Squares Fittig Chi Square Distributio (χ ) Suppose: We have a set of measuremets {x 1, x, x }. We kow the true value of each x i (x t1, x t, x t ). We would

More information

Mathematical Induction

Mathematical Induction Mathematical Iductio Itroductio Mathematical iductio, or just iductio, is a proof techique. Suppose that for every atural umber, P() is a statemet. We wish to show that all statemets P() are true. I a

More information

MASSACHUSETTS INSTITUTE OF TECHNOLOGY 6.436J/15.085J Fall 2008 Lecture 19 11/17/2008 LAWS OF LARGE NUMBERS II THE STRONG LAW OF LARGE NUMBERS

MASSACHUSETTS INSTITUTE OF TECHNOLOGY 6.436J/15.085J Fall 2008 Lecture 19 11/17/2008 LAWS OF LARGE NUMBERS II THE STRONG LAW OF LARGE NUMBERS MASSACHUSTTS INSTITUT OF TCHNOLOGY 6.436J/5.085J Fall 2008 Lecture 9 /7/2008 LAWS OF LARG NUMBRS II Cotets. The strog law of large umbers 2. The Cheroff boud TH STRONG LAW OF LARG NUMBRS While the weak

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