The tag has no wiki summary.

learn more… | top users | synonyms

8
votes
0answers
145 views

Algorithmic (un-)solvability of diophantine equations of given degree with given number of variables

Question: For which $d, k \in \mathbb{N}$ is there an algorithm to determine whether a polynomial diophantine equation $$ P(x_1, \dots, x_k) = 0, \ \ \ P \in \mathbb{Z}[x_1, \dots, x_k] $$ ...
3
votes
1answer
148 views

Numbers represented by inhomogeneous forms

I have a family of Diophantine equations that I am trying to solve, and I am trying to figure out what methods could be used to prove existence of solutions. Unfortunately, the equations are ...
2
votes
3answers
543 views

A Diophantine equation with prime powers

Let $p$ and $q$ be prime numbers such that $p^2+p+1=3q^a$: is it true that $a=1$? This specific equation appears when computing order components of finite groups.
5
votes
1answer
202 views

Congruence properties of $x_1^6+x_2^6+x_3^6+x_4^6+x_5^6 = z^6$?

(This was posted previously in MSE without getting any answers.) It is known that given primitive (co-prime) integer solutions to, $$x_1^4+x_2^4+x_3^4+x_4^4 = z^4$$ then there is one $x_i$ such ...
9
votes
1answer
394 views

On a result attributed to W. Ljunggren and T. Nagell

I've read in a number of places that, building on previous work of T. Nagell, W. Ljunggren proved in 1 that the Diophantine equation $$\frac{x^{n}-1}{x-1} = y^{2}$$ doesn't admit solutions in ...
3
votes
0answers
69 views

Low height integer points on a rank variety

Let $M_i$ be fixed rectangular matrices with integer coefficients less than $n$. Consider the variety defined by the condition $$ \mathrm{rank}(\lambda_1M_1 + \lambda_2M_2 + ... + \lambda_kM_k) = 1. ...
13
votes
4answers
734 views

Random Diophantine polynomials: Percent solvable?

Suppose one generates a random polynomial of degree $d$ with integer coefficients uniformly distributed within $[-c_\max,c_\max]$. For example, for $d=8$, $|c_\max|=100$, here is one random ...
10
votes
0answers
407 views

Why are solutions to $\sqrt[k]{x_1^k+x_2^k+x_3^k+x_4^k}$ for $k=2,3$ curiously smooth?

Given an integer solution $s_m$ to the system, $$x_1^2+x_2^2+\dots+x_n^2 = y^2$$ $$x_1^3+x_2^3+\dots+x_n^3 = z^3$$ and define the function, $$F(s_m) = x_1+x_2+\dots+x_n$$ For $n\geq3$, using an ...
7
votes
0answers
180 views

Integer solutions of $x^2=4+8y^2+13z^2$

I have been looking for integer solutions of certain Diophantine equations, one of the simplest examples being $x^2=4+8y^2+13z^2$. The ideal answer would be a way to parametrize all the integer ...
8
votes
1answer
203 views

Integers $d$ for which the Negative Pell equation is soluble for both $d$ and $2d$?

Let $\text{NPE}_d$ denote the negative Pell equation: $$ x^2-dy^2=-1$$ Where $d$ is a given positive nonsquare integer and integer solutions are sought for x and y. we know that (in this paper): ...
7
votes
3answers
269 views

Deciding a quadratic diophantine equation

Given $a,b\in\Bbb Q_+$, is there an easy way to decide if $$S_{a,b}=\{(x,y)\in\Bbb Z^2:ax^2 + by^2=1\}=\emptyset?$$ I am more interested in seeing if there is a quick way to test for case when ...
2
votes
0answers
141 views

Diophantine equations and the numbers $4,7,8$

Consider the diophantine equation $$ x^n+y^n+z^n=k\cdot xyz, $$ where $n,x,y,z$ are positive integers. Now consider $k\in\left\{4,7,8\right\}$. It is well-known or easily provable that for $n=1$ and ...
1
vote
3answers
132 views

Decidability of sum of powers exponential diophantine equation

I want to ask about decidability of exponential Diophantine equation: $z_12^{\eta_1} + \ldots + z_n2^{\eta_n} = z$, where $z_i,\eta_i,z \in \mathbb{Z}$, and $\eta_i$ - are variables. Can we find ...
8
votes
2answers
580 views

Sum of consecutive cubes

I'm investigating when the sum of $n$ consecutive cubes equals a cube, i.e., for which $n$ does $$\sum_{i=0}^{n-1} (k+i)^3 = k^3 + (k+1)^3 + \cdots + (k+n-1)^3 = Y^3 $$ have nontrivial solutions ...
24
votes
5answers
1k views

Parametric solutions of Pell's equation

Given a positive integer $n$ which is not a perfect square, it is well-known that Pell's equation $a^2 - nb^2 = 1$ is always solvable in non-zero integers $a$ and $b$. Question: Let $n$ be a ...
-8
votes
1answer
201 views

Proof of a cubic equation problem [closed]

Well I was doing some questions and i found something. This equation $x^3+y^3+z^3=w^3$ has only one solution which is $x=3,y=4,z=5,w=6$. And what I have have proposed is that there is not other ...
7
votes
2answers
252 views

Decidability of diophantine equation in a theory

Given a theory $T \subseteq \operatorname{Th}(\mathbb{N})$, define the decision problem $D_T$ as follows: Given a polynomial $p$ with integer coefficients and variables $\bar{x}$, decide whether ...
1
vote
0answers
442 views

Is $ a^2b^2-ab-ap$ a perfect square for suitable $a,b\in \mathbb{Z}^+$?

Consider the expression $$ a^2b^2-ab-ap\qquad (a,b\in \mathbb{Z}^+), $$ where $p\equiv1\pmod{4}$. Question. For every prime $p\equiv1\pmod{4}$ do there exist $a,b\in\mathbb{Z}^+$ such that ...
5
votes
1answer
530 views

The elliptic curve for $x_1^9+x_2^9+\dots+x_6^9 = y_1^9+y_2^9+\dots+y_6^9$

I. If there are $a,b,c,d,e,f$ such that, $$a+b+c = d+e+f\tag1$$ $$a^2+b^2+c^2 = d^2+e^2+f^2\tag2$$ $$3u^3-3uv+w=-def\tag3$$ where $u=a+b+c,\; v = ab+ac+bc,\;w = abc$, then, $$(a + u)^k + (b + ...
1
vote
1answer
180 views

Diophantine equation with factorials

Find all natural solutions $m!=a^2n!$ . It's clear that $m>=n$. When $m=n$ we have solutions $(1,m,m)$. When $m=n+1$ we have solutions $(a,a^2,a^2-1)$. I think that when $m>n+1$ we have no ...
1
vote
1answer
122 views

basis of the lattice generated by the integer points inside a subspace of R^L

Consider $K$ linearly independent vectors $\mathbf{a}_1, \mathbf{a}_2, ..., \mathbf{a}_K \in \mathbb{Z}^L$, where $1 \leq K<L $. Hence, the span of $\lbrace\mathbf{a}_1, \mathbf{a}_2, ..., ...
5
votes
2answers
227 views

Density of multi-grade solutions to $x_1^k+x_2^k+x_3^k = y_1^k+y_2^k+y_3^k$ for $k = 5$ or $6$?

Given the Diophantine equation, $$x_1^k+x_2^k+x_3^k = y_1^k+y_2^k+y_3^k\tag1$$ there is the rather curious observation that the smallest positive solutions for $k=5$ or $6$ is multi-grade. ...
3
votes
0answers
228 views

On 7th and 8th powers for $x_1^k+x_2^k+x_3^k+x_4^k = y_1^k+y_2^k+y_3^k+y_4^k$

The Diophantine equation, $$x_1^k+x_2^k+x_3^k = y_1^k+y_2^k+y_3^k\tag1$$ for either $k=5$ or $6$ is quite well explored, and it has long been known that it has an infinite number of primitive ...
24
votes
1answer
986 views

$x^4+y^4$ powerful for relatively prime $x,y$

I asked this question on the NMBRTHRY mailing list on 17 February 2014, but it remains unsolved as far as I know. Recall that a "powerful number" is a positive integer whose prime factorizations $m = ...
5
votes
1answer
289 views

On the elliptic curve $x(x+a^2)(x+b^2) = y^2$

Ajai Choudhry showed that special cases of the elliptic curve, $$x(x+a^2)(x+b^2)=y^2\tag1$$ can be used to prove that, $$u_1^7+u_2^7+\dots + u_9^7 = 0\tag2$$ has an infinite number of primitive ...
11
votes
1answer
790 views

More elliptic curves for $a^4+b^4+c^4+d^4 = (a+b+c+d)^4$?

(Note: See also the $a^4+b^4+c^4 = 1$ version in this old MSE post.) The equation discussed in a paper by Jacobi and Madden, $$a^4+b^4+c^4+d^4 = (a+b+c+d)^4 = z^4\tag1$$ or equivalently, $$(p-2q + ...
3
votes
2answers
210 views

Sets of squares representing all squares up to $n^2$

Let $S_n=\{1,2,\ldots,n\}$ be natural numbers up to $n$. Say that a subset $S \subseteq S_n$ square-represents $S_n^2$ if every square $1^2,2^2,\ldots,n^2$ can be represented by adding or subtracting ...
28
votes
3answers
1k views

Why do Pell equations appear in Ramanujan's pi formulas?

While answering this MSE question about the Pell equation $x^2-29y^2=1$, I noticed that certain fundamental solutions appeared in Ramanujan's famous pi formula. I. Given the fundamental unit, ...
7
votes
1answer
367 views

rational points of a hyperelliptic curve

I have the following hyperelliptic curve of genus $2$: $$ y^2 = 561 x^6 - 41904 x^5 + 627264 x^4 + 11860992 x^3 - 197074944 x^2 + 124416^2 $$ I need to find all the rational points on this curve. ...
33
votes
4answers
3k views

Fermat's last theorem over larger fields

Fermat's last theorem implies that the number of solutions of $x^5 + y^5 = 1$ over $\mathbb{Q}$ is finite. Is the number of solutions of $x^5 + y^5 = 1$ over $\mathbb{Q}^{\text{ab}}$ finite? Here ...
0
votes
1answer
210 views

The number of solutions of a Diophantine equation [closed]

Is $\lim_{n \rightarrow \infty} |\{(x,y) \in \mathbb{Q}(\zeta_n)^2 : y^3 = x^3 + x + 1\}| < \infty ?$ where $\zeta_n$ is a primitive $n$-th root of unity. That is, I am asking whether the number ...
2
votes
0answers
195 views

Diophantine equations over cyclotomic fields

Let $\mathbb{Q}^{\text{ab}}$ be the compositum of all finite abelian extensions of $\mathbb{Q}$. Explicitly, $\mathbb{Q}^{\text{ab}}$ is the field obtained from $\mathbb{Q}$ by adjoining all roots of ...
11
votes
2answers
2k views

How many Pythagorean triples are there in which every member is triangular?

How many Pythagorean triples $(a,b,c)$ are there such that $a, b$ and $c$ are triangular? Any two solutions with only $a$ and $b$ interchanged are considered equivalent. The question of existence ...
0
votes
0answers
140 views

The Diophantine equation $x^2 + bxy + cy^2 = p^z_1 \cdots p^{z_k}$

Let $b,c \in \mathbb{Z}$ and let $p_1,\ldots,p_k$ be given primes. Is there an effective algorithm to find all the solutions of the Diophantine equation $$x^2 + bxy + cy^2 = p_1^{z_1} \cdots ...
3
votes
3answers
411 views

Pairs of quadratic polynomials taking values pairs of consecutive squares

Let $f,g \in \mathbb{Z}[x]$ be quadratic and neither square. For $x,y,z \in \mathbb{Z}$ what is the maximal number of solutions to $f(x)=z^2,g(y)=(z+1)^2$? Solutions are integral points on the genus ...
4
votes
0answers
173 views

Monte Carlo variant of Hilbert's Tenth Problem

Let $k \in \mathbb{N}$. Given an algorithm $\mathcal{A}$ which takes as argument a polynomial $P \in \mathbb{Z}[x_1,\dots,x_k]$ and either returns true or false, we say that $\mathcal{A}$ works for ...
10
votes
1answer
219 views

Schoenberg's Rational Polygon Problem

"A polygon is said to be rational if all its sides and diagonals are rational, and I. J. Schoenberg has posed the difficult question, ‘Can any given polygon be approximated as closely as we like by ...
3
votes
4answers
481 views

solutions to special diophantine equations [closed]

Let $0\le x,y,z,u,v,w\le n$ be integer numbers obeying \begin{align*} x^2+y^2+z^2=&u^2+v^2+w^2\\ x+y+v=&u+w+z\\ x\neq& w \end{align*} (Please note that the second equality is ...
4
votes
1answer
214 views

polynomials in many variables and Hasse principle

I was wondering whether there exists any result of the form "if $f \in \mathbb{Z}[x_1, ..., x_k]$ is a polynomial (not form! I don't require homogeneity) of total degree $n$, with $k \geq \delta ...
5
votes
1answer
329 views

A congruence conjecture regarding $(r-s)^4-1 \equiv 0\!\pmod{4r^2s}$

Is the following conjecture true? Conjecture. If $r > s \ge 1$ are relatively prime integers such that \begin{equation} (r-s)^4-1 \equiv 0\!\pmod{4r^2s}, \tag{1} \end{equation} then $r-s = 1$ ...
0
votes
6answers
611 views

Does the Diophantine equation $(x^2+ay^2)(u^2+bv^2) = p^2+cq^2$ admit a complete solution?

In this MSE question/thread, I have been discussing the equation $$ (x^2+ay^2)(u^2+bv^2) = p^2+cq^2, \tag{$\star$} $$ where $x,a,y,u,b,v,p,c,q$ are integers. I posed a conjecture which turned out to ...
12
votes
2answers
618 views

Failing of heuristics from circle method

The heuristic from circle method for integral points on diagonal cubic surfaces $x^3+y^3+z^3=a$ ($a$ is a cubic-free integer) seems to fit well with numerical computations by ANDREAS-STEPHAN ELSENHANS ...
13
votes
3answers
1k views

Finding integer points on elliptic curves via divisibility conditions like $(a+b)^2 \mid (2b^3+6ab^2-1)$

Is the following conjecture correct? Conjecture. The divisibility condition $(\alpha+\beta)^2 \mid (2\beta^3+6\alpha\beta^2-1)$ has no solutions in positive integers $1 \le \beta < \alpha < ...
0
votes
0answers
77 views

Superelliptic Curves [duplicate]

I'm trying to find information on superelliptic curves and how to solve them over the integers. The equation is $$y^k = f(x)$$ where $k=3$ and $f$ has degree $d=3$. Does anyone know any ...
7
votes
1answer
277 views

The Diophantine equation $x^p - 4y^p = z^2$

If $p \geq 5$ is a prime, are there any integers $x, y, z > p$ such that $(x, y) = 1$ and $$x^{p} - 4y^{p} = z^{2}$$
1
vote
0answers
317 views

When is a cubic polynomial a cube? [closed]

I've been researching cubes and I'm trying to solve this Diophantine equation over the integers. $$ax^3 + bx^2 + cx + d = y^3$$where a, b, c, d are parameters for a given $n$. For example, for $n = ...
-4
votes
2answers
199 views

If $~(c - b) ^ 2 + 3cb = a^3~$ has nonzero integer solutions, then $~(a,c) \gt 1~$ or $~(b,c) \gt 1$? [closed]

If $~(c - b) ^ 2 + 3cb = a^3~$ has nonzero integer solutions, then $~(a,c) \gt 1~$ or $~(b,c) \gt 1$? I think this is true, how to prove this?
15
votes
0answers
456 views

The lonely molecule

Suppose $n$ air molecules (infinitesimal points) are bouncing around in a unit $d$-dimensional cube, with perfectly elastic wall collisions. Let $k=n^{\frac{1}{d}}$. For example, in 3D, $d=3$, with ...
2
votes
1answer
285 views

Integer points on $y^2=x^2-x^3+x^4$

Does the Diophantine equation $y^2=x^2-x^3+x^4$ have solutions other than $x=1,y=1$? Interestingly, the Diophantine equation $y^2=x^2-x^3+x^5$ has such solutions: $x=3,y=15$, $x=5,y=55$, ...
14
votes
3answers
1k views

Not-lonely runners

The lonely runner conjecture has several formulations. They all involve a number $n$ runners running on a circular track, each with a different speeds, and the conjecture is that each runner is ...