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}$. ...

learn more… | top users | synonyms

3
votes
1answer
361 views

On the Diophantine equation $x^2 = y^p + 2^{r}z^p$ where $p\geq 7$ is an odd prime and $r \geq 2$

It is known that the only nonzero pairwise coprime integer solutions to the above Diophantine equation are for $r=3$, for which $(x, y, z) = (3,1,1)$ and $(-3,1, 1)$. (Cohen, Number Theory Volume 2: ...
1
vote
0answers
81 views

Simple Diophantine equations for Cartan matrices of Kac-Moody algebras

Let us consider the matrix $A$ defined as follows: $A_{i i} =2$, $A_{i j} = - \frac{2 d_i}{d - 1 - d_{j}}, \qquad i \neq j$; $i, j = 1, \dots, n$. Here $d_1,...,d_n$ are natural numbers, $n > 1$ ...
1
vote
0answers
157 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 ...
1
vote
0answers
480 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 ...
1
vote
0answers
138 views

Equation in the Gaussian Integers

Let $a,b \in \mathbb{N}$. Is there a possibility to characterize the solutions of $a N(\alpha) - b N(\beta)=1$ where $\alpha,\beta \in \mathbb{Z}[i]$? In particular I am interested in the case $a=1$ ...
1
vote
0answers
46 views

Question about link between non-terminals of grammars and variables of Diophantine equations

If we change the right arrow in the rewriting rules of grammar into equators , changes all terminals into x and keep the non-terminals unchanged,we get system of equations.In some cases,those ...
1
vote
0answers
90 views

Cassels-Birch-Davenport theorem for multiple quadratic forms of certain type

A classical theorem of Cassels states that if a homogenous quadratic form $Q$ has an integer zero, then there is a zero of small height (bounded solely by the coefficients and number of variables). ...
1
vote
0answers
218 views

Integral points on affine rational curves over $\mathbb{Q}$

Given a rational curve $C:(f_1(t),f_2(t))$, where $f_i(t),i=1,2$ are rational functions with rational coefficients. Question: Is there any criterion(proved or conjectural) for the existence of ...
1
vote
0answers
107 views

Rational solutions of equations of the form $y^2 x = f(x)$

Let $k$ be any number field, and suppose we want to study the $k$-rational points on $$y^2 x = f(x),$$ where $f$ is a polynomial of degree greater or equal than 3. In other words, $y^2 x = f(x)$ is a ...
1
vote
0answers
1k 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 ...
1
vote
0answers
408 views

Diophantine equation over Z[i]

I'm trying to generate the set of solutions of a specific diophantine equation over Z[i]. The equation is the following: $$ z_1^2 + z_2^2 + z_1*z_2 + 39 = 0$$ with $ z_1$ (resp $z_2$) such that ...
1
vote
0answers
181 views

Efficient counting of Egyptian fractions with bounded denominators

I was amazed to discover that sequence http://oeis.org/A020473 in the OEIS has almost four hundred terms computed. I wonder how one can get that far? E.g., how one can compute A020473(100)? P.S. ...
1
vote
0answers
315 views

Quartic case of a theorem of Bombieri and Pila

I am interested in the ternary case of a theorem of Bombieri and Pila, in E. Bombieri and J. Pila, "The number of integral points on arcs and ovals", Duke Mathematical Journal., 59 (1989), 337-357. ...
1
vote
0answers
175 views

Checking local solubility of varieties at “bad” primes

Let $X$ be smooth variety defined over $\mathbb{Q}$. If we want to check that $X$ is locally soluble at a prime $p$, then it suffices to find a non-singular $\mathbb{F}_p$ point, which can be lifted ...
0
votes
0answers
127 views

A trivial application of Wilson's theorem to Brocard's Problem

Proposition: Let $W(1)$ be the set of all Wilson primes of order $1$ and suppose $n=p-1,$ where $p$ is a prime such that $p\notin W(1)$, then there are no integer solutions to the equation ...
0
votes
0answers
141 views

The existence of solution for special equation on integer ring

I have a question which belongs to the field of number theory. Can we prove or disprove the following claim: For all prime number $p=24t+1$ and the natural number $n=6t+1$, there is at least, one ...
0
votes
0answers
97 views

Systems of linear modular equations with unknowns in the moduli

I am interested in systems of linear modular equations, where the unknowns also appear in the moduli. The general form would be: $A \vec{x}= \vec{b} \;\textrm{mod} \; (C \vec{x}+\vec{d})$ where A ...
0
votes
0answers
152 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 ...
0
votes
0answers
90 views

Using the circle method to prove that there are no solutions to diophantine equaltions

Would it be possible to use the circle method to prove that there are no solutions to certain diophantine equations. For example, could one use the circle method to prove the fact that there are no ...
0
votes
0answers
166 views

On unique solutions to linear diophantine equations

Let $\sum_{i=1}^k a_ix_i = N$ be the equation with $a_i \in [2^t,2^{t+1}]$ being distinct primes. If we seek unique solutions $x_i\in R_i = (0,a_i)\cap \Bbb Z$, then in general it is not possible. ...
0
votes
0answers
339 views

Diophantine equation solutions

I am not able to make headway on solving the diophantine equation $x^m - y^n = 6.$ Are there any solutions to this? What about $x^m - y^n = 14,$ and $= 30$ (both $m$ and $n$ are at least $2$).
0
votes
0answers
93 views

how do you bound exponent of x^2+1=y^p

for p a prime exponent using linear forms in logs? So far I have (x-i)(x+i)=y^p which are coprime and hence x+i=(a+ib)^p , now how do I get a linear form in logs so that I can find an upper bound on ...
0
votes
0answers
265 views

Exponential Diophantine $\prod x_i^{e_{x_i}} + \prod y_i^{e_{y_i}} = \prod z_i^{e_{z_i}}$ ,$e_{x_i}>3,e_{y_i}>3,e_{z_i}>3$

Does the exponential diophantine equation $$ \prod x_i^{e_{x_i}} + \prod y_i^{e_{y_i}} = \prod z_i^{e_{z_i}}$$ with $x_i, y_i,z_i$ coprime and $e_{x_i}>3,e_{y_i}>3,e_{z_i}>3$ have ...
0
votes
0answers
298 views

When is $Pn^2-2an+\frac{a^2-k}{P}$ , with $P$ Prime, $k=a^2 mod P$, a square?

It is easy to show that the following problems are equivalent. a. When is $Pn^2-2an+\frac{a^2-k}{P}$ , with $P$ Prime, $k=a^2 mod P$, and $n$ any integer, a square? and b. When is $X^2-PY^2=k$ ...
-1
votes
0answers
42 views

General Solution of Quadratic Diophantine Equation System

I am looking for the general solution of: $x^2-y^2=\square$ $x^2-z^2=\square$ $y^2-z^2=\square$ I have found a solution in tpiezas site. But not really sure if this is the general solution.