Lucas sequences with cyclotomic root field

Christian Ballot

The search session has expired. Please query the service again.

Displaying similar documents to “Lucas sequences with cyclotomic root field”

Interpolating sequences in the unit ball of $C^{n}$

N. Pandeski (1985)

Matematički Vesnik

Similarity:

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

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

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

Common terms in binary recurrences

Erzsébet Orosz (2006)

Acta Mathematica Universitatis Ostraviensis

Similarity:

The purpose of this paper is to prove that the common terms of linear recurrences $M (2 a, - 1, 0, b)$ and $N (2 c, - 1, 0, d)$ have at most $2$ common terms if $p = 2$ , and have at most three common terms if $p > 2$ where $D$ and $p$ are fixed positive integers and $p$ is a prime, such that neither $D$ nor $D + p$ is perfect square, further $a, b, c, d$ are nonzero integers satisfying the equations $a^{2} - D b^{2} = 1$ and $c^{2} - (D + p) d^{2} = 1$ .

Discrepancy estimates for some linear generalized monomials

Roswitha Hofer, Olivier Ramaré (2016)

Acta Arithmetica

Similarity:

We consider sequences modulo one that are generated using a generalized polynomial over the real numbers. Such polynomials may also involve the integer part operation [·] additionally to addition and multiplication. A well studied example is the (nα) sequence defined by the monomial αx. Their most basic sister, ${([n α] β)}_{n \geq 0}$ , is less investigated. So far only the uniform distribution modulo one of these sequences is resolved. Completely new, however, are the discrepancy results proved in this paper....

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.

Congruences for certain families of Apéry-like sequences

Zhi-Hong Sun (2022)

Czechoslovak Mathematical Journal

Similarity:

We systematically investigate the expressions and congruences for both a one-parameter family ${G_{n} (x)}$ as well as a two-parameter family ${G_{n} (r, m)}$ of sequences.

Root location for the characteristic polynomial of a Fibonacci type sequence

Zhibin Du, Carlos Martins da Fonseca (2023)

Czechoslovak Mathematical Journal

Similarity:

We analyse the roots of the polynomial $x^{n} - p x^{n - 1} - q x - 1$ for $p ⩾ q ⩾ 1$ . This is the characteristic polynomial of the recurrence relation $F_{k, p, q} (n) = p F_{k, p, q} (n - 1) + q F_{k, p, q} (n - k + 1) + F_{k, p, q} (n - k)$ for $n ⩾ k$ , which includes the relations of several particular sequences recently defined. In the end, a matricial representation for such a recurrence relation is provided.

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.