Javascript must be enabled to continue!
Solutions of Two Diophantine Equations
View through CrossRef
Suppose that the sequences {Pi}i≥0, {Ri}i≥0, and {Ji}i≥0 correspond to the Padovan numbers, Perrin numbers, and Jacobsthal num bers, respectively. In this paper, we determine all Padovan and Perrin numbers that can be written as the sum of two Jacobsthal numbers by ap plying Baker’s method for linear forms in logarithms, combined with the reduction technique of Dujella and Peth˝o.
Department of Mathematics, University of the Punjab
Title: Solutions of Two Diophantine Equations
Description:
Suppose that the sequences {Pi}i≥0, {Ri}i≥0, and {Ji}i≥0 correspond to the Padovan numbers, Perrin numbers, and Jacobsthal num bers, respectively.
In this paper, we determine all Padovan and Perrin numbers that can be written as the sum of two Jacobsthal numbers by ap plying Baker’s method for linear forms in logarithms, combined with the reduction technique of Dujella and Peth˝o.
Related Results
Solving ????-unit, Mordell, Thue, Thue–Mahler and Generalized Ramanujan–Nagell Equations via the Shimura–Taniyama Conjecture
Solving ????-unit, Mordell, Thue, Thue–Mahler and Generalized Ramanujan–Nagell Equations via the Shimura–Taniyama Conjecture
In the first part we construct algorithms (over
Q
...
A New Proof of Smoryński’s Theorem
A New Proof of Smoryński’s Theorem
We prove: (1) the set of all Diophantine equations which have at most finitely many solutions in non-negative integers is not recursively enumerable, (2) the set of all Diophantine...
EQUAÇÕES DIOFANTINAS: UM PROJETO PARA A SALA DE AULA E O USO DO GEOGEBRA
EQUAÇÕES DIOFANTINAS: UM PROJETO PARA A SALA DE AULA E O USO DO GEOGEBRA
http://dx.doi.org/10.5902/2179460X14629The study of Number Theory here in this article aims to study some properties of integer multiples or divisors, emphasizing issues related to...
Teaching Congruences in Connection with Diophantine Equations
Teaching Congruences in Connection with Diophantine Equations
The presented paper is devoted to the new teaching model of congruences of computer science students within the subject of discrete mathematics at universities. The main goal was t...
A note on some polynomial-factorial Diophantine equations
A note on some polynomial-factorial Diophantine equations
In 1876 Brocard, and independently in 1913 Ramanujan, asked to find all integer solutions for the equation
\(n!=x^2-1\). It is conjectured that this equation has only three solut...
Secure Watermarking using Diophantine Equations for Authentication and Recovery
Secure Watermarking using Diophantine Equations for Authentication and Recovery
This paper describes an authentication scheme that uses Diophantine equations based generation of the secret locations to embed the authentication and recovery watermark in the DWT...
An Analysis of the Density and Patterns of the Solutions of Diophantine Equations of the Third Power
An Analysis of the Density and Patterns of the Solutions of Diophantine Equations of the Third Power
According to Fermat’s last theorem, xn + yn = zn has no solutions if n > 2. We modified Fermat’s equation into the Diophantine equations a3 + b3 + c3 = d3, a3 + b3 + c3 = d...

