Related papers: Only finitely many Tribonacci Diophantine triples …

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…

In this article, we are interested in whether a product of three consecutive integers $a (a+1) (a+2)$ divides another such product $b (b+1) (b+2)$. If this happens, we prove that there is some gaps between them, namely $b \gg \frac{a \log…

The following article summarizes research where theorems and their respective demonstrations are postulated based on quadratic equations with special properties given by the Pythagorean triplets and the Fibonacci sequence given the second…

Let Q be an infinite set of positive integers. Denote by W(Q) the set of n-tuples of real numbers simultaneously tau-well approximable by infinitely many rationals with denominators in Q but only by finitely many rationals with denominators…

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,…

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…

The Tribonacci sequence $\mathbb{T}$ is the fixed point of the substitution $\sigma(a,b,c)=(ab,ac,a)$. In this note, we get the explicit expressions of all squares, and then establish the tree structure of the positions of repeated squares…

In the present paper we show that there exist infinitely many consecutive square-free numbers of the form $[\alpha n]$, $[\alpha n]+1$, where $\alpha>1$ is irrational number with bounded partial quotient or irrational algebraic number.

We investigate approximation to a given real number by algebraic numbers and algebraic integers of prescribed degree. We deal with both best and uniform approximation, and highlight the similarities and differences compared with the…

We show that if {1, b, c, d} is a D(-1) diophantine quadruple with b<c<d and c=1+s^2, then the cases s=p^k, s=2p^k, c=p and c=2p^k do not occur, where p is an odd prime and k is a positive integer. For the integer d=1+x^2, we show that it…

We prove that for each fixed $m \ge 2$, there are only finitely many disjoint covering systems with minimum modulus at least $3$ in which precisely one modulus is repeated, namely the largest modulus, and it occurs exactly $m$ times.

We give bounds on the number of solutions to the Diophantine equation (X+1/x)(Y+1/y) = n as n tends to infinity. These bounds are related to the number of solutions to congruences of the form ax+by = 1 modulo xy.

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…

Let $[\,\cdot\,]$ be the floor function. In this paper we show that whenever $\eta$ is real, the constants $\lambda_i$ satisfy some necessary conditions, then for any fixed $1<c<38/37$ there exist infinitely many prime triples $p_1,\,…

Let $\Gamma\subset \bar{\Q}^{\times}$ be a finitely generated multiplicative group of algebraic numbers, let $\alpha_1,\ldots,\alpha_m$ be non-zero algebraic numbers, and let $\varepsilon >0$ be fixed. In this paper, we prove that there…

In this paper we state some conjectures about q-Fibonacci polynomials which for q=1 reduce to well-known results about Fibonacci numbers and Fibonacci polynomials.

We prove that the uniform recurrence of morphic sequences is decidable. For this we show that the number of derived sequences of uniformly recurrent morphic sequences is bounded. As a corollary we obtain that uniformly recurrent morphic…

Let $a,b,c$ be relatively prime positive integers such that $a^{2}+b^{2}=c^{2}.$ In 1956, Je\'{s}manowicz conjectured that for any positive integer $n$, the only solution of $(an)^{x}+(bn)^{y}=(cn)^{z}$ in positive integers is…

One of the most popular and studied recursive series is the Fibonacci sequence. It is challenging to see how Fibonacci numbers can be used to generate other recursive sequences. In our article, we describe some families of integer…

Let (F_n^{(k)})_{n\geq -(k-2)} be the k-generalized Fibonacci sequence, defined as the linear recurrence sequence whose first k terms are \(0, 0, \ldots, 0, 1\), and whose subsequent terms are determined by the sum of the preceding k terms.…