相关论文: On Diophantine quintuple Conjecture

Using the theory of Diophantine m-tuples, i.e. sets with the property that the product of its any two distinct elements increased by 1 is a perfect square, we construct an elliptic curve over Q(t) of rank at least 4 with three non-trivial…

Let $ \{L_n\}_{n\geq 0} $ be the sequence of Lucas numbers. In this paper, we look at the exponential Diophantine equation $L_n-2^x3^y=c$, for $n,x,y\in \mathbb{Z}_{\ge0}$. We treat the cases $c\in -\mathbb{N}$, $c=0$ and $c\in \mathbb{N}$…

In this work, we accomplish three goals. First, we determine the entire family of positive integer solutions to the three- variable Diophantine equation, xy=z^2; for n=2,3,4,5,6. For n=2, we obtain a 3-parameter family of solutions; for…

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

In this paper we consider the Diophantine equation $ V_n - b^m = c $ for given integers $ b,c $ with $ b \geq 2 $, whereas $ V_n $ varies among Lucas-Lehmer sequences of the second kind. We prove under some technical conditions that if the…

We give examples of birational selfmaps of $\mathbb{P}^d, d \geq 3$, whose dynamical degree is a transcendental number. This contradicts a conjecture by Bellon and Viallet. The proof uses a combination of techniques from algebraic dynamics…

In this paper we prove an inequality for individual and uniform Diophantine exponents in the case of simultaneous approximation. This inequality is better than Jarnik's for small values of the uniform exponent.

For all $k\geq 2$, we provide almost-sharp quantitative results for the $k$-dimensional Duffin-Schaeffer conjecture, analogous to recent developments in the 1-D case of Koukoulopoulos-Maynard-Yang. In particular, for…

We prove a strong analogue of Liouville's Theorem in Diophantine approximation for points on arbitrary algebraic varieties. We use this theorem to prove a conjecture of the first author for cubic surfaces in $\P^3$.

Integer solutions of the diophantine equation $A^4+hB^4=C^4+hD^4$ are known for all positive integer values of $h < 1000$. While a solution of the aforementioned diophantine equation for any arbitrary positive integer value of $h$ is not…

Let $X/C$ be a general product of elliptic curves. Our goal is to establish the Hodge-D-conjecture for $X$. We accomplish this when $\dim X \leq 5$. For $\dim X \geq 6$, we reduce the conjecture to a matrix rank condition that is amenable…

We study the problem of Diophantine approximation on lines in $\mathbb{R}^d$ under certain primality restrictions.

For a nonzero rational number $q$, a rational $D(q)$-$n$-tuple is a set of $n$ distinct nonzero rationals $\{a_1, a_2, \dots, a_n\}$ such that $a_ia_j+q$ is a square for all $1 \leqslant i < j \leqslant n$. We investigate for which $q$…

In this paper we consider the Diophantine equation $x^2+q^{2m}=2y^p$ where $m,p,q,x,y$ are integer unknowns with $m>0,$ $p$ and $q$ are odd primes and $\gcd(x,y)=1.$ We prove that there are only finitely many solutions $(m,p,q,x,y)$ for…

In this paper we study the Diophantine equation $x^{4}-q^{4}=py^{5},$ with the following conditions: $p$ and $q$ are different prime natural numbers, $y$ is not divisible with $p$, $p\equiv3$ (mod20), $q\equiv4$ (mod5), $\overline{p}$ is a…

We prove that for given integers b and c, the diophantine equation x^2+bx+c=y^2, has finitely many integer solutions(i.e. pairs in ZxZ),in fact an even number of such solutions(including the zero or no solutions case).We also offer an…

In this paper, we find all solutions of the exponential Diophantine equation $B_{n+1}^x-B_n^x=B_m$ in positive integer variables $(m, n, x)$, where $B_k$ is the $k$-th term of the Balancing sequence.

We show that for infinitely many square-free integers q there exist infinitely many triples of rational numbers {a, b, c} such that a^2 + q, b^2 + q, c^2 + q, ab + q, ac + q and bc + q are squares of rational numbers.

A famous problem posed by Diophantus was to find sets of distinct positive rational numbers such that the product of any two is one less than a rational square. Some sets of six such numbers are presented and the computational algorithm…

We study diophantine equations of the form ${a_1 + \ldots + a_n = 0}$ where the $a_i$'s are assumed to be coprime and to satisfy certain subsum conditions. We are interested in the limit superior of the qualities of the admissible solutions…