Questions tagged [diophantine-equations]

Use for questions about finding integer or rational solutions to polynomial equations.

Use this tag for questions about finding integer, or perhaps rational, solutions to polynomial equations.

Diophantine equations are named after Diophantus of Alexandria, a third century Greek mathematician.

An example of a Diophantine equation is to find all quadruples of integers $(w,x,y,z)$ such that $$w^2+x^2=3(y^2+z^2).$$

Solving Diophantine equations often involves other areas of mathematics such as congruences, linear algebra, inequalities, forms (e.g., binary quadratic forms), and elliptic curves. Special solution methods include comparing divisors, considering orders of magnitude, Fermat's method of descent, and finding intersections of curves with lines of rational slope through a known rational point.

5324 questions
1
vote
0 answers

What is the relevance of studying the Markov Diophantine Equation And its Generalized Forms.

The relevance of the Markov equation and its Generalized forms are still a mystery to me. I cannot find anywhere online about the rational or relevance for studying the topic outside of pure curiosity. The Markov Diophantine equation…
1
vote
2 answers

Diophantine equation $x^3=a^2+b^2+c^2$

Does anyone know if a formula exists to obtain all solutions of the above Diophantine equation? All numbers integers. Addendum: After seeing the answer from Tito Piezas III, I reconsidered the above equation and came up with an original solution…
1
vote
0 answers

Is $\exists x,\ a_1, ... a_{n}$ $\in \mathbf{N}\ {\gt 0}$ such that $x^{n} = \sum_{i = 1}^{n} a_{i}^n$ true for any positive integer $n$?

Is $\exists x,\ a_1, ... a_{n}$ such that $x^{n} = \sum_{i = 1}^{n} a_{i}^n$ true for any positive integer $n$? Fermat's last theorem got me thinking if it's possible to split a hypercube of dimension $n$ with the length of each side being an…
Gabriel
  • 21
1
vote
0 answers

Solution - or proof of no solution - for sum of squares starting from 0 equaling a square

I noticed that $\sum_{i=0}^{24} i^2 = 70^2$. Are there any other solutions to $\sum_{i=0}^{n} i^2 = x^2$, besides the trivial cases where n and x are both 0 or 1? Or, is there a proof that no other solutions exist? I searched the OEIS and found…
1
vote
1 answer

Solve $\log_2(x+1)=⌊\log_2(x)⌋+1$ in positive integers

This question is related to: Find all positive integer solutions verifying two conditions Let us consider the following equation: $$\log_2(x+1)=⌊\log_2(x)⌋+1$$ $\log_2$ is the logarithm in base $2$ (https://www.vedantu.com/maths/log-base-2) and…
Safwane
  • 3,840
1
vote
1 answer

Continuing with Brahmagupta-Fibonacci identity...

Continuing for Brahmagupta-Fibonacci Identity... Find non-zero integers $a, b, x, y$ satisfy: \begin{cases} ax+by=\alpha \\ ay-bx=\beta \\ \end{cases} I also want various solutions to this kind of question. Again, I want many solutions, including…
RDK
  • 2,623
  • 1
  • 8
  • 30
1
vote
1 answer

Find all integers $x,y$ such that $x^5-x^3-x^2+1=y^2$

Find all integers $x,y$ such that $x^5-x^3-x^2+1=y^2$ I think we need to factor this out and I've managed to factor it to $(x-1)(x+1)^2(x^2-x+1)=y^2$, but I'm not sure what to do here. Have I done something wrong? Am I on the right path? Please…
1
vote
1 answer

How to solve in integers the equation $2x^2+x+2x^2y-y^2+y=1$?

Any hints? I could've reduced it to Pell's equation and solved it, if there wasn't $2x^2y$ part. This is a part of a bigger problem, and that's all I have left to solve the main one.
1
vote
1 answer

Diophantine equation for N variables

I'm sorry if this is a newbie question but I'm not sure how to approach it. I have a problem that I want to solve(by creating an algo) and I'm pretty sure its a Diophantine equation, but I'm not sure how to solve if there's more than a few…
Lostsoul
  • 419
1
vote
1 answer

How do I prove Diophantine equation has no solutions

In order to solve some bigger problem I need to prove that equation $$z^2+y^2=nx^2$$ where $ n=6 \; mod\;8$ and $x,y,z$ are all integers, doesn't have any non-zero solutions I was given a hint how to do it when $n=6$. Say we…
Nick
  • 21
1
vote
0 answers

Linear Diophantine Equation problem

The Secretary of the School Puzzle Solvers Society sends the Treasurer to the stationery shop to buy as many ballpoint pens and notebooks as she can lay her hands on. The price of a pen is $e2.45$ and the price of a notebook is $e1.60$. On her…
Sean3
  • 21
1
vote
0 answers

Are there coprime nonzero integers $u,v,w$ such that $2u(u^2+pv^2)=w^p$ where $p>3$?

Let $p$ be a prime. Let $u,v$ be coprime non zero integers,$w$ is an integer. Does the equation $$2u(u^2+pv^2)=w^p$$ always yield an infinite descent argument? For some primes like (3,7), it is evident. It does not look too evident to me for some…
1
vote
1 answer

How do I solve $x^3-x=12y+6$

This is what I have so far: $$x^3-x = 12y + 6$$ $$x(x+1)(x-1) = 2(6y+3)$$ The RHS of the equation is even, so therefore so must the LHS. Given that the three numbers on the LHS are consecutive, then we know $x$ is even and $(x-1)$ and $(x+1)$ are…
1
vote
2 answers

Solve Diophantine Equation

Show that $ x^3 - 6 = 25y^2 + 35y $ doesn't have any non-zero integer solution. What I have tried $$ 25y^2 + 35y - x^3 + 6 = 0 $$ solving for y we get $$ y = \frac{-35 \pm \sqrt { 625 + 100 x^3} } {50} $$ so I need to show that $$ 25 + 4x^3= z^2…
newbie
  • 65
1
vote
2 answers

Diophantine Equation:$a^3+40033=d$,$b^3+39312=d$,$ c^3+4104 = d$, $a,b,c>0$ are all distinct positive integers, and $a,b,c ∉ \{2, 9, 15, 16, 33, 34\}$

For a problem that I'm working on, I need to solve the following system of Diophantine equations:- $a^3+40033=d$, $b^3+39312=d$, $ c^3+4104 = d$ where $a,b,c>0$ are all DISTINCT positive integers, and $a,b,c$ ∉ {$ 2, 9, 15, 16, 33, 34$} How does one…
Train Heartnet
  • 2,534
  • 3
  • 25
  • 42