Skip to main content

All Questions

5 questions with no upvoted or accepted answers
Filter by
Sorted by
Tagged with
18 votes
0 answers
1k views

Is the set of integers of the form $a/(b+c)+b/(a+c)+c/(a+b)$ computable?

The starting point of this question is the observation that the smallest positive integers $a,b,c$ satisfying $$\frac{a}{b+c} + \frac{b}{a+c} + \frac{c}{a+b} = 4$$ are absurdly high, namely $$(...
Dominic van der Zypen's user avatar
7 votes
0 answers
274 views

Is decidability reducible to unique decidability (perhaps in multilinear polynomial situations)?

Given a Diophantine equation it is not decidable if it has integer solution. I. Is there a Diophantine set $\mathcal D_{unique}$ satisfying the properties every member in $\mathcal D_{unique}$ is a ...
Turbo's user avatar
  • 13.9k
5 votes
0 answers
356 views

minimum size of undecidable quadratic diophantine problems

According to Matiyasevich, the existence of integer solutions of systems of polynomial equations with integer coefficients is undecidable. By introducing additional variables substituting factors of ...
Arnold Neumaier's user avatar
3 votes
0 answers
116 views

Variation in decidability of diophantine equations with field extension

Let $O_k$ be the ring of integers in a subfield $k$ of $\overline{\mathbb{Q}}$. Let's call an equation $p(x_1, \dots, x_n) = 0$ where $p$ is a polynomial in $n$-variables $x_1, \dots, x_n$ with ...
Fanta's user avatar
  • 31
1 vote
0 answers
216 views

How to solve special Diophantine equation systems (which one can solve by hand) with the computer?

I have a quadratic Diophantine equation system which is possibly not homogeneous and has some mixed and some linear terms. But I know that there are only finitely many solutions over the integers. One ...
Bernhard Boehmler's user avatar