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

Diego Marques

Displaying similar documents to “On the intersection of two distinct $k$ -generalized Fibonacci sequences”

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.

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...

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 square classes in generalized Fibonacci sequences

Zafer Şiar, Refik Keskin (2016)

Acta Arithmetica

Similarity:

Let P and Q be nonzero integers. The generalized Fibonacci and Lucas sequences are defined respectively as follows: U₀ = 0, U₁ = 1, V₀ = 2, V₁ = P and $U_{n + 1} = P U ₙ + Q U_{n - 1}$ , $V_{n + 1} = P V ₙ + Q V_{n - 1}$ for n ≥ 1. In this paper, when w ∈ 1,2,3,6, for all odd relatively prime values of P and Q such that P ≥ 1 and P² + 4Q > 0, we determine all n and m satisfying the equation Uₙ = wUₘx². In particular, when k|P and k > 1, we solve the equations Uₙ = kx² and Uₙ = 2kx². As a result, we determine all n such that Uₙ = 6x². ...

On the spacing between terms of generalized Fibonacci sequences

Diego Marques (2014)

Colloquium Mathematicae

Similarity:

For k ≥ 2, the k-generalized Fibonacci sequence $(F ₙ^{(k)}) ₙ$ is defined to have the initial k terms 0,0,...,0,1 and be such that each term afterwards is the sum of the k preceding terms. We will prove that the number of solutions of the Diophantine equation $F ₘ^{(k)} - F ₙ^{(ℓ)} = c > 0$ (under some weak assumptions) is bounded by an effectively computable constant depending only on c.

On the distance between generalized Fibonacci numbers

Jhon J. Bravo, Carlos A. Gómez, Florian Luca (2015)

Colloquium Mathematicae

Similarity:

For an integer k ≥ 2, let $(F ₙ^{(k)}) ₙ$ be the k-Fibonacci sequence which starts with 0,..., 0,1 (k terms) and each term afterwards is the sum of the k preceding terms. This paper completes a previous work of Marques (2014) which investigated the spacing between terms of distinct k-Fibonacci sequences.

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...

Some identities involving differences of products of generalized Fibonacci numbers

Curtis Cooper (2015)

Colloquium Mathematicae

Similarity:

Melham discovered the Fibonacci identity $F_{n + 1} F_{n + 2} F_{n + 6} - F ³_{n + 3} = (- 1) ⁿ F ₙ$ . He then considered the generalized sequence Wₙ where W₀ = a, W₁ = b, and $W ₙ = p W_{n - 1} + q W_{n - 2}$ and a, b, p and q are integers and q ≠ 0. Letting e = pab - qa² - b², he proved the following identity: $W_{n + 1} W_{n + 2} W_{n + 6} - W ³_{n + 3} = e q^{n + 1} (p ³ W_{n + 2} - q ² W_{n + 1})$ . There are similar differences of products of Fibonacci numbers, like this one discovered by Fairgrieve and Gould: $F ₙ F_{n + 4} F_{n + 5} - F ³_{n + 3} = {(- 1)}^{n + 1} F_{n + 6}$ . We prove similar identities. For example, a generalization of Fairgrieve and Gould’s identity is $W ₙ W_{n + 4} W_{n + 5} - W ³_{n + 3} = e q ⁿ (p ³ W_{n + 4} - q W_{n + 5})$ .

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.

Primefree shifted Lucas sequences

Lenny Jones (2015)

Acta Arithmetica

Similarity:

We say a sequence $= {(s ₙ)}_{n \geq 0}$ is primefree if |sₙ| is not prime for all n ≥ 0, and to rule out trivial situations, we require that no single prime divides all terms of . In this article, we focus on the particular Lucas sequences of the first kind, $_{a} = {(u ₙ)}_{n \geq 0}$ , defined by u₀ = 0, u₁ = 1, and uₙ = aun-1 + un-2 for n≥2, where a is a fixed integer. More precisely, we show that for any integer a, there exist infinitely many integers k such that both of the shifted sequences $_{a} \pm k$ are simultaneously primefree. This...

On the Lucas sequence equations Vₙ = kVₘ and Uₙ = kUₘ

Refik Keskin, Zafer Şiar (2013)

Colloquium Mathematicae

Similarity:

Let P and Q be nonzero integers. The sequences of generalized Fibonacci and Lucas numbers are defined by U₀ = 0, U₁ = 1 and $U_{n + 1} = P U ₙ - Q U_{n - 1}$ for n ≥ 1, and V₀ = 2, V₁ = P and $V_{n + 1} = P V ₙ - Q V_{n - 1}$ for n ≥ 1, respectively. In this paper, we assume that P ≥ 1, Q is odd, (P,Q) = 1, Vₘ ≠ 1, and $V_{r} \neq 1$ . We show that there is no integer x such that $V ₙ = V_{r} V ₘ x ²$ when m ≥ 1 and r is an even integer. Also we completely solve the equation $V ₙ = V ₘ V_{r} x ²$ for m ≥ 1 and r ≥ 1 when Q ≡ 7 (mod 8) and x is an even integer. Then we show that when P ≡ 3 (mod 4) and...

Lucas factoriangular numbers

Bir Kafle, Florian Luca, Alain Togbé (2020)

Mathematica Bohemica

Similarity:

We show that the only Lucas numbers which are factoriangular are $1$ and $2$ .

Explicit algebraic dependence formulae for infinite products related with Fibonacci and Lucas numbers

Hajime Kaneko, Takeshi Kurosawa, Yohei Tachiya, Taka-aki Tanaka (2015)

Acta Arithmetica

Similarity:

Let d ≥ 2 be an integer. In 2010, the second, third, and fourth authors gave necessary and sufficient conditions for the infinite products $\prod_{\binom{k = 1}{U_{d^{k}} \neq - a_{i}}}^{\infty} (1 + (a_{i}) / (U_{d^{k}}))$ (i=1,...,m) or $\prod_{\binom{k = 1}{V_{d^{k}} \neq - a_{i}}}^{\infty} (1 + (a_{i}) (V_{d^{k}})$ (i=1,...,m) to be algebraically dependent, where $a_{i}$ are non-zero integers and $U_{n}$ and $V_{n}$ are generalized Fibonacci numbers and Lucas numbers, respectively. The purpose of this paper is to relax the condition on the non-zero integers $a_{1}, . . ., a_{m}$ to non-zero real algebraic numbers, which gives new cases where the infinite products above are algebraically...

Piatetski-Shapiro sequences via Beatty sequences

Lukas Spiegelhofer (2014)

Acta Arithmetica

Similarity:

Integer sequences of the form $⌊ n^{c} ⌋$ , where 1 < c < 2, can be locally approximated by sequences of the form ⌊nα+β⌋ in a very good way. Following this approach, we are led to an estimate of the difference $\sum_{n \leq x} φ (⌊ n^{c} ⌋) - 1 / c \sum_{n \leq x^{c}} φ (n) n^{1 / c - 1}$ , which measures the deviation of the mean value of φ on the subsequence $⌊ n^{c} ⌋$ from the expected value, by an expression involving exponential sums. As an application we prove that for 1 < c ≤ 1.42 the subsequence of the Thue-Morse sequence indexed by $⌊ n^{c} ⌋$ attains both of its values with...

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...

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.

Pell and Pell-Lucas numbers of the form $- 2^{a} - 3^{b} + 5^{c}$

Yunyun Qu, Jiwen Zeng (2020)

Czechoslovak Mathematical Journal

Similarity:

In this paper, we find all Pell and Pell-Lucas numbers written in the form $- 2^{a} - 3^{b} + 5^{c}$ , in nonnegative integers $a$ , $b$ , $c$ , with $0 \leq max {a, b} \leq c$ .

Displaying similar documents to “On the intersection of two distinct k -generalized Fibonacci sequences”

Displaying similar documents to “On the intersection of two distinct $k$ -generalized Fibonacci sequences”