On the spacing between terms of generalized Fibonacci sequences

Diego Marques

Displaying similar documents to “On the spacing between terms of generalized Fibonacci sequences”

An exponential Diophantine equation related to the sum of powers of two consecutive k-generalized Fibonacci numbers

Carlos Alexis Gómez Ruiz, Florian Luca (2014)

Colloquium Mathematicae

Similarity:

A generalization of the well-known Fibonacci sequence ${F ₙ}_{n \geq 0}$ given by F₀ = 0, F₁ = 1 and $F_{n + 2} = F_{n + 1} + F ₙ$ for all n ≥ 0 is the k-generalized Fibonacci sequence ${F ₙ^{(k)}}_{n \geq - (k - 2)}$ whose first k terms are 0,..., 0, 1 and each term afterwards is the sum of the preceding k terms. For the Fibonacci sequence the formula $F ₙ ² + F ²_{n + 1} ² = F_{2 n + 1}$ holds for all n ≥ 0. In this paper, we show that there is no integer x ≥ 2 such that the sum of the xth powers of two consecutive k-generalized Fibonacci numbers is again a k-generalized Fibonacci number. This...

Diophantine triples with values in binary recurrences

Clemens Fuchs, Florian Luca, Laszlo Szalay (2008)

Annali della Scuola Normale Superiore di Pisa - Classe di Scienze

Similarity:

In this paper, we study triples $a, b$ and $c$ of distinct positive integers such that $a b + 1, a c + 1$ and $b c + 1$ are all three members of the same binary recurrence sequence.

On the intersection of two distinct $k$ -generalized Fibonacci sequences

Diego Marques (2012)

Mathematica Bohemica

Similarity:

Let $k \geq 2$ and define $F^{(k)} : = {(F_{n}^{(k)})}_{n \geq 0}$ , the $k$ -generalized Fibonacci sequence whose terms satisfy the recurrence relation $F_{n}^{(k)} = F_{n - 1}^{(k)} + F_{n - 2}^{(k)} + \dots + F_{n - k}^{(k)}$ , with initial conditions $0, 0, \dots, 0, 1$ ( $k$ terms) and such that the first nonzero term is $F_{1}^{(k)} = 1$ . The sequences $F : = F^{(2)}$ and $T : = F^{(3)}$ are the known Fibonacci and Tribonacci sequences, respectively. In 2005, Noe and Post made a conjecture related to the possible solutions of the Diophantine equation $F_{n}^{(k)} = F_{m}^{(ℓ)}$ . In this note, we use transcendental tools to provide a general method for finding the intersections $F^{(k)} \cap F^{(m)}$ which gives...

Solutions of the Diophantine Equation $7 X^{2} + Y^{7} = Z^{2}$ from Recurrence Sequences

Hayder R. Hashim (2020)

Communications in Mathematics

Similarity:

Consider the system $x^{2} - a y^{2} = b$ , $P (x, y) = z^{2}$ , where $P$ is a given integer polynomial. Historically, the integer solutions of such systems have been investigated by many authors using the congruence arguments and the quadratic reciprocity. In this paper, we use Kedlaya’s procedure and the techniques of using congruence arguments with the quadratic reciprocity to investigate the solutions of the Diophantine equation $7 X^{2} + Y^{7} = Z^{2}$ if $(X, Y) = (L_{n}, F_{n})$ (or $(X, Y) = (F_{n}, L_{n})$ ) where ${F_{n}}$ and ${L_{n}}$ represent the sequences of Fibonacci numbers and Lucas numbers...

On the golden number and Fibonacci type sequences

Eugeniusz Barcz (2019)

Annales Universitatis Paedagogicae Cracoviensis | Studia ad Didacticam Mathematicae Pertinentia

Similarity:

The paper presents, among others, the golden number $ϕ$ as the limit of the quotient of neighboring terms of the Fibonacci and Fibonacci type sequence by means of a fixed point of a mapping of a certain interval with the help of Edelstein’s theorem. To demonstrate the equality , where $f_{n}$ is $n$ -th Fibonacci number also the formula from Corollary has been applied. It was obtained using some relationships between Fibonacci and Lucas numbers, which were previously justified.

Some interpretations of the $(k, p)$ -Fibonacci numbers

Natalia Paja, Iwona Włoch (2021)

Commentationes Mathematicae Universitatis Carolinae

Similarity:

In this paper we consider two parameters generalization of the Fibonacci numbers and Pell numbers, named as the $(k, p)$ -Fibonacci numbers. We give some new interpretations of these numbers. Moreover using these interpretations we prove some identities for the $(k, p)$ -Fibonacci numbers.

On a generalization of the Pell sequence

Jhon J. Bravo, Jose L. Herrera, Florian Luca (2021)

Mathematica Bohemica

Similarity:

The Pell sequence ${(P_{n})}_{n = 0}^{\infty}$ is the second order linear recurrence defined by $P_{n} = 2 P_{n - 1} + P_{n - 2}$ with initial conditions $P_{0} = 0$ and $P_{1} = 1$ . In this paper, we investigate a generalization of the Pell sequence called the $k$ -generalized Pell sequence which is generated by a recurrence relation of a higher order. We present recurrence relations, the generalized Binet formula and different arithmetic properties for the above family of sequences. Some interesting identities involving the Fibonacci and generalized Pell numbers...

Diophantine approximations with Fibonacci numbers

Victoria Zhuravleva (2013)

Journal de Théorie des Nombres de Bordeaux

Similarity:

Let $F_{n}$ be the $n$ -th Fibonacci number. Put $ϕ = \frac{1 + \sqrt{5}}{2}$ . We prove that the following inequalities hold for any real $α$ : 1) ${inf}_{n \in ℕ} | | F_{n} α | | \leq \frac{ϕ - 1}{ϕ + 2}$ , 2) ${lim inf}_{n \to \infty} | | F_{n} α | | \leq \frac{1}{5}$ , 3) ${lim inf}_{n \to \infty} | | ϕ^{n} α | | \leq \frac{1}{5}$ . These results are the best possible.

A note on the article by F. Luca “On the system of Diophantine equations $a ² + b ² = {(m ² + 1)}^{r}$ and $a^{x} + b^{y} = {(m ² + 1)}^{z}$ ” (Acta Arith. 153 (2012), 373-392)

Takafumi Miyazaki (2014)

Acta Arithmetica

Similarity:

Let r,m be positive integers with r > 1, m even, and A,B be integers satisfying $A + B \sqrt (- 1) = {(m + \sqrt (- 1))}^{r}$ . We prove that the Diophantine equation ${| A |}^{x} + {| B |}^{y} = {(m ² + 1)}^{z}$ has no positive integer solutions in (x,y,z) other than (x,y,z) = (2,2,r), whenever $r > 10^{74}$ or $m > 10^{34}$ . Our result is an explicit refinement of a theorem due to F. Luca.

Diophantine equations involving factorials

Horst Alzer, Florian Luca (2017)

Mathematica Bohemica

Similarity:

We study the Diophantine equations ${(k!)}^{n} - k^{n} = {(n!)}^{k} - n^{k}$ and ${(k!)}^{n} + k^{n} = {(n!)}^{k} + n^{k},$ where $k$ and $n$ are positive integers. We show that the first one holds if and only if $k = n$ or $(k, n) = (1, 2), (2, 1)$ and that the second one holds if and only if $k = n$ .

On the diophantine equation $x^{y} - y^{x} = c^{z}$

Zhongfeng Zhang, Jiagui Luo, Pingzhi Yuan (2012)

Colloquium Mathematicae

Similarity:

Applying results on linear forms in p-adic logarithms, we prove that if (x,y,z) is a positive integer solution to the equation $x^{y} - y^{x} = c^{z}$ with gcd(x,y) = 1 then (x,y,z) = (2,1,k), (3,2,k), k ≥ 1 if c = 1, and either $(x, y, z) = (c^{k} + 1, 1, k)$ , k ≥ 1 or $2 \leq x < y \leq m a x 1.5 \times 10^{10}, c$ if c ≥ 2.

Finiteness results for Diophantine triples with repdigit values

Attila Bérczes, Florian Luca, István Pink, Volker Ziegler (2016)

Acta Arithmetica

Similarity:

Let g ≥ 2 be an integer and $_{g} \subset ℕ$ be the set of repdigits in base g. Let $_{g}$ be the set of Diophantine triples with values in $_{g}$ ; that is, $_{g}$ is the set of all triples (a,b,c) ∈ ℕ³ with c < b < a such that ab + 1, ac + 1 and bc + 1 lie in the set $_{g}$ . We prove effective finiteness results for the set $_{g}$ .

On some Diophantine equations involving balancing numbers

Euloge Tchammou, Alain Togbé (2021)

Archivum Mathematicum

Similarity:

In this paper, we find all the solutions of the Diophantine equation $B_{1}^{p} + 2 B_{2}^{p} + \dots + k B_{k}^{p} = B_{n}^{q}$ in positive integer variables $(k, n)$ , where $B_{i}$ is the $i^{t h}$ balancing number if the exponents $p$ , $q$ are included in the set ${1, 2}$ .

Fermat $k$ -Fibonacci and $k$ -Lucas numbers

Jhon J. Bravo, Jose L. Herrera (2020)

Mathematica Bohemica

Similarity:

Using the lower bound of linear forms in logarithms of Matveev and the theory of continued fractions by means of a variation of a result of Dujella and Pethő, we find all $k$ -Fibonacci and $k$ -Lucas numbers which are Fermat numbers. Some more general results are given.

On systems of diophantine equations with a large number of solutions

Jerzy Browkin (2010)

Colloquium Mathematicae

Similarity:

We consider systems of equations of the form $x_{i} + x_{j} = x_{k}$ and $x_{i} \cdot x_{j} = x_{k}$ , which have finitely many integer solutions, proposed by A. Tyszka. For such a system we construct a slightly larger one with much more solutions than the given one.