Results 11 to 20 of about 20,503 (203)
Pell-Lucas polynomials for numerical treatment of the nonlinear fractional-order Duffing equation
The nonlinear fractional-order cubic-quintic-heptic Duffing problem will be solved through a new numerical approximation technique. The suggested method is based on the Pell-Lucas polynomials’ operational matrix in the fractional and integer orders.
El-Sayed Adel Abd Elaziz
doaj +2 more sources
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Webb, W.A., Yokota, H.
openaire +4 more sources
Fermat and Mersenne numbers in $k$-Pell sequence
For an integer $k\geq 2$, let $(P_n^{(k)})_{n\geq 2-k}$ be the $k$-generalized Pell sequence, which starts with $0,\ldots,0,1$ ($k$ terms) and each term afterwards is defined by the recurrence $ P_n^{(k)}=2P_{n-1}^{(k)}+P_{n-2}^{(k)}+\cdots +P_{n-k}^{(k)}
B. Normenyo, S. Rihane, A. Togbe
doaj +1 more source
Lucas sequences and repdigits [PDF]
Let $(G_n)_{n \geq1}$ be a binary linear recurrence sequence that is represented by the Lucas sequences of the first and second kind, which are $\{U_n\}$ and $\{V_n\}$, respectively.
Hayder Raheem Hashim, Szabolcs Tengely
doaj +1 more source
On some new results for the generalised Lucas sequences
In this paper we introduce the functions which count the number of generalized Lucas and Pell-Lucas sequence terms not exceeding a given value x and, under certain conditions, we derive exact formulae (Theorems 3 and 4) and establish asymptotic limits ...
Andrica Dorin +2 more
doaj +1 more source
It is known that for each pair of non-zero integers, the number \(N(a,b)\) of triples of positive integers \(x,y,z\) satisfying the two Pell equations \[ x^2-az^2=1,\qquad y^2-bz^2=1\tag{1} \] is finite. In fact, this follows from Siegel's theorem that there are only finitely many integral points on a curve of genus 1.
Rickert, John, Masser, D.W.
openaire +4 more sources
Algebraic Coding Theory Using Pell Equation x2 − 8y2 = 1
An interdisciplinary field with significant practical use is cryptography. The difficulty of specific mathematical computing tasks affects a public key cryptosystem’s security. The technique for coding and decoding the messages was described in this work,
Janaki G, Gowri Shankari A
doaj +1 more source
Some Criteria for Class Numbers to Be Non-One
Let d be a positive integer which is not a perfect square and n be any nonzero fixed integer. Then, the equation x2−dy2=n is known as the general Pell equation. In this paper, we give some criteria for class numbers of certain real quadratic fields to be
Ahmad Issa, Hasan Sankari
doaj +1 more source
Polynomial Pell's Equations [PDF]
The polynomial Pell’s equation is P 2 − ( x 2 + d ) Q 2 = 1 {P^2} - ({x^2} + d){Q^2} = 1 , where d d is an integer ...
openaire +2 more sources
Our aim in this article is to present a collocation method to solve two population models for single and interacting species. For this, logistic growth model and prey–predator model are examined.
Şuayip Yüzbaşı, Gamze Yıldırım
doaj +1 more source

