Results 31 to 40 of about 53,723 (156)
On some links between the generalised Lucas pseudoprimes of level k
Pseudoprimes are composite integers sharing behaviours of the prime numbers, often used in practical applications like public-key cryptography. Many pseudoprimality notions known in the literature are defined by recurrent sequences.
Andrica Dorin +2 more
doaj +1 more source
The complex-type Pell p-numbers [PDF]
In this paper, we define the complex-type Pell p-numbers and give the generating matrix of these defined numbers. Then, we produce the combinatorial representation, the generating function, the exponential representation and the sums of the complex-type ...
Yeşim Aküzüm +2 more
doaj +1 more source
The Solution of a System of Higher-Order Difference Equations in Terms of Balancing Numbers
In this paper, we are interested in the closed-form solution of the following system of nonlinear difference equations of higher order, un+1 = 1/34-vn-m , vn+1 = 1/34-un-m, n, m ∈ N0, and the initial values u-j and v-j , j∈{0, 1, ..., m} are real numbers
Ahmed Ghezal, Imane Zemmouri
doaj +1 more source
Markov Triples with Generalized Pell Numbers
For an integer k≥2, let (Pn(k))n be the k-generalized Pell sequence which starts with 0,…,0,1 (k terms), and each term afterwards is given by Pn(k)=2Pn−1(k)+Pn−2(k)+⋯+Pn−k(k). In this paper, we determine all solutions of the Markov equation x2+y2+z2=3xyz,
Julieth F. Ruiz +2 more
doaj +1 more source
Pell Leonardo numbers and their matrix representations
In this study, we investigate Pell numbers and Leonardo numbers and describe a new third-order number sequence entitled Pell Leonardo numbers. We then construct some identities, including the Binet formula, generating function, exponential generating ...
Çağla Çelemoğlu
doaj +1 more source
Pell Even Sum Cordial Labeling of Graphs
LetG=(V,E) be a simple graph and let P_i be Pell numbers. For a bijectionf:V\left(G\right)\rightarrow{P_0,\ P_1,\ldots,P_{\left|V\right|-1}}, assign the label 1 for the edge e=uv if f\left(u\right)+f(v) is even and label 0 otherwise. Then f is said to be
Christina Mercy, T Tamizh Chelvam
doaj +1 more source
On a New One Parameter Generalization of Pell Numbers
In this paper we present a new one parameter generalization of the classical Pell numbers. We investigate the generalized Binet’s formula, the generating function and some identities for r-Pell numbers.
Bród Dorota
doaj +1 more source
Applications of some special numbers obtained from a difference equation of degree three
In this paper we present applications of some special numbers obtained from a difference equation of degree three, especially in the Coding Theory. As a particular case, we obtain the generalized Pell-Fibonacci-Lucas numbers, which were extended to the ...
Flaut, Cristina, Savin, Diana
core +1 more source
Almost neo cobalancing numbers [PDF]
In this work, we determined the general terms of almost neo cobalancing numbers, almost Lucas-neo cobalancing numbers and almost neo cobalancers in terms of cobalancing and Lucas-cobalancing numbers. We also deduced some results on relationship with Pell,
Ahmet Tekcan, Ecem Akgüç
doaj +1 more source
On Mixed 𝐵-Concatenations of Pell and Pell–Lucas Numbers which are Pell Numbers
Let (𝑃𝑛)𝑛≥0 and (𝑄𝑛)𝑛≥0 be the Pell and Pell–Lucas sequences. Let 𝑏 be a positive integer such that 𝑏 ≥ 2. In this paper, we prove that the following two Diophantine equations 𝑃𝑛 = 𝑏𝑑𝑃𝑚 + 𝑄𝑘 and 𝑃𝑛 = 𝑏𝑑𝑄𝑚 + 𝑃𝑘 with 𝑑, the number of digits of 𝑃𝑘 or 𝑄𝑘 in base 𝑏, have only finitely many solutions in nonnegative integers (𝑚, 𝑛, 𝑘, 𝑏, 𝑑).
Adédji, Kouéssi Norbert +1 more
openaire +2 more sources

