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

  • Context: Graduate 
  • 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:-

[tex]a^3 + 40033 = d[/tex] [tex]b^3 + 39312 = d[/tex] [tex]c^3 + 4104 = d[/tex], where [itex]a, b, c, d > 0[/itex] are all DISTINCT positive integers and [itex]a, b, c \notin[/itex] {[itex]2, 9, 15, 16, 33, 34[/itex]}.

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:
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 [itex]b^3 - a^3 = 721[/itex], 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 [itex]b^3 - a^3 = 721[/itex] gives [itex](b-a)(a^2 + ab + b^2) = 7[/itex]x[itex]103[/itex], and so [itex](b-a) \in[/itex] {[itex]1,7,103,721[/itex]}. Then you compute [itex]a[/itex] and [itex]b[/itex] for each of these values, get the corresponding [itex]d[/itex] values, and plug it in the equation, [itex]c^3 +4104 = d[/itex]. 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, [itex]b^3 - a^3≥(a+1)^3 - a^3 = 3a^2 + 3a + 1[/itex]. This gives a direct upper bound on [itex]a[/itex], namely [itex]15[/itex]. Now, checking for which of [itex]a = 1,2,3,...15[/itex], one has that [itex]a^3 + 721[/itex] is the third power of an integer, one finds that this is only the case for [itex]a=2[/itex] and [itex]a=15[/itex] (where [itex]b[/itex] would be [itex]9[/itex] and [itex]16[/itex] 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 [itex]b^3 - a^3 = 721[/itex] gives [itex](b-a)(a^2 + ab + b^2) = 7[/itex]x[itex]103[/itex], and so [itex](b-a) \in[/itex] {[itex]1,7,103,721[/itex]}. Then you compute [itex]a[/itex] and [itex]b[/itex] for each of these values, get the corresponding [itex]d[/itex] values, and plug it in the equation, [itex]c^3 +4104 = d[/itex]. 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:
 

Similar threads

  • · Replies 6 ·
Replies
6
Views
2K
  • · Replies 3 ·
Replies
3
Views
2K
  • · Replies 1 ·
Replies
1
Views
1K
  • · Replies 9 ·
Replies
9
Views
3K
  • · Replies 1 ·
Replies
1
Views
31K
Replies
2
Views
2K
Replies
9
Views
4K
Replies
4
Views
2K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 14 ·
Replies
14
Views
3K