English
Related papers

Related papers: A Pillai-Catalan-type problem involving Fibonacci …

200 papers

It is well known that every positive integer can be expressed as a sum of nonconsecutive Fibonacci numbers provided the Fibonacci numbers satisfy $F_n =F_{n-1}+F_{n-2}$ for $n\geq 3$, $F_1 =1$ and $F_2 =2$. In this paper, for any…

Combinatorics · Mathematics 2019-02-06 Daniel Gotshall , Pamela E. Harris , Dawn Nelson , Maria D. Vega , Cameron Voigt

A second order polynomial sequence is of Fibonacci-type $\mathcal{F}_{n}$ (Lucas-type $\mathcal{L}_{n}$) if its Binet formula has a structure similar to that for Fibonacci (Lucas) numbers. Under certain conditions these polynomials are…

Number Theory · Mathematics 2022-02-17 Rigoberto Florez , J. C. Saunders

In this paper we state some conjectures about q-Fibonacci polynomials which for q=1 reduce to well-known results about Fibonacci numbers and Fibonacci polynomials.

Combinatorics · Mathematics 2008-05-06 Johann Cigler

We introduce a refinement of Boolean-Catalan numbers and call them Boolean-Narayana numbers. We provide an explicit formula for these numbers, and prove unimodality, log-concavity, and real-roots-only results for their sequences. We also…

Combinatorics · Mathematics 2026-04-14 Miklos Bona

We prove that the sequence $(1/F_{n+2})_{n\ge 0}$ of reciprocals of the Fibonacci numbers is a moment sequence of a certain discrete probability, and we identify the orthogonal polynomials as little $q$-Jacobi polynomials with…

Number Theory · Mathematics 2010-08-06 Christian Berg

A $K$-Fibonacci sequence is a binary recurrence sequence where $F_0=0$, $F_1=1$, and $F_n=K\cdot F_{n-1}+F_{n-2}$. These sequences are known to be periodic modulo every positive integer greater than $1$. If the length of one shortest period…

Number Theory · Mathematics 2024-07-30 Brennan Benfield , Oliver Lippard

If L, respectively R are matrices with entries binom{i-1,j-1}, respectively binom{i-1,n-j}, it is known that L^2 = I (mod 2), respectively R^3 = I (mod 2), where I is the identity matrix of dimension n > 1 (see P10735-May 1999 issue of the…

Combinatorics · Mathematics 2007-05-23 Rhodes Peele , Pantelimon Stanica

For a set $A$ of positive integers with $\gcd(A)=1$, let $\langle A \rangle$ denote the set of all finite linear combinations of elements of $A$ over the non-negative integers. Then it is well known that only finitely many positive integers…

Number Theory · Mathematics 2025-07-02 Ryan Azim Shaikh , Amitabha Tripathi

In this paper, we find all the sums of three Fibonacci numbers which are close to a power of 2. This paper continues and extends the previous work of Hasanalizade \cite{Hasanalizade}.

Number Theory · Mathematics 2022-07-27 Bibhu Prasad Tripathy , Bijan Kumar Patel

In this paper, we define Tribonacci-Lucas polynomials and present Tribonacci-Lucas numbers and polynomials as a binomial sum. Then, we introduce incomplete Tribonacci-Lucas numbers and polynomials. In addition we derive recurrence…

Number Theory · Mathematics 2016-01-01 N. Yilmaz , N. Taskara

In this work, we made a generalization that includes all bicomplex Fibonacci-like numbers such as; Fibonacci, Lucas, Pell, etc.. We named this generalization as bicomplex Horadam numbers. For bicomplex Fibonacci and Lucas numbers we gave…

Rings and Algebras · Mathematics 2018-12-27 Serpil Halici , Adnan Karataş

In this paper we study the sum $$\sum_{j_1+j_2+...+j_d=n}\prod_{i=1}^d F_{k\cdot j_i},$$ where $d\geq2$ and $k\geq1$.

Combinatorics · Mathematics 2007-05-23 Toufik Mansour

We present numerous interesting, mostly new, results involving the $n$-step Fibonacci numbers and $n$-step Lucas numbers and a generalization. Properties considered include recurrence relations, summation identities, including binomial and…

Number Theory · Mathematics 2018-08-09 Kunle Adegoke

We study the concatenated Fibonacci constant $\mathcal{F} := 0.F_{1}F_{2}F_{3}\cdots = 0.11235813\cdots$, obtained by concatenating the Fibonacci numbers in the fractional part, and ask whether it is normal. We show that several classical…

Number Theory · Mathematics 2026-04-21 José Ricardo G. Mendonça

In this paper, we study the diophantine equation ${{\sigma }_{2}}(n)-{{n}^{2}}=An+B$. We prove that except for finitely many computable solutions, all the solutions to this equation with $(A,B)=({{L}_{2m}},F_{2m}^{2}-1)$ are…

Number Theory · Mathematics 2014-06-24 Tianxin Cai , Liuquan Wang , Yong Zhang

This paper sets the groundwork for the consideration of families of recursively defined polynomials and rational functions capable of describing the Bernoulli numbers. These families of functions arise from various recursive definitions of…

Number Theory · Mathematics 2018-12-31 Christina Taylor

In this paper, we find all integers c having at least two representations as a difference between a Fibonacci number and a power of 2.

Number Theory · Mathematics 2018-01-25 Mahadi Ddamulira , Florian Luca , Mihaja Rakotomalala

A generalization of the well-known Fibonacci sequence is the $k$-Fibonacci sequence with some fixed integer $k\ge 2$. The first $k$ terms of this sequence are $0,0, \ldots, 1$, and each term afterwards is the sum of the preceding $k$ terms.…

Number Theory · Mathematics 2025-07-21 Jhon J. Bravo , Pranabesh Das , Jose L. Herrera , John C. Saunders

In this paper we study the Fibonacci numbers and derive some interesting properties and recurrence relations. We prove some charecterizations for $F_p$, where $p$ is a prime of a certain type. We also define period of a Fibonacci sequence…

Number Theory · Mathematics 2015-06-11 Alexandre Laugier , Manjil P. Saikia

In this paper, bicomplex k-Fibonacci quaternions are defined. Also, some algebraic properties of bicomplex k-Fibonacci quaternions which are connected with bicomplex numbers and k-Fibonacci numbers are investigated. Furthermore, the…

Number Theory · Mathematics 2018-10-12 Fügen Torunbalcı Aydın