English
Related papers

Related papers: On $k$-Fibonacci sums by matrix methods

200 papers

The Fibonacci numbers satisfy the famous recurrence $F_n = F_{n - 1} + F_{n - 2}$. The theory of C-finite sequences ensures that the Fibonacci numbers whose indices are divisible by $m$, namely $F_{mn}$, satisfy a similar recurrence for…

Combinatorics · Mathematics 2022-07-01 Robert Dougherty-Bliss

In [16], we obtained some congruences for Lucas quotients of two infinite families of Lucas sequences by studying the combinatorial sum $$\sum_{k\equiv r(\mbox{mod}m)}{n\choose k}a^k.$$ In this paper, we show that the sum can be expressed…

Number Theory · Mathematics 2016-09-27 Jiangshuai Yang , Yingpu Deng

The work considers the set $\Lambda_n^k$ of all $n\times n$ binary matrices having the same number of $k$ units in each row and each column. The article specifically focuses on the matrices whose rows and columns are sorted…

Combinatorics · Mathematics 2026-03-02 Krasimir Yordzhev

The summation formula $$ \sum^{n-1}_{i=0}\epsilon^i i! (i^k+u_k) = v_k+\epsilon^{n-1} n! A_{k-1}(n) $$ $(\epsilon=\pm 1; k=1,2,...; u_k, v_k\in \msbm\hbox{Z}; A_{k-1}$ is a polynomial) is derived and its various aspects are considered. In…

Number Theory · Mathematics 2007-05-23 Branko Dragovich

Let $F_n$ and $L_n$ be the Fibonacci and Lucas numbers, respectively. Four corresponding zeta functions in $s$ are defined by \[\zeta_F(s) \,:=\, \sum_{n=1}^{\infty} \frac{1}{F_n^s}\,,\quad \zeta_F^*(s) \,:=\,\sum_{n=1}^{\infty}…

Number Theory · Mathematics 2018-05-09 Carsten Elsner , Niclas Technau

We present a range of difficult integration formulas involving Fibonacci and Lucas numbers and trigonometric functions. These formulas are often expressed in terms of special functions like the dilogarithm and Clausen's function. We also…

General Mathematics · Mathematics 2024-06-04 Kunle Adegoke , Robert Frontczak

In this paper we present two families of Fibonacci-Lucas identities, with the Sury's identity being the best known representative of one of the families. While these results can be proved by means of the basic identity relating Fibonacci…

Combinatorics · Mathematics 2016-06-30 Ivica Martinjak , Helmut Prodinger

In this paper, we find all sums of two Fibonacci numbers which are close to a power of 2. As a corollary, we also determine all Lucas numbers close to a power of 2. The main tools used in this work are lower bounds for linear forms in…

Number Theory · Mathematics 2022-06-22 Elchin Hasanalizade

We derive a general recurrence relation for squares of Fibonacci-like numbers. Various properties are developed, including double binomial summation identites.

General Mathematics · Mathematics 2019-01-09 Kunle Adegoke , Tokunbo Omiyinka

By expressing Fibonacci and Lucas numbers in terms of the powers of the golden ratio, $\alpha=(1+\sqrt 5)/2$ and its inverse, $\beta=-1/\alpha=(1-\sqrt 5)/2$, a multitude of Fibonacci and Lucas identities have been developed in the…

Number Theory · Mathematics 2018-10-30 Kunle Adegoke

The aim of this paper is to prove wordlessly the sum formula of $1^{k}+2^{k}+\ldots +n^{k}$, $k\in\{1,2,3\}$.

History and Overview · Mathematics 2022-06-16 Bikash Chakraborty

The purpose of this paper is to discuss the relationship between prime numbers and sums of Fibonacci numbers. One of our main results says that for every sufficiently large integer $k$ there exists a prime number that can be represented as…

Number Theory · Mathematics 2022-08-17 Michael Drmota , Clemens Müllner , Lukas Spiegelhofer

Brualdi and Ma found a connection between involutions of length $n$ with $k$ descents and symmetric $k\times k$ matrices with non-negative integer entries summing to $n$ and having no row or column of zeros. From their main theorem they…

Combinatorics · Mathematics 2017-07-10 Samantha Dahlberg

Recently, by the Riordan's identity related to tree enumerations, \begin{eqnarray*} \sum_{k=0}^{n}\binom{n}{k}(k+1)!(n+1)^{n-k} &=& (n+1)^{n+1}, \end{eqnarray*} Sun and Xu derived another analogous one, \begin{eqnarray*}…

Combinatorics · Mathematics 2010-07-09 Yidong Sun , Jujuan Zhuang

For arbitrary $n$ complex numbers $a_{\nu-1}$, $\nu=1,\dots,n$, where $n$ is sufficiently large, we get the representation in the form of power sums: $a_{\nu-1}=\lambda_1^\nu+\dots+\lambda_{2n+1}^\nu$, where $\lambda_k$ are distinct points,…

Classical Analysis and ODEs · Mathematics 2018-07-18 Mikhail A. Komarov

In this paper,we find all generalized Fibonacci numbers which are Narayana's cows numbers. In our proofs, we use both Baker's theory of nonzero linear forms in logarithms of algebraic numbers and the Baker-Davenport reduction method.

Number Theory · Mathematics 2023-02-21 Hayat Bensella , Djilali Behloul

Using combinatorial techniques, we derive a recurrence identity that expresses an exponential power sum with negative powers in terms of another exponential power sum with positive powers. Consequently, we derive a formula for the power sum…

Number Theory · Mathematics 2023-11-23 Neha Elizabeth Thomas , K Vishnu Namboothiri

The paper studies algebraic independence of certain reciprocal sums of Fibonacci and Lucas sequences. Also more general binary recurrences are considered. The main tool is Mahler's method reducing the investigation of the algebraic…

Number Theory · Mathematics 2014-03-24 Peter Bundschuh , Keijo Väänänen

In earlier work with C.~Monical, we introduced the notion of a K-crystal, with applications to K-theoretic Schubert calculus and the study of Lascoux polynomials. We conjectured that such a K-crystal structure existed on the set of…

Combinatorics · Mathematics 2023-08-02 Oliver Pechenik , Travis Scrimshaw

We define two notions of partial sums of a Riordan array, corresponding respectively to the partial sums of the rows and the partial sums of the columns of the Riordan array in question. We characterize the matrices that arise from these…

Combinatorics · Mathematics 2021-09-01 Paul Barry
‹ Prev 1 4 5 6 7 8 10 Next ›