ID: math/0604453

Two $S$-unit equations with many solutions

April 20, 2006

View on ArXiv

Similar papers 3

On Two Diophantine Inequalities Over Primes

April 29, 2016

81% Match
Min Zhang, Jinjiang Li
Number Theory

Let $1<c<37/18,\,c\neq2$ and $N$ be a sufficiently large real number. In this paper, we prove that, for almost all $R\in(N,2N],$ the Diophantine inequality $|p_1^c+p_2^c+p_3^c-R|<\log^{-1}N$ is solvable in primes $p_1,\,p_2,\,p_3.$ Moreover, we also investigate the problem of six primes and prove that the Diophantine inequality $|p_1^c+p_2^c+p_3^c+p_4^c+p_5^c+p_6^c-N|<\log^{-1}N$ is solvable in primes $p_1,\,p_2,\,p_3,\,p_4,\,p_5,\,p_6$ for sufficiently large real number $N$.

Find SimilarView on arXiv

On a conjecture concerning the number of solutions to $a^x+b^y=c^z$, II

November 24, 2022

81% Match
Maohua Le, Reese Scott, Robert Styer
Number Theory

Let $a$, $b$, $c$ be distinct primes with $a<b$. Let $S(a,b,c)$ denote the number of positive integer solutions $(x,y,z)$ of the equation $a^x + b^y = c^z$. In a previous paper \cite{LeSt} it was shown that if $(a,b,c)$ is a triple of distinct primes for which $S(a,b,c)>1$ and $(a,b,c)$ is not one of the six known such triples then $(a,b,c)$ must be one of three cases. In the present paper, we eliminate two of these cases (using the special properties of certain continued fra...

Find SimilarView on arXiv

A binary additive equation with prime and square-free number

January 11, 2024

81% Match
S. I. Dimitrov
Number Theory

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$ is a prime and $m$ is a square-free.

Find SimilarView on arXiv

$S$-Unit Equations and the Asymptotic Fermat Conjecture over Number Fields

March 25, 2020

81% Match
Ekin Ozman, Samir Siksek
Number Theory

Recent attempts at studying the Fermat equation over number fields have uncovered an unexpected and powerful connection with $S$-unit equations. In this expository paper we explain this connection and its implications for the asymptotic Fermat conjecture.

Find SimilarView on arXiv

On additive representation functions

November 1, 2017

81% Match
Yong-Gao Chen, Hui Lv
Number Theory
Combinatorics

Let $A$ be an infinite set of natural numbers. For $n\in \mathbb{N}$, let $r(A, n)$ denote the number of solutions of the equation $n=a+b$ with $a, b\in A, a\le b$. Let $|A(x)|$ be the number of integers in $A$ which are less than or equal to $x$. In this paper, we prove that, if $r(A, n)\not= 1$ for all sufficiently large integers $n$, then $|A(x)|> \frac 12 (\log x/\log\log x)^2$ for all sufficiently large $x$.

Find SimilarView on arXiv

Effective results for unit equations over finitely generated domains

July 28, 2011

81% Match
Jan-Hendrik Evertse, Kálmán Győry
Number Theory

Let A be a commutative domain containing Z which is finitely generated as a Z-algebra, and let a,b,c be non-zero elements of A. It follows from work of Siegel, Mahler, Parry and Lang that the equation (*) ax+by=c has only finitely many solutions in elements x,y of the unit group A* of A, but the proof following from their arguments is ineffective. Using linear forms in logarithms estimates of Baker and Coates, in 1979 Gy\H{o}ry gave an effective proof of this finiteness resul...

Find SimilarView on arXiv

Number of solutions to a special type of unit equations in two unknowns, III

March 29, 2024

81% Match
Takafumi Miyazaki, István Pink
Number Theory

It is conjectured 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 integers $x,y$ and $z$, except for specific cases. We develop the methods in our previous work which rely on a variety from Baker's theory and thoroughly study the conjecture for cases where $c$ is small relative to $a$ or $b$. Using restrictions derived under which there is more than one solution to t...

Find SimilarView on arXiv

The number of equations c=a+b satisfying the abc-conjecture

April 13, 2009

81% Match
Constantin M. Petridi
Number Theory

We prove that for a positive integer $c$ and any given $\varepsilon$, $0<\varepsilon<1$, the number $N(c)$ of equations $c=a+b$, $a<b$, with positive coprime integers $a$ and $b$, which satisfy the inequality $$c < R(c)^{\frac{\varepsilon}{1+\varepsilon}}R(a)^{\frac{1}{1+\varepsilon}}R(b)^{\frac{1}{1+\varepsilon}},$$ where R(n) is the radical of $n$, is for $c\to\infty$ $$N(c)=(1-\varepsilon)\frac{\phi(c)}{2}+O\Bigl(\frac{\phi(c)}{2}\Bigr).$$ An analogue for the abc-conjectur...

Find SimilarView on arXiv

On the unit equation over cyclic number fields of prime degree

December 11, 2020

81% Match
Nuno Freitas, Alain Kraus, Samir Siksek
Number Theory

Let $\ell \ne 3$ be a prime. We show that there are only finitely many cyclic number fields $F$ of degree $\ell$ for which the unit equation $$\lambda + \mu = 1, \qquad \lambda,~\mu \in \mathcal{O}_F^\times$$ has solutions. Our result is effective. For example, we deduce that the only cyclic quintic number field for which the unit equation has solutions is $\mathbb{Q}(\zeta_{11})^+$.

Find SimilarView on arXiv

On additive and multiplicative decompositions of sets of integers with restricted prime factors, I. (Smooth numbers.)

June 27, 2020

81% Match
K. Győry, L. Hajdu, A. Sárközy
Number Theory

In [10] the third author of this paper presented two conjectures on the additive decomposability of the sequence of ''smooth'' (or ''friable'') numbers. Elsholtz and Harper [4] proved (by using sieve methods) the second (less demanding) conjecture. The goal of this paper is to extend and sharpen their result in three directions by using a different approach (based on the theory of $S$-unit equations).

Find SimilarView on arXiv