Diophantine Equation with no solutions

  • A
  • Thread starter e2m2a
  • Start date
In summary, the question is whether the Diophantine equation C^u = A^u + B^s, where u = 2s, has a solution for all values of s. It has been proven that for s = 1, there is a solution with integers. However, for s > 1, there is no solution with integers due to Fermat's last theorem. This remains true for all other positive integer values of s, except for 1.
  • #1
e2m2a
354
11
Does anyone know if this Diophantine equation is impossible to solve for all values of s?

C^u = A^u + B^s, where u = 2s

For example, is there no integer solution for C,A, and B for the following:

C^22 = A^22 + B^11
 
Mathematics news on Phys.org
  • #2
It is possible to solve ##C^2 = A^2 + B ## with integers for s = 1
 
  • #3
But what about for s > 1? Are there no solutions and if so, is there a proof for this?
 
  • #4
Are the restrictions going to come in one at a time or is there a complete problem description ?
'Integers' is quite a bit more than 'natural numbers > 2' ##\qquad ## [edit] ##\ge 2##
 
Last edited:
  • #5
BvU said:
Are the restrictions going to come in one at a time or is there a complete problem description ?
'Integers' is quite a bit more than 'natural numbers > 2'
Interested only in positive integers or natural numbers for s > 1,
 
  • #6
A solution to C22 = A22 + B11 would be a solution to D11 = E11 + B11 where D = C2 and E = A2, which is impossible per Fermat's last theorem. Similar for all other positive integers s apart from 1.
 
  • Like
Likes BvU
  • #7
mfb said:
A solution to C22 = A22 + B11 would be a solution to D11 = E11 + B11 where D = C2 and E = A2, which is impossible per Fermat's last theorem. Similar for all other positive integers s apart from 1.
Ok. That makes sense. Thanks.
 

1. What is a Diophantine Equation with no solutions?

A Diophantine Equation with no solutions is a polynomial equation in two or more variables with integer coefficients, where no set of integers can satisfy the equation. This means that there is no solution that exists for the equation.

2. How do you know if a Diophantine Equation has no solutions?

A Diophantine Equation with no solutions can be identified by using various methods such as the Rational Root Theorem, the Fundamental Theorem of Arithmetic, or by using modular arithmetic. If no set of integers can satisfy the equation, then it has no solutions.

3. Can a Diophantine Equation with no solutions ever have a solution?

No, a Diophantine Equation with no solutions will never have a solution. This is because the equation is specifically designed to have no set of integers that can satisfy it.

4. What are some real-world applications of Diophantine Equations with no solutions?

Diophantine Equations with no solutions have applications in cryptography, specifically in the field of public-key cryptography. They are also used in coding theory and in the study of elliptic curves.

5. Are there any famous Diophantine Equations with no solutions?

Yes, there are several famous Diophantine Equations with no solutions, including Fermat's Last Theorem, which states that there are no positive integer solutions to the equation a^n + b^n = c^n for n > 2. Another famous example is the Beal Conjecture, which states that there are no positive integer solutions to the equation a^x + b^y = c^z for x, y, z > 2.

Similar threads

Replies
4
Views
697
  • General Math
Replies
3
Views
975
Replies
3
Views
809
  • Calculus and Beyond Homework Help
Replies
4
Views
1K
Replies
12
Views
7K
  • General Math
Replies
11
Views
1K
Replies
1
Views
799
  • General Math
Replies
21
Views
2K
Replies
1
Views
861
Back
Top