You are on page 1of 1

OmegaLearn.org Chapter 2.

Number Theory
Remark 2.5.14
To solve a general congruence of more than 2 congruences, just solve them 2 at a time
until you are left with just 1 congruence.

Video Link(s)
More on Modular Arithmetic

2.6 Diophantine Equations


Video Link(s)
Diophantine Equations

Definition 2.6.1. A Diophantine equation is a polynomial equation such that the only
solutions of interest are the integer ones (an integer solution is such that all the variables
have integer values).

Concept 2.6.2 (Strategies to Solve Diophantine Equations)


Here are some ideas on how to solve diophantine equations

• Take mods of different numbers. This is generally useful when you

1. Show there are no solutions to a Diophantine equation


2. Show that there are only a specific type of solution

• You can try to bound the possible values of different terms. This is generally useful
when there are a finite number of solutions to your Diophantine equations

• Factoring, using the various factorizations (see the algebra section on this), can
help find all the solutions

• Make substitutions to simplify your Diophantine equation

• Look for conditions on what must be multiples/divisors of your variables and


rewrite your Diophantine equation in terms of that

44

You might also like