TILING PROOFS OF SOME FIBONACCI-LUCAS RELATIONS. Mark Shattuck Department of Mathematics, University of Tennessee, Knoxville, TN , USA
|
|
- Terence Smith
- 5 years ago
- Views:
Transcription
1 INTEGERS: ELECTRONIC JOURNAL OF COMBINATORIAL NUMBER THEORY 8 (008), #A18 TILING PROOFS OF SOME FIBONACCI-LUCAS RELATIONS Mark Shattuck Department of Mathematics, University of Tennessee, Knoxville, TN , USA shattuck@math.utk.edu Received: 3/6/07, Revised: 1/7/08, Accepted: 4/18/08, Published: 5/8/08 Abstract We provide tiling proofs for some relations between Fibonacci Lucas numbers, as requested by Benjamin Quinn in their text, Proofs that Really Count. Extending our arguments yields Gibonacci generalizations of these identities. 1. Introduction Let F n L n denote the Fibonacci Lucas numbers defined, respectively, by F 0 = 0, F 1 = 1 with F n = F n 1 + F n if n by L 0 =, L 1 = 1 with L n = L n 1 + L n if n. The following four relations can be shown using the Binet formulas for F n L n occur as (V85) (V88) in Vajda [: F (k+3)t = F t [( 1) (k+1)t + F (k+)t = F t ( 1) it L (k+ i)t, (1.1) ( 1) it L (k+1 i)t, (1.) L (k+3)t = L t [( 1) (k+1)(t+1) + F (k+)t = L t ( 1) i(t+1) L (k+ i)t, (1.3) ( 1) i(t+1) F (k+1 i)t, (1.4) where k t are nonnegative integers. Benjamin Quinn request combinatorial proofs of (1.1) (1.4) on page 145 of their text, Proofs that Really Count [1. In this note, we provide tiling proofs for (1.1) (1.4) as well as for a couple of closely related identities. The arguments
2 INTEGERS: ELECTRONIC JOURNAL OF COMBINATORIAL NUMBER THEORY 8 (008), #A18 can be extended to yield generalizations involving Gibonacci numbers. The tiling proofs we give will also supply a combinatorial insight into the various divisibility relations implicit in (1.1) (1.4) within/between the Fibonacci Lucas sequences. The Fibonacci number F n+1 counts tilings of a board of length n with cells labeled 1,,..., n using squares dominos (termed n-tilings). The Lucas number L n is given by the simple relation L n = F n+1 + F n 1, n. (1.5) From (1.5), we see that L n counts n-tilings in which one may circle a domino covering cells n 1 n, which we ll term Lucas n-tilings. (There are F n 1 Lucas n-tilings which end in a circled domino F n+1 Lucas n-tilings which do not.) We ll say that a tiling is breakable at m (as in [1, p. 3) if cell m is covered by a square or by a second segment of a domino. The 5-tiling below is breakable at 0 (vacuously), 1, 3, 5. For m 0, let F m L m denote the sets consisting of m-tilings of Lucas m-tilings, respectively.. Tiling Proofs We first provide a combinatorial interpretation for (1.) when t is even. By (1.5), we re to show ( ) F (k+)t = Ft F (k+1 i)t+1 + F t F (k+1 i)t 1. (.1) Given i, 0 i k, let F i F (k+)t 1 comprise those tilings starting with it consecutive dominos, but not with (i + 1)t consecutive dominos. There are clearly F t F (k+1 i)t 1 members of F i that are not breakable at (i + 1)t, as such tilings can be decomposed as d it δ 1 dδ, where δ 1 δ are tilings of length t 1 (k + 1 i)t, respectively. So we need to show that there are F t F (k+1 i)t+1 members of F i that are breakable at (i + 1)t. Suppose λ F i is breakable at (i + 1)t. Let α be the t-tiling obtained by taking all the pieces in λ covering cells it + 1 through (i + 1)t β be the [(k + 1 i)t 1-tiling obtained by taking all the pieces in λ past cell (i + 1)t. We place α above β, offsetting the tilings by shifting β to the right by one cell. (Tiling α covers cells 1 through t β covers cells through (k + 1 i)t.) Look for the first fault line passing through α β. (A fault line occurs at cell j if both α β are breakable at cell j.) Exchange all the pieces in α past the first fault line with all the pieces in β past it (i.e., swap tails as shown) to obtain (A, B) F (k+1 i)t F t 1.
3 INTEGERS: ELECTRONIC JOURNAL OF COMBINATORIAL NUMBER THEORY 8 (008), #A18 3 Figure 1: Swapping tails past cell 8 converts (α, β) into (A, B). Note that λ F i implies that tails can always be swapped as it cannot be the case that α consists of β starts with t dominos. (If i = k, there is a single case in which tails of length zero are swapped.) Since t 1 is odd, there is always at least one square in a tiling of length t 1. Thus, the inverse on F (k+1 i)t F t 1 can always be defined, which completes the even case. Now suppose t 1 is odd. With the F i as above, let F i > := k j=i+1 F j, 0 i k ; (.) note that F i > = F (k i)t, as members of F i > must start with at least (i + 1)t consecutive dominos. There are F t F (k+1 i)t 1 members of F (k+)t 1 starting with it dominos that aren t breakable at (i + 1)t. These tilings consist of the F (k i)t members of F i > (they aren t breakable at (i+1)t since t is odd) as well as the members of F i that aren t breakable at (i + 1)t. Upon subtraction, there are then F t F (k+1 i)t 1 F (k i)t members of F i that aren t breakable at (i + 1)t. If λ F i is breakable at (i + 1)t, then use the correspondence above with F (k+1 i)t F t 1, noting that now the F (k i)t ordered pairs whose first component starts with t+1 dominos whose second component consists of t 1 dominos are missed. Thus, there are F t F (k+1 i)t+1 F (k i)t members of F i that are breakable at (i + 1)t. Upon adding the F t F (k+1 i)t 1 F (k i)t members of F i that aren t breakable at (i + 1)t, we see that there are (F t F (k+1 i)t+1 F (k i)t ) + (F t F (k+1 i)t 1 F (k i)t ) = F t L (k+1 i)t F (k i)t members of F i altogether, which implies F i + F i > = F t L (k+1 i)t. Therefore, F t ( 1) i L (k+1 i)t = ( 1) [ i F i + F i > = F i = F (k+)t 1 = F (k+)t,
4 INTEGERS: ELECTRONIC JOURNAL OF COMBINATORIAL NUMBER THEORY 8 (008), #A18 4 where the second equality follows from a simple characteristic function argument: If 0 j k λ F j, then both the second third sums count λ one time, the second j 1 since ( 1) j + ( 1) i = 1. This completes the odd case the proof of (1.). A slight modification of the preceding argument gives (1.1) as well. We now turn to identity (1.3), first assuming t 1 is odd. A similar proof will apply to (1.4). By (1.5), we re to show L (k+3)t = L t + (F t+1 + F t 1 ) L (k+ i)t. (.3) Given i, 0 i k + 1, let L i L (k+3)t comprise those tilings starting with it consecutive dominos, but not with (i + 1)t consecutive dominos. Clearly, L k+1 = L t. If 0 i k, then there are F t+1 L (k+ i)t members of L i that are breakable at (i + 1)t as well, since such tilings can be decomposed as d it δ 1 δ, where δ 1 is a regular tiling of length t δ is a Lucas tiling of length (k + i)t. So we need to show that there are F t 1 L (k+ i)t members of L i that are not breakable at (i + 1)t. Suppose λ L i is not breakable at (i + 1)t. Let α be the (t 1)-tiling obtained by taking all the pieces in λ covering cells it + 1 through (i + 1)t 1 β be the Lucas [(k + i)t 1-tiling obtained by taking all the pieces in λ past cell (i + 1)t + 1. Set α above β, shifting β to the right by one cell, exchange pieces past the first fault line to obtain (A, B) L (k+ i)t F t. Note that this operation can always be performed since λ L i can always be reversed since t is odd. If t is even, then let L i > := k+1 j=i+1 L j, 0 i k, (.4) where the L i are as above. Note that L i > = L (k+1 i)t, since members of L i > must start with at least (i + 1)t consecutive dominos. If 0 i k, then there are F t+1 L (k+ i)t members of L (k+3)t which start with it consecutive dominos are breakable at (i + 1)t. Since t is even, there are among these the L (k+1 i)t members of L i >. By subtraction, we get F t+1 L (k+ i)t L (k+1 i)t members of L i that are breakable at (i + 1)t if 0 i k. If λ L i is not breakable at (i+1)t, then use the correspondence above with L (k+ i)t F t, noting that now the ordered pairs whose second component consists of t 1 dominos whose first component starts with t dominos are missed. Thus, there are F t 1L (k+ i)t L (k+1 i)t members of L i that aren t breakable at (i+1)t (F t+1 L (k+ i)t L (k+1 i)t )+ (F t 1 L (k+ i)t L (k+1 i)t ) = L t L (k+ i)t L (k+1 i)t members of L i in all. The rest of the proof goes much like the odd case of (1.) above. Two further identities can also be obtained from the arguments above. On page 146 of their text, Benjamin Quinn request combinatorial proofs for Identities V93 V94,
5 INTEGERS: ELECTRONIC JOURNAL OF COMBINATORIAL NUMBER THEORY 8 (008), #A18 5 which may be written as k+1 F (k+3)t = ( 1) (k+1)t F t [(k + 3) + 5 ( 1) it Fit i=1 (.5) k+1 F (k+3)t = ( 1) (k+1)t F t [ (k + 1) + ( 1) it L it. (.6) Replacing i by k + 1 i in (1.1) gives i=1 substituting k+1 F (k+3)t = ( 1) (k+1)t F t [1 + ( 1) it L it, (.7) i=1 L it = 5F it + ( 1) it (.8) L it = L it ( 1) it (.9) into (.7) yields (.5) (.6), respectively. The preceding argument for (1.1) hence (.7) can then be easily combined with the arguments for (.8) (.9), which are known involve tailswapping (see, e.g., Identities 36, 45, 53 of [1), to obtain combinatorial interpretations for (.5) (.6), as desired. 3. Generalizations Let (G n ) n 0 be the sequence given by G n = G n 1 + G n if n, where G 0 G 1 are nonnegative integers (termed Gibonacci numbers [1, p. 17 as shorth for generalized Fibonacci numbers). The G n are seen to enumerate n-tilings in which a terminal square is assigned one of G 1 possible phases a terminal domino is assigned one of G 0 possible phases (termed phased n-tilings). Note that G n reduces to F n+1 when G 0 = G 1 = 1 to L n when G 0 =, G 1 = 1. Reasoning as in the prior section with phased tilings instead of regular tilings yields the following (reindexed) generalizations of (1.1) (1.4): G (k+3)t 1 = ( 1) kt [ ( 1) t G t 1 + F t ( 1) it (G (i+)t + G (i+)t ), (3.1)
6 INTEGERS: ELECTRONIC JOURNAL OF COMBINATORIAL NUMBER THEORY 8 (008), #A18 6 G (k+)t 1 = ( 1) kt [ ( 1) t (G 1 G 0 ) + F t G (k+3)t = ( 1) k(t+1) [ G (k+)t 1 = ( 1) k(t+1) [ ( 1) it (G (i+1)t + G (i+1)t ), (3.) ( 1) t+1 G t + L t ( 1) i(t+1) G (i+)t, (3.3) ( 1) t+1 (G 1 G 0 ) + L t ( 1) i(t+1) G (i+1)t 1. (3.4) Identities (3.1), (3.), (3.4) reduce to (1.1), (1.), (1.4), respectively, when G n = F n+1, (3.3) reduces to (1.3) when G n = L n. We outline the proof of (3.), leave the others as exercises for the interested reader. We adjust the argument above for (1.), first assuming t is even. Let G m denote the set consisting of phased tilings of length m let G i G (k+)t 1 comprise those tilings starting with it consecutive dominos, but not with (i+1)t consecutive dominos, 0 i k. There are then F t G (i+1)t members of G k i that are not breakable at (k i + 1)t if 0 i k, upon tailswapping as above, F t G (i+1)t members of G k i that are breakable at (k i + 1)t if 0 < i k. If i = 0, we omit the G 1 cases in which λ G k ends in a phased square preceded by t 1 dominos, since here tailswapping doesn t actually move any tiles (i.e., the first only fault occurs directly after cell t) hence the phased square ending λ fails to be moved. Similarly, we must omit from consideration the G 0 members of G t F t 1 whose first coordinate is a phased tiling which contains no squares whose second coordinate is a regular tiling which contains only a single square occurring at the end. Thus, there are F t G t + (G 1 G 0 ) members of G k that are breakable at (k + 1)t. Adding together all of the cases gives (3.) when t is even. Similar adjustments apply when t is odd. References [1 A. Benjamin J. Quinn, Proofs that Really Count: The Art of Combinatorial Proof, The Dolciani Mathematical Expositions, 7, Mathematical Association of America, 003. [ S. Vajda, Fibonacci & Lucas Numbers, the Golden Section: Theory Applications, John Wiley & Sons, Inc., 1989.
TILING PROOFS OF SOME FORMULAS FOR THE PELL NUMBERS OF ODD INDEX
#A05 INTEGERS 9 (2009), 53-64 TILING PROOFS OF SOME FORMULAS FOR THE PELL NUMBERS OF ODD INDEX Mark Shattuck Department of Mathematics, University of Tennessee, Knoxville, TN 37996-1300 shattuck@math.utk.edu
More informationRECOUNTING DETERMINANTS FOR A CLASS OF HESSENBERG MATRICES. Arthur T. Benjamin Department of Mathematics, Harvey Mudd College, Claremont, CA 91711
INTEGERS: ELECTRONIC JOURNAL OF COMBINATORIAL NUMBER THEORY 7 (2007), #A55 RECOUNTING DETERMINANTS FOR A CLASS OF HESSENBERG MATRICES Arthur T. Benjamin Department of Mathematics, Harvey Mudd College,
More informationCounting on Continued Fractions
appeared in: Mathematics Magazine 73(2000), pp. 98-04. Copyright the Mathematical Association of America 999. All rights reserved. Counting on Continued Fractions Arthur T. Benjamin Francis Edward Su Harvey
More informationTiling Proofs of Recent Sum Identities Involving Pell Numbers
Tiling Proofs of Recent Sum Identities Involving Pell Numbers Arthur T. Benjamin Department of Mathematics, Harvey Mudd College, Claremont, CA 91711 E-mail: benjamin@hmc.edu Sean S. Plott Department of
More informationIn Search of Combinatorial Fibonacci Identities
Summer Research 2010 Duncan McGregor Mike Rowell Department of Mathematics and Computer Science Pacific University, Oregon NUMS, April 9, 2011 Outline 1 2 Fibonacci Sequence Defined Recursively: f 0 =
More informationarxiv: v1 [math.co] 11 Aug 2015
arxiv:1508.02762v1 [math.co] 11 Aug 2015 A Family of the Zeckendorf Theorem Related Identities Ivica Martinjak Faculty of Science, University of Zagreb Bijenička cesta 32, HR-10000 Zagreb, Croatia Abstract
More informationCOMPLEMENTARY FAMILIES OF THE FIBONACCI-LUCAS RELATIONS. Ivica Martinjak Faculty of Science, University of Zagreb, Zagreb, Croatia
#A2 INTEGERS 9 (209) COMPLEMENTARY FAMILIES OF THE FIBONACCI-LUCAS RELATIONS Ivica Martinjak Faculty of Science, University of Zagreb, Zagreb, Croatia imartinjak@phy.hr Helmut Prodinger Department of Mathematics,
More informationCounting on Chebyshev Polynomials
DRAFT VOL. 8, NO., APRIL 009 1 Counting on Chebyshev Polynomials Arthur T. Benjamin Harvey Mudd College Claremont, CA 91711 benjamin@hmc.edu Daniel Walton UCLA Los Angeles, CA 90095555 waltond@ucla.edu
More informationTwo Identities Involving Generalized Fibonacci Numbers
Two Identities Involving Generalized Fibonacci Numbers Curtis Cooper Dept. of Math. & Comp. Sci. University of Central Missouri Warrensburg, MO 64093 U.S.A. email: cooper@ucmo.edu Abstract. Let r 2 be
More informationCombinatorial proofs of Honsberger-type identities
International Journal of Mathematical Education in Science and Technology, Vol. 39, No. 6, 15 September 2008, 785 792 Combinatorial proofs of Honsberger-type identities A. Plaza* and S. Falco n Department
More informationThe Negs and Regs of Continued Fractions
The Negs and Regs of Continued Fractions Alex Eustis Arthur T. Benjamin, Advisor Sanjai Gupta, Reader May, 2006 Department of Mathematics Copyright 2006 Alex Eustis. The author grants Harvey Mudd College
More informationGeorgia Tech HSMC 2010
Georgia Tech HSMC 2010 Varsity Multiple Choice February 27 th, 2010 1. A cube of SPAM defined by S = {(x, y, z) 0 x, y, z 1} is cut along the planes x = y, y = z, z = x. How many pieces are there? (No
More informationPhased Tilings and Generalized Fibonacci Identities
Claremont Colleges Scholarship @ Claremont All HMC Faculty Publications and Research HMC Faculty Scholarship 6-1-2000 Phased Tilings and Generalized Fibonacci Identities Arthur T. Benjamin Harvey Mudd
More informationThe Fibonacci Numbers -- Exposed More Discretely
Claremont Colleges Scholarship @ Claremont All HMC Faculty Publications and Research HMC Faculty Scholarship 6-1-2003 The Fibonacci Numbers -- Exposed More Discretely Arthur T. Benjamin Harvey Mudd College
More informationarxiv: v2 [math.co] 29 Jun 2016
arxiv:1508.04949v2 [math.co] 29 Jun 2016 Complementary Families of the Fibonacci-Lucas Relations Ivica Martinjak Faculty of Science, University of Zagreb Bijenička cesta 32, HR-10000 Zagreb, Croatia Helmut
More informationCATALAN DETERMINANTS A COMBINATORIAL APPROACH
CATALAN DETERMINANTS A COMBINATORIAL APPROACH ARTHUR T BENJAMIN, NAIOMI T CAMERON, JENNIFER J QUINN, AND CARL R YERGER Abstract Determinants of matrices involving the Catalan sequence have appeared throughout
More informationA Tiling Approach to Chebyshev Polynomials
A Tiling Approach to Chebyshev Polynomials Daniel Walton Arthur T. Benjamin, Advisor Sanjai Gupta, Reader May, 2007 Department of Mathematics Copyright c 2007 Daniel Walton. The author grants Harvey Mudd
More informationTransforming Inductive Proofs to Bijective Proofs
Transforming Inductive Proofs to Bijective Proofs Nathaniel Shar Stanford University nshar@stanford.edu June 2010 1 Introduction A bijective proof of an identity A = B is a pair of sets S,T and a bijection
More informationEnumerating Distinct Chessboard Tilings and Generalized Lucas Sequences Part I
Enumerating Distinct Chessboard Tilings and Generalized Lucas Sequences Part I Daryl DeFord Washington State University January 28, 2013 Roadmap 1 Problem 2 Symmetry 3 LHCCRR as Vector Spaces 4 Generalized
More informationCounting permutations by cyclic peaks and valleys
Annales Mathematicae et Informaticae 43 (2014) pp. 43 54 http://ami.ektf.hu Counting permutations by cyclic peaks and valleys Chak-On Chow a, Shi-Mei Ma b, Toufik Mansour c Mark Shattuck d a Division of
More information#A91 INTEGERS 18 (2018) A GENERALIZED BINET FORMULA THAT COUNTS THE TILINGS OF A (2 N)-BOARD
#A91 INTEGERS 18 (2018) A GENERALIZED BINET FORMULA THAT COUNTS THE TILINGS OF A (2 N)-BOARD Reza Kahkeshani 1 Department of Pure Mathematics, Faculty of Mathematical Sciences, University of Kashan, Kashan,
More informationBIJECTIVE PROOFS FOR FIBONACCI IDENTITIES RELATED TO ZECKENDORF S THEOREM
BIJECTIVE PROOFS FOR FIBONACCI IDENTITIES RELATED TO ZECKENDORF S THEOREM Philip Matchett Wood Department of Mathematics, Rutgers University, Piscataway, NJ 08854 e-mail: matchett@math.rutgers.edu (Submitted
More informationFibonacci Numbers. Justin Stevens. Lecture 5. Justin Stevens Fibonacci Numbers (Lecture 5) 1 / 10
Fibonacci Numbers Lecture 5 Justin Stevens Justin Stevens Fibonacci Numbers (Lecture 5) 1 / 10 Outline 1 Fibonacci Numbers Justin Stevens Fibonacci Numbers (Lecture 5) 2 / 10 Fibonacci Numbers The Fibonacci
More informationSELF-AVOIDING WALKS AND FIBONACCI NUMBERS. Arthur T. Benjamin Dept. of Mathematics, Harvey Mudd College, Claremont, CA
SELF-AVOIDING WALKS AND FIBONACCI NUMBERS Arthur T. Benjamin Dept. of Mathematics, Harvey Mudd College, Claremont, CA 91711 benjamin@hmc.edu Abstract. By combinatorial arguments, we prove that the number
More informationarxiv: v3 [math.co] 6 Aug 2016
ANALOGUES OF A FIBONACCI-LUCAS IDENTITY GAURAV BHATNAGAR arxiv:1510.03159v3 [math.co] 6 Aug 2016 Abstract. Sury s 2014 proof of an identity for Fibonacci and Lucas numbers (Identity 236 of Benjamin and
More informationMath 324 Summer 2012 Elementary Number Theory Notes on Mathematical Induction
Math 4 Summer 01 Elementary Number Theory Notes on Mathematical Induction Principle of Mathematical Induction Recall the following axiom for the set of integers. Well-Ordering Axiom for the Integers If
More informationFibonacci numbers. Chapter The Fibonacci sequence. The Fibonacci numbers F n are defined recursively by
Chapter Fibonacci numbers The Fibonacci sequence The Fibonacci numbers F n are defined recursively by F n+ = F n + F n, F 0 = 0, F = The first few Fibonacci numbers are n 0 5 6 7 8 9 0 F n 0 5 8 55 89
More informationThe Combinatorialization of Linear Recurrences
The Combinatorialization of Linear Recurrences Arthur T Benjamin Harvey Mudd College Claremont, CA, USA benjamin@hmcedu Jennifer J Quinn University of Washington Tacoma Tacoma, WA USA jjquinn@uwedu Halcyon
More informationF. T. HOWARD AND CURTIS COOPER
SOME IDENTITIES FOR r-fibonacci NUMBERS F. T. HOWARD AND CURTIS COOPER Abstract. Let r 1 be an integer. The r-generalized Fibonacci sequence {G n} is defined as 0, if 0 n < r 1; G n = 1, if n = r 1; G
More informationq-counting hypercubes in Lucas cubes
Turkish Journal of Mathematics http:// journals. tubitak. gov. tr/ math/ Research Article Turk J Math (2018) 42: 190 203 c TÜBİTAK doi:10.3906/mat-1605-2 q-counting hypercubes in Lucas cubes Elif SAYGI
More informationGeneralized Lucas Sequences Part II
Introduction Generalized Lucas Sequences Part II Daryl DeFord Washington State University February 4, 2013 Introduction Èdouard Lucas: The theory of recurrent sequences is an inexhaustible mine which contains
More informationThe solutions to the two examples above are the same.
One-to-one correspondences A function f : A B is one-to-one if f(x) = f(y) implies that x = y. A function f : A B is onto if for any element b in B there is an element a in A such that f(a) = b. A function
More informationMATH 324 Summer 2011 Elementary Number Theory. Notes on Mathematical Induction. Recall the following axiom for the set of integers.
MATH 4 Summer 011 Elementary Number Theory Notes on Mathematical Induction Principle of Mathematical Induction Recall the following axiom for the set of integers. Well-Ordering Axiom for the Integers If
More informationLINEAR RECURRENCES THROUGH TILINGS AND MARKOV CHAINS ARTHUR T. BENJAMIN, CHRISTOPHER R. H. HANUSA, AND FRANCIS EDWARD SU
LINEAR RECURRENCES THROUGH TILINGS AND MARKOV CHAINS ARTHUR T. BENJAMIN, CHRISTOPHER R. H. HANUSA, AND FRANCIS EDWARD SU ABSTRACT. We present a tiling interpretation for k-th order linear recurrences,
More informationBijective proofs for Fibonacci identities related to Zeckendorf s Theorem
Bijective proofs for Fibonacci identities related to Zeckendorf s Theorem Philip Matchett Wood Department of Mathematics, Rutgers University, Hill Center Busch Campus, 0 Frelinghuysen Rd, Piscataway, NJ
More informationLecture 8 : Structural Induction DRAFT
CS/Math 240: Introduction to Discrete Mathematics 2/15/2011 Lecture 8 : Structural Induction Instructor: Dieter van Melkebeek Scribe: Dalibor Zelený DRAFT Last week we discussed proofs by induction. We
More informationCombinatorial Proofs and Algebraic Proofs I
Combinatorial Proofs and Algebraic Proofs I Shailesh A Shirali Shailesh A Shirali is Director of Sahyadri School (KFI), Pune, and also Head of the Community Mathematics Centre in Rishi Valley School (AP).
More informationDiscrete Mathematics and Probability Theory Fall 2013 Vazirani Note 1
CS 70 Discrete Mathematics and Probability Theory Fall 013 Vazirani Note 1 Induction Induction is a basic, powerful and widely used proof technique. It is one of the most common techniques for analyzing
More informationCounting Palindromic Binary Strings Without r-runs of Ones
1 3 47 6 3 11 Journal of Integer Sequences, Vol. 16 (013), Article 13.8.7 Counting Palindromic Binary Strings Without r-runs of Ones M. A. Nyblom School of Mathematics and Geospatial Science RMIT University
More information1. Introduction Definition 1.1. Let r 1 be an integer. The r-generalized Fibonacci sequence {G n } is defined as
SOME IDENTITIES FOR r-fibonacci NUMBERS F. T. HOWARD AND CURTIS COOPER Abstract. Let r 1 be an integer. The r-generalized Fibonacci sequence {G n} is defined as 8 >< 0, if 0 n < r 1; G n = 1, if n = r
More informationMathematical Induction. Section 5.1
Mathematical Induction Section 5.1 Section Summary Mathematical Induction Examples of Proof by Mathematical Induction Mistaken Proofs by Mathematical Induction Guidelines for Proofs by Mathematical Induction
More informationMath 120. x x 4 x. . In this problem, we are combining fractions. To do this, we must have
Math 10 Final Eam Review 1. 4 5 6 5 4 4 4 7 5 Worked out solutions. In this problem, we are subtracting one polynomial from another. When adding or subtracting polynomials, we combine like terms. Remember
More informationMath 46 Final Exam Review Packet
Math 46 Final Exam Review Packet Question 1. Perform the indicated operation. Simplify if possible. 7 x x 2 2x + 3 2 x Question 2. The sum of a number and its square is 72. Find the number. Question 3.
More informationA Probabilistic View of Certain Weighted Fibonacci Sums
Claremont Colleges Scholarship @ Claremont All HMC Faculty Publications and Research HMC Faculty Scholarship 8-1-2003 A Probabilistic View of Certain Weighted Fibonacci Sums Arthur T. Benjamin Harvey Mudd
More informationLecture 7 Feb 4, 14. Sections 1.7 and 1.8 Some problems from Sec 1.8
Lecture 7 Feb 4, 14 Sections 1.7 and 1.8 Some problems from Sec 1.8 Section Summary Proof by Cases Existence Proofs Constructive Nonconstructive Disproof by Counterexample Nonexistence Proofs Uniqueness
More information17 Advancement Operator Equations
November 14, 2017 17 Advancement Operator Equations William T. Trotter trotter@math.gatech.edu Review of Recurrence Equations (1) Problem Let r(n) denote the number of regions determined by n lines that
More informationTHE OFFICIAL JOURNAL OF THE FIBONACCI ASSOCIATION
THE OFFICIAL JOURNAL OF THE FIBONACCI ASSOCIATION TABLE OF CONTENTS On p-adic Complementary Theorems between Pascal's Triangle and the Modified Pascal Triangle... Shiro Ando and Daihachiro Sato 194 A Number
More informationFIFTH ROOTS OF FIBONACCI FRACTIONS. Christopher P. French Grinnell College, Grinnell, IA (Submitted June 2004-Final Revision September 2004)
Christopher P. French Grinnell College, Grinnell, IA 0112 (Submitted June 2004-Final Revision September 2004) ABSTRACT We prove that when n is odd, the continued fraction expansion of Fn+ begins with a
More informationC) x m A) 260 sq. m B) 26 sq. m C) 40 sq. m D) 364 sq. m. 7) x x - (6x + 24) = -4 A) 0 B) all real numbers C) 4 D) no solution
Sample Departmental Final - Math 46 Perform the indicated operation. Simplif if possible. 1) 7 - - 2-2 + 3 2 - A) + - 2 B) - + 4-2 C) + 4-2 D) - + - 2 Solve the problem. 2) The sum of a number and its
More informationMath 378 Spring 2011 Assignment 4 Solutions
Math 3 Spring 2011 Assignment 4 Solutions Brualdi 6.2. The properties are P 1 : is divisible by 4. P 2 : is divisible by 6. P 3 : is divisible by. P 4 : is divisible by 10. Preparing to use inclusion-exclusion,
More informationInteger Sequences Related to Compositions without 2 s
1 2 3 47 6 23 11 Journal of Integer Sequences, Vol. 6 (2003), Article 03.2.3 Integer Sequences Related to Compositions without 2 s Phyllis Chinn Department of Mathematics Humboldt State University Arcata,
More informationHomework #2 Solutions Due: September 5, for all n N n 3 = n2 (n + 1) 2 4
Do the following exercises from the text: Chapter (Section 3):, 1, 17(a)-(b), 3 Prove that 1 3 + 3 + + n 3 n (n + 1) for all n N Proof The proof is by induction on n For n N, let S(n) be the statement
More informationON SUMS OF SQUARES OF PELL-LUCAS NUMBERS. Gian Mario Gianella University of Torino, Torino, Italy, Europe.
INTEGERS: ELECTRONIC JOURNAL OF COMBINATORIAL NUMBER THEORY 6 (2006), #A15 ON SUMS OF SQUARES OF PELL-LUCAS NUMBERS Zvonko Čerin University of Zagreb, Zagreb, Croatia, Europe cerin@math.hr Gian Mario Gianella
More informationLinear Equations & Inequalities Definitions
Linear Equations & Inequalities Definitions Constants - a term that is only a number Example: 3; -6; -10.5 Coefficients - the number in front of a term Example: -3x 2, -3 is the coefficient Variable -
More information1. INTRODUCTION. Figure 1: An ellipse with b < 0. are the image of the n th roots of unity under the mapping. n,j ) + (a n + b n ) (2) j=0
PRODUCTS OF ELLIPTICAL CHORD LENGTHS AND THE FIBONACCI NUMBERS Thomas E. Price Department of Theoretical and Applied Mathematics, The University of Akron, Akron, OH 44325 e-mail: teprice@uakron.edu (Submitted
More information3 - Induction and Recursion
November 14, 2017 3 - Induction and Recursion William T. Trotter trotter@math.gatech.edu Using Recurrence Equations (1) Basic Problem How many regions are determined by n lines that intersect in general
More informationCounting Peaks and Valleys in a Partition of a Set
1 47 6 11 Journal of Integer Sequences Vol. 1 010 Article 10.6.8 Counting Peas and Valleys in a Partition of a Set Toufi Mansour Department of Mathematics University of Haifa 1905 Haifa Israel toufi@math.haifa.ac.il
More information1 Sequences and Summation
1 Sequences and Summation A sequence is a function whose domain is either all the integers between two given integers or all the integers greater than or equal to a given integer. For example, a m, a m+1,...,
More informationOn Some Combinations of Non-Consecutive Terms of a Recurrence Sequence
1 2 3 47 6 23 11 Journal of Integer Sequences, Vol. 21 (2018), Article 18.3.5 On Some Combinations of Non-Consecutive Terms of a Recurrence Sequence Eva Trojovská Department of Mathematics Faculty of Science
More informationProperties of Radicals
9. Properties of Radicals Essential Question How can you multiply and divide square roots? Operations with Square Roots Work with a partner. For each operation with square roots, compare the results obtained
More informationExtended Binet s formula for the class of generalized Fibonacci sequences
[VNSGU JOURNAL OF SCIENCE AND TECHNOLOGY] Vol4 No 1, July, 2015 205-210,ISSN : 0975-5446 Extended Binet s formula for the class of generalized Fibonacci sequences DIWAN Daksha M Department of Mathematics,
More informationFrom Simplest Recursion to the Recursion of Generalizations of Cross Polytope Numbers
Kennesaw State University DigitalCommons@Kennesaw State University Honors College Capstones and Theses Honors College Spring 5-6-2017 From Simplest Recursion to the Recursion of Generalizations of Cross
More informationFour Basic Sets. Divisors
Four Basic Sets Z = the integers Q = the rationals R = the real numbers C = the complex numbers Divisors Definition. Suppose a 0 and b = ax, where a, b, and x are integers. Then we say a divides b (or
More informationASSIGNMENT 12 PROBLEM 4
ASSIGNMENT PROBLEM 4 Generate a Fibonnaci sequence in the first column using f 0 =, f 0 =, = f n f n a. Construct the ratio of each pair of adjacent terms in the Fibonnaci sequence. What happens as n increases?
More informationGreat Theoretical Ideas in Computer Science
15-251 Great Theoretical Ideas in Computer Science Recurrences, Fibonacci Numbers and Continued Fractions Lecture 9, September 23, 2008 Happy Autumnal Equinox http://apod.nasa.gov/apod/ap080922.html Leonardo
More informationDay 2: Let The Good Roll
Opener 1. We re going to start with doing the same thing, over and over. The Monica sequence is one of the least famous sequences of all For example, M(2) = time. It starts with 2, then 2 again, then each
More informationSum of Squares. Defining Functions. Closed-Form Expression for SQ(n)
CS/ENGRD 2110 Object-Oriented Programming and Data Structures Spring 2012 Thorsten Joachims Lecture 22: Induction Overview Recursion A programming strategy that solves a problem by reducing it to simpler
More informationThe Fibonacci Quilt Sequence
The Sequence Minerva Catral, Pari Ford*, Pamela Harris, Steven J. Miller, Dawn Nelson AMS Section Meeting Georgetown University March 7, 2015 1 1 2 1 2 3 1 2 3 4 1 2 3 4 5 Fibonacci sequence Theorem (
More informationParity Theorems for Statistics on Domino Arrangements
Parity Theorems for Statistics on Domino Arrangements Mar A Shattuc Mathematics Department University of Tennessee Knoxville, TN 37996-1300 shattuc@mathutedu Carl G Wagner Mathematics Department University
More informationPrimary classes of compositions of numbers
Annales Mathematicae et Informaticae 41 (2013) pp. 193 204 Proceedings of the 15 th International Conference on Fibonacci Numbers and Their Applications Institute of Mathematics and Informatics, Eszterházy
More informationClimbing an Infinite Ladder
Section 5.1 Section Summary Mathematical Induction Examples of Proof by Mathematical Induction Mistaken Proofs by Mathematical Induction Guidelines for Proofs by Mathematical Induction Climbing an Infinite
More informationDISTRIBUTION OF FIBONACCI AND LUCAS NUMBERS MODULO 3 k
DISTRIBUTION OF FIBONACCI AND LUCAS NUMBERS MODULO 3 k RALF BUNDSCHUH AND PETER BUNDSCHUH Dedicated to Peter Shiue on the occasion of his 70th birthday Abstract. Let F 0 = 0,F 1 = 1, and F n = F n 1 +F
More informationFibonacci Number of the Tadpole Graph
Kennesaw State University DigitalCommons@Kennesaw State University Faculty Publications 9-1-2014 Fibonacci Number of the Tadpole Graph Joe DeMaio Kennesaw State University, jdemaio@kennesaw.edu John Jacobson
More informationRUSSELL JAY HENDEL. F i+1.
RUSSELL JAY HENDEL Abstract. Kimberling defines the function κ(n) = n 2 α n nα, and presents conjectures and open problems. We present three main theorems. The theorems provide quick, effectively computable,
More informationInduction and Recursion
. All rights reserved. Authorized only for instructor use in the classroom. No reproduction or further distribution permitted without the prior written consent of McGraw-Hill Education. Induction and Recursion
More informationDiscrete Mathematics and Probability Theory Spring 2014 Anant Sahai Note 3
EECS 70 Discrete Mathematics and Probability Theory Spring 014 Anant Sahai Note 3 Induction Induction is an extremely powerful tool in mathematics. It is a way of proving propositions that hold for all
More informationA bijective proof of Shapiro s Catalan convolution
A bijective proof of Shapiro s Catalan convolution Péter Hajnal Bolyai Institute University of Szeged Szeged, Hungary Gábor V. Nagy {hajnal,ngaba}@math.u-szeged.hu Submitted: Nov 26, 2013; Accepted: May
More informationSome Review Problems for Exam 3: Solutions
Math 3355 Fall 018 Some Review Problems for Exam 3: Solutions I thought I d start by reviewing some counting formulas. Counting the Complement: Given a set U (the universe for the problem), if you want
More informationMathematical Induction
Mathematical Induction MAT231 Transition to Higher Mathematics Fall 2014 MAT231 (Transition to Higher Math) Mathematical Induction Fall 2014 1 / 21 Outline 1 Mathematical Induction 2 Strong Mathematical
More informationAt the start of the term, we saw the following formula for computing the sum of the first n integers:
Chapter 11 Induction This chapter covers mathematical induction. 11.1 Introduction to induction At the start of the term, we saw the following formula for computing the sum of the first n integers: Claim
More informationDirect Proof Universal Statements
Direct Proof Universal Statements Lecture 13 Section 4.1 Robb T. Koether Hampden-Sydney College Wed, Feb 6, 2013 Robb T. Koether (Hampden-Sydney College) Direct Proof Universal Statements Wed, Feb 6, 2013
More informationAND OCCUPANCY PROBLEMS
COMBINATIONS, COMPOSITIONS AND OCCUPANCY PROBLEMS MORTON ABRAMSON York University, Downsview, Toronto, Canada Let r < k be positive integers,, INTRODUCTION By a composition of k into r parts (an r-composition
More informationCompositions of n with no occurrence of k. Phyllis Chinn, Humboldt State University Silvia Heubach, California State University Los Angeles
Compositions of n with no occurrence of k Phyllis Chinn, Humboldt State University Silvia Heubach, California State University Los Angeles Abstract A composition of n is an ordered collection of one or
More informationGreat Theoretical Ideas in Computer Science
15-251 Great Theoretical Ideas in Computer Science Recurrences, Fibonacci Numbers and Continued Fractions Lecture 9, September 24, 2009 Leonardo Fibonacci In 1202, Fibonacci proposed a problem about the
More informationCollege Algebra Final, 7/2/10
NAME College Algebra Final, 7//10 1. Factor the polnomial p() = 3 5 13 4 + 13 3 + 9 16 + 4 completel, then sketch a graph of it. Make sure to plot the - and -intercepts. (10 points) Solution: B the rational
More informationSeveral Generating Functions for Second-Order Recurrence Sequences
47 6 Journal of Integer Sequences, Vol. 009), Article 09..7 Several Generating Functions for Second-Order Recurrence Sequences István Mező Institute of Mathematics University of Debrecen Hungary imezo@math.lte.hu
More informationSEQUENCES, MATHEMATICAL INDUCTION, AND RECURSION
CHAPTER 5 SEQUENCES, MATHEMATICAL INDUCTION, AND RECURSION Copyright Cengage Learning. All rights reserved. SECTION 5.4 Strong Mathematical Induction and the Well-Ordering Principle for the Integers Copyright
More informationn F(n) 2n F(2n) Here are some values of the series in comparison to Fibonacci number:
I did my exploration on Lucas numbers because different series fascinate me and it was related to the Fibonacci numbers which is pretty well known to all the mathematicians across the world so I wanted
More information12 Sequences and Recurrences
12 Sequences and Recurrences A sequence is just what you think it is. It is often given by a formula known as a recurrence equation. 12.1 Arithmetic and Geometric Progressions An arithmetic progression
More informationOn the possible quantities of Fibonacci numbers that occur in some type of intervals
On the possible quantities of Fibonacci numbers that occur in some type of intervals arxiv:1508.02625v1 [math.nt] 11 Aug 2015 Bakir FARHI Laboratoire de Mathématiques appliquées Faculté des Sciences Exactes
More informationON THE POSSIBLE QUANTITIES OF FIBONACCI NUMBERS THAT OCCUR IN SOME TYPES OF INTERVALS
Acta Math. Univ. Comenianae Vol. LXXXVII, 2 (2018), pp. 291 299 291 ON THE POSSIBLE QUANTITIES OF FIBONACCI NUMBERS THAT OCCUR IN SOME TYPES OF INTERVALS B. FARHI Abstract. In this paper, we show that
More informationModule 2: Reflecting on One s Problems
MATH55 Module : Reflecting on One s Problems Main Math concepts: Translations, Reflections, Graphs of Equations, Symmetry Auxiliary ideas: Working with quadratics, Mobius maps, Calculus, Inverses I. Transformations
More informationChapter 4 ARITHMETIC AND GEOMETRIC PROGRESSIONS 2, 5, 8, 11, 14,..., 101
Chapter 4 ARITHMETIC AND GEOMETRIC PROGRESSIONS A finite sequence such as 2, 5, 8, 11, 14,..., 101 in which each succeeding term is obtained by adding a fixed number to the preceding term is called an
More informationTHE DIVISION THEOREM IN Z AND R[T ]
THE DIVISION THEOREM IN Z AND R[T ] KEITH CONRAD 1. Introduction In both Z and R[T ], we can carry out a process of division with remainder. Theorem 1.1. For any integers a and b, with b nonzero, there
More informationCongruence successions in compositions
Discrete Mathematics and Theoretical Computer Science DMTCS vol. 16:, 014, 37 338 Congruence successions in compositions Toufik Mansour 1 Mark Shattuck Mark C. Wilson 3 1 Department of Mathematics, University
More information#A87 INTEGERS 18 (2018) A NOTE ON FIBONACCI NUMBERS OF EVEN INDEX
#A87 INTEGERS 8 (208) A NOTE ON FIBONACCI NUMBERS OF EVEN INDEX Achille Frigeri Dipartimento di Matematica, Politecnico di Milano, Milan, Italy achille.frigeri@polimi.it Received: 3/2/8, Accepted: 0/8/8,
More informationOne Pile Nim with Arbitrary Move Function
One Pile Nim with Arbitrary Move Function by Arthur Holshouser and Harold Reiter Arthur Holshouser 3600 Bullard St. Charlotte, NC, USA, 28208 Harold Reiter Department of Mathematics UNC Charlotte Charlotte,
More informationSERIES
SERIES.... This chapter revisits sequences arithmetic then geometric to see how these ideas can be extended, and how they occur in other contexts. A sequence is a list of ordered numbers, whereas a series
More informationQ 1 Find the square root of 729. 6. Squares and Square Roots Q 2 Fill in the blank using the given pattern. 7 2 = 49 67 2 = 4489 667 2 = 444889 6667 2 = Q 3 Without adding find the sum of 1 + 3 + 5 + 7
More informationENUMERATING DISTINCT CHESSBOARD TILINGS
ENUMERATING DISTINCT CHESSBOARD TILINGS DARYL DEFORD Abstract. Counting the number of distinct colorings of various discrete objects, via Burnside s Lemma and Pólya Counting, is a traditional problem in
More information