Divisor Sums of Generalised Exponential Polynomials

1996 ◽  
Vol 39 (1) ◽  
pp. 35-46 ◽  
Author(s):  
G. R. Everest ◽  
I. E. Shparlinski
Keyword(s):  
Prime Ideal ◽  
Algebraic Integer ◽  
Linear Recurrence ◽  
Exponential Polynomial ◽  
Exponential Polynomials ◽  
Recurrence Sequence ◽  
Special Cases ◽  
Divisor Sums ◽  
Recurrence Sequences

AbstractA study is made of sums of reciprocal norms of integral and prime ideal divisors of algebraic integer values of a generalised exponential polynomial. This includes the important special cases of linear recurrence sequences and general sums of S-units. In the case of an integral binary recurrence sequence, similar (but stronger) results were obtained by P. Erdős, P. Kiss and C. Pomerance.

scholarly journals A Study On Sum Formulas of Generalized Sixth-Order Linear Recurrence Sequences

2020 ◽  
pp. 36-48
Author(s):  
Yüksel Soykan
Keyword(s):  
Sixth Order ◽  
Linear Recurrence ◽  
Lucas Numbers ◽  
Order Linear ◽  
Summation Formulas ◽  
Special Cases ◽  
Recurrence Sequences

In this paper, closed forms of the summation formulas for generalized Hexanacci numbers are presented. As special cases, we give summation formulas of Hexanacci, Hexanacci-Lucas, sixth order Pell, sixth order Pell-Lucas, sixth order Jacobsthal, sixth order Jacobsthal-Lucas numbers.

scholarly journals On Homogeneous Combinations of Linear Recurrence Sequences

Mathematics ◽  
2020 ◽  
Vol 8 (12) ◽  
pp. 2152
Author(s):  
Marie Hubálovská ◽  
Štěpán Hubálovský ◽  
Eva Trojovská
Keyword(s):  
Fibonacci Sequence ◽  
Linear Recurrence ◽  
Degree Polynomial ◽  
Recurrence Sequence ◽  
Linear Recurrence Sequence ◽  
Recurrence Sequences ◽  
Positive Integers

Let (Fn)n≥0 be the Fibonacci sequence given by Fn+2=Fn+1+Fn, for n≥0, where F0=0 and F1=1. There are several interesting identities involving this sequence such as Fn2+Fn+12=F2n+1, for all n≥0. In 2012, Chaves, Marques and Togbé proved that if (Gm)m is a linear recurrence sequence (under weak assumptions) and Gn+1s+⋯+Gn+ℓs∈(Gm)m, for infinitely many positive integers n, then s is bounded by an effectively computable constant depending only on ł and the parameters of (Gm)m. In this paper, we shall prove that if P(x1,…,xℓ) is an integer homogeneous s-degree polynomial (under weak hypotheses) and if P(Gn+1,…,Gn+ℓ)∈(Gm)m for infinitely many positive integers n, then s is bounded by an effectively computable constant depending only on ℓ, the parameters of (Gm)m and the coefficients of P.

scholarly journals On prime powers in linear recurrence sequences

2021 ◽  
Author(s):  
Japhet Odjoumani ◽  
Volker Ziegler
Keyword(s):  
Positive Integer ◽  
Diophantine Equation ◽  
Prime Numbers ◽  
Linear Recurrence ◽  
Exceptional Set ◽  
Recurrence Sequence ◽  
Lucas Sequence ◽  
Finite Set ◽  
Linear Recurrence Sequence ◽  
Recurrence Sequences

AbstractIn this paper we consider the Diophantine equation $$U_n=p^x$$ U n = p x where $$U_n$$ U n is a linear recurrence sequence, p is a prime number, and x is a positive integer. Under some technical hypotheses on $$U_n$$ U n , we show that, for any p outside of an effectively computable finite set of prime numbers, there exists at most one solution (n, x) to that Diophantine equation. We compute this exceptional set for the Tribonacci sequence and for the Lucas sequence plus one.

scholarly journals Sum Formulas for Generalized Fifth-Order Linear Recurrence Sequences

2019 ◽  
pp. 1-14
Author(s):  
Yüksel Soykan
Keyword(s):  
Linear Recurrence ◽  
Order Linear ◽  
Lucas Sequences ◽  
Summation Formulas ◽  
Special Cases ◽  
Recurrence Sequences ◽  
Fifth Order

In this paper, closed forms of the summation formulas for generalized Pentanacci numbers are presented. Then, some previous results are recovered as particular cases of the present results. As special cases, we give summation formulas of Pentanacci, Pentanacci-Lucas, fifth order Pell, fifth order Pell-Lucas, fifth order Jacobsthal and fifth order Jacobsthal-Lucas sequences. We present the proofs to indicate how these formulas, in general, were discovered. In fact, all the listed formulas of the special cases of of the main theorems may be proved by induction, but that method of proof gives no clue about their discovery.

scholarly journals ON THE GROWTH OF LINEAR RECURRENCES IN FUNCTION FIELDS

2020 ◽  
pp. 1-10
Author(s):  
CLEMENS FUCHS ◽  
SEBASTIAN HEINTZE
Keyword(s):  
Number Field ◽  
Function Field ◽  
Function Fields ◽  
Linear Recurrence ◽  
Recurrence Sequence ◽  
Linear Recurrences ◽  
Field Case ◽  
Power Sum ◽  
Linear Recurrence Sequence

Abstract Let $ (G_n)_{n=0}^{\infty } $ be a nondegenerate linear recurrence sequence whose power sum representation is given by $ G_n = a_1(n) \alpha _1^n + \cdots + a_t(n) \alpha _t^n $ . We prove a function field analogue of the well-known result in the number field case that, under some nonrestrictive conditions, $ |{G_n}| \geq ( \max _{j=1,\ldots ,t} |{\alpha _j}| )^{n(1-\varepsilon )} $ for $ n $ large enough.

On ℤ-Modules of Algebraic Integers

2009 ◽  
Vol 61 (2) ◽  
pp. 264-281 ◽  
Author(s):  
J. P. Bell ◽  
K. G. Hare
Keyword(s):  
Algebraic Integer ◽  
Full Rank ◽  
Pisot Number ◽  
List Type ◽  
Algebraic Integers ◽  
Pisot Numbers ◽  
Cyclotomic Numbers ◽  
Special Cases ◽  
Fixed Order ◽  
Fixed Positive Integer

Abstract. Let q be an algebraic integer of degree d ≥ 2. Consider the rank of the multiplicative subgroup of ℂ* generated by the conjugates of q. We say q is of full rank if either the rank is d − 1 and q has norm ±1, or the rank is d. In this paper we study some properties of ℤ[q] where q is an algebraic integer of full rank. The special cases of when q is a Pisot number and when q is a Pisot-cyclotomic number are also studied. There are four main results.(1)If q is an algebraic integer of full rank and n is a fixed positive integer, then there are only finitely many m such that disc `ℤ[qm]´ = disc `ℤ[qn]´.(2)If q and r are algebraic integers of degree d of full rank and ℤ[qn] = ℤ[rn] for infinitely many n, then either q = ωr′ or q = Norm(r)2/dω/r′ , where r ′ is some conjugate of r and ω is some root of unity.(3)Let r be an algebraic integer of degree at most 3. Then there are at most 40 Pisot numbers q such that ℤ[q] = ℤ[r].(4)There are only finitely many Pisot-cyclotomic numbers of any fixed order.

scholarly journals Decomposable polynomials in second order linear recurrence sequences

2018 ◽  
Vol 159 (3-4) ◽  
pp. 321-346 ◽  
Author(s):  
Clemens Fuchs ◽  
Christina Karolus ◽  
Dijana Kreso
Keyword(s):  
Second Order ◽  
Linear Recurrence ◽  
Order Linear ◽  
Recurrence Sequences

scholarly journals Identities Involving the Fourth-Order Linear Recurrence Sequence

Symmetry ◽  
2019 ◽  
Vol 11 (12) ◽  
pp. 1476 ◽  
Author(s):  
Lan Qi ◽  
Zhuoyu Chen
Keyword(s):  
Power Series ◽  
Series Expansion ◽  
Generating Function ◽  
Fourth Order ◽  
Power Series Expansion ◽  
Linear Recurrence ◽  
Recurrence Sequence ◽  
Order Linear ◽  
Elementary Methods ◽  
Linear Recurrence Sequence

In this paper, we introduce the fourth-order linear recurrence sequence and its generating function and obtain the exact coefficient expression of the power series expansion using elementary methods and symmetric properties of the summation processes. At the same time, we establish some relations involving Tetranacci numbers and give some interesting identities.

Sign in / Sign up

Export Citation Format

Share Document