Related papers: Two $S$-unit equations with many solutions

In this paper we introduce a new diophantine equation with prime numbers. Let $[\, \cdot\,]$ be the floor function. We prove that when $1<c<\frac{23}{21}$ and $\theta>1$ is a fixed, then every sufficiently large positive integer $N$ can be…

For $n \geq 3,$ let $ p_n $ denote the $n^{\rm th}$ prime number. Let $[ \; ]$ denote the floor or greatest integer function. For a positive integer $m,$ let $\pi_2(m)$ denote the number of twin primes not exceeding $m.$ The twin prime…

The following system of equations {x_1 \cdot x_1=x_2, x_2 \cdot x_2=x_3, 2^{2^{x_1}}=x_3, x_4 \cdot x_5=x_2, x_6 \cdot x_7=x_2} has exactly one solution in ({\mathbb N}\{0,1})^7, namely (2,4,16,2,2,2,2). Hypothesis 1 states that if a system…

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…

From known effective bounds on the prime counting function of the form \[ |\pi(x)-\mathrm{Li}(x)| < a \;x \;(\ln x)^{b} \; \exp\left(-{c}\; \sqrt{\ln x}\right); \qquad (x \geq x_0); \] it is possible to establish exponentially tight…

Answering affirmatively a 2007 problem of Chen, the first author proved that there is a unique representation basis $A$ of $\mathbb{Z}$ and a constant $c>0$ such that $$ A(-x,x)\ge c\sqrt{x} $$ for infinitely many positive integers $x$,…

Let $\beta,\epsilon \in (0,1]$, and $k \geq \exp(122 \max\{1/\beta,1/\epsilon\})$. We prove that if $A,B$ are subsets of a prime field $\mathbb{Z}_{p}$, and $|B| \geq p^{\beta}$, then there exists a sum of the form $$S = a_{1}B \pm \ldots…

In this paper, we use a variety of classical and new research methods for ternary exponential Diophantine equations and extensive use of computer calculations to study the conjecture of R. Scott and R. Styer which asserts that for any fixed…

Denote by $\text{PS}(\alpha)$ the image of the Piatetski-Shapiro sequence $n \mapsto \lfloor n^{\alpha} \rfloor$ where $\alpha > 1$ is non-integral and $\lfloor x \rfloor$ is the integer part of $x \in \mathbb{R}$. We partially answer the…

Let $T$ be a positive integer, and $\mathcal{M}$ be a finitely presented module over the Laurent polynomial ring $\mathbb{Z}_{/T}[X_1^{\pm}, \ldots, X_N^{\pm}]$. We consider S-unit equations over $\mathcal{M}$: these are equations of the…

Let $k\geq2$ and $s$ be positive integers. Let $\theta\in(0,1)$ be a real number. In this paper, we establish that if $s>k(k+1)$ and $\theta>0.55$, then every sufficiently large natural number $n$, subjects to certain congruence conditions,…

Let $[\, \cdot\,]$ be the floor function. In this paper, we show that when $1<c<\frac{82}{79}$, then every sufficiently large positive integer $N$ can be represented in the form \begin{equation*} N=[p^c]+[m^c]\,, \end{equation*} where $p$…

Let $S$ be a finite set of primes. The $S$-part $[m]_S$ of a non-zero integer $m$ is the largest positive divisor of $m$ that is composed of primes from $S$. In 2013, Gross and Vincent proved that if $f(X)$ is a polynomial with integer…

Recent results of Bourgain and Shparlinski imply that for almost all primes $p$ there is a multiple $mp$ that can be written in binary as $mp= 1+2^{m_1}+ \cdots +2^{m_k}, \quad 1\leq m_1 < \cdots < m_k,$ with $k=66$ or $k=16$, respectively.…

In this paper we study the problem of detecting prime numbers between all consecutive cubes. Firstly, we use a large computation to show that there is always a prime between $n^3$ and $(n+1)^3$ for $n^3\leq 1.649\cdot 10^{40}$. In addition,…

We show that if $A\subset \mathbb{Z}$ is a finite set of integers in which every integer is divisible by $O(1)$ many primes then \[\max(\lvert A+A\rvert,\lvert AA\rvert) \geq \lvert A\rvert^{12/7-o(1)}\] and, for any $m\geq 2$,…

This paper studies integer solutions to the ABC equation A+B+C=0 in which none of A, B, C has a large prime factor. Set H(A,B, C)= max(|A|,|B|,|C|) and set the smoothness S(A, B, C) to be the largest prime factor of ABC. We consider…

We prove that there exist infinitely many rationals a, b and c with the property that a^2-1, b^2-1, c^2-1, ab-1, ac-1 and bc-1 are all perfect squares. This provides a solution to a variant of the problem studied by Diophantus and Euler.

Let $a, b\in \mathbb{N}$ be relatively prime. Previous work showed that exactly one of the two equations $ax + by = (a-1)(b-1)/2$ and $ax + by + 1 = (a-1)(b-1)/2$ has a nonnegative, integral solution; furthermore, the solution is unique.…

We estimate the number of integer solutions to decomposable form inequalities (both asymptotic estimates and upper bounds are provided) when the degree of the form and the number of variables are relatively prime. These estimates display…