An elementary unified approach to prove some identities involving Fibonacci and Lucas numbers

Using the explicit formulas of the generating polynomials of Fibonacci and Lucas, we prove some new identities involving Fibonacci and Lucas numbers. As an application of these identities, we show how some Diophantine equations have infinitely many solutions. To illustrate the powerful of this elementary method, we give proofs of many known formulas.

A New Method of Matrix Decomposition to Get the Determinants and Inverses of r -Circulant Matrices with Fibonacci and Lucas Numbers

We use a new method of matrix decomposition for r -circulant matrix to get the determinants of A n = Circ r F 1 , F 2 , … , F n and B n = Circ r L 1 , L 2 , … , L n , where F n is the Fibonacci numbers and L n is the Lucas numbers. Based on these determinants and the nonsingular conditions, inverse matrices are derived. The expressions of the determinants and inverse matrices are represented by Fibonacci and Lucas Numbers. In this study, the formulas of determinants and inverse matrices are much simpler and concise for programming and reduce the computational time.

Finite Sums Involving Reciprocals of the Binomial and Central Binomial Coefficients and Harmonic Numbers

We prove some finite sum identities involving reciprocals of the binomial and central binomial coefficients, as well as harmonic, Fibonacci and Lucas numbers, some of which recover previously known results, while the others are new.

On New Formulas of Fibonacci and Lucas Numbers Involving Golden Ratio Associated with Atomic Structure in Chemistry

The main purpose of this paper is to give many new formulas involving the Fibonacci numbers, the golden ratio, the Lucas numbers, and other special numbers. By using generating functions for the special numbers with their functional equations method, we also give many new relations among the Fibonacci numbers, the Lucas numbers, the golden ratio, the Stirling numbers, and other special numbers. Moreover, some applications of the Fibonacci numbers and the golden ratio in chemistry are given.

Fibonacci Power Sums

We evaluate various sums involving the powers of Fibonacci and Lucas numbers.

Binomial Fibonacci Power Sums

We evaluate various binomial sums involving the powers of Fibonacci and Lucas numbers.

Prime Factors and Divisibility of Sums of Powers of Fibonacci and Lucas Numbers

The Fibonacci sequence, whose first terms are f0; 1; 1; 2; 3; 5; : : :g, is generated using the recursive formula Fn+2 = Fn+1 + Fn with F0 = 0 and F1 = 1. This sequence is one of the most famous integer sequences because of its fascinating mathematical properties and connections with other fields such as biology, art, and music. Closely related to the Fibonacci sequence is the Lucas sequence. The Lucas sequence, whose first terms are f2; 1; 3; 4; 7; 11; : : :g, is generated using the recursive formula Ln+2 = Ln+1 + Ln with L0 = 2 and L1 = 1. In this paper, patterns in the prime factors of sums of powers of Fibonacci and Lucas numbers are examined. For example, F2 3n+4 + F2 3n+2 is even for all n 2 N0. To prove these results, techniques from modular arithmetic and facts about the divisibility of Fibonacci and Lucas numbers are utilized. KEYWORDS: Fibonacci Sequence; Lucas Sequence; Modular Arithmetic; Divisibility Sequence

Triple sums including Fibonacci numbers with three binomial coefficients

In this paper, we consider some triple sums that involve Fibonacci numbers with three binomial coefficients. We chose the indices of Fibonacci numbers as linear combination of the summation indices. Moreover, various types of alternating analogues of them whose powers depend on the index or indices are computed. These sums are evaluated in nice multiplication forms in terms of Fibonacci and Lucas numbers.