~W I F

Size: px
Start display at page:

Download "~W I F"

Transcription

1 A FIBONACCI PROPERTY OF WYTHOFF PAIRS ROBERT SILBER North Carolia State Uiversity, Raleigh, North Carolia I this paper we poit out aother of those fasciatig "coicideces" which are so characteristically associated with the Fiboacci umbers. It occurs i relatio to the so-called safe pairs (a, b ) for Wythoffs Nim [1, 2, 3]. These pairs have bee extesively aalyzed by Carlitz, Scoville ad Hoggatt i their researches o Fiboacci represetatios [4, 5, 6, 7], a cotext urelated to the game of im. The latter have carefully established the basic properties of the a ad b, so that eve though that which we are about to report is ot described i their ivestigatios, it is a ready cosequece of them. For coveiece ad for reasos of precedece, we refer to the pairs (a, b ) as Wyth off pairs. The first forty Wythoff pairs are listed i Table 1 for referece. We recall that the pairs are defied iductively as follows: (a-j, b-i) = (1, 2), ad, havig defied (aj, bj), (a2, b2),, (a, b ) f a +i is defied as the smallest positive iteger ot amog ai, bj, a2, b2,, a, b ad the b +i is defied asa / + ( + 1). Each positive iteger occurs exactly oce as a member of some Wyth off pair, ad the sequeces la ) ad {b } are (strictly) icreasig. t _ Wythoff [1] showed that a = faj ad b = fa 2 J, a beig the golde ratio (1 + V5)/2; a more elegat proof of this appears i [3]. This coectio of the Wythoff pairs with the golde ratio suggests to ay "Fiboaccist" that the Fiboacci umbers are ot very far out of the picture. The work of Carlitz et.'al. that we have metioed shows that the a ad b play a fudametal part i the aalysis of the Fiboacci umber system. We ow look at aother coectio with Fiboacci umbers. Table 1 The First Forty Wythoff Pairs / b b ~W a I F b ~~b~\ I examiig Table 1, it is iterestig to observe that the first few Fiboacci umbers occur paired with other Fiboacci umbers: (a l,bj = (1,2), (a 2,b 2 ) = (3,5), (a 5, b s ) = (8,13), (a l3, b l3 ) = (21,34), (a 34, b da ) = (55, 89). It is ot difficult to establish that this patter cotiues throughout the sequece of Wythoff pairs, usig the fact that lim (b /a ) = a ad also lim (F + j/f ) = a. However, a almost immediate proof ca be had, based o Eq. (3.5) of [4], which states that (1) a +b = a b 380

2 NOV A FIBONACCI PROPERTY OF WYTHOFF PAIRS 381 for each positive iteger. We defer the proof mometarily, it beig our itetio to state ad prove a geeralizatio of the foregoig. Clearly there are may Wythoff pairs whose members are ot Fiboacci umbers; the first such is (a 3, b 3 ) = (4,7). The pair (4,7) ca be used to geerate a Fiboacci sequece i the same way X\\dX(a u bj = (1,2) ca be cosidered to determie the usual Fiboacci umbers; we take G-j = 4, 62 = 7, G +2= G +f + G. The first few terms of the resultig Fiboacci sequece are It is (perhaps) a bit startlig to observe that 4, 7, 1 1, 1 8, 2 9, 4 7, -. ' (a 3,b 3 ) = (4,7), (a,b ) = (11, 18), (a lb,bj = (29,47). The pair (a 4, b 4 )= (6, 10) similarly geerates a Fiboacci sequece 6, 10, 16, 26, 42,68, - ad sure eough (a 4/ bj = (6, 10), (a 10, b j = (16, 26), (a 26, b j = (42, 68). It is time for our first theorem. Theorem. Let G u G 2, G 3, - be the Fiboacci sequece geerated by a Wythoff pair (a, b ). The every pairft? 1# G 2 ), (G 3, GJ, (G 5, GJ, - i s agai a Wythoff pair. Proof. By costructio, every Wythoff pair satisfies (2) a k + k = b k. Cosider the first four terms of the geerated Fiboacci sequece: Accordig to Eq. (1) so that Equatio (2) with k = b gives a,b,a +b,a +2b. so that the four terms uder cosideratio are i fact a +b = at, a +2b = a b + b. a b + b = b bp, a, b, a b, b b. Thus we have prove that i geeral (G 3, 4 ) is a Wythoff pair whe (G u G 2 ) is. But (G 5, G 6 ) ca be cosidered as cosistig of the third ad fourth terms of the Fiboacci sequece geerated by (G 3, G A ), ad the latter is already kow to be a Wythoff pair. I this way, the theorem follows by iductio. Thus we see that each Wythoff pair geerates a sequece of Wythoff pairs; the pairs followig the first pair of the sequece will be said to be geerated by the first pair. We defie a Wythoff pair to be primitive if o other Wythoff pair geerates it. It is clear that if (a m, b m ) geerates (a, b ), the m <. For this reaso, oe ca determie the first few primitive pairs by the followig algorithm, aalogous to Eratosthees' sieve. The first pair (1,2) is clearly primitive. All those geerated by (1,2) are elimiated (up to some specified poit i the table). The first pair remaiig must agai be primitive, ad all pairs geerated by that primitive are elimiated. The process is repeated. The first few primitive pairs so determied are pair umbers 1,3,4,6,8,9, 11, 12, 14, 1 6, - which we recogize at oce to be the sequece This occasios our ext theorem. a x, a 2, a 3,.

3 382 A FIBONACCI PROPERTY OF WYTHOFF PAIRS [NOV. Theorem. A Wythoff pair (a, h ) is primitive if ad oly if = a^ for some positive iteger k. Proof. We have see that the terms of the Fiboacci sequece geerated by ay Wythoff pair (a, b )are of the form *.b.*b.b b.a bb.b bb.~. From this it is obvious that ay o-primitive pair (a, b ) must have = b k for some positive iteger k, which makes every pair (a, b ) with = a^ a primitive pair. O the other had, the sequece a, b, a bp, b b, - geerated by (a,b ) shows clearly that each pair (a bk, b bf< ) is geerated by (a^, b^); thus every primitive pair (a, b ) must have/7 = a^. This theorem shows that the umber of primitive pairs is ifiite, ad has the followig corollary. Corollary. There exists a sequece of Fiboacci sequeces which simply covers the set of positive itegers. A iterestig property of the primitive pairs turs up whe we calculate successively the determiats I 3/7 b 31 b 1 J ' restrictig our attetio to those (a, b ) which are primitive. We fid that = 1, = 3, ad so o. This suggests that the value of the determiat applied to the k primitive is k - 1. By the foregoig theorem, we kow that the k th primitive is i fact (a a., b a.), so the suggested idetity becomes 2 3a k -b ak = k- 1, which follows readily from Eq. (3.2) of [4]. We coclude by iterpretig our results i terms of the fidigs i [4] ad [6]. Accordig to the latter, the Wy'thoff pairs (a, b ) are those pairs of positive itegers with the followig two properties: first, the caoical Fiboacci represetatio of b is exactly the left shift of the caoical Fiboacci represetatio of a, ad secod, the right-most 1 appearig i the represetatio of a occurs i a eve umbered positio. (I base 2 this would be aalogous to sayig that b = 2a ad that the largest power of 2 which divides * is odd). No two 1's appear i successio i the represetatios of a ad/?^. If we adda^ ad/?,,, each 1 i the represetatio of b will combie with its shift i the represetatio of a to yield a 1 i the positio immediately to the left of the added pair, sice F + F i = F +i. This meas that b +a has a represetatio which is exactly the left shift of b. By exactly the same reasoig, (b + a ) + b has a represetatio which is exactly the left shift of b + a, ad so forth. Hece, the Fiboacci sequece geerated by ay Wythoff pair, whe expressed caoically i the Fiboacci umber system, cosists of cosecutive left shifts of the first term of the sequece. I the simplest case, the pair (1,2) geerates the usual Fiboacci sequece, which i the Fiboacci umber system would be expressed ad the geerated pairs would be 10, 100, 1000, 10000, , - (10, 100), (1000, 10000),

4 1976] A FIBONACCI PROPERTY OF WYTHOFF PAIRS 383 which have the requisite properties that each b is the left shift of a ad that each a has its right-most 1 i a eve-umbered positio. The ext case correspods to the sequece geerated by (4, 7); 4, 7, 11, 18, -. I Fiboacci, this appears as 1010, 10100, , ,-. This procedure ca be traced back a additioal step to the idex of the pair (a, b ). Doig so provides i additio a simple iterpretatio of the primitive pairs i terms of Fiboacci represetatios. There is a prescriptio i [6] for geeratig a Wythoff pair (a, b ) from its idex, but it ecessitates the so-called secod caoical Fiboacci represetatio. For preset purposes it suffices to remark that the secod caoical represetatio of ay ca be obtaied by addig 1 to the usual caoical represetatio of - 1. (For example,the caoical represetatio of 7 is 10100, so the secod caoical represetatio of 8 is 10101). The umbers a ad b are the obtaied from successive left shifts of the secod caoical represetatio of. Thus, i the example of (4,7), we obtai the secod caoical represetatio of 4 as = 1001 ad geerate a b a +b = a b, etc : We have see that the primitive pairs correspod to the case = a^. It is readily established o the basis of the results i [4] that the umbers a^ are precisely those umbers whose secod caoical Fiboacci represetatios cotai a 1 i the first positio (as follows: first, a umber is a b/< if ad oly if its caoical represetatio cotais its right-most 1 i a odd positio-which is ever the first-ad, secod, a secod caoical represetatio fails to be caoical if ad oly if it cotais a 1 i the first positio). It follows that the primitive pairs (a, b ) are precisely those for which, the secod caoical represetatio of havig a 1 i the first positio, the caoical represetatio of a eds i 10 ad that of h eds i 1QO. Other terms of the geerated Fiboacci sequece have additioal zeroes, the locatio of ay umber i the sequece beig exactly depedet o the umber of termial zeroes i its caoical represetatio. This eables oe to determie for ay positive iteger/? exactly which primitive Wythoff pair geerates the Fiboacci sequece i which that appears, as well as the locatio of i that sequece. First determie the caoical Fiboacci represetatio of. The portio of the represetatio betwee the first ad last 1's, iclusive, is the secod caoical represetatio of the umber k of the primitive Wythoff pair which geerates the Fiboacci sequece cotaiig. Oe left shift produces a^; aother produces b^. Coutig a^ as the first term, b/< as the secod, ad so forth, the i th term will equal, where / is the umber of zeroes prior to the first 1 i the Fiboacci represetatio of A7. For example, let = 52. I Fiboacci, 52 is represeted Sice represets 8 ad the represetatio termiates i four zeroes, 52 must be the fourth term of the Fiboacci sequece geerated by the primitive pair (a 8, b B ). As cofirmatio we ote that this particular sequece is 12,20,32,52,84,-. AFOOTWOTE Because of the coectio of the Wythoff pairs with Wythoff's Mim, the precedig prescriptio for geeratig. Wythoff pairs is clearly also a prescriptio for playig Wythoff's Nim usig the Fiboacci umber system. This gives the Fiboacci umber system a role i this game quite aalogous to the role of the biary umber system i Bouto's Nim [8]. The aalysis of Wythoff's Nim usig Fiboacci represetatios ca be made self-cotaied ad elemetary, certaily ot requirig the level of mathematical sophisticatio required to follow the ivestigatios i [4, 5, 6, 7]. For the beefit of those iterested i mathematical recreatios, we provide this aalysis i a compaio paper [9]. It is iterestig to ote that the role of the Fiboacci umber system i im games was already aticipated by Whiiha [10] i 1963.

5 384 A FIBONACCI PROPERTY OF WYTHOFF PAIRS NOV REFERENCES 1. W. A. Wythoff, '"A Modificatio of the Game of Nim," NieuwArchiefvoorWiskude, 2d Series, Vol. 7, 1907, pp A. P. Domoryad, Mathematical Games ad Pastimes, N. Y., Macmilla Co., 1964, pp H. S. M. Coxeter, "The Golde Sectio, Phyllotaxis, ad Wythoff's Game,"Scripta Mathematica, Vol. 19, 1953, pp L Carlitz, R. Scoville ad V. E. Hoggatt, Jr., "Fiboacci Represetatios," The Fiboacci Quarterly, Vol. 10, 1972, pp L Carlitz, et. al., "Lucas Represetatios," The Fiboacci Quarterly, Vol. 10, 1972, pp L Carlitz, et. al., "Addedum to the Paper 'Fiboacci Represetatios'," The Fiboacci Quarterly, Vol. 10, 1972, pp L Carlitz, R. Scoville ad T. Vaugha, "Some Arithmetic Fuctios Related to Fiboacci Numbers," The Fiboacci Quarterly, Vol. 11, 1973, pp C.L. Bouto, "Nim, A Game with a Complete Mathematical Theory," Aals of Mathematics, , pp R. Silber, "Wythoff's Nim ad Fiboacci Represetatios," to appear, The Fiboacci Quarterly. 10. M. J. Whiiha, "Fiboacci Nim," The Fiboacci Quarterly, Vol. 1, No. 4, 1963, pp *******

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

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

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

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

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

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

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

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

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

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

Square-Congruence Modulo n

Square-Congruence Modulo n Square-Cogruece Modulo Abstract This paper is a ivestigatio of a equivalece relatio o the itegers that was itroduced as a exercise i our Discrete Math class. Part I - Itro Defiitio Two itegers are Square-Cogruet

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

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

P. Z. Chinn Department of Mathematics, Humboldt State University, Arcata, CA

P. Z. Chinn Department of Mathematics, Humboldt State University, Arcata, CA RISES, LEVELS, DROPS AND + SIGNS IN COMPOSITIONS: EXTENSIONS OF A PAPER BY ALLADI AND HOGGATT S. Heubach Departmet of Mathematics, Califoria State Uiversity Los Ageles 55 State Uiversity Drive, Los Ageles,

More 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

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

SEQUENCES AND SERIES

SEQUENCES AND SERIES Sequeces ad 6 Sequeces Ad SEQUENCES AND SERIES Successio of umbers of which oe umber is desigated as the first, other as the secod, aother as the third ad so o gives rise to what is called a sequece. Sequeces

More information

Counting Well-Formed Parenthesizations Easily

Counting Well-Formed Parenthesizations Easily Coutig Well-Formed Parethesizatios Easily Pekka Kilpeläie Uiversity of Easter Filad School of Computig, Kuopio August 20, 2014 Abstract It is well kow that there is a oe-to-oe correspodece betwee ordered

More information

MA131 - Analysis 1. Workbook 3 Sequences II

MA131 - Analysis 1. Workbook 3 Sequences II MA3 - Aalysis Workbook 3 Sequeces II Autum 2004 Cotets 2.8 Coverget Sequeces........................ 2.9 Algebra of Limits......................... 2 2.0 Further Useful Results........................

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

CHAPTER 10 INFINITE SEQUENCES AND SERIES

CHAPTER 10 INFINITE SEQUENCES AND SERIES CHAPTER 10 INFINITE SEQUENCES AND SERIES 10.1 Sequeces 10.2 Ifiite Series 10.3 The Itegral Tests 10.4 Compariso Tests 10.5 The Ratio ad Root Tests 10.6 Alteratig Series: Absolute ad Coditioal Covergece

More information

Measure and Measurable Functions

Measure and Measurable Functions 3 Measure ad Measurable Fuctios 3.1 Measure o a Arbitrary σ-algebra Recall from Chapter 2 that the set M of all Lebesgue measurable sets has the followig properties: R M, E M implies E c M, E M for N implies

More information

Sequences. Notation. Convergence of a Sequence

Sequences. Notation. Convergence of a Sequence Sequeces A sequece is essetially just a list. Defiitio (Sequece of Real Numbers). A sequece of real umbers is a fuctio Z (, ) R for some real umber. Do t let the descriptio of the domai cofuse you; it

More 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

Lecture Overview. 2 Permutations and Combinations. n(n 1) (n (k 1)) = n(n 1) (n k + 1) =

Lecture Overview. 2 Permutations and Combinations. n(n 1) (n (k 1)) = n(n 1) (n k + 1) = COMPSCI 230: Discrete Mathematics for Computer Sciece April 8, 2019 Lecturer: Debmalya Paigrahi Lecture 22 Scribe: Kevi Su 1 Overview I this lecture, we begi studyig the fudametals of coutig discrete objects.

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

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

(A sequence also can be thought of as the list of function values attained for a function f :ℵ X, where f (n) = x n for n 1.) x 1 x N +k x N +4 x 3

(A sequence also can be thought of as the list of function values attained for a function f :ℵ X, where f (n) = x n for n 1.) x 1 x N +k x N +4 x 3 MATH 337 Sequeces Dr. Neal, WKU Let X be a metric space with distace fuctio d. We shall defie the geeral cocept of sequece ad limit i a metric space, the apply the results i particular to some special

More information

( a) ( ) 1 ( ) 2 ( ) ( ) 3 3 ( ) =!

( a) ( ) 1 ( ) 2 ( ) ( ) 3 3 ( ) =! .8,.9: Taylor ad Maclauri Series.8. Although we were able to fid power series represetatios for a limited group of fuctios i the previous sectio, it is ot immediately obvious whether ay give fuctio has

More information

The Boolean Ring of Intervals

The Boolean Ring of Intervals MATH 532 Lebesgue Measure Dr. Neal, WKU We ow shall apply the results obtaied about outer measure to the legth measure o the real lie. Throughout, our space X will be the set of real umbers R. Whe ecessary,

More information

Section 5.1 The Basics of Counting

Section 5.1 The Basics of Counting 1 Sectio 5.1 The Basics of Coutig Combiatorics, the study of arragemets of objects, is a importat part of discrete mathematics. I this chapter, we will lear basic techiques of coutig which has a lot of

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

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

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

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

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

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

More information

PROPERTIES OF AN EULER SQUARE

PROPERTIES OF AN EULER SQUARE PROPERTIES OF N EULER SQURE bout 0 the mathematicia Leoard Euler discussed the properties a x array of letters or itegers ow kow as a Euler or Graeco-Lati Square Such squares have the property that every

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

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

MAT1026 Calculus II Basic Convergence Tests for Series

MAT1026 Calculus II Basic Convergence Tests for Series MAT026 Calculus II Basic Covergece Tests for Series Egi MERMUT 202.03.08 Dokuz Eylül Uiversity Faculty of Sciece Departmet of Mathematics İzmir/TURKEY Cotets Mootoe Covergece Theorem 2 2 Series of Real

More information

A Block Cipher Using Linear Congruences

A Block Cipher Using Linear Congruences Joural of Computer Sciece 3 (7): 556-560, 2007 ISSN 1549-3636 2007 Sciece Publicatios A Block Cipher Usig Liear Cogrueces 1 V.U.K. Sastry ad 2 V. Jaaki 1 Academic Affairs, Sreeidhi Istitute of Sciece &

More information

Induction: Solutions

Induction: Solutions Writig Proofs Misha Lavrov Iductio: Solutios Wester PA ARML Practice March 6, 206. Prove that a 2 2 chessboard with ay oe square removed ca always be covered by shaped tiles. Solutio : We iduct o. For

More information

1 Statement of the Game

1 Statement of the Game ANALYSIS OF THE CHOW-ROBBINS GAME JON LU May 10, 2016 Abstract Flip a coi repeatedly ad stop wheever you wat. Your payoff is the proportio of heads ad you wish to maximize this payoff i expectatio. I this

More information

Lecture 2: April 3, 2013

Lecture 2: April 3, 2013 TTIC/CMSC 350 Mathematical Toolkit Sprig 203 Madhur Tulsiai Lecture 2: April 3, 203 Scribe: Shubhedu Trivedi Coi tosses cotiued We retur to the coi tossig example from the last lecture agai: Example. Give,

More information

Unit 6: Sequences and Series

Unit 6: Sequences and Series AMHS Hoors Algebra 2 - Uit 6 Uit 6: Sequeces ad Series 26 Sequeces Defiitio: A sequece is a ordered list of umbers ad is formally defied as a fuctio whose domai is the set of positive itegers. It is commo

More information

An analog of the arithmetic triangle obtained by replacing the products by the least common multiples

An analog of the arithmetic triangle obtained by replacing the products by the least common multiples arxiv:10021383v2 [mathnt] 9 Feb 2010 A aalog of the arithmetic triagle obtaied by replacig the products by the least commo multiples Bair FARHI bairfarhi@gmailcom MSC: 11A05 Keywords: Al-Karaji s triagle;

More information

MA131 - Analysis 1. Workbook 2 Sequences I

MA131 - Analysis 1. Workbook 2 Sequences I MA3 - Aalysis Workbook 2 Sequeces I Autum 203 Cotets 2 Sequeces I 2. Itroductio.............................. 2.2 Icreasig ad Decreasig Sequeces................ 2 2.3 Bouded Sequeces..........................

More information

INEQUALITIES BJORN POONEN

INEQUALITIES BJORN POONEN INEQUALITIES BJORN POONEN 1 The AM-GM iequality The most basic arithmetic mea-geometric mea (AM-GM) iequality states simply that if x ad y are oegative real umbers, the (x + y)/2 xy, with equality if ad

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

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

Week 5-6: The Binomial Coefficients

Week 5-6: The Binomial Coefficients Wee 5-6: The Biomial Coefficiets March 6, 2018 1 Pascal Formula Theorem 11 (Pascal s Formula For itegers ad such that 1, ( ( ( 1 1 + 1 The umbers ( 2 ( 1 2 ( 2 are triagle umbers, that is, The petago umbers

More information

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

Product measures, Tonelli s and Fubini s theorems For use in MAT3400/4400, autumn 2014 Nadia S. Larsen. Version of 13 October 2014. Product measures, Toelli s ad Fubii s theorems For use i MAT3400/4400, autum 2014 Nadia S. Larse Versio of 13 October 2014. 1. Costructio of the product measure The purpose of these otes is to preset the

More information

Sums, products and sequences

Sums, products and sequences Sums, products ad sequeces How to write log sums, e.g., 1+2+ (-1)+ cocisely? i=1 Sum otatio ( sum from 1 to ): i 3 = 1 + 2 + + If =3, i=1 i = 1+2+3=6. The ame ii does ot matter. Could use aother letter

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

arxiv: v1 [math.nt] 10 Dec 2014

arxiv: v1 [math.nt] 10 Dec 2014 A DIGITAL BINOMIAL THEOREM HIEU D. NGUYEN arxiv:42.38v [math.nt] 0 Dec 204 Abstract. We preset a triagle of coectios betwee the Sierpisi triagle, the sum-of-digits fuctio, ad the Biomial Theorem via a

More information

7 Sequences of real numbers

7 Sequences of real numbers 40 7 Sequeces of real umbers 7. Defiitios ad examples Defiitio 7... A sequece of real umbers is a real fuctio whose domai is the set N of atural umbers. Let s : N R be a sequece. The the values of s are

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

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

4 The Sperner property.

4 The Sperner property. 4 The Sperer property. I this sectio we cosider a surprisig applicatio of certai adjacecy matrices to some problems i extremal set theory. A importat role will also be played by fiite groups. I geeral,

More information

AMS Mathematics Subject Classification : 40A05, 40A99, 42A10. Key words and phrases : Harmonic series, Fourier series. 1.

AMS Mathematics Subject Classification : 40A05, 40A99, 42A10. Key words and phrases : Harmonic series, Fourier series. 1. J. Appl. Math. & Computig Vol. x 00y), No. z, pp. A RECURSION FOR ALERNAING HARMONIC SERIES ÁRPÁD BÉNYI Abstract. We preset a coveiet recursive formula for the sums of alteratig harmoic series of odd order.

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

Beurling Integers: Part 2

Beurling Integers: Part 2 Beurlig Itegers: Part 2 Isomorphisms Devi Platt July 11, 2015 1 Prime Factorizatio Sequeces I the last article we itroduced the Beurlig geeralized itegers, which ca be represeted as a sequece of real umbers

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

Seunghee Ye Ma 8: Week 5 Oct 28

Seunghee Ye Ma 8: Week 5 Oct 28 Week 5 Summary I Sectio, we go over the Mea Value Theorem ad its applicatios. I Sectio 2, we will recap what we have covered so far this term. Topics Page Mea Value Theorem. Applicatios of the Mea Value

More information

Chapter 0. Review of set theory. 0.1 Sets

Chapter 0. Review of set theory. 0.1 Sets Chapter 0 Review of set theory Set theory plays a cetral role i the theory of probability. Thus, we will ope this course with a quick review of those otios of set theory which will be used repeatedly.

More information

Random Models. Tusheng Zhang. February 14, 2013

Random Models. Tusheng Zhang. February 14, 2013 Radom Models Tusheg Zhag February 14, 013 1 Radom Walks Let me describe the model. Radom walks are used to describe the motio of a movig particle (object). Suppose that a particle (object) moves alog the

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

Chapter IV Integration Theory

Chapter IV Integration Theory Chapter IV Itegratio Theory Lectures 32-33 1. Costructio of the itegral I this sectio we costruct the abstract itegral. As a matter of termiology, we defie a measure space as beig a triple (, A, µ), where

More information

Sequences I. Chapter Introduction

Sequences I. Chapter Introduction Chapter 2 Sequeces I 2. Itroductio A sequece is a list of umbers i a defiite order so that we kow which umber is i the first place, which umber is i the secod place ad, for ay atural umber, we kow which

More information

On the Fibonacci-like Sequences of Higher Order

On the Fibonacci-like Sequences of Higher Order Article Iteratioal Joural of oder atheatical Scieces, 05, 3(): 5-59 Iteratioal Joural of oder atheatical Scieces Joural hoepage: wwwoderscietificpressco/jourals/ijsaspx O the Fiboacci-like Sequeces of

More information

Disjoint set (Union-Find)

Disjoint set (Union-Find) CS124 Lecture 7 Fall 2018 Disjoit set (Uio-Fid) For Kruskal s algorithm for the miimum spaig tree problem, we foud that we eeded a data structure for maitaiig a collectio of disjoit sets. That is, we eed

More information

Continued Fractions and Pell s Equation

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

More information

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

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

More information

Matrices and vectors

Matrices and vectors Oe Matrices ad vectors This book takes for grated that readers have some previous kowledge of the calculus of real fuctios of oe real variable It would be helpful to also have some kowledge of liear algebra

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

Section 5.5. Infinite Series: The Ratio Test

Section 5.5. Infinite Series: The Ratio Test Differece Equatios to Differetial Equatios Sectio 5.5 Ifiite Series: The Ratio Test I the last sectio we saw that we could demostrate the covergece of a series a, where a 0 for all, by showig that a approaches

More information

CONVERGENCE OF SERIES. 225 SOME THEOREMS ON THE CONVERGENCE OF SERIES. BY PROFESSOR R. D. CARMICHAEL.

CONVERGENCE OF SERIES. 225 SOME THEOREMS ON THE CONVERGENCE OF SERIES. BY PROFESSOR R. D. CARMICHAEL. CONVERGENCE OF SERIES. 225 SOME THEOREMS ON THE CONVERGENCE OF SERIES. BY PROFESSOR R. D. CARMICHAEL. (Read before the America Mathematical Society, September 8, 1913.) No geeral criteria are kow for the

More information

Chapter 7 COMBINATIONS AND PERMUTATIONS. where we have the specific formula for the binomial coefficients:

Chapter 7 COMBINATIONS AND PERMUTATIONS. where we have the specific formula for the binomial coefficients: Chapter 7 COMBINATIONS AND PERMUTATIONS We have see i the previous chapter that (a + b) ca be writte as 0 a % a & b%þ% a & b %þ% b where we have the specific formula for the biomial coefficiets: '!!(&)!

More information

Linear Regression Demystified

Linear Regression Demystified Liear Regressio Demystified Liear regressio is a importat subject i statistics. I elemetary statistics courses, formulae related to liear regressio are ofte stated without derivatio. This ote iteds to

More information

1.3 Convergence Theorems of Fourier Series. k k k k. N N k 1. With this in mind, we state (without proof) the convergence of Fourier series.

1.3 Convergence Theorems of Fourier Series. k k k k. N N k 1. With this in mind, we state (without proof) the convergence of Fourier series. .3 Covergece Theorems of Fourier Series I this sectio, we preset the covergece of Fourier series. A ifiite sum is, by defiitio, a limit of partial sums, that is, a cos( kx) b si( kx) lim a cos( kx) b si(

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

Math 61CM - Solutions to homework 3

Math 61CM - Solutions to homework 3 Math 6CM - Solutios to homework 3 Cédric De Groote October 2 th, 208 Problem : Let F be a field, m 0 a fixed oegative iteger ad let V = {a 0 + a x + + a m x m a 0,, a m F} be the vector space cosistig

More information

THE APPEARANCE OF FIBONACCI AND LUCAS NUMBERS IN THE SIMULATION OF ELECTRICAL POWER LINES SUPPLIED BY TWO SIDES

THE APPEARANCE OF FIBONACCI AND LUCAS NUMBERS IN THE SIMULATION OF ELECTRICAL POWER LINES SUPPLIED BY TWO SIDES THE APPEARANCE OF FIBONACCI AND LUCAS NUMBERS IN THE SIMULATION OF ELECTRICAL POWER LINES SUPPLIED BY TWO SIDES Giuseppe Ferri Dipartimeto di Ihgegeria Elettrica-FacoM di Igegeria, Uiversita di L'Aquila

More information

INFINITE SEQUENCES AND SERIES

INFINITE SEQUENCES AND SERIES INFINITE SEQUENCES AND SERIES INFINITE SEQUENCES AND SERIES I geeral, it is difficult to fid the exact sum of a series. We were able to accomplish this for geometric series ad the series /[(+)]. This is

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

De Bruijn Sequences for the Binary Strings with Maximum Density

De Bruijn Sequences for the Binary Strings with Maximum Density De Bruij Sequeces for the Biary Strigs with Maximum Desity Joe Sawada 1, Brett Steves 2, ad Aaro Williams 2 1 jsawada@uoguelph.ca School of Computer Sciece, Uiversity of Guelph, CANADA 2 brett@math.carleto.ca

More information

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

De la Vallée Poussin Summability, the Combinatorial Sum 2n 1 J o u r a l of Mathematics ad Applicatios JMA No 40, pp 5-20 (2017 De la Vallée Poussi Summability, the Combiatorial Sum 1 ( 2 ad the de la Vallée Poussi Meas Expasio Ziad S. Ali Abstract: I this paper

More information

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

Sequences and Series of Functions

Sequences and Series of Functions Chapter 6 Sequeces ad Series of Fuctios 6.1. Covergece of a Sequece of Fuctios Poitwise Covergece. Defiitio 6.1. Let, for each N, fuctio f : A R be defied. If, for each x A, the sequece (f (x)) coverges

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

4.1 Sigma Notation and Riemann Sums

4.1 Sigma Notation and Riemann Sums 0 the itegral. Sigma Notatio ad Riema Sums Oe strategy for calculatig the area of a regio is to cut the regio ito simple shapes, calculate the area of each simple shape, ad the add these smaller areas

More information

Probability, Expectation Value and Uncertainty

Probability, Expectation Value and Uncertainty Chapter 1 Probability, Expectatio Value ad Ucertaity We have see that the physically observable properties of a quatum system are represeted by Hermitea operators (also referred to as observables ) such

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

NUMERICAL METHODS FOR SOLVING EQUATIONS

NUMERICAL METHODS FOR SOLVING EQUATIONS Mathematics Revisio Guides Numerical Methods for Solvig Equatios Page 1 of 11 M.K. HOME TUITION Mathematics Revisio Guides Level: GCSE Higher Tier NUMERICAL METHODS FOR SOLVING EQUATIONS Versio:. Date:

More information

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

(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

MATH 112: HOMEWORK 6 SOLUTIONS. Problem 1: Rudin, Chapter 3, Problem s k < s k < 2 + s k+1

MATH 112: HOMEWORK 6 SOLUTIONS. Problem 1: Rudin, Chapter 3, Problem s k < s k < 2 + s k+1 MATH 2: HOMEWORK 6 SOLUTIONS CA PRO JIRADILOK Problem. If s = 2, ad Problem : Rudi, Chapter 3, Problem 3. s + = 2 + s ( =, 2, 3,... ), prove that {s } coverges, ad that s < 2 for =, 2, 3,.... Proof. The

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

Lecture 2.5: Sequences

Lecture 2.5: Sequences Lecture.5: Sequeces CS 50, Discrete Structures, Fall 015 Nitesh Saxea Adopted from previous lectures by Zeph Gruschlag Course Admi HW posted Covers Chapter Due Oct 0 (Tue) Mid Term 1: Oct 15 (Thursday)

More information