Solving Diophantine Equations Using CRT

  • Thread starter ascheras
  • Start date
In summary, the problem involves finding all solutions for two equations in the form of mod 35. This can be broken down into two separate equations in mod 5 and mod 7, which can be solved to get (2,1) and (3,4) respectively. Then, using the Chinese Remainder Theorem, the solutions for x and y can be obtained as x ≡ 17 (mod 35) and y ≡ 11 (mod 35).
  • #1
ascheras
14
0
ok, so I've never done a problem like this one before:

find all solutions:

24x + 11y == 4 (mod 35)
5x + 7y == -13 (mod 35).

This reduces to:
24x + 11y == 4 (mod 5)
5x + 7y == -13 (mod 5).

and
24x + 11y == 4 (mod 7)
5x + 7y == -13 (mod 7).

Solving the two, i get (2,1) and (3,4) respectively.
Do I now apply the CRT to get all the solutions?
 
Physics news on Phys.org
  • #2
I'm not quite sure about it, but I think that you should now solve these systems

x == 2 (mod5)
x == 3 (mod7)

which gives x == 17 (mod35)

and

y == 1 (mod5)
y == 4 (mod7)

which gives y == 11 (mod35)
 
  • #3
Yes, from the above, using CRT gives you :

[tex]x \equiv 17~(mod~35)~~y \equiv 11~(mod~35) [/tex]
 

1. What is a Diophantine equation?

A Diophantine equation is a polynomial equation where the solutions are required to be integer numbers. It is named after the ancient Greek mathematician Diophantus.

2. What are some examples of Diophantine equations?

Some examples of Diophantine equations are:
1) x + y = 10 (simple linear equation)
2) x^2 + y^2 = z^2 (Pythagorean triple equation)
3) x^3 + y^3 = z^3 (Fermat's Last Theorem)
4) x^3 + y^3 = 2z^3 (Euler's sum of powers conjecture)

3. What makes Diophantine equations difficult to solve?

Diophantine equations are difficult to solve because of the restriction that the solutions must be integers. This makes it challenging to find a general solution for all possible values of the variables. In addition, some Diophantine equations have no solutions, while others have infinitely many solutions.

4. How are Diophantine equations used in real-world problems?

Diophantine equations have many applications in cryptography, coding theory, and number theory. They are also used in various fields of science and engineering to model and solve problems that involve discrete quantities, such as in logistics, scheduling, and optimization.

5. What are some famous unsolved Diophantine equations?

One of the most famous unsolved Diophantine equations is Fermat's Last Theorem, which states that there are no positive integer solutions to the equation xn + yn = zn for n > 2. Another well-known unsolved equation is the Beal Conjecture, which states that there are no positive integer solutions to the equation xn + yn = z^m for x, y, z, m > 2 and n > 5.

Similar threads

  • Precalculus Mathematics Homework Help
Replies
10
Views
1K
  • Calculus and Beyond Homework Help
Replies
4
Views
1K
  • Precalculus Mathematics Homework Help
Replies
1
Views
927
  • Calculus and Beyond Homework Help
Replies
2
Views
1K
  • Calculus and Beyond Homework Help
Replies
1
Views
1K
  • Set Theory, Logic, Probability, Statistics
Replies
12
Views
951
Replies
11
Views
2K
Replies
7
Views
7K
  • Introductory Physics Homework Help
Replies
3
Views
1K
  • Linear and Abstract Algebra
Replies
2
Views
771
Back
Top