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

  • Context: Graduate 
  • Thread starter Thread starter jobsism
  • Start date Start date
Click For Summary

Discussion Overview

The discussion revolves around solving a system of Diophantine equations involving distinct positive integers. Participants explore methods for finding solutions, including brute-force approaches and algebraic manipulations, while considering constraints on the integers involved.

Discussion Character

  • Exploratory
  • Technical explanation
  • Debate/contested
  • Mathematical reasoning

Main Points Raised

  • The original problem involves the equations a^3 + 40033 = d, b^3 + 39312 = d, and c^3 + 4104 = d, with the requirement that a, b, c, d are distinct positive integers not including certain values.
  • One participant suggests that the equation a^3 - b^3 = 721 provides a straightforward way to determine a and b, implying a direct relationship between them.
  • Another participant corrects the previous statement, suggesting that b^3 - a^3 = 721 should be considered instead, and outlines a method involving factorization to find potential values for a and b.
  • It is noted that checking values for a leads to the conclusion that only a=2 and a=15 yield integer solutions for b, which are not allowed due to the constraints.
  • Participants discuss the tedious nature of the proposed methods, with one suggesting that even simpler approaches lead to invalid solutions based on the constraints provided.

Areas of Agreement / Disagreement

Participants express differing views on the effectiveness of various methods for solving the equations. There is no consensus on a definitive solution or approach, and the discussion remains unresolved regarding the existence of valid integer solutions under the given constraints.

Contextual Notes

Participants note limitations in the methods discussed, including the need for extensive checking of values and the impact of constraints on potential solutions. The discussion highlights the complexity of solving Diophantine equations with specific conditions.

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:
 

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
30K
Replies
2
Views
2K
Replies
9
Views
4K
Replies
4
Views
2K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 14 ·
Replies
14
Views
3K