Skip to main content

Questions tagged [diophantine-equations]

Diophantine equations are polynomial equations $F=0$, or systems of polynomial equations $F_1=\ldots=F_k=0$, where $F,F_1,\ldots,F_k$ are polynomials in either $\mathbb{Z}[X_1,\ldots,X_n]$ of $\mathbb{Q}[X_1,\ldots,X_n]$ of which it is asked to find solutions over $\mathbb{Z}$ or $\mathbb{Q}$. Topics: Pell equations, quadratic forms, elliptic curves, abelian varieties, hyperelliptic curves, Thue equations, normic forms, K3 surfaces ...

Filter by
Sorted by
Tagged with
6 votes
3 answers
605 views

Natural number solutions for equations of the form $\frac{a^2}{a^2-1} \cdot \frac{b^2}{b^2-1} = \frac{c^2}{c^2-1}$

Consider the equation $$\frac{a^2}{a^2-1} \cdot \frac{b^2}{b^2-1} = \frac{c^2}{c^2-1}.$$ Of course, there are solutions to this like $(a,b,c) = (9,8,6)$. Is there any known approximation for the ...
tobias's user avatar
  • 749
1 vote
0 answers
53 views

On a structural decomposition of polynomials based on integral roots

Given an irreducible polynomial of structure $$f(x,y)=\sum_{\substack{i,j\in\{0,1,2\}\\i+j\leq3}}a_{i, j}x^iy^j\in\mathbb Z[x,y]$$ with $a_{2,1}a_{1,2}a_{1,1}a_{1,0}a_{0,1}a_{0,0}\neq0$ if $f(m,n)=0$ ...
VS.'s user avatar
  • 1,826
0 votes
0 answers
180 views

When is $\phi(a^n+b^n+c^n)=0\mod n$?

A corollary Zsigmondy's Theorem leads to the following congruence (one can look to $(24)$),$\phi(a^n+b^n)=0\mod n$ whenever $a, b$ are coprime and $n \neq 2$ and $(a,b)\neq(1,1)$. (Here $\phi$ is the ...
user avatar
16 votes
2 answers
410 views

$3$-ranks of elliptic curves and representations $p=ax^3+by^3$

Let $p$ be a prime with $p\equiv2\pmod3$ and $E_p$ the elliptic curve $y^2=x^3+9p^2$ which has a rational $3$-torsion point. Let $\alpha$ from $E_p(\mathbb Q)$ to $\mathbb Q^*/{\mathbb Q^*}^3$ be the $...
Henri Cohen's user avatar
  • 13.1k
0 votes
1 answer
74 views

Small linear relations in unbalanced diophantine equations from primitive Pythagorean triples

$r$ is parameter. Pick coprime $m,n\in[r,2r]$ with $mn$ even. Consider the Linear Diophantine Equation $$a^4u+b^4v+c^2z=0$$ where $a=m^2-n^2$, $b=2mn$ and $c=m^2+n^2$. Is it true that there are ...
VS.'s user avatar
  • 1,826
4 votes
1 answer
193 views

Small linear relations between primitive Pythagorean triples $\mathsf{II}$

WillJagy answered a linear relation question on Pythagorean Triples in Small linear relations between primitive Pythagorean triples $\mathsf I$. Now let $a^2+b^2=c^2$ be a primitive Pythagorean ...
VS.'s user avatar
  • 1,826
9 votes
0 answers
328 views

Cohn's eight diophantine equations

Today I was reading J.H.E. Cohn's Eight diophantine equations (1966). On p. 158 he comes across the equation $y^2 = a^3 + 3a$ for odd values of $a$ and writes that this is equivalent to $x^3 + (x+1)^3 ...
Franz Lemmermeyer's user avatar
3 votes
0 answers
126 views

FLT and integral points on elliptic curves

For integers $x,y,z,t,n$ define $S_n : xy(x+y)=t^n$. For $ n > 2$, Fermat's Last Theorem implies there are no integral solution on $S_n$ with $x,y$ coprime and $xy(x+y) \ne 0$ since $x,y,x+y$ are ...
joro's user avatar
  • 25.4k
0 votes
0 answers
221 views

Number of integer solutions to quadratic polynomial with integer coefficients

It is known from for example Representations of Integers as Sums of Squares by Grosswald, E. that $$|\{(n_1,n_2,\ldots,n_k)\in\mathbb{Z}^k: \ n_1^2+n_2^2+\cdots+n_k^2=N\}|\leq C_\varepsilon N^{\frac{...
shrinklemma's user avatar
0 votes
1 answer
198 views

Write $n^2$ as $x^2+y^2+2\times4^z$ or $x^2+y^2+5\times 4^z$

In March 2018, I formulated the following somewhat curious question. Question 1. Whether for any integer $n>1$ there is a nonnegative integer $k$ such that $n^2-2\times 4^k$ or $n^2-5\times 4^k$ ...
Zhi-Wei Sun's user avatar
  • 15.6k
1 vote
0 answers
135 views

$n$-variable polynomials modulo $p$

The Hasse-Weil bound implies that for any 2-variable polynomial $P(x,y)$, there exists approximately $p$ solutions in $\mathbb{F}_p$ of $P(x,y) \equiv a \pmod p$ for sufficiently large $p$, and any ...
Junsukim's user avatar
  • 141
1 vote
0 answers
104 views

Write $p^2$ as $x^2+2y^2+3\times 2^z$ with $x,y,z$ nonnegative integers

In April 2018, I noted that the first integer $n>1$ with $n^2\not\in\{x^2+2y^2+3\times 2^z:\ x,y,z=0,1,2,\ldots\}$ is $$5884015571=7\times17\times49445509.$$ Question. Is it true that for each ...
Zhi-Wei Sun's user avatar
  • 15.6k
-2 votes
1 answer
168 views

Diophantine equation $10^n-a^3-b^3=c^2$

Consider the Diophantine equation: $10^n-a^3-b^3=c^2$, for $a$, $b$, $c$, and $n$ positive. Has this equation infinitely many solutions?
Enzo Creti's user avatar
20 votes
3 answers
2k views

Simplest diophantine equation with open solvability

What is the simplest diophantine equation for which we (collectively) don't know whether it has any solutions? I'm aware of many simple ones where we don't know (whether we know) all the solutions, ...
Veky's user avatar
  • 351
3 votes
1 answer
278 views

Solutions in primes of the equation $\,3p^2+q^2=r^2+3$

Let's consider the Diophantine equation $\,3p^2+q^2=r^2+3$. Actually, I am interested only in the solutions represented by sets $\,(p,q,r)\,$ of prime numbers. It's easy to prove that if $\,(p,q)\,$ ...
Augusto Santi's user avatar
7 votes
1 answer
386 views

Does this equation have more than one integer solution?

Consider the following diophantine equation $$n = (3^x - 2^x)/(2^y - 3^x),$$ where $x$ and $y$ are positive integers and $2^y > 3^x$. Does $n$ have any other integer solutions besides the case ...
Lee's user avatar
  • 79
1 vote
0 answers
110 views

On Kellner's result and the Erdos-Moser equation

Let $m, k$ be positive integers. Consider the Erdos-Moser expression $S_{k}(m) = 1^k + 2^k + ... + (m-1)^k$. By a result of Kellner, we know that if $m | S_{k}(m)$, then $m|B_k$, where $B_r$ denotes ...
user152442's user avatar
3 votes
1 answer
415 views

Which Hilbert's 10th polynomials are known to have solutions?

The Diophantine equation $$x^3 + y^3 + z^3 = 42$$ was recently solved by Booker and Sutherland: Sum of three cubes for 42 finally solved. Is there a clean partition of the form of those polynomial ...
Joseph O'Rourke's user avatar
6 votes
4 answers
628 views

Request for an exact formula related to a partition in number theory

The Frobenius equation is the Diophantine equation $$ a_1 x_1+\dots+a_n x_n=b,$$ where the $a_j$ are positive integers, $b$ is an integer, and a solution $$(x_1, \dots, x_n)$$ must consist of non-...
wonderich's user avatar
  • 10.5k
8 votes
2 answers
643 views

Around the diophantine equation $\frac{a}{2b+3c}+\frac{b}{2c+3a}+\frac{c}{2a+3b}=\text{odd integer}$, over positive integers

I am interested to know if a similar theorem that shows this answer of the post Estimating the size of solutions of a diophantine equation (this MathOverflow, January 5th 2016) is feasible for a ...
user142929's user avatar
0 votes
1 answer
320 views

find all of rational solutions of the quartic equation?

Consider the equation $a^4+6v^2a^2-8a+v^4=0$ over the rationals. Note that the following are solutions: $(a,v)=(1,1),(0,0),(2,0)$. Are there any other rational solutions?
user151553's user avatar
0 votes
0 answers
264 views

On variants of the abc conjecture in terms of Lehmer means

In this post we denote the Lehmer mean of a tuple $\text{x}$ of positive real numbers as $$L_p(\text{x})={\sum_{k=1}^nx_k^p\over\sum_{k=1}^nx_k^{p-1}},$$ see the reference Wikipedia Lehmer mean. The ...
user142929's user avatar
2 votes
1 answer
248 views

Sum from combinatorics on nonnegative integer numbers

Let $n_1,n_2,\ldots,n_k\in\{0,1,2,\ldots\}$. Can you calculate the sum $$ \sum_{n_1,n_2,\ldots,n_k\geqslant0}\mathbb{1}_\left\{n_1+\frac{n_2}{2}+\ldots+\frac{n_k}{k}<1\right\}? $$ If it's helpful, ...
Fancier of Mathematica's user avatar
2 votes
2 answers
902 views

Diophantine representation of the set of prime numbers of the form $n²+1$

A polynomial formula for the primes (with 26 variables) was presented by Jones, J., Sato, D., Wada, H. and Wiens, D. (1976). Diophantine representation of the set of prime numbers. American ...
Safwane's user avatar
  • 1,197
2 votes
1 answer
573 views

Integer points of one Mordell equation

How can I determine all integer points of the following equation $$y^2=x^3+10546$$ I tried Magma with IntegralPoints(EllipticCurve([0,10546])); but got the ...
yarchik's user avatar
  • 492
5 votes
1 answer
355 views

Research work on $ax^n-by^m=1$

I am looking for results on the equation $$ax^n-by^m=1 \tag 1 $$ where $\gcd(m,n)=1$ and $a,b,n,m$ are constants. I found literature for $ax^n-by^n=1$ (R. A. Mollin, D. T. Walker) but couldn't ...
Consider Non-Trivial Cases's user avatar
16 votes
2 answers
983 views

Prove $\frac{\text{Area}_1}{c_1^2}+\frac{\text{Area}_2}{c_2^2}\neq \frac{\text{Area}_3}{c_3^2}$ for all primitive Pythagorean triples

A while ago I asked this question on MSE here. After placing a bounty it got quite a bit of attention but unfortunately it has yet to be resolved. After getting some advice from MO Meta I have decided ...
PMaynard's user avatar
  • 211
1 vote
2 answers
307 views

A question about integer triples

How can we generate all integer solutions of the equation $$(qr+rp+pq)(x^2+y^2+z^2) = (p^2+q^2+r^2)(yz+zx+xy),$$ given that $p,q,r$ are integers? Clearly if any one of $(x,y,z), (x,z,y), (y,z,x), (...
Clark Kimberling's user avatar
1 vote
0 answers
81 views

On sparse $0/1$ linear equations solvable with compressed sensing

If you have a system of $m$ linearly independent equations in $n$ variables with domain $0/1$ and we know there is at least one solution with at most $d$ variables to be $1$ then if $m$ at least a ...
VS.'s user avatar
  • 1,826
0 votes
1 answer
140 views

Diophantine equations that involve cubes and the volume of square frustums

This week I wondered about diophantine problems that involve the volume of certain cubes and frustums, see the Wikipedia Frustum. I wondered if each one of these problems have infinitely many ...
user142929's user avatar
8 votes
1 answer
382 views

Solutions of a Diophantine equation with large common divisors

There is a curious Diphantine equation showing up in my research: $$ \frac{1}{a^2-1}+\frac{1}{b^2-1}=\frac{1}{c^2-1}+\frac{1}{d^2-1}. $$ I am trying to find its integer solutions where $a$, $b$, $c$ ...
Fan Zheng's user avatar
  • 5,169
0 votes
1 answer
132 views

Different solution of power Diophantine equation based on constant term

Let us define a power Diophantine equation by 2 algebraic functions $f,g$ (having different degree) and by integers $k, l >0$ where, there are finite solutions for $f(x)+k=g(y)$, but there exists $...
Michael's user avatar
  • 267
4 votes
1 answer
364 views

Diophantine equation in Laurent polynomials

(This is a modified repost of a question from MSE; since it came out of research, I thought it might be appropriate to post it here.) Consider the equation \begin{equation*} P(x, x^{-1})^m + Q(x, x^{-...
user137's user avatar
  • 181
0 votes
0 answers
63 views

Quadratic factors of $l_1(x,y)^3+l_2(x,y)^3+l_3(x,y)^3-n$

Related to sum of three squares and this question. Let $l_1,l_2,l_3 \in \mathbb{Z}[x,y]$ and $n \in \mathbb{Z}$. Assume that $n$ is not a cube and not twice cube. Let $f=l_1(x,y)^3+l_2(x,y)^3+l_3(x,...
joro's user avatar
  • 25.4k
7 votes
1 answer
364 views

Rational Diophantine set for the non-squares

Related to Hilbert's Tenth problem. Is there polynomial with integer coefficients $P(a,x_1,...,x_n)$ such that $P(A,X_i)=0$ has rational solutions $X_i$ iff $A$ is not the square of integer (or as ...
joro's user avatar
  • 25.4k
0 votes
1 answer
200 views

On a variant of Brocard's problem using the definition of Pochhammer symbols

I've considered the following variant of Brocard's problem $$\frac{(2n-1)!}{(n-1)!}+1=m^2\tag{1}$$ for integers $n\geq 1$ and integers $m\geq 1$. I was inspired from the fact that the evaluation of ...
user142929's user avatar
5 votes
0 answers
125 views

Is integer circuit membership undecidable?

According to wikipedia integer circuit in its simplest form is succinct representation of multivariate polynomial with integer coefficients. Decidability if an integer is represented by the integer ...
joro's user avatar
  • 25.4k
6 votes
2 answers
466 views

Points on hyperelliptic curves: $y^2=5(x^2-3)(x^2+2)(x^2-11/5)$

González-Jiménez and Xarles studied a problem in Diophantine number theory and they obtained several nice results via elliptic curve Chabauty's method over quadratic number fields. At page 73 in paper ...
castor's user avatar
  • 298
3 votes
0 answers
285 views

Catalan numbers, Pochhammer symbols, Stirling numbers of the second kind, and sums of aliquot parts

For integers $N\geq 1$ we define $$s(N)=\sigma(N)-N$$ the aliquot sum function, where $\sigma(N)=\sum_{1\leq d|N}d$ is the sum of divisors function. Here $(x)_n$ is the Pochhammer symbol and ${a\...
user142929's user avatar
0 votes
0 answers
64 views

On the number of solutions of the equation involving Pochhammer symbols $(n)_a\cdot(n)_b=(n)_c$, for integers greater than or equal to $2$

As paticular case of the equation involving Pochhammer symbols $$(n)_a\cdot(m)_b=(k)_c,$$ where the variables are positive integers, I've consider the case $n=m=k$ of previous equation, that is $$(n)...
user142929's user avatar
2 votes
1 answer
231 views

Equations involving arithmetic functions of primorials

Let $\sigma(n)=\sum_{1\leq d\mid n}d$ the sum of divisors, $\varphi(n)$ the Euler's totient function and we denote the primorial $\prod_{k=1}^n p_k$ as $N_n$, where $p_k$ denotes the $k$-th prime ...
user142929's user avatar
3 votes
1 answer
457 views

Special linear Diophantine system - is it solvable in general?

Background: An equivalent question was asked on MSE almost two years before this post now. It was never fully resolved. - Here, we are asking if further progress can be made. Motivation Solving this ...
Vepir's user avatar
  • 611
4 votes
0 answers
185 views

Near Pochhammer symbols: the equation $(n)_m-(k)_l=2$ for integers greater than or equal to two

In this post I consider the following equation involving Pochhammer symbols, $$(n)_m-(k)_l=2\tag{1}$$ for positive integers $n\geq 2$ and $k\geq 2$, and positive integers $m\geq 2$ and $l\geq 2$. ...
user142929's user avatar
1 vote
0 answers
188 views

How small can $u$ be in the Pell equation $u^2-k^3 v^2=\pm 1$?

Let $k$ be positive integer, not a square and let $u_k,v_k$ be non-trivial solutions to the Pell equation $u_k^2-k^3 v_k^2=\pm 1$. Q1 How small $u_k$ can be infinitely often as function $k$? This ...
joro's user avatar
  • 25.4k
27 votes
3 answers
1k views

When does $axy+byz+czx$ represent all integers?

For which $a,b,c$ does $axy+byz+czx$ represent all integers? In a recent answer, I conjectured that this holds whenever $\gcd(a,b,c)=1$, and I hope someone will know. I also conjectured that $axy+byz+...
user avatar
2 votes
2 answers
239 views

Concise formulation of set of equation systems

I have the following set of equation systems, and I would like to find a short, formal way to write it down. My main difficulty is that I cannot find a good way to write the indices of the variables $\...
Mario Krenn's user avatar
5 votes
1 answer
529 views

On Richard Guy's problem D5 in "Unsolved problems in Number Theory"

This question is motivated by recent discovery of Andrew Booker+Andrew Sutherland. Richard Guy's problem D5 in his Unsolved Problems in Number Theory contains the original question for the sum of ...
Y. Zhao's user avatar
  • 3,337
1 vote
0 answers
63 views

On the equation involving Stirling numbers of the second kind ${n\brace a}{m\brace b}={k\brace c}$, and its solutions satisfying certain requirements

In this post we denote the Stirling numbers of the second kind as ${r\brace s}$ and we consider the proposal to ask if the equation of the title has infinitely many solutions $${n\brace a}{m\brace b}={...
user142929's user avatar
3 votes
0 answers
179 views

Solubility of a Diophantine equation [closed]

Is it true that for positive integers $B$ and $G$, the following equation in $B_1,B_2,G_1,G_2$ has a non-negative integer solution for any value $c$ such that $|c|\le B G$ : $$G_1B_1-G_2B_2 = c$$ ...
bleh's user avatar
  • 153
7 votes
1 answer
691 views

What are the solutions of this Diophantine equation?

Besides $(x, y, z)=(0, 0, 0)$ and $(1, 1, -2)$ (and their permutations) are there any other integer solutions to the equation $$3(x^{3}+y^{3}+z^{3})+3(x^{2}+y^{2}+z^{2})+(x+y+z)=0 $$ ?
McRonald's user avatar

1
6 7
8
9 10
19