# What types of Diophantine equations are unsolvable?

### What types of Diophantine equations are unsolvable?

Question: What types of Diophantine equations are unsolvable over the set of positive rational numbers?

Guest

### Re: What types of Diophantine equations are unsolvable?

FYI: 'From the result of Hilbert's tenth problem, does it follow that there exist infinitely numbers of equation...',

https://math.stackexchange.com/questions/118662/from-the-result-of-hilberts-tenth-problem-does-it-follow-that-there-exist-infi?rq=1.
Guest

### Re: What types of Diophantine equations are unsolvable?

Good Reference Book: 'An Introduction to Diophantine Equations' by Prof. T. Andreescu et al.

https://www.springer.com/gp/book/9780817645489.
Guest

### Re: What types of Diophantine equations are unsolvable?

Guest wrote:Question: What types of Diophantine equations are unsolvable over the set of positive rational numbers?

I had a very bad experience with https://math.stackexchange.com, and I strongly do not recommend it to anyone.

Dave.
Guest

### Re: What types of Diophantine equations are unsolvable?

A General Example:

Can we generally determine the solvability or the unsolvability for the following Diophantine equation,

$$x^{7} + x^{6}y + x^{5}y^{2} + x^{4}y^{3}+ x^{3}y^{4}+ x^{2}y^{5}+ xy^{6} + y^{7} = c \in \mathbb{Z_{+}}$$?

Remark: $$x, y \in \mathbb{Z}$$.

Hmm. The value of c is important!

A Specific Example:

Can we solve the following Diophantine equation,

$$x^{7} + x^{6}y + x^{5}y^{2} + x^{4}y^{3}+ x^{3}y^{4}+ x^{2}y^{5}+ xy^{6} + y^{7} =234,567,890,123$$?
Guest

### Re: What types of Diophantine equations are unsolvable?

Guest wrote:A General Example:

Can we generally determine the solvability or the unsolvability for the following Diophantine equation,

$$x^{7} + x^{6}y + x^{5}y^{2} + x^{4}y^{3}+ x^{3}y^{4}+ x^{2}y^{5}+ xy^{6} + y^{7} = c \in \mathbb{Z_{+}}$$?

Remark: $$x, y \in \mathbb{Z}$$.

Hmm. The value of c is important!

A Specific Example:

Can we solve the following Diophantine equation,

$$x^{7} + x^{6}y + x^{5}y^{2} + x^{4}y^{3}+ x^{3}y^{4}+ x^{2}y^{5}+ xy^{6} + y^{7} =234,567,890,123$$?

If we are unhappy with $$x, y \in \mathbb{Z}$$, then we could choose $$x, y \in \mathbb{Q}$$.

It is still a fair game.
Attachments
Silhouette of Sherlock Holmes.jpg (5.13 KiB) Viewed 217 times
Guest

### Re: What types of Diophantine equations are unsolvable?

Remark: We need to develop a theory that works well. Good luck!
Guest

### Re: What types of Diophantine equations are unsolvable?

Remark: The simplest case occurs when $$x = y$$. Right?

We should assume $$x \ne y$$.
Guest

### Re: What types of Diophantine equations are unsolvable?

Some Food for Thought: 'NP-Complete decision problems for binary quadratics', by Profs., K. L. Manders and L. Adleman,

https://www.sciencedirect.com/science/article/pii/0022000078900442?via%3Dihub.
Guest

### Re: What types of Diophantine equations are unsolvable?

Wow! A single number has so much meaning/richness attached to it.

And the study of numbers tells us or reveals to us the truth about the nature of existence/things (energy, etc.)

Why? (A Hint: https://www.math10.com/forum/viewtopic.php?f=63&t=8579).

But we must be energetic, bold, resourceful, and imaginative to know their hidden/subtle/powerful secrets.

The great Gauss was right to say that number theory is the queen of the queens (the sciences including its greatest science, mathematics). Amen!
Guest

### Re: What types of Diophantine equations are unsolvable?

"Simple seeks simplest (best) solution."

A Specific Example:

Can we solve the following Diophantine equation,

$$x^{7} + x^{6}y + x^{5}y^{2} + x^{4}y^{3}+ x^{3}y^{4}+ x^{2}y^{5}+ xy^{6} + y^{7} =234,567,890,123$$ for some $$x \ne y \in \mathbb{Z}$$?

Let s = $$\sum_{i=1}^{7} \beta^{i} + 1$$ for some $$\beta \in \mathbb{Q}$$.

Question 1: Does $$s | 234,567,890,123$$ where $$\beta < 0$$ or $$0 <\beta < 1$$ or $$\beta >1$$?

Question 2: Does $$y = (\frac{234,567,890,123}{s})^{ \frac{1}{7} } \in \mathbb{Z}$$?

Question 3: Does $$x = \beta y \in \mathbb{Z}$$?

If our questions, one, two, and three, have affirmative answers, then we can solve our equation, otherwise, we cannot solve it. Right?
Guest

### Re: What types of Diophantine equations are unsolvable?

An Update:

Guest wrote:"Simple seeks simplest (best) solution."

A Specific Example:

Can we solve the following Diophantine equation,

$$x^{7} + x^{6}y + x^{5}y^{2} + x^{4}y^{3}+ x^{3}y^{4}+ x^{2}y^{5}+ xy^{6} + y^{7} =234,567,890,123$$ for some $$x \ne y \in \mathbb{Z}$$?

Let s = $$\sum_{i=1}^{7} \beta^{i} + 1$$ for some $$\beta \in \mathbb{Q}$$.

Question1: Does $$y = (\frac{234,567,890,123}{s})^{ \frac{1}{7} } \in \mathbb{Z}$$ where $$\beta < 0$$ or $$0 <\beta < 1$$ or $$\beta >1$$?

Question 2: Does $$x = \beta y \in \mathbb{Z}$$?

If our questions, one and two, have affirmative answers, then we can solve our equation, otherwise, we cannot solve it. Right?
Guest

### Re: What types of Diophantine equations are unsolvable?

Guest wrote:An Update:

"Simple seeks simplest (best) solution."

A Specific Example:

Can we solve the following Diophantine equation,

$$x^{7} + x^{6}y + x^{5}y^{2} + x^{4}y^{3}+ x^{3}y^{4}+ x^{2}y^{5}+ xy^{6} + y^{7} =234,567,890,123$$ for some $$x \ne y \in \mathbb{Z}$$?

Let s = $$\sum_{i=1}^{7} \beta^{i} + 1$$ for some $$\beta \in \mathbb{Q}$$.

Question 1: Does $$y = (\frac{234,567,890,123}{s})^{ \frac{1}{7} } \in \mathbb{Z}$$ where $$\beta < 0$$ or $$0 <\beta < 1$$ or $$\beta >1$$?

Question 2: Does $$x = \beta y \in \mathbb{Z}$$?

If our questions, one and two, have affirmative answers, then we can solve our equation, otherwise, we cannot solve it. Right?

Important Question: What is the algorithm that answers our question in polynomial time or less than polynomial time?
Guest

### Re: What types of Diophantine equations are unsolvable?

Hmm. Current theory (Hilbert's Tenth Problem has a negative answer.) states that we cannot generally answer our question in polynomial time or less...

We are skeptical since we had not been clever enough in our search for truth.
Guest

### Re: What types of Diophantine equations are unsolvable?

[b]Remark[\b]: We need better theory!
Guest

### Re: What types of Diophantine equations are unsolvable?

Guest wrote:Remark: We need better theory!
Guest

### Re: What types of Diophantine equations are unsolvable?

Do we choose Rabbit Hole A: $$\beta < 0$$?

Or do we choose Rabbit Hole B: $$0 < \beta < 1$$?

Or do we choose Rabbit Hole C: $$\beta > 1$$?

Hmm. We are clueless.
Guest

### Re: What types of Diophantine equations are unsolvable?

Guest wrote:Do we choose Rabbit Hole A: $$\beta < 0$$?

Or do we choose Rabbit Hole B: $$0 < \beta < 1$$?

Or do we choose Rabbit Hole C: $$\beta > 1$$?

Hmm. We are clueless.

It is not a hopeless situation. Thank God! Amen!

Keywords: Initial values, Criteria, Newton's Method (Jacobian), Convergent sequence...

Can we select initial values, $$x_{0 }, y_{0 } \in \mathbb{Z}$$, based on some criteria (unknown) that will help us to choose the best Rabbit Hole to explore?

Equation 0: $$\beta_{0 } = \frac{y_{0 }}{x_{0 }} \in \mathbb{Q}$$ ...

Relevant Reference Link: 'Are Diophantine equations in four variables solvable?'

https://www.math10.com/forum/viewtopic.php?f=63&t=7803.
Guest

### Re: What types of Diophantine equations are unsolvable?

An Update:

Do we choose Rabbit Hole A: $$\beta < -1$$?

Or do we choose Rabbit Hole B: $$-1 < \beta < 0$$?

Or do we choose Rabbit Hole C: $$0 < \beta < 1$$?

Or do we choose Rabbit Hole D: $$\beta > 1$$?

Hmm. There may be no solutions for each Rabbit Hole. Or there may be solutions for each Rabbit Hole. How many solutions? Who knows?

But we believe there are finitely many solutions (if they exist) for Rabbit Holes, A, C, and D. Why?

Therefore, the best Rabbit Hole to explore for possible solutions is Rabbit Hole B since it has the most possible solutions. Why?
Guest

### Re: What types of Diophantine equations are unsolvable?

An Update:

"Simple seeks simplest (best) solution."

A Specific Example:

Question: Can we solve the following Diophantine equation,

$$x^{7} + x^{6}y + x^{5}y^{2} + x^{4}y^{3}+ x^{3}y^{4}+ x^{2}y^{5}+ xy^{6} + y^{7} =234,567,890,123$$ for some $$x \ne y \in \mathbb{Z}$$?

Let s = $$\sum_{i=1}^{7} \beta^{i} + 1$$ for some $$\beta \in \mathbb{Q}$$ such that $$-1 < \beta < 0$$.

Question 1: Does $$y = (\frac{234,567,890,123}{s})^{ \frac{1}{7} } \in \mathbb{Z}$$?

Question 2: Does $$x = \beta y \in \mathbb{Z}$$?

If our questions, one and two, have affirmative answers, then we can solve our equation, otherwise, we cannot solve it. Right?

What is the algorithm that answers our question in polynomial time or less than polynomial time?

'Are Diophantine equations in four variables solvable?'

https://www.math10.com/forum/viewtopic.php?f=63&t=7803.
Guest

Next