FORMULAS FOR BINOMIAL SUMS INCLUDING POWERS OF FIBONACCI AND LUCAS NUMBERS

Similar documents
Some congruences related to harmonic numbers and the terms of the second order sequences

arxiv: v1 [math.co] 12 Sep 2014

Applied Mathematics Letters

The Parity of the Number of Irreducible Factors for Some Pentanomials

The binomial transforms of the generalized (s, t )-Jacobsthal matrix sequence

Binomial transforms of the modified k-fibonacci-like sequence

ON THE NUMBER OF PRIMITIVE PYTHAGOREAN QUINTUPLES

Evaluation of various partial sums of Gaussian q-binomial sums

A combinatorial proof of multiple angle formulas involving Fibonacci and Lucas numbers

THE ADJACENCY-PELL-HURWITZ NUMBERS. Josh Hiller Department of Mathematics and Computer Science, Adelpi University, New York

h-analogue of Fibonacci Numbers

System in Weibull Distribution

Finite Fields and Their Applications

Slobodan Lakić. Communicated by R. Van Keer

COMBINATORIAL IDENTITIES DERIVING FROM THE n-th POWER OF A 2 2 MATRIX

Closed-form evaluations of Fibonacci Lucas reciprocal sums with three factors

Multiplicative Functions and Möbius Inversion Formula

An Optimal Bound for Sum of Square Roots of Special Type of Integers

Self-complementing permutations of k-uniform hypergraphs

Valuated Binary Tree: A New Approach in Study of Integers

THE GENERALIZED (s, t)-fibonacci AND FIBONACCI MATRIX SEQUENCES

arxiv: v2 [math.co] 3 Sep 2017

LECTURE 8-9: THE BAKER-CAMPBELL-HAUSDORFF FORMULA

On the number of regions in an m-dimensional space cut by n hyperplanes

Special Relativity and Riemannian Geometry. Department of Mathematical Sciences

Remarks on the Properties of a Quasi-Fibonacci-like Polynomial Sequence

arxiv: v1 [math.ho] 18 May 2008

Bernoulli Numbers and Polynomials

A new Approach for Solving Linear Ordinary Differential Equations

#A27 INTEGERS 13 (2013) SOME WEIGHTED SUMS OF PRODUCTS OF LUCAS SEQUENCES

Randić Energy and Randić Estrada Index of a Graph

= m 1. sin π( ai z ) )

Denote the function derivatives f(x) in given points. x a b. Using relationships (1.2), polynomials (1.1) are written in the form

On quasiperfect numbers

EXPANSIVE MAPPINGS. by W. R. Utz

The Jacobsthal and Jacobsthal-Lucas Numbers via Square Roots of Matrices

DONALD M. DAVIS. 1. Main result

Existence of Two Conjugate Classes of A 5 within S 6. by Use of Character Table of S 6

The internal structure of natural numbers and one method for the definition of large prime numbers

Excess Error, Approximation Error, and Estimation Error

The lower and upper bounds on Perron root of nonnegative irreducible matrices

Amusing Properties of Odd Numbers Derived From Valuated Binary Tree

Difference Equations

PHASED TILINGS AND GENERALIZED FIBONACCI IDENTITIES

Some Generalized Fibonomial Sums related with the Gaussian q Binomial sums

A FORMULA FOR COMPUTING INTEGER POWERS FOR ONE TYPE OF TRIDIAGONAL MATRIX

TAIL BOUNDS FOR SUMS OF GEOMETRIC AND EXPONENTIAL VARIABLES

Modulo Magic Labeling in Digraphs

Determinants Containing Powers of Generalized Fibonacci Numbers

On Pfaff s solution of the Pfaff problem

SL n (F ) Equals its Own Derived Group

Math Review. CptS 223 Advanced Data Structures. Larry Holder School of Electrical Engineering and Computer Science Washington State University

Solving 2D-BKDV Equation by a Sub-ODE Method

Chowla s Problem on the Non-Vanishing of Certain Infinite Series and Related Questions

On the Calderón-Zygmund lemma for Sobolev functions

n α j x j = 0 j=1 has a nontrivial solution. Here A is the n k matrix whose jth column is the vector for all t j=0

BAYESIAN CURVE FITTING USING PIECEWISE POLYNOMIALS. Dariusz Biskup

A PROOF OF A CONJECTURE OF MELHAM

J. Number Theory 130(2010), no. 4, SOME CURIOUS CONGRUENCES MODULO PRIMES

General viscosity iterative method for a sequence of quasi-nonexpansive mappings

EXACT TRAVELLING WAVE SOLUTIONS FOR THREE NONLINEAR EVOLUTION EQUATIONS BY A BERNOULLI SUB-ODE METHOD

Yong Joon Ryang. 1. Introduction Consider the multicommodity transportation problem with convex quadratic cost function. 1 2 (x x0 ) T Q(x x 0 )

A Radon-Nikodym Theorem for Completely Positive Maps

Using T.O.M to Estimate Parameter of distributions that have not Single Exponential Family

A combinatorial problem associated with nonograms

A CHARACTERIZATION OF ADDITIVE DERIVATIONS ON VON NEUMANN ALGEBRAS

9 Characteristic classes

A property of the elementary symmetric functions

A Proof of a Conjecture for the Number of Ramified Coverings of the Sphere by the Torus

COMPARISON OF SOME RELIABILITY CHARACTERISTICS BETWEEN REDUNDANT SYSTEMS REQUIRING SUPPORTING UNITS FOR THEIR OPERATIONS

An efficient algorithm for multivariate Maclaurin Newton transformation

International Journal of Mathematical Archive-9(3), 2018, Available online through ISSN

Linearization coefficients of Bessel polynomials and properties of Student-t distributions

Ballot Paths Avoiding Depth Zero Patterns

The Degrees of Nilpotency of Nilpotent Derivations on the Ring of Matrices

Designing Fuzzy Time Series Model Using Generalized Wang s Method and Its application to Forecasting Interest Rate of Bank Indonesia Certificate

More metrics on cartesian products

COS 511: Theoretical Machine Learning

On an identity for the cycle indices of rooted tree automorphism groups

GENERALIZATION OF AN IDENTITY INVOLVING THE GENERALIZED FIBONACCI NUMBERS AND ITS APPLICATIONS

PARTITIONS WITH PARTS IN A FINITE SET

The Impact of the Earth s Movement through the Space on Measuring the Velocity of Light

On some variants of Jensen s inequality

On the average number of divisors of the sum of digits of squares

% & 5.3 PRACTICAL APPLICATIONS. Given system, (49) , determine the Boolean Function, , in such a way that we always have expression: " Y1 = Y2

a b a In case b 0, a being divisible by b is the same as to say that

The Order Relation and Trace Inequalities for. Hermitian Operators

= = = (a) Use the MATLAB command rref to solve the system. (b) Let A be the coefficient matrix and B be the right-hand side of the system.

arxiv: v1 [math.ac] 23 Oct 2018

Zhi-Wei Sun (Nanjing)

What is LP? LP is an optimization technique that allocates limited resources among competing activities in the best possible manner.

arxiv: v6 [math.nt] 23 Aug 2016

Restricted divisor sums

THE CHINESE REMAINDER THEOREM. We should thank the Chinese for their wonderful remainder theorem. Glenn Stevens

Expected Value and Variance

Department of Economics, Niigata Sangyo University, Niigata, Japan

Integral Transforms and Dual Integral Equations to Solve Heat Equation with Mixed Conditions

Digital Signal Processing

Genericity of Critical Types

A PROOF OF MELHAM S CONJECTURE

Transcription:

U.P.B. Sc. Bull., Seres A, Vol. 77, Iss. 4, 015 ISSN 13-707 FORMULAS FOR BINOMIAL SUMS INCLUDING POWERS OF FIBONACCI AND LUCAS NUMBERS Erah KILIÇ 1, Iler AKKUS, Neşe ÖMÜR, Yücel Türer ULUTAŞ3 Recently Prodnger [] proved general expanson forulas for sus of powers of Fbonacc and Lucas nubers. In ths paper, we wll prove general expanson forulas for bnoal sus of powers of Fbonacc and Lucas nubers. Keywords: Fbonacc and Lucas nubers, bnoal sus, powers. MSC010: 11B39, 05A19. 1. Introducton The Fbonacc nubers and Lucas nubers L n are defned by the followng recursons: for n > 0, +1 + 1 and L n+1 L n + L n 1, where F 0 0, F 1 1 and L 0, L 1 1, respectvely. If the roots of the characterstc equaton x x 1 0 are α and β, then the Bnet forulas for the are αn β n α β and L n α n + β n. Weann and Cooper [4] entoned about soe conjectures of Melha for the su: F +1. 1 Oze [1] consdered Melha s su and then he gave an explct expanson for Melha s su as a polynoal n +1. In general, Prodnger [] derved the general forula for the su: F +ε +δ, where ε, δ {0, 1}, as well as the evaluatons of the correspondng sus for Lucas nubers. 1 TOBB Econocs and Technology Unversty, Matheatcs Departent, 06560 Anara, Turey, e-al: elc@etu.edu.tr Kırıale Unversty, Faculty of Arts and Scences, Departent of Matheatcs, 71450 Yahshan, Kırıale, Turey, e-al: aus.tr@gal.co 3 Kocael Unversty, Departent of Matheatcs, 41380 Izt, Turey, e-al: neseour@ocael.edu.tr, turery@ocael.edu.tr 69

70 Erah KILIÇ, Iler AKKUS, Neşe ÖMÜR, Yücel Türer ULUTAŞ In [5], the authors gave forulas for the alternatng analogues of sus of Melha for Fbonacc and Lucas nubers of the fors 1 F +ε +δ and 1 L +ε +δ, 1 where ε, δ {0, 1}. In ths paper, we consder certan bnoal sus gven by F +ε +δt, L +ε +δt, 1 F +ε +δt and 1 1 L +ε +δt, where t s an postve nteger and ε, δ {0, 1}. Throughout ths paper, we use the ndcator functon [S] defned by 1 f the stateent S s true or 0 otherwse. We recall soe facts for the readers convenence n [3]: For any real nubers and n, and + n t t/ 1 n t t n t + n t t + n t/ [t s even] 1 t/ Fro [6], we have the followng result: t/ 1 t n 1 t + n t t + n t/ 1 t/ [t s even]. t/ Lea 1.1. Let r and s be arbtrary ntegers. Then 5 n 1/ Fs n L sn+r f n s odd, F r+s 5 n/ Fs n F sn+r f n s even, L n s F sn+r f s s even. L r+s 1 F r+s 5 n+1/ Fs n F sn+r f n s odd, 5 n/ Fs n L sn+r f n s even, L n s L sn+r f s s even. 5 n/ Fs n F sn+r f n s even, 5 n 1/ Fs n L sn+r f n s odd, 1 n L n s F sn+r f s s odd. f s s odd, f s s odd, f s s even, 3 4 5

Forulas for Bnoal Sus Includng Powers of Fbonacc and Lucas Nubers 71 v 1 L r+s 5 n/ Fs n L sn+r f n s even, 5 n+1/ Fs n F sn+r f n s odd, 1 n L n s L sn+r f s s odd. f s s even, 6. Soe Bnoal Sus for Fbonacc Nubers Here we consder bnoal and alternatng bnoal sus of powers of Fbonacc nubers. Theore.1. For t > 0, Ft 1 1 5 1 For odd t > 0, F +1 t 5 n 5 n 1 L n t L tn + 1 5 1 n. 1 +1 F n +1t F +1tn f n s even, and for even t > 0, F +1 t 1 5 1 +1 F n +1t L +1tn f n s odd, 1 + 1 L n +1t F +1tn Proof. Fro the Bnet forulas of { } and {L n }, and by, we wrte Ft n α t β t α β 1 1 n α β 1 α t + β t + 1 1 1 5 1 n L t + 1 n, whch, by 4 n Lea 1.1 and snce n n n, equvalent to n Ft 1 1 5 1 L n t L tn + 1 n,

7 Erah KILIÇ, Iler AKKUS, Neşe ÖMÜR, Yücel Türer ULUTAŞ as claed. Consder F +1 t n α t β t +1 α β 1 + 1 α β +1 1 α +1 t β +1 t 1 5 1 + 1 n F +1 t, whch, by tang s + 1 t and r 0 n 3 n Lea 1.1, gves the claed results. Followng the proof way of Theore.1, we have the followng result wthout proof: Theore.. For t > 0, F+1t 1 1 5 1 t+1 L n t L tn+1 + 1 5 1 t+1 n. For odd t > 0, F +1 +1t 5 n / 5 n 1/ + 1 + 1 +1 t F +1 tn+1 +1t L +1tn+1 f n s even, f n s odd, and, for even t > 0, F +1 +1t 1 5 + 1 1 L n +1 t F +1 tn+1.

Forulas for Bnoal Sus Includng Powers of Fbonacc and Lucas Nubers 73 Theore.3. For t > 0, 1 F+1t 5 n 1 1 t+1 F t n L tn+1 + 1 5 1 t+1 [n 0] 5 n +1 1 1 t+1 For odd t > 0, 1 F +1 +1t 1n 5 and, for even t > 0, 1 F +1 +1t 5 n 5 n 1 t F tn+1 f n s even, f n s odd. + 1 L n +1 t F +1 tn+1, 1 + 1 +1 t F +1 tn+1 Proof. For t > 0, by, consder 1 F+1t 1 + 1 +1 t L +1 tn+1 α 1 +1t β +1t α β 1 1 n α β 1 1 t+1 α t+1 + β t+1 + 1 1 α β 1 5 + 1 5 1 1 t+1 1 t+1 1 1 +1t 1 L t+1 1, f n s even, f n s odd.

74 Erah KILIÇ, Iler AKKUS, Neşe ÖMÜR, Yücel Türer ULUTAŞ whch, by tang s r t n 6 n Lea 1.1 and n n 1 [n 0], gves the claed result. For t > 0, by, consder n 1 F +1 +1t α 1 +1t β +1t α β 1 α β +1 1 1 5 +1 + 1 α +1 t+1 β +1 t+1 + 1 1 t+1 1 +t 1 F +1 t+1 whch, by tang s r + 1 t n 5 n Lea 1.1, gves the claed result. Followng the proof way of Theore.3, we have the followng result: Theore.4. For t > 0, 1 n Ft 5 n 1 5 n +1 F t n L tn + 1 5 1 [n 0] 1 1 1 t F tn f n s even, f n s odd, For odd t > 0, 1 n F +1 t 1 n 1 5 1 + 1 L n +1t F +1tn, and for even t > 0, 1 n F +1 t 5 n 5 n 1 1 + 1 +1t F +1tn 1 + 1 +1t L +1tn f n s even f n s odd.

Forulas for Bnoal Sus Includng Powers of Fbonacc and Lucas Nubers 75 3. Bnoal Sus and Bnoal Alternatng Sus for Lucas Nubers Now we consder bnoal and alternatng bnoal sus of powers of Lucas nubers. Theore 3.1. For t > 0, L t 1 L n t L tn + n. For even t > 0, L +1 t + 1 L n +1t L +1tn, and, for odd t > 0, L +1 t 5 n/ + 1 +1t L +1tn 5 n+1/ + 1 +1t F +1tn f n s even, f n s odd. Proof. For t > 0, by the Bnet forula of {L n } and 1, we wrte L t α t + β t 1 n α t + β t + n n L t +, 1 αβ t whch, by tang s t and r 0 n 4 n Lea 1.1, gves the claed result.

76 Erah KILIÇ, Iler AKKUS, Neşe ÖMÜR, Yücel Türer ULUTAŞ For t > 0, by the Bnet forula of {L n } and 1, we wrte L +1 t α t + β t +1 + 1 α +1 t + β +1 t + 1 n L +1 t whch, by tang s + 1 t and r 0 n 4 n Lea 1.1, gves the claed result. Followng the proof way of the prevous Theores, we gve the followng results wthout proof: Theore 3.. For t > 0, 1 n L +1t For even t > 0, L +1 +1t and, for odd t > 0, L +1 +1t 5 n + 1 5 n+1 + 1 Theore 3.3. For t > 0, 1 L t 5 n 1 5 n+1 1 1 t L n t L tn+1 + + 1 1 t n. L n +1t L +1tn+1, 1 +1t L +1tn+1 1 +1t F +1tn+1 t L tn + t F tn f n s even, f n s odd. [n 0] f n s even, f n s odd.

Forulas for Bnoal Sus Includng Powers of Fbonacc and Lucas Nubers 77 For odd t > 0, 1 L +1 t 1 n and, for even t > 0, n 5 n 1 L +1 t + 1 5 n+1 Theore 3.4. For t > 0, 1 L +1t 1 5n/ + 5 + 1 +1 t L +1 tn + 1 +1 t F +1 tn n+1/ 1 1 t t L tn+1 1 t [n 0] For odd t > 0, 1 L +1 +1t 1n and, for even t > 0, 1 L +1 +1t 5 n 5 n+1 + 1 L n +1 t L +1 tn, 1 t t F tn+1 + 1 + 1 f n s even, f n s odd. f n s even, f n s odd. 1 L n +1 t L +1 tn+1, +1 t L +1 tn+1 +1 t F +1 tn+1 R E F E R E N C E S f n s even, f n s odd. [1] K. Oze, On Melha s su,the Fbonacc Quarterly, 46-47 008-009,107 110. [] H. Prodnger, On a su of Melha and ts varants, The Fbonacc Quarterly, 46-473 008-009, 07 15. [3] S. Vajda, Fbonacc & Lucas nubers, and the golden secton. Theory and applcatons. John Wley & Sons, Inc., New Yor, 1989.

78 Erah KILIÇ, Iler AKKUS, Neşe ÖMÜR, Yücel Türer ULUTAŞ [4] M. Weann and C. Cooper, Dvsblty of an F L type convoluton. Applcatons of Fbonacc Nubers, 9 004, 67 87. [5] E. Kılıç, N. Öür and Y. T. Ulutaş, Alternatng sus of the powers of Fbonacc and Lucas nubers, Msolc Math. Notes, Vol. 1 011, No. 1, 87 103. [6] E. Kılıç, N. Öür and Y. T. Ulutaş, Bnoal sus whose coeffcents are products of ters of bnary sequences, Utltas Math., 84 011, 45 5.