ON QUADRAPELL NUMBERS AND QUADRAPELL POLYNOMIALS
|
|
- Ashlee Reeves
- 5 years ago
- Views:
Transcription
1 Hacettepe Journal of Mathematics and Statistics Volume 8() (009), ON QUADRAPELL NUMBERS AND QUADRAPELL POLYNOMIALS Dursun Tascı Received 09:0 :009 : Accepted 04 :05 :009 Abstract In this paper we define and deal with the quadrapell numbers,, in terms of a linear recurrence relation of order 4, and define the quadrapell polynomials in x. Further we give the generating function, a Binet-like formula and formulae for sums of these numbers. Keywords: Quadrapell numbers, Quadrapell polynomials. 000 AMS Classification: B9.. Introduction Recurrence relations and their generalizations have many interesting properties, and they have many applications to every field of science. Koshy s book [8] is a good source for these applications. One application of second order linear recurrences occurs in graph theory. In [0] Minc give the relationship between the permanent of a certain (0, ) superdiagonal matrix and the k-generalized Fibonacci numbers. Second order linear recurrences, especially the Fibonacci and Lucas numbers and their generalizations, are studied in [6, 7, 9, ] In [6] the authors consider the relationship between the generalized order k Fibonacci, Lucas numbers and their sums of bipartite graphs. In [7] the authors defined two tridiagonal matrices and they gave a relationship between the permanents and determinants of these matrices and second order linear recurrences. In [] the authors presented a sequence of progressively better upper bounds for the Perron root of a nonnegative matrix. They showed that each element in the sequence is a function of the Perron root of the arithmetic symmetrization of a power of the matrix. The authors in [] and [] defined and studied various fourth order linear recurrences and their polynomial analogous. Gazi University, Department of Mathematics, Teknikokullar, Ankara, Turkey. dtasci@gazi.edu.tr
2 66 D. Tascı In this paper we define and deal with the quadrapell numbers,, using a linear recurrence relation of order 4, and define the quadrapell polynomials in x. Then we give some identities and formulae among the terms of the Fibonacci sequence, the Lucas sequence, the sequence and the sequence C(n) all of whose elements are, 0 or. Also various summation formulae including the terms are given. Moreover a generating matrix (a companion matrix) of order 4 is given for generating the terms. The ratios of consecutive Fibonacci numbers and Lucas numbers converge to the Golden ratio α =.680, and we give evidence to support the conjecture that the ratio of consecutive terms of the Quadrapell numbers is also the Golden ratio.. Main results.. Quadrapell Numbers... Definition. The Quadrapell numbers are defined by the recurrence relation = D(n ) + D(n ) + D(n 4), n 4, where D(0) = D() = D() =, D() =. The first few Quadrapell numbers are,,,, 4, 5, 9, 5,, 8, 6, 99, 6, 6, 4, 68, 04, 785, 889, 4675, 756, 8,... Just as ratios of consecutive Fibonacci numbers and Lucas numbers converge to the the Golden ratio α =.680, so we conjecture that the Quadrapell ratios also D(n ) converge to α =.680 (Golden ratio). The characteristic equation of the Quadrapell recurrence relation is given by x 4 x x = 0. It can be shown that this equation has two real roots and two imaginary roots. The real roots are given by α = + 5 (Golden ratio), β = 5 and the imaginary roots are given by γ = + i and δ = i. Using the recursive definition, we can develop a generating function for the Quadrapell numbers. We require a real-valued function g(x) whose formal power series expansion at x = 0 has the form x n = D(0) + D()x + D()x + + x n +. If this is the case, the formal power series expansions of x g(x),x g(x) and x 4 g(x) are respectively D(0)x + D()x + D()x D(n )x n +, D(0)x + D()x 4 + D()x D(n )x n +,and D(0)x 4 + D()x 5 + D()x D(n 4)x n +,
3 On Quadrapell Numbers and Polynomials 67 so the expansion for g(x) x g(x) x g(x) x 4 g(x) is since and D(0) + D()x + (D() D(0))x + (D() D() D(0))x = + x x, D(0) = D() = D() =, D() = + (D(4) D() D() D(0))x 4 + = D(n ) + D(n ) + D(n 4). However, + x x is a finite series so we may write that is, ( x x x 4 )g(x) = + x x, + ( D(n ) D(n ) D(n 4))x n + + x x g(x) = x x x. 4 Now we present a theorem giving a Binet-like formula for Quadrapell numbers... Theorem. where = αn+ β n+ α β α = + 5, β = 5 are the roots of the equation x 4 x x = 0. ( α n β n α β ) + ( γ n δ n γ δ ),, γ = + i, δ = i Proof. Expressing the generating function of the Quadrapell sequence as a sum of partial fractions we obtain: g(x) = x x + x + x x + x + = x x x + x x + x x + x + = ( ) α n β n ( ) x n α n+ β n+ + x n + ( ) γ n δ n x n α β α β γ δ [ = ( ) ( ) α n β n α n+ β n+ + + ( )] γ n δ n x n α β α β γ δ We note from [] that and x x x = x x = ( α n β n α β ) x n ( α n+ β n+ α β ).
4 68 D. Tascı Thus, by the equality of generating functions, we get the stated Binet-like formula for the Quadrapell sequence... Corollary. i) C(n) = F(n + ) + F(n ), ii) C(n) = L(n), where F(n), L(n) and C(n) denote the Fibonacci sequence, the Lucas sequence, and C(n) = γn δ n γ δ, respectively. Now we present an important conjecture. It is of interest to consider the ratio of successive terms in this sequence. Initial values are given in Table. This ratio appears to converge to the Golden ratio, α =.680. For large n, this value is found to be D(n + ).680 (Golden Ratio) Table n D(n+) n D(n+) n D(n+) It appears from Table that D(n+) approaches α = , the magic number, as n. This encourages us to make the following conjecture:.4. Conjecture. D(n+) x 4 x x = 0. converges to the limit α, the positive root of We can extended the definition of to negative subscripts. If we apply the Quadrapell recurrence relation to the negative side, we obtain Table n D( n) We can generalize Table, for k N, n Z + : +, if n = 6k + D( n) =, if n = 6k + 4, if n = k + Now we give some theorems related to sums of Quadrapell numbers.
5 On Quadrapell Numbers and Polynomials Theorem. For k N k+ D(j) = D(k + ). Proof. We use the principle of mathematical induction. Since D(0) + D() = = D(), clearly the result is true for k = 0. Now assume it is true for an arbitrary positive integer k >, k+ Then, we have k+4 D(j) = D(k + ). D(j) = k+ D(j) + D(k + ) + D(k + ) + D(k + 4) = D(k + ) + D(k + ) + D(k + ) + D(k + 4) (by the induction hypothesis) = D(k + 4) + D(k + ) + D(k + ) = D(k + 6) (by the Quadrapell recurrence relation) So the formula works for k +. Thus, by the principle of mathematical induction the formula holds for every integer k Theorem. For k N, k+ D(j) = D(k + 4). Proof. We proceed by induction on k. Since D(0) + D() + D() = = D(4), the statement is true for k = 0. Assume it is true for k >, k+ D(j) = D(k + 4). Then, we show that the formula holds for k +. Indeed, k+5 D(j) = k+ D(j) + D(k + ) + D(k + 4) + D(k + 5) = D(k + 4) + D(k + ) Thus the formula works for k Lemma. + D(k + 4) + D(k + 5) (by the induction hypothesis) = D(k + 5) + D(k + 4) + D(k + ) = D(k + 7) (by the Quadrapell recurrence relation) + D(n + ) + D(n + ) + D(n + 5) = D(n + 6).
6 70 D. Tascı Proof. By the Quadrapell recurrence relation, we have D(n + 5) = D(n + ) + D(n + ) + D(n + ). Thus we obtain + D(n + ) + D(n + ) + D(n + 5) = + D(n + ) + D(n + ) + D(n + ) = D(n + ) + D(n + ) + + D(n + ) + D(n + ) = D(n + 4) + D(n + ) + D(n + ) (by the recurrence relation) = D(n + 6) (by the recurrence relation). So the lemma is proved..8. Theorem. For k N, k+ D(j) = D(6k + ). Proof. We use induction on k. Since D(0) + D() = = D(), the formula works for k = 0. Now we assume that it is true for k >. Then k+4 D(j) = k+ D(j) + D(6k + 4) + D(6k + 6) + D(6k + 8) = D(6k + ) + D(6k + 4) + D(6k + 6) + D(6k + 8) (by the induction hypothesis) = D(6k + 9) (by Lemma.7). Note that if we take n = 6k + in Lemma.7, then we obtain D(6k + ) + D(6k + 4) + D(6k + 6) + D(6k + 8) = D(6k + 9). Thus the formula is true for k +. So, the proof is complete..9. Theorem. For k N, k+ D(j) = D(6k + 5) +. Proof. We will use proof by induction. Since D(0) + D() + D(4) = 6 = D(5) +, clearly it is true for k = 0. We now suppose that the statement holds for k >, i.e. k+ D(j) = D(6k + 5) +.
7 On Quadrapell Numbers and Polynomials 7 Then k+5 D(j) = k+ D(j) + D(6k + 6) + D(6k + 8) + D(6k + 0) = D(6k + 5) + + D(6k + 6) + D(6k + 8) + D(6k + 0) = D(6k + ) + (by Lemma.7). Thus the formula works for k +. So, by the principle of mathematical induction, the given statement is true for every integer k Theorem. For k N, k D(j + ) = D(6k + ). Proof. We use the principle of mathematical induction on k. Since D() = = D(), the formula is true for k = 0. Now we assume that it is true for k >, that is, k Then we have k+ D(j + ) = D(6k + ). k D(j + ) = D(j + ) + D(6k + ) + D(6k + 5) + D(6k + 7) = D(6k + ) + D(6k + ) + D(6k + 5) + D(6k + 7) = D(6k + 8) (by Lemma.7). Thus, the formula works for k +. Consequently the given statement is true for every integer k 0... Theorem. For k N, k+ D(j + ) = D(6k + 4). Proof. We proceed by induction on k, Since D() + D() = = D(4), the formula is true for k = 0. Assume it is true for k >, that is k+ Then we have k+4 D(j + ) = D(6k + 4). D(j + ) = k+ D(j + ) + D(6k + 5) + D(6k + 7) + D(6k + 9) = D(6k + 4) + D(6k + 5) + D(6k + 7) + D(6k + 9) = D(6k + 0) (by Lemma.7).
8 7 D. Tascı Therefore the formula works for k +. So, by the principle of mathematical induction the formula holds for every integer k 0... Definition. The matrix of the Quadrapell recurrence relation is defined by 0 T = The characteristic polynomial of the matrix T is λ 4 λ λ. We note that the characteristic equation of the matrix T is same as that of the Quadrapell equation. Furthermore, the eigenvalues of the matrix T are λ = + 5 = α, λ = 5 = β, λ = + i = γ, λ4 = i = δ. Also the eigenvectors of T are X = = 5 + α α α + β β β, for λ = + 5 = α (Golden ratio), 5 X = 5 =, for λ = 5 = β, X = i + i = δ γ, for λ = + i = γ, X 4 = + i i = γ δ, for λ4 = i = δ. We note that det(t) =... Definition. [8] Let λ, λ,..., λ n be the (real or complex) eigenvalues of a matrix A. Then its spectral radius ρ(a) is defined as: ρ(a) = max i n ( λi )..4. Theorem. [] For any matrix norm, ρ(a) = lim n An n..5. Lemma. Let T be the matrix of the Quadrapell recurrence relation. Then for every integer n we have lim T n n = + 5 = α (Golden ratio). n
9 On Quadrapell Numbers and Polynomials 7 Proof. Since the spectral radius of the matrix T is ρ(t) = + 5, the desired result follows by Theorem Theorem. D(n + ) D(n + ) D(n + ) D(n + ) D(n + ) D(n ) D(n + ) D(n ) D(n ) = ( ) n 5 D(n ) D(n ) D(n ) Proof. We use the principle of mathematical induction on n. Since D(4) D() D() D() 4 D() D() D() D(0) D() D() D(0) D( ) = = 5 D() D(0) D( ) D( ) the result is true for n =. Now we assume that it is true for an arbitrary positive integer n >, that is D(n + ) D(n + ) D(n + ) D(n + ) D(n + ) D(n ) D(n + ) D(n ) D(n ) = ( ) n 5 D(n ) D(n ) D(n ) Then using the Quadrapell recurrence relation and properties of determinants, we have D(n + 4) D(n + ) D(n + ) D(n + ) D(n + ) D(n + ) D(n + ) D(n + ) D(n + ) D(n ) D(n + ) D(n ) D(n ) D(n + ) + D(n + ) + D(n + ) D(n + ) D(n + ) = D(n + ) + + D(n ) D(n + ) D(n + ) + D(n ) + D(n ) D(n + ) D(n ) D(n ) + D(n ) + D(n ) D(n ) D(n )
10 74 D. Tascı D(n + ) D(n + ) D(n + ) D(n + ) = D(n + ) D(n + ) D(n + ) D(n + ) D(n ) D(n ) D(n ) D(n ) }{{} 0 D(n + ) D(n + ) D(n + ) D(n + ) + D(n + ) D(n + ) D(n ) D(n + ) D(n ) D(n ) D(n ) D(n ) }{{} D(n + ) D(n + ) D(n + ) + D(n ) D(n + ) D(n + ) D(n ) D(n + ) D(n ) D(n ) D(n ) D(n ) D(n + ) D(n + ) D(n + ) = ( ) D(n + ) D(n + ) D(n ) D(n + ) D(n ) D(n ) D(n ) D(n ) D(n ) = ( )( ) n 5 (by the induction hypothesis) = ( ) n+ 5 Thus the statement works for n +. So, the equality is true for every integer n. 0.. Quadrapell Polynomials. Quadrapell numbers can be generalized to a set of polynomials, called the Quadrapell polynomials..7. Definition. The Quadrapell polynomials are defined by x, if n = 0,, if n =, D n(x) = x if n =, x, if n =, x D n (x) + xd n (x) + D n 4(x), if n 4. The first eight Quadrapell polynomials are: D 0(x) = x D (x) = D (x) = x D (x) = x D 4(x) = x 4 + x D 5(x) = x 5 + x + D 6(x) = x 6 + 4x 4 + x + x D 7(x) = x 7 + 4x 5 + x + 7x D 8(x) = x 8 + 8x 6 + x 5 + 6x 4 + 5x. Here we make an interesting observation: D i() = D(i), i =,,,..., n.
11 On Quadrapell Numbers and Polynomials 75 In fact, D n() =..8. Theorem. (x +x) n D i(x) = D n(x)+( x )D n+(x)+d n+(x)+d n+(x) x x x. Proof. Considering Definition 6, we have n n n n D i+(x) = x D i+(x) + x D i(x) + D i (x) or D n(x) + ( x )D n+(x) + D n+(x) + D n+(x) n = (x + x) D i(x) + D 0(x) + D (x) + D (x). On the other hand, since D 0(x) = x, D (x) = x and D (x) = x, it follows that n (x +x) D i(x) = D n(x)+( x )D n+(x)+d n+(x)+d n+(x) x x x. So the theorem is proved..9. Corollary. n D i = (Dn + Dn+ + Dn+ 4). Proof. Since D i() = D i, the proof is easily seen by Theorem.8. References [] Harary, F. Determinants, permanents and bipartite graphs, Math. Mag. 4, 46 48, 969. [] Harne, S. and Parihar, C. L. Some generalized Fibonacci polynomials, J. Indian Acad. Math. 8(), 5 5, 996. [] Harne, S. and Singh, B. Some properties of fourth-order recurrence relations, Vikram Math. J. 0, 79 84, 000. [4] Horadam, A. F. and Shannon, A. G. Irrational sequence-generated factors of integers, Fibonacci Quart. 9(), 40 50, 98. [5] Horn, R. and Johnson, C. Matrix Analysis (Cambridge University Press, 985). [6] Kilic, E. and Tasci, D. On families of bipartite graphs associated with sums of Fibonacci and Lucas numbers, Ars Combin. 89, 40, 008. [7] Kilic, E. and Tasci, D. On the second order linear recurrences by tridiagonal matrices, Ars Combin. (to appear). [8] Koshy, T. Fibonacci and Lucas Numbers with Applications (John Wiley & Sons Inc., 00). [9] Lee, G. -Y. k-lucas numbers and associated Bipartite graphs, Linear Algebra and its Appl. 0, 5 6, 000. [0] Minc, H. Permanents of (0,)-circulants, Canad. Math. Bull. 7 (), 5 6, 964. [] Sato, S. On matrix representations of generalized Fibonacci numbers and their applications, in Applications of Fibonacci Numbers, Vol. 5 (St. Andrews, 99) (Kluwer Acad. Publ., Dordrecht, 99), [] Tasci, D. and Kirkland, S. Sequence of upper bounds for the Perron root of nonnegative matrix, Linear Algebra and Its Appl. 7, 8, 998.
PAijpam.eu ON THE BOUNDS FOR THE NORMS OF R-CIRCULANT MATRICES WITH THE JACOBSTHAL AND JACOBSTHAL LUCAS NUMBERS Ş. Uygun 1, S.
International Journal of Pure and Applied Mathematics Volume 11 No 1 017, 3-10 ISSN: 1311-8080 (printed version); ISSN: 1314-335 (on-line version) url: http://wwwijpameu doi: 10173/ijpamv11i17 PAijpameu
More informationThe generalized order-k Fibonacci Pell sequence by matrix methods
Journal of Computational and Applied Mathematics 09 (007) 33 45 wwwelseviercom/locate/cam The generalized order- Fibonacci Pell sequence by matrix methods Emrah Kilic Mathematics Department, TOBB University
More informationPermanents and Determinants of Tridiagonal Matrices with (s, t)-pell Numbers
International Mathematical Forum, Vol 12, 2017, no 16, 747-753 HIKARI Ltd, wwwm-hikaricom https://doiorg/1012988/imf20177652 Permanents and Determinants of Tridiagonal Matrices with (s, t)-pell Numbers
More informationGeneralized Bivariate Lucas p-polynomials and Hessenberg Matrices
1 2 3 47 6 23 11 Journal of Integer Sequences, Vol. 15 (2012), Article 12.3.4 Generalized Bivariate Lucas p-polynomials and Hessenberg Matrices Kenan Kaygisiz and Adem Şahin Department of Mathematics Faculty
More informationOn the Hadamard Product of Fibonacci Q n matrix and Fibonacci Q n matrix
Int J Contemp Math Sciences, Vol, 006, no 6, 753-76 On the Hadamard Product of Fibonacci Q n matrix and Fibonacci Q n matrix Ayşe NALLI Department of Mathematics, Selcuk University 4070, Campus-Konya,
More informationResearch Article The Adjacency Matrix of One Type of Directed Graph and the Jacobsthal Numbers and Their Determinantal Representation
Applied Mathematics Volume 20, Article ID 423163, 14 pages doi:101155/20/423163 Research Article The Adjacency Matrix of One Type of Directed Graph and the Jacobsthal Numbers and Their Determinantal Representation
More informationA System of Difference Equations with Solutions Associated to Fibonacci Numbers
International Journal of Difference Equations ISSN 0973-6069 Volume Number pp 6 77 06) http://campusmstedu/ijde A System of Difference Equations with Solutions Associated to Fibonacci Numbers Yacine Halim
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 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 informationOn Gaussian Pell Polynomials and Their Some Properties
Palestine Journal of Mathematics Vol 712018, 251 256 Palestine Polytechnic University-PPU 2018 On Gaussian Pell Polynomials and Their Some Properties Serpil HALICI and Sinan OZ Communicated by Ayman Badawi
More informationarxiv: v1 [math.co] 20 Aug 2015
arxiv:1508.04953v1 [math.co] 20 Aug 2015 On Polynomial Identities for Recursive Sequences Ivica Martinak and Iva Vrsalko Faculty of Science University of Zagreb Bienička cesta 32, HR-10000 Zagreb Croatia
More information1 Examples of Weak Induction
More About Mathematical Induction Mathematical induction is designed for proving that a statement holds for all nonnegative integers (or integers beyond an initial one). Here are some extra examples of
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 informationThe Fibonacci Identities of Orthogonality
The Fibonacci Identities of Orthogonality Kyle Hawins, Ursula Hebert-Johnson and Ben Mathes January 14, 015 Abstract In even dimensions, the orthogonal projection onto the two dimensional space of second
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 informationSome algebraic identities on quadra Fibona-Pell integer sequence
Özkoç Advances in Difference Equations (015 015:148 DOI 10.1186/s1366-015-0486-7 R E S E A R C H Open Access Some algebraic identities on quadra Fibona-Pell integer sequence Arzu Özkoç * * Correspondence:
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 informationTHE GENERALIZED TRIBONACCI NUMBERS WITH NEGATIVE SUBSCRIPTS
#A3 INTEGERS 14 (014) THE GENERALIZED TRIBONACCI NUMBERS WITH NEGATIVE SUBSCRIPTS Kantaphon Kuhapatanakul 1 Dept. of Mathematics, Faculty of Science, Kasetsart University, Bangkok, Thailand fscikpkk@ku.ac.th
More informationMatrix functions that preserve the strong Perron- Frobenius property
Electronic Journal of Linear Algebra Volume 30 Volume 30 (2015) Article 18 2015 Matrix functions that preserve the strong Perron- Frobenius property Pietro Paparella University of Washington, pietrop@uw.edu
More informationOn the Pell Polynomials
Applied Mathematical Sciences, Vol. 5, 2011, no. 37, 1833-1838 On the Pell Polynomials Serpil Halici Sakarya University Department of Mathematics Faculty of Arts and Sciences 54187, Sakarya, Turkey shalici@sakarya.edu.tr
More informationarxiv: v1 [math.nt] 20 Sep 2018
Matrix Sequences of Tribonacci Tribonacci-Lucas Numbers arxiv:1809.07809v1 [math.nt] 20 Sep 2018 Zonguldak Bülent Ecevit University, Department of Mathematics, Art Science Faculty, 67100, Zonguldak, Turkey
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 informationarxiv: v2 [math.co] 8 Oct 2015
SOME INEQUALITIES ON THE NORMS OF SPECIAL MATRICES WITH GENERALIZED TRIBONACCI AND GENERALIZED PELL PADOVAN SEQUENCES arxiv:1071369v [mathco] 8 Oct 015 ZAHID RAZA, MUHAMMAD RIAZ, AND MUHAMMAD ASIM ALI
More informationDeterminant and Permanent of Hessenberg Matrix and Fibonacci Type Numbers
Gen. Math. Notes, Vol. 9, No. 2, April 2012, pp.32-41 ISSN 2219-7184; Copyright c ICSRS Publication, 2012 www.i-csrs.org Available free online at http://www.geman.in Determinant and Permanent of Hessenberg
More informationk-jacobsthal and k-jacobsthal Lucas Matrix Sequences
International Mathematical Forum, Vol 11, 016, no 3, 145-154 HIKARI Ltd, wwwm-hikaricom http://dxdoiorg/101988/imf0165119 k-jacobsthal and k-jacobsthal Lucas Matrix Sequences S Uygun 1 and H Eldogan Department
More informationOn Some Properties of Bivariate Fibonacci and Lucas Polynomials
1 2 3 47 6 23 11 Journal of Integer Sequences, Vol. 11 (2008), Article 08.2.6 On Some Properties of Bivariate Fibonacci and Lucas Polynomials Hacène Belbachir 1 and Farid Bencherif 2 USTHB/Faculty of Mathematics
More informationOn repdigits as product of consecutive Lucas numbers
Notes on Number Theory and Discrete Mathematics Print ISSN 1310 5132, Online ISSN 2367 8275 Vol. 24, 2018, No. 3, 5 102 DOI: 10.7546/nntdm.2018.24.3.5-102 On repdigits as product of consecutive Lucas numbers
More informationarxiv: v1 [math.nt] 9 May 2017
The spectral norm of a Horadam circulant matrix Jorma K Merikoski a, Pentti Haukkanen a, Mika Mattila b, Timo Tossavainen c, arxiv:170503494v1 [mathnt] 9 May 2017 a Faculty of Natural Sciences, FI-33014
More informationA note on the k-narayana sequence
Annales Mathematicae et Informaticae 45 (2015) pp 91 105 http://amietfhu A note on the -Narayana sequence José L Ramírez a, Víctor F Sirvent b a Departamento de Matemáticas, Universidad Sergio Arboleda,
More informationGeneralized Numerical Radius Inequalities for Operator Matrices
International Mathematical Forum, Vol. 6, 011, no. 48, 379-385 Generalized Numerical Radius Inequalities for Operator Matrices Wathiq Bani-Domi Department of Mathematics Yarmouk University, Irbed, Jordan
More informationPascal Eigenspaces and Invariant Sequences of the First or Second Kind
Pascal Eigenspaces and Invariant Sequences of the First or Second Kind I-Pyo Kim a,, Michael J Tsatsomeros b a Department of Mathematics Education, Daegu University, Gyeongbu, 38453, Republic of Korea
More informationSpectral radius, symmetric and positive matrices
Spectral radius, symmetric and positive matrices Zdeněk Dvořák April 28, 2016 1 Spectral radius Definition 1. The spectral radius of a square matrix A is ρ(a) = max{ λ : λ is an eigenvalue of A}. For an
More informationBIVARIATE JACOBSTHAL AND BIVARIATE JACOBSTHAL-LUCAS MATRIX POLYNOMIAL SEQUENCES SUKRAN UYGUN, AYDAN ZORCELIK
Available online at http://scik.org J. Math. Comput. Sci. 8 (2018), No. 3, 331-344 https://doi.org/10.28919/jmcs/3616 ISSN: 1927-5307 BIVARIATE JACOBSTHAL AND BIVARIATE JACOBSTHAL-LUCAS MATRIX POLYNOMIAL
More informationCSCE 222 Discrete Structures for Computing. Dr. Hyunyoung Lee
CSCE 222 Discrete Structures for Computing Sequences and Summations Dr. Hyunyoung Lee Based on slides by Andreas Klappenecker 1 Sequences 2 Sequences A sequence is a function from a subset of the set of
More informationA Note on the Determinant of Five-Diagonal Matrices with Fibonacci Numbers
Int. J. Contemp. Math. Sciences, Vol. 3, 2008, no. 9, 419-424 A Note on the Determinant of Five-Diagonal Matrices with Fibonacci Numbers Hacı Civciv Department of Mathematics Faculty of Art and Science
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 informationEigenvectors Via Graph Theory
Eigenvectors Via Graph Theory Jennifer Harris Advisor: Dr. David Garth October 3, 2009 Introduction There is no problem in all mathematics that cannot be solved by direct counting. -Ernst Mach The goal
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 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 Generalized k-fibonacci Sequence by Two-Cross-Two Matrix
Global Journal of Mathematical Analysis, 5 () (07) -5 Global Journal of Mathematical Analysis Website: www.sciencepubco.com/index.php/gjma doi: 0.449/gjma.v5i.6949 Research paper On Generalized k-fibonacci
More informationk-pell, k-pell-lucas and Modified k-pell Numbers: Some Identities and Norms of Hankel Matrices
International Journal of Mathematical Analysis Vol. 9, 05, no., 3-37 HIKARI Ltd, www.m-hikari.com http://dx.doi.org/0.988/ijma.05.4370 k-pell, k-pell-lucas and Modified k-pell Numbers: Some Identities
More informationOn the properties of k-fibonacci and k-lucas numbers
Int J Adv Appl Math Mech (1) (01) 100-106 ISSN: 37-59 Available online at wwwijaammcom International Journal of Advances in Applied Mathematics Mechanics On the properties of k-fibonacci k-lucas numbers
More informationGaussian Modified Pell Sequence and Gaussian Modified Pell Polynomial Sequence
Aksaray University Journal of Science and Engineering e-issn: 2587-1277 http://dergipark.gov.tr/asujse http://asujse.aksaray.edu.tr Aksaray J. Sci. Eng. Volume 2, Issue 1, pp. 63-72 doi: 10.29002/asujse.374128
More informationOn the generating matrices of the k-fibonacci numbers
Proyecciones Journal of Mathematics Vol. 3, N o 4, pp. 347-357, December 013. Universidad Católica del Norte Antofagasta - Chile On the generating matrices of the k-fibonacci numbers Sergio Falcon Universidad
More informationSection 11.1 Sequences
Math 152 c Lynch 1 of 8 Section 11.1 Sequences A sequence is a list of numbers written in a definite order: a 1, a 2, a 3,..., a n,... Notation. The sequence {a 1, a 2, a 3,...} can also be written {a
More informationLinear recurrence relations with the coefficients in progression
Annales Mathematicae et Informaticae 4 (013) pp. 119 17 http://ami.ektf.hu Linear recurrence relations with the coefficients in progression Mircea I. Cîrnu Department of Mathematics, Faculty of Applied
More informationFibonacci and Lucas Identities the Golden Way
Fibonacci Lucas Identities the Golden Way Kunle Adegoe adegoe00@gmail.com arxiv:1810.12115v1 [math.nt] 25 Oct 2018 Department of Physics Engineering Physics, Obafemi Awolowo University, 220005 Ile-Ife,
More informationOn sum of powers of the Laplacian and signless Laplacian eigenvalues of graphs
On sum of powers of the Laplacian and signless Laplacian eigenvalues of graphs Saieed Akbari 1,2 Ebrahim Ghorbani 1,2 Jacobus H. Koolen 3,4 Mohammad Reza Oboudi 1,2 1 Department of Mathematical Sciences
More informations-generalized Fibonacci Numbers: Some Identities, a Generating Function and Pythagorean Triples
International Journal of Mathematical Analysis Vol. 8, 2014, no. 36, 1757-1766 HIKARI Ltd, www.m-hikari.com http://dx.doi.org/10.12988/ijma.2014.47203 s-generalized Fibonacci Numbers: Some Identities,
More informationCOMPLEX FACTORIZATION BY CHEBYSEV POLYNOMIALS
LE MATEMATICHE Vol LXXIII 2018 Fasc I, pp 179 189 doi: 104418/201873113 COMPLEX FACTORIZATION BY CHEBYSEV POLYNOMIALS MURAT SAHIN - ELIF TAN - SEMIH YILMAZ Let {a i },{b i } be real numbers for 0 i r 1,
More informationReciprocal Sums of Elements Satisfying Second Order Linear Recurrences
Chamchuri Journal of Mathematics Volume 00 Number, 93 00 http://wwwmathscchulaacth/cjm Reciprocal Sums of Elements Satisfying Second Order Linear Recurrences Kantaphon Kuhapatanakul and Vichian Laohakosol
More informationABSTRACT 1. INTRODUCTION
THE FIBONACCI NUMBER OF GENERALIZED PETERSEN GRAPHS Stephan G. Wagner Department of Mathematics, Graz University of Technology, Steyrergasse 30, A-8010 Graz, Austria e-mail: wagner@finanz.math.tu-graz.ac.at
More informationSection 4.1: Sequences and Series
Section 4.1: Sequences and Series In this section, we shall introduce the idea of sequences and series as a necessary tool to develop the proof technique called mathematical induction. Most of the material
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 informationSOME SUMS FORMULAE FOR PRODUCTS OF TERMS OF PELL, PELL- LUCAS AND MODIFIED PELL SEQUENCES
SOME SUMS FORMULAE FOR PRODUCTS OF TERMS OF PELL PELL- LUCAS AND MODIFIED PELL SEQUENCES Serpil HALICI Sakarya Üni. Sciences and Arts Faculty Dept. of Math. Esentepe Campus Sakarya. shalici@ssakarya.edu.tr
More informationOn h(x)-fibonacci octonion polynomials
Alabama Journal of Mathematics 39 (05) ISSN 373-0404 On h(x)-fibonacci octonion polynomials Ahmet İpek Karamanoğlu Mehmetbey University, Science Faculty of Kamil Özdağ, Department of Mathematics, Karaman,
More informationDiophantine quadruples and Fibonacci numbers
Diophantine quadruples and Fibonacci numbers Andrej Dujella Department of Mathematics, University of Zagreb, Croatia Abstract A Diophantine m-tuple is a set of m positive integers with the property that
More informationA Horadam-based pseudo-random number generator
A Horadam-based pseudo-random number generator Item type Authors Citation DOI Publisher Journal Meetings and Proceedings Bagdasar, Ovidiu; Chen, Minsi Bagdasar, O. and Chen, M. (4) 'A Horadam-based pseudo-random
More informationFibonacci and Lucas numbers via the determinants of tridiagonal matrix
Notes on Number Theory and Discrete Mathematics Print ISSN 30 532, Online ISSN 2367 8275 Vol 24, 208, No, 03 08 DOI: 07546/nntdm2082403-08 Fibonacci and Lucas numbers via the determinants of tridiagonal
More informationFibonacci and k Lucas Sequences as Series of Fractions
DOI: 0.545/mjis.06.4009 Fibonacci and k Lucas Sequences as Series of Fractions A. D. GODASE AND M. B. DHAKNE V. P. College, Vaijapur, Maharashtra, India Dr. B. A. M. University, Aurangabad, Maharashtra,
More informationGENERALIZED FIBONACCI AND LUCAS NUMBERS OF THE FORM wx 2 AND wx 2 1
Bull. Korean Math. Soc. 51 (2014), No. 4, pp. 1041 1054 http://dx.doi.org/10.4134/bkms.2014.51.4.1041 GENERALIZED FIBONACCI AND LUCAS NUMBERS OF THE FORM wx 2 AND wx 2 1 Ref ik Kesk in Abstract. Let P
More informationInt. J. Contemp. Math. Sciences, Vol. 3, 2008, no. 35, Fermat-GCD Matrices
Int. J. Contemp. Math. Sciences, Vol. 3, 2008, no. 35, 745-753 Fermat-GCD Matrices Şerife Büyükköse The University of AhiEvran, Faculty of Science and Arts Department of Mathematics, 4000 Kirşehir, Turkey
More informationGeneralized Fibonacci numbers of the form 2 a + 3 b + 5 c
Generalized Fibonacci numbers of the form 2 a + 3 b + 5 c Diego Marques 1 Departamento de Matemática, Universidade de Brasília, Brasília, 70910-900, Brazil Abstract For k 2, the k-generalized Fibonacci
More informationThe Spectral Norms of Geometric Circulant Matrices with Generalized Tribonacci Sequence
International Journal of Scientific and Innovative Mathematical Research (IJSIMR) Volume 6, Issue 6, 2018, PP 34-41 ISSN No. (Print) 2347-307X & ISSN No. (Online) 2347-3142 DOI: http://dx.doi.org/10.20431/2347-3142.0606005
More informationYi Wang Department of Applied Mathematics, Dalian University of Technology, Dalian , China (Submitted June 2002)
SELF-INVERSE SEQUENCES RELATED TO A BINOMIAL INVERSE PAIR Yi Wang Department of Applied Mathematics, Dalian University of Technology, Dalian 116024, China (Submitted June 2002) 1 INTRODUCTION Pairs of
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 informationCLOSED FORM CONTINUED FRACTION EXPANSIONS OF SPECIAL QUADRATIC IRRATIONALS
CLOSED FORM CONTINUED FRACTION EXPANSIONS OF SPECIAL QUADRATIC IRRATIONALS DANIEL FISHMAN AND STEVEN J. MILLER ABSTRACT. We derive closed form expressions for the continued fractions of powers of certain
More informationIncomplete Tribonacci Numbers and Polynomials
1 3 47 6 3 11 Journal of Integer Sequences, Vol. 17 (014, Article 14.4. Incomplete Tribonacci Numbers and Polynomials José L. Ramírez 1 Instituto de Matemáticas y sus Aplicaciones Calle 74 No. 14-14 Bogotá
More informationPartition of Integers into Distinct Summands with Upper Bounds. Partition of Integers into Even Summands. An Example
Partition of Integers into Even Summands We ask for the number of partitions of m Z + into positive even integers The desired number is the coefficient of x m in + x + x 4 + ) + x 4 + x 8 + ) + x 6 + x
More informationSeries of Error Terms for Rational Approximations of Irrational Numbers
2 3 47 6 23 Journal of Integer Sequences, Vol. 4 20, Article..4 Series of Error Terms for Rational Approximations of Irrational Numbers Carsten Elsner Fachhochschule für die Wirtschaft Hannover Freundallee
More informationNotes on Continued Fractions for Math 4400
. Continued fractions. Notes on Continued Fractions for Math 4400 The continued fraction expansion converts a positive real number α into a sequence of natural numbers. Conversely, a sequence of natural
More informationINCOMPLETE BALANCING AND LUCAS-BALANCING NUMBERS
INCOMPLETE BALANCING AND LUCAS-BALANCING NUMBERS BIJAN KUMAR PATEL, NURETTIN IRMAK and PRASANTA KUMAR RAY Communicated by Alexandru Zaharescu The aim of this article is to establish some combinatorial
More informationOn Some Identities and Generating Functions
Int. Journal of Math. Analysis, Vol. 7, 2013, no. 38, 1877-1884 HIKARI Ltd, www.m-hikari.com http://dx.doi.org/10.12988/ijma.2013.35131 On Some Identities and Generating Functions for k- Pell Numbers Paula
More informationProblem Set 5 Solutions
Problem Set 5 Solutions Section 4.. Use mathematical induction to prove each of the following: a) For each natural number n with n, n > + n. Let P n) be the statement n > + n. The base case, P ), is true
More informationSpectral inequalities and equalities involving products of matrices
Spectral inequalities and equalities involving products of matrices Chi-Kwong Li 1 Department of Mathematics, College of William & Mary, Williamsburg, Virginia 23187 (ckli@math.wm.edu) Yiu-Tung Poon Department
More informationOn the adjacency matrix of a block graph
On the adjacency matrix of a block graph R. B. Bapat Stat-Math Unit Indian Statistical Institute, Delhi 7-SJSS Marg, New Delhi 110 016, India. email: rbb@isid.ac.in Souvik Roy Economics and Planning Unit
More informationDIOPHANTINE EQUATIONS, FIBONACCI HYPERBOLAS, AND QUADRATIC FORMS. Keith Brandt and John Koelzer
DIOPHANTINE EQUATIONS, FIBONACCI HYPERBOLAS, AND QUADRATIC FORMS Keith Brandt and John Koelzer Introduction In Mathematical Diversions 4, Hunter and Madachy ask for the ages of a boy and his mother, given
More informationA NICE DIOPHANTINE EQUATION. 1. Introduction
A NICE DIOPHANTINE EQUATION MARIA CHIARA BRAMBILLA Introduction One of the most interesting and fascinating subjects in Number Theory is the study of diophantine equations A diophantine equation is a polynomial
More informationAN ELEMENTARY PROOF OF THE SPECTRAL RADIUS FORMULA FOR MATRICES
AN ELEMENTARY PROOF OF THE SPECTRAL RADIUS FORMULA FOR MATRICES JOEL A. TROPP Abstract. We present an elementary proof that the spectral radius of a matrix A may be obtained using the formula ρ(a) lim
More informationON GENERALIZED BALANCING SEQUENCES
ON GENERALIZED BALANCING SEQUENCES ATTILA BÉRCZES, KÁLMÁN LIPTAI, AND ISTVÁN PINK Abstract. Let R i = R(A, B, R 0, R 1 ) be a second order linear recurrence sequence. In the present paper we prove that
More informationarxiv: v1 [math.ho] 28 Jul 2017
Generalized Fibonacci Sequences and Binet-Fibonacci Curves arxiv:1707.09151v1 [math.ho] 8 Jul 017 Merve Özvatan and Oktay K. Pashaev Department of Mathematics Izmir Institute of Technology Izmir, 35430,
More informationChapter 11 - Sequences and Series
Calculus and Analytic Geometry II Chapter - Sequences and Series. Sequences Definition. A sequence is a list of numbers written in a definite order, We call a n the general term of the sequence. {a, a
More informationarxiv: v1 [math.nt] 17 Nov 2011
On the representation of k sequences of generalized order-k numbers arxiv:11114057v1 [mathnt] 17 Nov 2011 Kenan Kaygisiz a,, Adem Sahin a a Department of Mathematics, Faculty of Arts Sciences, Gaziosmanpaşa
More informationMath 108b: Notes on the Spectral Theorem
Math 108b: Notes on the Spectral Theorem From section 6.3, we know that every linear operator T on a finite dimensional inner product space V has an adjoint. (T is defined as the unique linear operator
More informationImpulse Response Sequences and Construction of Number Sequence Identities
Impulse Response Sequences and Construction of Number Sequence Identities Tian-Xiao He Department of Mathematics Illinois Wesleyan University Bloomington, IL 6170-900, USA Abstract As an extension of Lucas
More informationDivisibility in the Fibonacci Numbers. Stefan Erickson Colorado College January 27, 2006
Divisibility in the Fibonacci Numbers Stefan Erickson Colorado College January 27, 2006 Fibonacci Numbers F n+2 = F n+1 + F n n 1 2 3 4 6 7 8 9 10 11 12 F n 1 1 2 3 8 13 21 34 89 144 n 13 14 1 16 17 18
More informationApplied Mathematics Letters
Applied Mathematics Letters 5 (0) 554 559 Contents lists available at SciVerse ScienceDirect Applied Mathematics Letters journal homepage: wwwelseviercom/locate/aml On the (s, t)-pell and (s, t)-pell Lucas
More informationON THE SUM OF POWERS OF TWO. 1. Introduction
t m Mathematical Publications DOI: 0.55/tmmp-06-008 Tatra Mt. Math. Publ. 67 (06, 4 46 ON THE SUM OF POWERS OF TWO k-fibonacci NUMBERS WHICH BELONGS TO THE SEQUENCE OF k-lucas NUMBERS Pavel Trojovský ABSTRACT.
More informationCullen Numbers in Binary Recurrent Sequences
Cullen Numbers in Binary Recurrent Sequences Florian Luca 1 and Pantelimon Stănică 2 1 IMATE-UNAM, Ap. Postal 61-3 (Xangari), CP 58 089 Morelia, Michoacán, Mexico; e-mail: fluca@matmor.unam.mx 2 Auburn
More informationMiskolc Mathematical Notes HU e-issn Tribonacci numbers with indices in arithmetic progression and their sums. Nurettin Irmak and Murat Alp
Miskolc Mathematical Notes HU e-issn 8- Vol. (0), No, pp. 5- DOI 0.85/MMN.0.5 Tibonacci numbes with indices in aithmetic pogession and thei sums Nuettin Imak and Muat Alp Miskolc Mathematical Notes HU
More informationPowers of Two as Sums of Two Lucas Numbers
1 3 47 6 3 11 Journal of Integer Sequences, Vol. 17 (014), Article 14.8.3 Powers of Two as Sums of Two Lucas Numbers Jhon J. Bravo Mathematics Department University of Cauca Street 5 No. 4-70 Popayán,
More informationOn the Hadamard Product of the Golden Matrices
Int. J. Contemp. Math. Sci., Vol., 007, no. 11, 537-544 On the Hadamard Product of the Golden Matrices Ayşe NALLI Department of Mathematics, Selcuk University 4070, Campus-Konya, Turkey aysenalli@yahoo.com
More informationA NOTE ON MULTIPLICATIVE TRIPLE FIBONACCI SEQUENCES Satish Kumar, Hari Kishan and Deepak Gupta
The Bulletin of Society for Mathematical Services and Standards Online: 2015-03-02 ISSN: 2277-8020, Vol. 13, pp 1-6 doi:10.18052/www.scipress.com/bsmass.13.1 2015 SciPress Ltd., Switzerland A NOTE ON MULTIPLICATIVE
More informationSECOND-ORDER RECURRENCES. Lawrence Somer Department of Mathematics, Catholic University of America, Washington, D.C
p-stability OF DEGENERATE SECOND-ORDER RECURRENCES Lawrence Somer Department of Mathematics, Catholic University of America, Washington, D.C. 20064 Walter Carlip Department of Mathematics and Computer
More informationA Result on the Neutrix Composition of the Delta Function
Advances in Dynamical Systems and Applications ISSN 973-5321, Volume 6, Number 1, pp. 49 56 (211) http://campus.mst.edu/adsa A Result on the Neutrix Composition of the Delta Function Brian Fisher Department
More informationSOME RESULTS ON q-analogue OF THE BERNOULLI, EULER AND FIBONACCI MATRICES
SOME RESULTS ON -ANALOGUE OF THE BERNOULLI, EULER AND FIBONACCI MATRICES GERALDINE M. INFANTE, JOSÉ L. RAMÍREZ and ADEM ŞAHİN Communicated by Alexandru Zaharescu In this article, we study -analogues of
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 informationDecomposition of a recursive family of polynomials
Decomposition of a recursive family of polynomials Andrej Dujella and Ivica Gusić Abstract We describe decomposition of polynomials f n := f n,b,a defined by f 0 := B, f 1 (x := x, f n+1 (x = xf n (x af
More informationSome Determinantal Identities Involving Pell Polynomials
International Journal of Scientific and Innovative Mathematical Research (IJSIMR) Volume, Issue 5, May 4, PP 48-488 ISSN 47-7X (Print) & ISSN 47-4 (Online) www.arcjournals.org Some Determinantal Identities
More informationSpectrally arbitrary star sign patterns
Linear Algebra and its Applications 400 (2005) 99 119 wwwelseviercom/locate/laa Spectrally arbitrary star sign patterns G MacGillivray, RM Tifenbach, P van den Driessche Department of Mathematics and Statistics,
More information