The tag has no usage guidance.

learn more… | top users | synonyms

1
vote
0answers
400 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
175 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
308 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
147 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
86 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
150 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
976 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 ...
0
votes
0answers
333 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
293 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$ ...