f = 0 (n < 0), fj = 1, f = J2 f. (n > 1).

Similar documents
COMPOSITIONS AND FIBONACCI NUMBERS

SOME PROPERTIES OF THIRD-ORDER RECURRENCE RELATIONS

DIRECT CALCULATION OF k-generalized FIBONACCI NUiBERS

GENERALIZED RABBITS FOR GENERALIZED FIBONACCI NUMBERS. V.E.Hoggatt^Jro. San Jose State College, San Jose, Calif e 1. INTRODUCTION

Fibonacci and k Lucas Sequences as Series of Fractions

REDUCTION FORMULAS FOR THE SUMMATION OF RECIPROCALS IN CERTAIN SECOND-ORDER RECURRING SEQUENCES

S \ - Z) *! for j = 1.2,---,k + l. i=i i=i

Section 4.1: Sequences and Series

SOME SUMMATION IDENTITIES USING GENERALIZED g-matrices

F. T. HOWARD AND CURTIS COOPER

X X + 1 " P n ) = P m "

1. Introduction Definition 1.1. Let r 1 be an integer. The r-generalized Fibonacci sequence {G n } is defined as

(1.1) A j y ( t + j) = 9

arxiv: v1 [math.nt] 17 Nov 2011

Polynomial Formula for Sums of Powers of Integers

EXPANSION OF ANALYTIC FUNCTIONS IN TERMS INVOLVING LUCAS NUMBERS OR SIMILAR NUMBER SEQUENCES

LINEARLY RECURSIVE SEQUENCES OF INTEGERS

Sums of Tribonacci and Tribonacci-Lucas Numbers

C O M P L E X FACTORIZATIONS O F T H E F I B O N A C C I AND LUCAS NUMBERS

On the Convergence of the Summation Formulas Constructed by Using a Symbolic Operator Approach

A matrix over a field F is a rectangular array of elements from F. The symbol

ADVANCED PROBLEMS AND SOLUTIONS

ADVANCED PROBLEMS AND SOLUTIONS

ADVANCED PROBLEMS AND SOLUTIONS

UNIT DETERMINANTS IN GENERALIZED PASCAL TRIANGLES

w = X ^ = ^ ^, (i*i < ix

On Two New Classes of Fibonacci and Lucas Reciprocal Sums with Subscripts in Arithmetic Progression

GENERALIZED FIBONACCI POLYNOMIALS AND ZECKENDORFS THEOREM 1. INTRODUCTION

AREA-BISECTING POLYGONAL PATHS. Warren Page New York City Technical College, CUNY

2. Linear recursions, different cases We discern amongst 5 different cases with respect to the behaviour of the series C(x) (see (. 3)). Let R be the

Algorithms: Background

Section 11.1 Sequences

(Submitted November 1999) 1. INTRODUCTION - F. n+k 2. n=1f" n+k l. <... < k m

DYNAMICS OF THE ZEROS OF FIBONACCI POLYNOMIALS M. X. He Nova Southeastern University, Fort Lauderdale, FL. D, Simon

GCD AND LCM POWER MATRICES. Sheii Ze Chun An-Gang Engineering College, Anshan, P.R. China, (Submitted October 1994)

SOME IDENTITIES INVOLVING THE FIBONACCI POLYNOMIALS*

Compare the growth rate of functions

ELEMENTARY PROBLEMS AND SOLUTIONS. Edited by A. P. HILLMAN University of New Mexico, Albuquerque, NM 87131

On Generalized k-fibonacci Sequence by Two-Cross-Two Matrix

4- prime p > k with ak'1 = 1, but this is also intractable at the moment. It often happens in number theory that every new result suggests many new qu

ON THE ERDOS-STONE THEOREM

F A M I L I E S OF IDENTITIES INVOLVING SUMS OF POWERS OF THE FIBONACCI AND LUCAS NUMBERS

1 if X E [a, b] Ira,b](x) = ~ 0 th. o erwtse. 2 Ira,b](Bk) = b- a

Theorem 1: R(F n+l ~2-M)=R(F n^m) y 0<M<F n u n> ] 47

GENERATING FUNCTIONS OF CENTRAL VALUES IN GENERALIZED PASCAL TRIANGLES. CLAUDIA SMITH and VERNER E. HOGGATT, JR.

THE ZECKENDORF ARRAY EQUALS THE WYTHOFF ARRAY

Introduction to Quantitative Techniques for MSc Programmes SCHOOL OF ECONOMICS, MATHEMATICS AND STATISTICS MALET STREET LONDON WC1E 7HX

a 11 x 1 + a 12 x a 1n x n = b 1 a 21 x 1 + a 22 x a 2n x n = b 2.

Summation of certain infinite Fibonacci related series

and ttuu ee 2 (logn loglogn) 1 J

*!5(/i,*)=t(-i)*-, fty.

1 Examples of Weak Induction

ELEMENTARY LINEAR ALGEBRA

Cartesian Tensors. e 2. e 1. General vector (formal definition to follow) denoted by components

AND RELATED NUMBERS. GERHARD ROSENBERGER Dortmund, Federal Republic of Germany (Submitted April 1982)

Divisibility in the Fibonacci Numbers. Stefan Erickson Colorado College January 27, 2006

Generalized Fibonacci Numbers and Blackwell s Renewal Theorem

Linear Systems and Matrices

DIFFERENTIAL PROPERTIES OF A GENERAL CLASS OF POLYNOMIALS. Richard Andre-Jeannin IUT GEA, Route de Romain, Longwy, France (Submitted April 1994)

8. Sequences, Series, and Probability 8.1. SEQUENCES AND SERIES

Math 324 Summer 2012 Elementary Number Theory Notes on Mathematical Induction

DISTRIBUTION OF FIBONACCI AND LUCAS NUMBERS MODULO 3 k

A Probabilistic View of Certain Weighted Fibonacci Sums

Problem Set 5 Solutions

arxiv:math/ v1 [math.nt] 6 May 2003

CLASSES OF IDENTITIES FOR THE GENERALIZED FIBONACCI NUMBERS G n = G n _ t + G n _ c FROM MATRICES WITH CONSTANT VALUED DETERMINANTS

Fibonacci numbers. Chapter The Fibonacci sequence. The Fibonacci numbers F n are defined recursively by

G E N E R A L I Z E D C O N V O L U T I O N A R R A Y S

arxiv: v1 [math.nt] 6 Apr 2018

Each copy of any part of a JSTOR transmission must contain the same copyright notice that appears on the screen or printed page of such transmission.

MULTI-RESTRAINED STIRLING NUMBERS

ADVANCED PROBLEMS AND SOLUTIONS Edited by RAYMOND E.WHITNEY Lock Haven State College, Lock Haven, Pennsylvania

2 ERDOS AND NATHANSON k > 2. Then there is a partition of the set of positive kth powers In k I n > } = A, u A Z such that Waring's problem holds inde

Lecture 9 Classification of States

Invertible Matrices over Idempotent Semirings

ADVANCED PROBLEMS AND SOLUTIONS

SUBSEMiGROUPS OF THE ADDITIVE POSITIVE INTEGERS 1. INTRODUCTION

The geometry of polynomial diagrams

Induction. Induction. Induction. Induction. Induction. Induction 2/22/2018

ON IDENTIFICATION OF DYNAMICAL SYSTEM PARAMETERS FROM EXPERIMENTAL DATA

ELEMENTARY LINEAR ALGEBRA

William Stallings Copyright 2010

THE BRAHMAGUPTA POLYNOMIALS IN TWO COMPLEX VARIABLES* In Commemoration of Brahmagupta's Fourteenth Centenary

P i [B k ] = lim. n=1 p(n) ii <. n=1. V i :=

ADVANCED PROBLEMS AND SOLUTIONS

EQUATIONS WHOSE ROOTS ARE T I E nth POWERS OF T I E ROOTS OF A GIVEN CUBIC EQUATION

LONGEST SUCCESS RUNS AND FIBONACCI-TYPE POLYNOMIALS

Largest Values of the Stern Sequence, Alternating Binary Expansions and Continuants

Fall 2017 Test II review problems

Covering Subsets of the Integers and a Result on Digits of Fibonacci Numbers

ASYMPTOTIC DISTRIBUTION OF THE MAXIMUM CUMULATIVE SUM OF INDEPENDENT RANDOM VARIABLES

GENERALIZATION OF UNIVERSAL PARTITION AND BIPARTITION THEOREMS. Hacène Belbachir 1

EXERCISES. a b = a + b l aq b = ab - (a + b) + 2. a b = a + b + 1 n0i) = oii + ii + fi. A. Examples of Rings. C. Ring of 2 x 2 Matrices

Lecture #8: We now take up the concept of dynamic programming again using examples.

F O R M U L A S F O R CONVOLUTION F I B O N A C C I NUMBERS AND P O L Y N O M I A L S

ON A KIND OF GENERALIZED ARITHMETIC-GEOMETRIC PROGRESSION

Sums of Squares and Products of Jacobsthal Numbers

Bounds for pairs in partitions of graphs

On the number of occurrences of all short factors in almost all words

Partitions and the FermiDirac Distribution

Transcription:

GENERALIZED FIBONACCI KSEQUENCES HYMAM GABAI York College (CUNY) and University of Illinois (UICSM) 1* INTRODUCTION For k > 2, the Fibonacci ksequence F(k) maybe defined recursively by n l f = 0 (n < 0), fj = 1, f = J2 f. (n > 1). i=nk A generalized Fibonacci ksequence A(k) may be constructed by arbitrarily choosing a l3 a 0, a, o e e, a?_ic 5 and defining nl a n = 0 (a < 2 k) f \ = 2 a. (n > 1) 9 i=nk In this paper, some wellknown properties of F(2) (see [1] and [8]) are generalized to the sequences A(k). For some properties of F(k), see [ 4 ], [6], and [7], The sequences A(3) are investigated in [9]. The pedagogical values of introducing Fibonacci sequences in the classroom a r e well known. (See, for example [ 3], pp 336367*) It seems possible thatcthe generalizations described in this paper may suggest some areas of investigation suitable for high school and college students* (See, for example [5].) For once a theorem concerning F(2) has been discovered, one may search for corresponding theorems concerning A(2), F(3), A(3), e o 8 and finally F(k) and A(k). (See [2].) 2 e THEOREMS The first theorem is a fp shift formula f? needed in the proof of Theorem 6. Theorem 1. For n > 2, a, = 2a a.. n+1 n nk 31

32 GENERALIZED FIBONACCI ksequences [Feb, T h e o r e m 2 is a generalization of the theorem that any two consecutive t e r m s of F(2) a r e relatively p r i m e. T h e o r e m 2. F o r n > 2, every common divisor of a n ' a n + l J a n+2 J " ', a n + k l is a divisor of a 2, a 3,, a n _ i. Some summation theorems a r e given in T h e o r e m s 3, 4, and 5. T h e o r e m 3. (a) F o r n > 1 and m > 1, n kn+m 2 ^ a k i + m + l 2rf i=0 i=m+lk = a i ' (b) F o r n > 1, n k n 1 E a k i = E a i i = l i=0 (c) F o r n > 1, a k n " a 0 T h e o r e m 4 F o r n > 2 k, _ S s l < i < kn1 i^olmodk) n. k2 k2' 2 h = k4t( % + k a l + J>i E (k l 1)a ni] i=2k V i=l i = l T h e o r e m 5. F o r n > 1, n k 1 n E a? = a a ( 1 a a n y / a.a... l n n+1 1 0 A «* l 13 i = l j=2 i=l

1970] GENERALIZED FIBONACCI ksequences T h e o r e m s 6, 7, and 8 show relations between F(k) and A(k). T h e o r e m 6. F o r n > 1 and m > 1, a n+m,i ~^ 2 ( Vk+j X) f mj+l J j=l \ i=l / J T h e o r e m 7. Let d be the g r e a t e s t common divisor of f m ' f m l 5 " 8 s f mk+2 8 If m > 1, m divides n 5 and d divides a, then d divides a. 5 ' m n r m n Theorem 8. Let r be the l a r g e s t root of the polynomial equation k 1 xk E xi = i=0 Then (a) k+1 / j 1 ^WsH^) and (b) lim ( ^ ) 3. PROOFS OF THEOREMS then Theorem 1 follows directly from the definition of A(k). n n1 For, if n a,, n+1 = V * Z< a. = 1 V * Z> a. + a i n a. nk = 2a a. n nk. i=nk+l i=nk

34 GENERALIZED FIBONACCI ksequences [Feb. To prove Theorem 2, suppose that d is a common divisor of a, a, j a,.. Since n+k1 n+k2 nfk2 a *n+k ""l = E a i = Vl i = n l + Z a i i=n it follows that d also divides a It follows, by induction, that d divides J n 1 a n 2 J ' " 9 a 2 9 F o r the proof of T h e o r e m 3(a), choose any integer m > 1. Now T h e o r e m 3(a) holds for n = 1 because 1 2 ^ a k i + m + l i=0 = a m + l + a k + m + l m k+m k+m E \ + E \ E i=m+lk i=m+l i=m+lk F u r t h e r m o r e, if Theorem 3(a) holds for n = p, then it holds for n = p + 1 because we then have a. I p+1 p 2 ^ a k i + m + l = a k(p+l)fm+l + Z J a k i + m + l i=0 i=0 k(p+l)+m kp+m E». + E. i=kp+m+l i=m+lk k(p+l)+m E s i=^m+lk Hence Theorem 3(a) holds for n > 1, m > 1. In the proof of T h e o r e m 3(b), we apply T h e o r e m 3 ( a ), choosing m = k 1:

1970] GENERALIZED FIBONACCI ksequences 35 kn+k1 ki+k Z**d i i=0 i=0 T h e o r e m 3(b) follows since the left side of this equation is equal to a kn+k 2Ld a k i i=l and the right side is equal to k n 1 kn+k1 k n 1 Ea, a. = a. + a,,, i=0 i=kn i i kn+k i=0 T h e o r e m (3c) is an immediate consequence of T h e o r e m 3(b). Inductive proofs of T h e o r e m s 4 and 5 a r e omitted. One m a y, however, verify (or discover!) T h e o r e m 4 by considering the following diagram: " a 2 k " a 3 k a 2 k L a l a 2 ^ 1 a 2 k *2k Vk Vk " a o " " a i a 2 a l a o a x a 3~k a 4 k V k a n+2k a n + 3 k a n + 3 a 1 n " a n + l V l a n... a n+3k a n+4»k n 1 ~ a n+k: " Vk2 3 " a n+k4 a n + k 3 ~ 1 a f 1 n+1 a n+2 a n a n+l [

36 GENERALIZED FIBONACCI ksequences [Feb. It follows from this diagram that n n k2 k2 2 h = Vk a l (k 2) E a i + E ia i Z (k * 1)a n+i i=2k i=2k i=l i=l For the proof of Theorem 6, let n be any integer such that n > 1. Theorem 6 holds for m = 1 because k j k S Vk+j S f lj+i = Z) (a nk+j f l ) = a n+l ' j=l 1=1 j=l If Theorem 6 holds for m = p, then it holds for m = p + 1 because we then have / a n+(p+l) " a (n+l)+p " 24 ( a n + l k + j ^ fpj+i k j=l \ i=l k+1 j j=2 \ (i=l k / j p+lj+i ~ f p+l) 2/ (Vk+j 2D f p+lj+i) " a nk+l f p+l j=i \ i=i / k+1 / k + 1 + a n+l 2 ^ fp_k+i "I X, a nk+i) f p i=l \ 5=2 k / E J L» ( a nk+j 2» p+lj+i) 3=1 i \ i=i 7 + f P + l ( " V k + l + 2 a n + l a n + 2 ) k / J zlrf I nk+j 2~* p+lj+i j=l \ i=l The last equality is obtained by applying Theorem 1. Hence Theorem 6 holds for n > 1 and m > 1.

1970] GENERALIZED FIBONACCI ksequences 37 T h e o r e m 7 obviously holds for n = m. 7 holds for n = m p, then it holds for n = m(p + 1). We shall prove that if T h e o r e m Suppose, therefore* that d divides a. By J T h e o r e m 6, ^ m mp m(p+l) mp+m /^ P m o k + i ) j mj+i I j=l \ i=l / Since d divides each t e r m of the sum m J a m p m+1 " i=l "mj+i where 1 < j < k 1, and d divides a, it follows that d divides J m mp m a m(p+l)' For the proof of Theorem 8(a), we once again apply Theorem 6. choose n = 1 and divide by f. 1+m' We a k 7 ^ = W * i I ^ T / j f J T ±1 ' In [6] it i s shown that, for any integer q, l i m j j ±a )= rq m >oo I f It follows, therefore, that ^ftjg^s^1 k / J k / J j = l \ k+j i=l k+l / j 1 I T. V ki " k L a ik ^ r j=2 \ i = l Theorem 8(b) holds since

38 GENERALIZED FIBONACCI ksequences Feb. 1970 v / V l \.. / a n + l f n f n+l\ lim I I = lim I s s I = I lim ^ii lim ^ 1 I lim J = r REFERENCES 1. Brother U. Alfred, "An Introduction to Fibonacci Discovery," The Fibonacci Association, 1965. 2. Brother U. Alfred, "Exploring Recur rent Sequences," Fibonacci Quarterly, Vol. 1, No. 2, 1963, pp. 8183. 3. M. Beberman and H. Vaughan, High School Mathematics, Course 3, D. C. Heath, 1966. 4. D. E, Ferguson, "An Expression for Generalized Fibonacci Numbers," Fibonacci Quarterly, Vol. 4, No. 3, 1966, pp. 270272. 5. M. Feinberg, "FibonacciTribonacci," Fibonacci Quarterly, Vol. 1, No. 3, 1963, pp. 7174. 6. I. Flores, "Direct Calculation of KGeneralized Fibonacci Numbers," Fibonacci Quarterly, Vol. 5, No. 3, 1967, pp. 259266. 7. E. P. Miles, "Generalized Fibonacci Numbers and Associated Matrices," American Mathematical Monthly, Vol. 67, No, 8, 1960, pp. 745752. 8. N. N. Vorobyov, The Fibonacci Numbers, D. C. Heath, 1963. 9. M. E. Waddill and L. Sacks, "Another Generalized Fibonacci Sequence," Fibonacci Quarterly, Vol. 5, No. 3, 1967, pp. 209222. * * * * DON'T FORGET! It's TIME to renew your subscription to the Fibonacci Quarterly!

2024 © sciencedocbox.com Privacy Policy | Terms of Service | Feedback