相关论文: Yet another $S$-unit variant of Diophantine tuples
A rational Diophantine m-tuple is a set of m nonzero rationals such that the product of any two of them increased by 1 is a perfect square. The first rational Diophantine quadruple was found by Diophantus, while Euler proved that there are…
The $abc$ conjecture states that there are only finitely many triples of coprime positive integers $(a,b,c)$ such that $a+b=c$ and $\operatorname{rad}(abc) < c^{1-\epsilon}$ for any $\epsilon > 0$. Using the optimized methods in a recent…
We consider a system of integer polynomials of the same degree with non-singular local zeros and in many variables. Generalising the work of Birch (1962) we find quantitative asymptotics (in terms of the maximum of the absolute value of the…
Given a negative $D>-(\log X)^{\log 2-\delta}$, we give a new upper bound on the number of square free integers $<X$ which are represented by some but not all forms of the genus of a primitive positive definite binary quadratic form $f$ of…
This paper contributes to the conjecture of R. Scott and R. Styer which asserts that for any fixed relatively prime positive integers $a,b$ and $c$ all greater than 1 there is at most one solution to the equation $a^x+b^y=c^z$ in positive…
We study some divisibility properties of multiperfect numbers. Our main result is: if $N=p_1^{\alpha_1}... p_s^{\alpha_s} q_1^{2\beta_1}... q_t^{2\beta_t}$ with $\beta_1, ..., \beta_t$ in some finite set S satisfies…
We refine a recent result of Parsell on the values of the form $\lambda_1p_1 + \lambda_2p_2 + \mu_1 2^{m_1} + ...m + \mu_s 2^{m_s}, $ where $p_1,p_2$ are prime numbers, $m_1,...c, m_s$ are positive integers, $\lambda_1 / \lambda_2$ is…
Assuming the well-known conjecture that [x,x+x^t] contains a prime for t > 0 and x sufficiently large, we prove: For 0 < r < 1, there exists 0 < s < r < 1, 0 < d < 1, and infinitely many primes q such that if S is a subset of Z/qZ having…
Let $a,b,c,d,e$ and $f$ be integers with $a\ge c\ge e>0$, $b>-a$ and $b\equiv a\pmod2$, $d>-c$ and $d\equiv c\pmod 2$, $f>-e$ and $f\equiv e\pmod2$. Suppose that $b\ge d$ if $a=c$, and $d\ge f$ if $c=e$. When $b(a-b)$, $d(c-d)$ and $f(e-f)$…
We show that there exists a connection between two types of objects: some kind of resultantal varieties over C, from one side, and varieties of twists of the tensor powers of the Carlitz module such that the order of 0 of its L-functions at…
A $\textit{square-full}$ number is a positive integer for which all its prime divisors divide itself at least twice. The counting function of square-full integers of the form $f(n)$ for $n\leqslant N$ is denoted by…
The Subspace Theorem is a powerful tool in number theory. It has appeared in various forms and been adapted and improved over time. It's applications include diophantine approximation, results about integral points on algebraic curves and…
Given a smooth quasi-projective complex algebraic variety $\mathcal{S}$, we prove that there are only finitely many Hodge-generic non-isotrivial families of smooth projective hypersurfaces over $\mathcal{S}$ of degree $d$ in…
In this paper we show that a polynomial equation admits infinitely many prime-tuple solutions assuming only that the equation satisfies suitable local conditions and the polynomial is sufficiently non-degenerate algebraically. Our notion of…
For a nonzero integer $n$, a set of distinct nonzero integers $\{a_1,a_2,\ldots,a_m\}$ such that $a_ia_j+n$ is a perfect square for all $1\leq i<j\leq m$, is called a Diophantine $m$-tuple with the property $D(n)$ or simply $D(n)$-set.…
The following result, a consequence of Dumas criterion for irreducibility of polynomials over integers, is generally proved using the notion of Newton diagram: Let $f(x)$ be a polynomial with integer coefficients and $k$ be a positive…
Let $ \{T_n\}_{n\geq 0} $ be the sequence of Tribonacci numbers. In this paper, we study the exponential Diophantine equation $T_n-2^x3^y=c$, for $n,x,y\in \mathbb{Z}_{\ge0}$. In particular, we show that there is no integer $c$ with at…
The multi-variable Schmidt polynomials are defined by $$ S_n^{(r)}(x_0,\ldots,x_n):=\sum_{k=0}^n {n+k \choose 2k}^{r}{2k\choose k} x_k. $$ We prove that, for any positive integers $m$, $n$, $r$, and $\varepsilon=\pm 1$, all the coefficients…
We study the solutions of a Diophantine equation of the form $a^x+b^y=c^z$, where $a\equiv 2 \pmod 4$, $b\equiv 3 \pmod 4$ and $\gcd (a,b,c)=1$. The main result is that if there exists a solution $(x,y,z)=(2,2,r)$ with $r>1$ odd then this…
We extend results of Denef, Zahidi, Demeyer and the second author to show the following. (1) Rational integers have a single-fold Diophantine definition over the ring of integral functions of any function field of characteristic 0. (2)…