Related papers: Cubic Thue Equations

In 1976, Dekking showed that there exists an infinite binary word that contains neither squares yy with y >= 4 nor cubes xxx. We show that `cube' can be replaced by any fractional power > 5/2. We also consider the analogous problem where…

In this paper we generalize the result of Fouvry and Iwaniec dealing with prime values of the quadratic form $x^2 + y^2$ with one input restricted to a thin subset of the integers. We prove the same result with an arbitrary primitive…

Let $\mu_1, \ldots, \mu_s$ be real numbers, with $\mu_1$ irrational. We investigate sums of shifted cubes $F(x_1,\ldots,x_s) = (x_1 - \mu_1)^3 + \ldots + (x_s - \mu_s)^3$. We show that if $\eta$ is real, $\tau >0$ is sufficiently large, and…

A conjecture of N. Terai states that for any integer $k>1$, the equation $x^2+(2k-1)^y =k^z$ has only one solution, namely, $(x, y, z) = (k-1, 1, 2).$ Using the structure of class groups of binary quadratic forms, we prove the conjecture…

In this paper, we use the method of Thue and Siegel, based on explicit Pade approximations to algebraic functions, to completely solve a family of quartic Thue equations. From this result, we can also solve the diophantine equation in the…

Let $\alpha$ be an algebraic number of degree $d\ge 3$ and let $K$ be the algebraic number field $\Q(\alpha)$. When $\varepsilon$ is a unit of $K$ such that $\Q(\alpha\varepsilon)=K$, we consider the irreducible polynomial $f_\varepsilon(X)…

For numbers $x$ coprime to $10$ there exist infinitely many binary numbers $b$ such that the greatest common divisor of $b$ and rev($b$) = $x$ and the sum of digits of $b = x$ (rev($b$) is the digit reversal of $b$). In most cases, the…

Let f in Z[x,y] be a reducible homoegeneous polynomial of degree 3. We show that f(x,y) has an even number of prime factors as often as an odd number of prime factors.

We give a light-hearted look at the topic in the title. Most solutions are in semi-boring parametric families, but some are sporadic and come from Thue equations. One amusing example is m = 2, x = (4/5)^128, y = (4/5)^125.

We consider Thue equations of the form $ax^k+by^k = 1$, and assuming the truth of the $abc$-conjecture, we show that almost all locally soluble Thue equations of degree at least three violate the Hasse principle. A similar conclusion holds…

As an application of the method of Thue-Siegel, we will resolve a conjecture of Walsh to the effect that the Diophantine equation $aX^{4} - bY^2=1$, for fixed positive integers $a$ and $b$, possesses at most two solutions in positive…

In this paper, we find a bound for the number of the positive solutions to the titled equation, improving a result of Togb\'e. As a consequence, we prove a conjecture of Togb\'e in a few cases.

We study the problem of whether a given finite algebra with finitely many basic operations contains a cube term; we give both structural and algorithmic results. We show that if such an algebra has a cube term then it has a cube term of…

For $F \in \mathbb{Z}[s,t]$ a binary quadratic form which is irreducible over $\mathbb{Q}$, and $L$ an abelian number field with class number $1$, we obtain the order of magnitude for the number of values $F(s,t)$ which are a norm from $L$.…

We prove that for any sequence of binary alphabets $\mathcal{A}_1,\mathcal{A}_2,\dots$, there exists a cube-free word $c_1c_2\dots$ so that $c_1\in\mathcal{A}_1,c_2\in\mathcal{A}_2,\dots$. In particular, for every $n$, there are at least…

Let f\in \mathbb{Z}[x,y] be an irreducible homogeneous polynomial of degree 3. We show that f(x,y) has an even number of prime factors as often as an odd number of prime factors.

In this paper, we introduce a new and direct approach to study the solvability of systems of equations generated by bilinear forms. More precisely, let $B (\cdot, \cdot)$ be a non-degenerate bilinear form and $E$ be a set in…

Let $a,b,c$ be fixed coprime positive integers with $\min\{a,b,c\}>1$. In this paper, combining the Gel'fond-Baker method with an elementary approach, we prove that if $\max\{a,b,c\}>5\times 10^{27}$, then the equation $a^x+b^y=c^z$ has at…

Building on the works of Mordell (1952) and Schinzel (2015), we prove that cubic diophantine equations $xyz=G(x,y)$ have infinitely many solutions.

A pair of symmetric bilinear forms A and B determine a binary form $f(x,y) = disc(Ax-By)$. We prove that the question of whether a given binary form can be written in this way as a discriminant form generically satisfies a local-global…