recurrence sequence
Recently Published Documents


TOTAL DOCUMENTS

37
(FIVE YEARS 13)

H-INDEX

7
(FIVE YEARS 1)

2021 ◽  
Vol 2021 ◽  
pp. 1-8
Author(s):  
Guoai Xu ◽  
Jiangtao Yuan ◽  
Guosheng Xu ◽  
Zhongkai Dang

Multipartite secret sharing schemes are those that have multipartite access structures. The set of the participants in those schemes is divided into several parts, and all the participants in the same part play the equivalent role. One type of such access structure is the compartmented access structure, and the other is the hierarchical access structure. We propose an efficient compartmented multisecret sharing scheme based on the linear homogeneous recurrence (LHR) relations. In the construction phase, the shared secrets are hidden in some terms of the linear homogeneous recurrence sequence. In the recovery phase, the shared secrets are obtained by solving those terms in which the shared secrets are hidden. When the global threshold is t , our scheme can reduce the computational complexity of the compartmented secret sharing schemes from the exponential time to polynomial time. The security of the proposed scheme is based on Shamir’s threshold scheme, i.e., our scheme is perfect and ideal. Moreover, it is efficient to share the multisecret and to change the shared secrets in the proposed scheme.


Author(s):  
Japhet Odjoumani ◽  
Volker Ziegler

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.


2021 ◽  
Vol 5 (1) ◽  
pp. 65-72
Author(s):  
Albert Adu-Sackey ◽  
◽  
Francis T. Oduro ◽  
Gabriel Obed Fosu ◽  
◽  
...  

The paper proves convergence for three uniquely defined recursive sequences, namely, arithmetico-geometric sequence, the Newton-Raphson recursive sequence, and the nested/composite recursive sequence. The three main hurdles for this prove processes are boundedness, monotonicity, and convergence. Oftentimes, these processes lie in the predominant use of prove by mathematical induction and also require some bit of creativity and inspiration drawn from the convergence monotone theorem. However, these techniques are not adopted here, rather, as a novelty, extensive use of basic manipulation of inequalities and useful equations are applied in illustrating convergence for these sequences. Moreover, we established a mathematical expression for the limit of the nested recurrence sequence in terms of its leading term which yields favorable results.


Mathematics ◽  
2020 ◽  
Vol 8 (12) ◽  
pp. 2152
Author(s):  
Marie Hubálovská ◽  
Štěpán Hubálovský ◽  
Eva Trojovská

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.


Author(s):  
CLEMENS FUCHS ◽  
SEBASTIAN HEINTZE

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.


2020 ◽  
pp. 27-33
Author(s):  
P. Kosobutskyy

In this work shows that the classical oscillations of the ratio of neighboring members of the Fibonacci sequences are valid for arbitrary directions on the plane of the phase coordinates, approaching, to a maximum, the solutions to the characteristic quadratic equation at a given point. The values of the solutions to the characteristic equation along the satellites are asymptotically close to their integer values of the corresponding root lines.


Symmetry ◽  
2019 ◽  
Vol 11 (12) ◽  
pp. 1476 ◽  
Author(s):  
Lan Qi ◽  
Zhuoyu Chen

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