A system of Diophantine equations combines multiple integer equations into one problem. The unknown variables must take integer values that satisfy all equations at the same time. A system may contain linear equations, nonlinear equations, or a mixture of both. For example, the system x + y = 7 and x − y = 1 has the integer solution x = 4 and y = 3. A solution of only one equation is not sufficient; it must satisfy every equation in the system. Linear systems can often be simplified using substitution, elimination, greatest common divisors, and divisibility conditions. Modular arithmetic is particularly useful for proving that a system has no integer solution. Nonlinear systems may require factorization, inequalities, identities, or special number-theoretic results. The complete investigation may involve proving that a proposed solution exists, determining whether it is unique, or finding every possible integer solution.
Systems of Diophantine Equations
A system of Diophantine equations consists of two or more equations that must be satisfied simultaneously by the same integer variables. Solutions are integer tuples satisfying every equation in the system.
P₁(x₁, ..., xₖ) = 0, P₂(x₁, ..., xₖ) = 0, ..., Pₘ(x₁, ..., xₖ) = 0, where x₁, ..., xₖ ∈ ℤ
Explanation
Variables
P₁, P₂, ..., Pₘ
Polynomial expressions defining the equations in the system.
X₁, ..., xₖ
Unknown integer variables shared by the equations.
M
The number of equations.
K
The number of unknown variables.
Example or application
Problem
Solve the system x + y = 11 and x − y = 3 in integers.
Solution
Add the equations to eliminate y: 2x = 14, so x = 7. Substitute x = 7 into x + y = 11 to obtain y = 4. Both values are integers and satisfy both original equations.
Answer
(x, y) = (7, 4)
Text
The main challenge in a system of Diophantine equations is satisfying all equations while respecting the integer restriction. Methods that solve ordinary algebraic systems may produce fractional solutions, so additional divisibility and integer checks are essential.
Key Points
A system contains at least two equations involving common unknown variables.
Every equation must be satisfied by the same integer tuple.
A solution to one equation alone is not necessarily a solution to the system.
Linear systems can often be approached using substitution or elimination.
Divisibility and modular arithmetic can eliminate impossible cases.
Nonlinear systems may require factorization or specialized number-theoretic arguments.
A complete solution should establish whether the solution set is empty, finite, or infinite.
Properties
The solution set of a system is the intersection of the solution sets of its individual equations.
A system may have no integer solutions even when every individual equation has integer solutions.
A system may have one, finitely many, or infinitely many integer solutions.
Adding or subtracting equations can eliminate variables.
Congruence conditions can restrict possible values of variables.
Every proposed solution must be checked in every original equation.
Methods
| Name | Description |
|---|---|
Substitution | Express one variable in terms of another and substitute the expression into the remaining equations. |
Elimination | Combine equations to eliminate one or more variables. |
Divisibility Analysis | Use common divisors of coefficients and constants to determine whether integer solutions are possible. |
Modular Arithmetic | Reduce equations modulo a suitable integer to identify restrictions or contradictions. |
Factorization | Rewrite nonlinear expressions as products to investigate possible integer factors. |
Applications
Solving simultaneous whole-number quantity problems.
Investigating integer coordinate relationships.
Solving systems involving divisibility and remainders.
Studying intersections of algebraic curves at integer points.
Analyzing mathematical constraints in combinatorial problems.
Learning Outcomes
Define a system of Diophantine equations.
Solve simple linear systems in integers.
Use elimination and substitution to simplify systems.
Apply divisibility and modular arithmetic to integer systems.
Verify that a solution satisfies every equation.
Practice Questions
Solve x + y = 13 and x − y = 5 in integers.
Determine whether x + y = 6 and 2x + 2y = 15 can have an integer solution.
Solve 2x + y = 11 and x + 2y = 10.
Explain why a solution of only one equation is insufficient.
Describe how modular arithmetic can prove that a system has no integer solution.
Find all integer solutions, if any, of x² + y² = 25 and x + y = 7.
Related Concepts
Diophantine Equations
Linear Diophantine Equations
Modular Arithmetic
Divisibility
Integer Constraints
Nonlinear Diophantine Equations
Common Mistakes
Checking a proposed solution in only one equation.
Accepting fractional values when integer solutions are required.
Ignoring restrictions imposed by divisibility.
Assuming that solving each equation separately automatically solves the system.
Failing to distinguish between finding one solution and finding all solutions.
Sources and verification
Sources are shown as provided in the project data. Not every source has yet been independently verified. Please report errors or missing citations.
- David M. Burton, Elementary Number Theory
- Kenneth H. Rosen, Elementary Number Theory and Its Applications
- Titu Andreescu and Dorin Andrica, An Introduction to Diophantine Equations
Suggest a correction or source · More in Arithmetic & Number Theory