Related papers: Diophantine triples in linear recurrence sequences…
Diophantine triples taking values in recurrence sequences have recently been studied quite a lot. In particular the question was raised whether or not there are finitely many Diophantine triples in the Tribonacci sequence. We answer this…
We show that essentially the Fibonacci sequence is the unique binary recurrence which contains infinitely many three-term arithmetic progressions. A criterion for general linear recurrences having infinitely many three-term arithmetic…
In a recent paper, Bilu et al. studied a conjecture of Marques and Lengyel on the $p$-adic valuation of the Tribonacci sequence. In this article, we study the $p$-adic valuation of third order linear recurrence sequences by considering a…
We discuss a problem initially thought for the Mathematical Olympiad but which has several interpretations. The recurrence sequences involved in this problem may be generalized to recurrence sequences related to a much larger set of…
These notes represent an extended version of a talk I gave for the participants of the IMO 2009 and other interested people. We introduce diophantine equations and show evidence that it can be hard to solve them. Then we demonstrate how one…
Let $ (G_n)_{n=0}^{\infty} $ be a polynomial power sum, i.e. a simple linear recurrence sequence of complex polynomials with power sum representation $ G_n = f_1\alpha_1^n + \cdots + f_k\alpha_k^n $ and polynomial characteristic roots $…
Let $\{u_{n}\}_{n \geq 0}$ be a non-degenerate binary recurrence sequence with positive, square-free discriminant and $p$ be a fixed prime number. In this paper, we have shown the finiteness result for the solutions of the Diophantine…
We study the Diophantine equation of type $U_n(x)=V_m(y)$, where $(U_n)_{n\geq 0}$ and $(V_m)_{m\geq 0}$ are polynomial power sums defined over a number field $K$. By applying the finiteness criterion of Bilu and Tichy, we show under…
Recursive formulas are derived for the number of solutions of linear and quadratic Diophantine equations with positive coefficients. This result is further extended to general non-linear additive Diophantine equations. It is shown that all…
A general construction yielding infinitely many families of $D(m^2)$-triples of triangular numbers is presented. Moreover, each triple obtained from this construction contains the same triangular number $T_n$.
One of the most interesting results of the last century was the proof completed by Matijasevich that computably enumerable sets are precisely the diophantine sets [MRDP Theorem, 9], thus settling, based on previously developed machinery,…
The classical Fibonacci sequence is known to exhibit many fascinating properties. In this paper, we explore the Fibonacci sequence and integer sequences generated by second order linear recurrence relations with positive integer…
Finding integer solutions to norm form equations is a classical Diophantine problem. Using the units of the associated coefficient ring, we can produce sequences of solutions to these equations. It is known that these solutions can be…
In this paper we give a description of all Pythagorean triples in the ring ${{\mathbb Z}}[\tau]$. We also consider triples in the Fibonacci model set which satisfy the Diophantine equations arising from Fermat's Last Theorem. Examples are…
Let ${\cal P}$ be the set of palindromes occurring in the Fibonacci sequence. In this note, we establish three structures of $\mathcal{P}$ and and discuss their properties: cylinder structure, chain structure and recursive structure. Using…
In this paper, we find all integers $c$ having at least two representations as a difference between linear recurrent sequences. This problem is a pillai problem involving Padovan and Fibonacci sequence. The proof of our main theorem uses…
This thesis is about the study of Diophantine equations involving binary recurrent sequences with arithmetic functions. Various Diophantine problems are investigated and new results are found out of this study. Firstly, we study several…
Motivated by a recent work of Tr\"umper we consider the general Collatz word (up-down pattern) and the sequences following this pattern. The recurrences for the first and last sequence entries are given, obtained from repeated application…
Diophantine quadruples are sets of four distinct positive integers such that the product of any two is one less than a square. All known examples belong to an infinite set which can be constructed recursively. Some observations on these…
This paper initiates a novel research direction in the theory of Diophantine equations: define an appropriate version of the equation's size, order all polynomial Diophantine equations starting from the smallest ones, and then solve the…