Related papers: On the shortest open cubic equations

In this article we explicitly describe irreducible trinomials X^3-aX+b which gives all the cyclic cubic extensions of Q. In doing so, we construct all integral points (x,y,z) with GCD(y,z)=1, of the curves X^2+3Y^2 = 4DZ^3 and…

We study triples {a,b,c} of distinct nonzero rational numbers such that a+1,b+1,c+1,ab+1,ac+1,bc+1 and abc+1 are all perfect squares. We prove that there exist infinitely many such triples. In contrast, we show that no triple of positive…

In this paper, we consider the problem about finding out perfect powers in an alternating sum of consecutive cubes. More precisely, we completely solve the Diophantine equation $(x+1)^3 - (x+2)^3 + \cdots - (x + 2d)^3 + (x + 2d + 1)^3 =…

Let $p$ be a prime greater than $3$ and let $a$ be a rational p-adic integer. In this paper we try to determine $\sum_{k=1}^{[p/3]}\binom{3k}ka^k\pmod p$, and real the connection between cubic congruences and the sum…

The first and second most symmetric nonsingular cubic surfaces are x^3+y^3+z^3+t^3=0 and x^2y+y^2z+z^2t+t^2x=0, respectively.

Let $p>3$ be a prime, $a_1,a_2,a_3\in\Bbb Z$ and let $N_p(x^3+a_1x^2+a_2x+a_3)$ denote the number of solutions to the congruence $x^3+a_1x^2+a_2x+a_3\equiv 0\pmod p$. In this paper, we give an explicit criterion for…

Let $q\ge 3$ be a non-exceptional modulus $q\ge3$, and let $a$ be a positive integer coprime with $q$. For any $\epsilon>0$, there exists $\alpha>0$ (computable), such that for all $x\ge \alpha (\log q)^2$, the interval $\left[…

This paper proposes an elementary solution to a special case of finding all perfect squares that can be written as sum of consecutive integer cubes. It is shown that there are no non-trivial solutions if the perfect square is a prime power,…

We prove that the equation $(x-2r)^3 + (x-r)^3 + x^3 + (x+r)^3 + (x+2r)^3= y^p$ only has solutions which satisfy $xy=0$ for $1\leq r\leq 10^6$ and $p\geq 5$ prime.

In this article we further develop methods for representing integers as a sum of three cubes. In particular, a barrier to solving the case $k=3$, which was outlined in a previous paper of the second author, is overcome. A very recent…

We determine the rational integers x,y,z such that x^3+y^9=z^2 and gcd(x,y,z)=1. First we determine a finite set of curves of genus 10 such that any primitive solution to x^3+y^9=z^2 corresponds to a rational point on one of those curves.…

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…

We prove that if $p \equiv 4,7 \pmod{9}$ is prime and $3$ is not a cube modulo $p$, then both of the equations $x^3+y^3=p$ and $x^3+y^3=p^2$ have a solution with $x,y \in \mathbb{Q}$.

We revisit a work by R. Okazaki and prove that for every cubic binary form F(x, y) with large enough discriminant, the Thue equation |F(x, y)| = 1 has at most 7 solutions in integers x and y.

We consider cubic forms $\phi_{a,b}(x,y,z) = ax^3 + by^3 - z^3$ with coefficients $a,b \in \mathbb{Z}$. We give an asymptotic formula for how many of these forms are locally soluble everywhere, i.e. we give an asymptotic formula for the…

Let g be a cubic polynomial with integer coefficients and n>9 variables, and assume that the congruence g=0 modulo p^k is soluble for all prime powers p^k. We show that the equation g=0 has infinitely many integer solutions when the cubic…

This work proposes a proof of the simplest cubic primes counting problem. It shows that the subset of primes {p = n^3 + 2 is prime : n => 1} is an infinite subset of primes. Further, the expected order of magnitude of the cubic primes…

The original version of this paper did not take into account that there may be solutions (x_0, y_o)in Z X Z of f(x,y) = x^3 + p(y)x + q(y) = 0 even though w_0 = (-3D(y_0))^(1/2) is irrational.

For relatively prime integers $a$ and $b$ both greater than one and odd integer $c$, there are at most two solutions in positive integers $(x,y,z)$ to the equation $a^x + b^y = c^z$. There are an infinite number of $(a,b,c)$ giving exactly…

We study the number $\nu(n)$ of representations of a positive integer $n$ by the form $x^3+y^3+z^3-3xyz$ in the conditions $0\leq x\leq y\leq z; z\geq x+1.$ We proved the following results: (i) for every positive $n,$ except for…