Help with Solving Diophantine Equations: Is Brute-Force the Only Option?

  • Thread starter Thread starter jobsism
  • Start date Start date
jobsism
Messages
115
Reaction score
0
EDIT:- My question earlier was in error. I've edited the question accordingly and my required set of Diophantine equations is the one given below:-

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, d > 0 are all DISTINCT positive integers and a, b, c \notin {2, 9, 15, 16, 33, 34}.

How does one go about solving this? Is brute-force the only possible way? Or could there be a case that no integer solutions exist for this equation?

Also, are there any online computing engines, that allow me to set constraints, and solve Diophantine equations of this sort?

Any and all help is appreciated! Thanks!
 
Last edited:
Mathematics news on Phys.org
hi jobsism! :smile:

let's go for the easy equation …

a3 - b3 = 721 …

doesn't that make it obvious what a and b must be? :wink:
 
tiny-tim said:
a3 - b3 = 721 …

doesn't that make it obvious what a and b must be? :wink:

Don't you mean b^3 - a^3 = 721, tiny-tim? :smile:

Your method is standard, but it requires checking and cross-checking for quite a number of values.

To the OP: In case you didn't get tiny-tim's hint, what he's trying to say is that b^3 - a^3 = 721 gives (b-a)(a^2 + ab + b^2) = 7x103, and so (b-a) \in {1,7,103,721}. Then you compute a and b for each of these values, get the corresponding d values, and plug it in the equation, c^3 +4104 = d. This is a rather tedious method in my opinion, but it would work.

However, I suggest a slightly easier approach. First, notice that for any solution, b^3 - a^3≥(a+1)^3 - a^3 = 3a^2 + 3a + 1. This gives a direct upper bound on a, namely 15. Now, checking for which of a = 1,2,3,...15, one has that a^3 + 721 is the third power of an integer, one finds that this is only the case for a=2 and a=15 (where b would be 9 and 16 respectively).

Both the above solutions are rejected, as per your constraints. So already, your first two equations do not have any solutions.
 
Hi Ryuzaki! :smile:
Ryuzaki said:
To the OP: In case you didn't get tiny-tim's hint, what he's trying to say is that b^3 - a^3 = 721 gives (b-a)(a^2 + ab + b^2) = 7x103, and so (b-a) \in {1,7,103,721}. Then you compute a and b for each of these values, get the corresponding d values, and plug it in the equation, c^3 +4104 = d. This is a rather tedious method in my opinion, but it would work.

Slightly easier would be eg if b - a = 1, then (b - a)2 - 3ab = 721, so 3ab = 720, ab = 240, (a,b) = (15,16), which the question doesn't allow :wink:
 
Insights auto threads is broken atm, so I'm manually creating these for new Insight articles. In Dirac’s Principles of Quantum Mechanics published in 1930 he introduced a “convenient notation” he referred to as a “delta function” which he treated as a continuum analog to the discrete Kronecker delta. The Kronecker delta is simply the indexed components of the identity operator in matrix algebra Source: https://www.physicsforums.com/insights/what-exactly-is-diracs-delta-function/ by...
Fermat's Last Theorem has long been one of the most famous mathematical problems, and is now one of the most famous theorems. It simply states that the equation $$ a^n+b^n=c^n $$ has no solutions with positive integers if ##n>2.## It was named after Pierre de Fermat (1607-1665). The problem itself stems from the book Arithmetica by Diophantus of Alexandria. It gained popularity because Fermat noted in his copy "Cubum autem in duos cubos, aut quadratoquadratum in duos quadratoquadratos, et...
I'm interested to know whether the equation $$1 = 2 - \frac{1}{2 - \frac{1}{2 - \cdots}}$$ is true or not. It can be shown easily that if the continued fraction converges, it cannot converge to anything else than 1. It seems that if the continued fraction converges, the convergence is very slow. The apparent slowness of the convergence makes it difficult to estimate the presence of true convergence numerically. At the moment I don't know whether this converges or not.
Back
Top