The tag has no usage guidance.

learn more… | top users | synonyms

2
votes
1answer
282 views

Quadratic Diophantine equation in $\mathbb Z[T]$

I am trying to solve the following quadratic diophantine equation in $\mathbb Z[T]$: $$((T+1)X+TY-1-Z)((T+1)X+TY-1+Z)=24XY$$ One has the following trivial solutions: $(X,Y,Z)=(0,Y,\pm(1-TY))$, ...
1
vote
0answers
75 views

System of congruences

I have a system of $n$ congruences. the generic $m$_th congruence of the system ($m = 1,\dots,n$) is in the form: $(p_n\#)^2(\displaystyle\sum_{\substack{i=1\\i\neq ...
2
votes
1answer
176 views

Finite sequences which happen to be the sequence of orders of elements of a simple group

Let $n\in \Bbb N$. Any finite group $G$ with $|G|=n$ has a solution for the Diophantine equation $$\sum_{d|n}x_d\phi(d)=n~~~~~~~~~~~~~~~~~~~~~~~(1)$$ where $\phi$ is the Euler's totient function, $d$ ...
0
votes
1answer
140 views

A three variable linear diophantine promise problem

Given $a,b,c,s\in\Bbb N$ such that $(a,b,c)=1$ with promise that we have at most one triple $x,y,z\in\Bbb N$ such that $ax+by+cz=s$, what is a good algorithm that runs in $O(\log(abcs))$ time to find ...
2
votes
0answers
81 views

Possible argument against Height bound hypothesis

From this paper. $f(x,y)$ is polynomial with integer coefficients. $s(f)$ is its size, the sum of the logarithms of the absolute values of the nonzero coefficients, defined on p. 6. From p. 7. ...
1
vote
0answers
145 views

Probability of correlated residues

Given $N,c\in\Bbb N$, where $c\ll(\log N)^{1/b}$ for any $b>1$ is fixed, what is the probability that given $A_1,A_2,A_3\in\Bbb N$ with ...
8
votes
1answer
307 views

When adding a constant makes a multivariate polynomial reducible?

Given a multivariate polynomial $f(x_1,\dots,x_n)$ with integer coefficients, how to find an integer $m$ (if it exists) such that $f(x_1,\dots,x_n) + m$ factors into polynomials of smaller degrees? ...
6
votes
4answers
231 views

Application and usage of representation of integers as sum of powers?

We know that there are many articles and manuscripts from the ancient to date talking about representation of integers as sum of squares, cubes etc. I would like to know what is it the usage and ...
1
vote
0answers
97 views

Egyptian fractions similar to Erdos-Straus conjecture

It is known that the Erdos-Straus conjecture is about writing $4/n$ as three unit fractions. My question is whether it is known that if $a>4$ $$ \frac an=\frac1{x_1}+\frac1{x_2}+\cdots+\frac1{x_k} ...
3
votes
4answers
456 views

Integral points on a particular family of curves

This is a follow-up to this question (and comments thereon). Namely, it follows from Felipe Voloch's comment that for any $n>2$ there is a finite set of integral $(x, y),$ such that $$ ...
0
votes
1answer
283 views

Particular case of Beal's Conjecture

Is it known that there exist no coprime positive integers $A$, $B$ and $C$ such that $A^3+B^4=C^3$? This is a particular case of Beal's Conjecture.
0
votes
1answer
127 views

Quadratic diophantine equation in $\mathbb C[T]$

I am trying to solve the following quadratic diophantine equation in $\mathbb C[T]$, but I did not manage. I hope someone could give some hints or solutions to my problem. Here is the equation ...
13
votes
2answers
1k 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 + ...
0
votes
2answers
1k views

non negative integer solutions : Diophantine Equations [closed]

I want to know the exact number of non-negative integer solutions of $a_1 + 2a_2 + \ldots + k \cdot a_k = n$. I know that it is the co-efficient of $x^n$ in $(1 - x^{a_1})^{-1} \cdot (1 - ...
2
votes
0answers
180 views

Can estimate upper bound of $|p_{i}|$ or $|q_{i}|?$

when I Find the diophantine-equation rational points $$2y^2=x^6-x^2+2$$ I using Faltings's theorem showed that there are only finitely many solutions,if we assmue that ...
14
votes
4answers
782 views

Number of $\mathbb F_p$ points constant mod $p$?

I have some affine varieties $X$ defined over $\mathbb Z$, and associated integers $c(X)$, with the property that $\# X_{\mathbb Z/p} \equiv c(X) \bmod p$ for all $p$. (In particular $c(X)$ is usually ...
7
votes
2answers
917 views

How to prove that this equation has only one solution?

I can't find a way to prove that the following equation has only one solution : $$ X = \frac{2^Q - 1}{2^{P+Q} - 3^P} $$ with $X,P,Q$ integers $> 0$. One trivial solution is $X = 1, P = 1, Q = ...
4
votes
2answers
854 views

Find all rational solutions of this diophantine-equation?

Now, today, my friend tell me this problem was posted by American Mathematical Monthly (Vol. 111, No. 2 Feb., 2004), p. 165 by Wu wei Chao ,and It is said that this problem is unsolved, until now. ...
10
votes
3answers
742 views

Find all solution $a,b,c$ with $(1-a^2)(1-b^2)(1-c^2)=8abc$

Two years ago, I made a conjecture on stackexchange: Today, I tried to find all solutions in integers $a,b,c$ to $$(1-a^2)(1-b^2)(1-c^2)=8abc,\quad a,b,c\in \mathbb{Q}^{+}.$$ I have found some ...
2
votes
2answers
244 views

Is it possible that $(a,b,c)$, $(x,y,a)$, $(p,q,b)$ are Pythagorean triples simultaneously? [closed]

Do there exist postive integers $a,b,c,x,y,p,q$ such $(a,b,c)$, $(x,y,a)$, $(p,q,b)$ are all Pythagorean triples? That is, does the system $$\begin{cases} a^2+b^2=c^2\\ x^2+y^2=a^2\\ p^2+q^2=b^2 ...
5
votes
2answers
608 views

When is $(-1+\sqrt[3]{2})^n$ of the form $a+b\sqrt[3]{2}$?

When is $(-1+\sqrt[3]{2})^n$ of the form $a+b\sqrt[3]{2}$ ($n$ being an integer) , i .e., when does $(-1+\sqrt[3]{2})^n$ not have a non-zero term in $\sqrt[3]{4}$. As you might have noticed, I'm ...
1
vote
1answer
134 views

How to solve a quadratic diophantine equation [closed]

I'm trying to solve $y^2=3x^2+3x+1$ for integers, which transforms into $(2y)^2-3(2x+1)^2=1$. I know how to solve pell's equation, but how can we extract only (odd,even) pair from the solutions of the ...
0
votes
2answers
139 views

Special type Diophantine equations with integer solutions

The following problem on Diophantine equation is still solved or not I don't know. However, I found few solutions by trail and error method. Problem: $X^2 - X = Y^5 - Y$ has integer solutions or not? ...
2
votes
1answer
78 views

Sufficient condition for solvability of linear diophantine system

I would like to know under what conditions does an integer solution exist to the under-determined linear system: Ax = b. (without constraints) Where A is m x n matrix with positive integers entries ...
13
votes
1answer
545 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] $$ ...
14
votes
2answers
764 views

Origin of the term “Diophantine equation”

It seems that the term "Diophantine equation" has been around at least since the second half of the 19th century, since the historian Hermann Hankel writes (polemically) in the chapter on Diophantus ...
2
votes
3answers
619 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.
4
votes
1answer
179 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 ...
13
votes
3answers
1k views

Diophantine equation: Egyptian fraction representations of 1

According to the OEIS (A002966) there are 294314 solutions in positive integers to the equation $$\sum_{i=1}^7\frac{1}{x_i}=1$$ assuming $x_1\leq x_2\leq\cdots\leq x_7$. Similarly for 8 summands there ...
5
votes
1answer
217 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
438 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 ...
8
votes
1answer
238 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): ...
3
votes
0answers
72 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
786 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 ...
11
votes
0answers
433 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 ...
0
votes
0answers
972 views

Diophantine: a^n + b^n + c^n = d^n and a^n + b^n = c^n + d^n

Let us consider the equation $a^n+b^n=c^n$ for positive integers $a,b,c$ and $n\ge 2$. The $n=2$ case has a well-known and beautiful parametrization known as Pythagorean triples. Fermat's Last Theorem ...
7
votes
0answers
201 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
3answers
323 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 ...
1
vote
3answers
146 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 ...
2
votes
0answers
151 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 ...
10
votes
8answers
5k views

Is there an algorithm to solve quadratic Diophantine equations?

I was asked two questions related to Diophantine equations. Can one find all integer triplets $(x,y,z)$ satisfying $x^2 + x = y^2 + y + z^2 + z$? I mean some kind of parametrization which gives all ...
8
votes
2answers
593 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 ...
35
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 ...
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 ...
3
votes
2answers
829 views

algorithm for solving systems of linear Diophantine inequalities

So, I posted on stack overflow looking for a reasonably fast algorithm to solve systems of linear Diophantine inequalities and was pointed to this article by Cheng-Zhi Gao and Yu-Lin Dong. The problem ...
2
votes
4answers
558 views

solution of the equation $a^2+pb^2-2c^2-2kcd+(p+k^2)d^2=0$

i am wondering if there is a complete solution for the equation $a^2+pb^2-2c^2-2kcd+(p+k^2)d^2=0$ in which $a,b,c,d,k$ are integer(not all zero) and $p$ is odd prime.
3
votes
5answers
862 views

Integer polynomials taking square values

Is there a way to determine a formula giving all integer values of $x$ for which the value of a polynomial $P(x)$ with integer coefficients is a square? That is, is there a closed formula for: $X = ...
5
votes
5answers
2k views

General integer solution for $x^2+y^2-z^2=\pm 1$

How to find general solution (in terms of parameters) for diophantine equations $x^2+y^2-z^2=1$ and $x^2+y^2-z^2=-1$? It's easy to find such solutions for $x^2+y^2-z^2=0$ or $x^2+y^2-z^2-w^2=0$ or ...
7
votes
2answers
272 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 ...
4
votes
1answer
649 views

Does the following Diophantine equation have nontrivial rational solutions?

Are there any solutions to the equation $s^{2}(1+t^{2})^{2}+t^{2}(1+s^{2})^{2}=u^2$ where $s,t,u\in \mathbb{Q}$ and $0 < s,t<1$? If so, is there a simple way to parametrize them all? If I am ...