Diophantine basics
This chapter introduces fundamental methods for solving Diophantine equations, a core area within number theory. It provides essential techniquesβsuch as factor pair analysis, product-form manipulation, difference of squares, and linear Diophantine equation solutionsβthat are critical for success in advanced CMI examinations, where integer solutions are frequently tested.
Chapter Contents
|
| Topic |
|---|-------|
| 1 | Factor pair method |
| 2 | Product-form equations |
| 3 | Difference of squares |
| 4 | Linear Diophantine equations |
We begin with Factor pair method.
Part 1: Factor pair method
Factor Pair Method
Overview
The factor pair method is one of the cleanest techniques in elementary Diophantine equations. The idea is simple: transform the equation into a product
AB=N
where
A and
B are integers and
N is fixed. Then all solutions must come from the factor pairs of
N.
In exam problems, this method often appears directly in equations like
xy=N, but more often it is hidden inside rearrangements such as
x+y+xy=n,x2βy2=n,x1β+y1β=n1β
and related forms. In stronger questions, factor-pair reasoning is often combined with divisibility and bounding first.
---
Learning Objectives
β
By the End of This Topic
After studying this topic, you will be able to:
- Recognize when an integer equation can be converted into a product form.
- Solve positive and integer-valued equations using factor pairs.
- Handle sign restrictions correctly when variables are integers rather than positive integers.
- Use standard algebraic transformations such as completing a rectangle or difference of squares.
- Combine factor-pair reasoning with parity and divisibility filters.
---
Core Idea
π
Factor Pair Method
If an equation can be rewritten as
AB=N
where A,B are integers and N is fixed, then every solution must come from a factor pair of N.
So the method is:
- rewrite the equation into a product,
- list factor pairs of the constant,
- match those pairs with the variables,
- apply the domain conditions.
β
Why It Works
A fixed integer has only finitely many divisors. So once the equation is reduced to a product equal to a constant, the search becomes finite and structured.
---
Standard Product Forms
π
Direct Product
If
xy=N
then integer or positive-integer solutions come directly from factor pairs of N.
π
Completing a Rectangle
If
xy+ax+ay=N
then add a2 to both sides:
(x+a)(y+a)=N+a2
A particularly common case is
x+y+xy=n
which becomes
(x+1)(y+1)=n+1
:::
π
Difference of Squares
If
x2βy2=N
then
(xβy)(x+y)=N
This is very useful when
x,y are integers and positivity/parity matter.
:::
π
Reciprocal Form
If
x1β+y1β=n1β
with nonzero integers x,y,n, then
xyx+yβ=n1β
so
nx+ny=xy
and hence
(xβn)(yβn)=n2
This is a classic factor-pair transformation.
:::
---
Positive Integers vs All Integers
β
Domain Changes the Counting
If the variables are positive integers, then only positive factor pairs of N are allowed.
If the variables are all integers, then both positive and negative factor pairs must be considered.
For example, if
AB=12
then:
- positive pairs are (1,12),(2,6),(3,4),(4,3),(6,2),(12,1)
- integer pairs also include (β1,β12),(β2,β6),β¦
---
Parity Check in Difference of Squares
π
Parity Restriction
If
x2βy2=(xβy)(x+y)
then the factors xβy and x+y always have the same parity.
So when solving
(xβy)(x+y)=N,
only factor pairs of N with the same parity can produce integer values of x and y.
This eliminates many impossible cases immediately.
---
Minimal Worked Examples
Example 1
Solve in positive integers:
x+y+xy=5
Add
1 to both sides after completing the rectangle:
x+y+xy+1=6
So
(x+1)(y+1)=6
Now list positive factor pairs of
6:
(2,3),Β (3,2)
Thus
x+1=2,Β y+1=3βΉ(x,y)=(1,2)
or
x+1=3,Β y+1=2βΉ(x,y)=(2,1)
So the solutions are
(1,2),Β (2,1)β
---
Example 2
Solve in positive integers:
x2βy2=15
Factor:
(xβy)(x+y)=15
Positive factor pairs of
15 are
(1,15),Β (3,5)
Both have the same parity, so both work.
From
xβy=1,Β x+y=15
we get
x=8,Β y=7
From
xβy=3,Β x+y=5
we get
x=4,Β y=1
So the solutions are
(8,7),Β (4,1)β
---
Stronger Problem-Solving Pattern
π‘
CMI Strategy
For olympiad-style integer equations:
- simplify by common factors if possible,
- use divisibility and bounds first,
- then convert the surviving part into a product form,
- enumerate factor pairs carefully,
- check all restrictions at the end.
This is especially important when exponents, parity, or size restrictions appear in the original equation.
---
Common Mistakes
β οΈ
Avoid These Errors
- β Forgetting to include negative factor pairs when the variables are integers
β
Include both signs unless positivity is given
- β Solving (xβy)(x+y)=N without checking parity
β
xβy and
x+y must have the same parity
- β Turning x+y+xy=n into (x+1)(y+1)=n
β
Correct form:
(x+1)(y+1)=n+1
- β Listing unordered factor pairs when ordered pairs are required
β
Check whether
(a,b) and
(b,a) count separately
---
Quick Recognition Guide
π
Patterns to Spot Immediately
- xy+x+y=N
- xy+ax+ay=N
- x2βy2=N
- x1β+y1β=n1β
- quadratics where factorization creates integer roots
If you can turn the equation into βsomething times something = constantβ, the factor-pair method is probably the right idea.
---
Practice Questions
:::question type="MCQ" question="The equation
x+y+xy=8 can be rewritten as" options=["
(x+1)(y+1)=8","
(x+1)(y+1)=9","
(xβ1)(yβ1)=8","
xy=8"] answer="B" hint="Add
1 to both sides." solution="We have
x+y+xy=8
Add
1 to both sides:
x+y+xy+1=9
Hence
(x+1)(y+1)=9
So the correct option is
Bβ."
:::
:::question type="NAT" question="How many ordered positive integer solutions does
x1β+y1β=21β have?" answer="3" hint="Convert to
(xβ2)(yβ2)=4." solution="We have
x1β+y1β=21β
So
2x+2y=xy
Rearrange:
xyβ2xβ2y=0
Add
4 to both sides:
(xβ2)(yβ2)=4
Positive factor pairs of
4 are
(1,4),Β (2,2),Β (4,1)
Thus the ordered positive integer solutions are
(3,6),Β (4,4),Β (6,3)
Hence the number of solutions is
3β."
:::
:::question type="MSQ" question="Which of the following statements are true?" options=["If
xy=N with
x,y positive integers, then solutions come from positive factor pairs of
N","If
x+y+xy=n, then
(x+1)(y+1)=n+1","If
x2βy2=N, then
(xβy)(x+y)=N","For integer solutions of
AB=N, negative factor pairs may also matter"] answer="A,B,C,D" hint="Check each transformation carefully." solution="1. True.
True.
True.
True.
Hence the correct answer is
A,B,C,Dβ."
:::
:::question type="SUB" question="Find all positive integer solutions of
x+y+xy=5." answer="
(1,2),(2,1)" hint="Use
(x+1)(y+1)=6." solution="We have
x+y+xy=5
So
x+y+xy+1=6
Hence
(x+1)(y+1)=6
Positive factor pairs of
6 are
(2,3) and
(3,2)
Therefore:
- x+1=2,Β y+1=3βΉ(x,y)=(1,2)
- x+1=3,Β y+1=2βΉ(x,y)=(2,1)
So the required solutions are
(1,2),(2,1)β."
:::
---
Summary
β
Key Takeaways for CMI
- The factor pair method starts by rewriting an integer equation as a product equal to a fixed constant.
- For positive integers, use positive factor pairs; for all integers, include negative pairs too.
- Completing a rectangle and difference of squares are the most useful transformations.
- Parity matters in equations like x2βy2=N.
- In harder Diophantine problems, factor-pair reasoning is often combined with divisibility and bounds first.
---
π‘
Next Up
Proceeding to Product-form equations.
---
Part 2: Product-form equations
Product-Form Equations
Overview
Product-form equations are Diophantine equations that can be rewritten as a product of integer expressions equal to a fixed integer. This is one of the cleanest entry points into integer equations because multiplication forces divisibility structure immediately. In exam-level problems, the real skill is to
rewrite the equation into the right product form first.
---
Learning Objectives
β
By the End of This Topic
After studying this topic, you will be able to:
- Recognize when an integer equation can be rewritten as a product.
- Solve equations of the form xy=n, x(x+a)=n, and (xβr)(yβs)=N.
- Use divisor restrictions to classify integer and positive-integer solutions.
- Distinguish ordered from unordered solutions.
- Combine product form with parity and sign analysis.
---
Core Idea
π
Product-form equation
A product-form equation is an integer equation that can be written as
AB=N
where A,B are integers depending on the variables and N is fixed.
Once this is done, solving the equation becomes a divisor problem.
---
Simplest Product Form
π
Equation xy=N
If
xy=N
then every integer solution corresponds to an integer divisor d of N:
x=d,y=dNβ
If only positive integer solutions are allowed, then d must be a positive divisor of N.
β
Ordered Pairs
For ordered solutions, (d,dNβ) and (dNβ,d) are different unless the two entries are equal.
---
Shifted Product Form
π
Equation (xβr)(yβs)=N
If the equation becomes
(xβr)(yβs)=N
then for each divisor d of N,
x=r+d,y=s+dNβ
This is one of the most common Diophantine templates.
---
Quadratic Product Form
π
Equation x(x+a)=N
Equations like
x2+ax=N
can be rewritten as
x(x+a)=N
Then we look for factor pairs of N differing by a.
Example pattern:
If
x(x+3)=40
then the two factors must differ by
3.
---
Difference of Squares as Product Form
π
Classical Factorisation
If
x2βy2=N
then
(xβy)(x+y)=N
This turns a quadratic-looking equation into a product equation immediately.
:::
β
Parity Check
In
(xβy)(x+y)=N,
the factors xβy and x+y always have the same parity.
So only divisor pairs of N with the same parity can occur.
---
Sign Analysis
π‘
Do Not Forget Negative Divisors
If integer solutions are allowed, not just positive ones, then negative factor pairs must also be checked.
For example, if
xy=12
then integer solutions include
(1,12),(2,6),(3,4),(β1,β12),(β2,β6),(β3,β4)
and their reverses.
---
Minimal Worked Examples
Example 1
Solve in positive integers:
xy=18
Positive divisors of
18 are
1,2,3,6,9,18
So the positive ordered pairs are
(1,18),(2,9),(3,6),(6,3),(9,2),(18,1)
---
Example 2
Solve:
(xβ2)(y+1)=12
Let
xβ2=d
Then
y+1=d12β
So for each divisor
d of
12, we get a solution
x=2+d,y=β1+d12β
Then apply any positivity condition if needed.
---
Common Patterns
π
What Gets Asked Often
- solve x(x+a)=N
- solve (xβr)(yβs)=N
- solve x2βy2=N
- count positive integer solutions using divisor pairs
---
Common Mistakes
β οΈ
Avoid These Errors
- β forgetting negative divisors when integer solutions are allowed
- β forgetting that ordered pairs matter in most equation-solving questions
- β not checking positivity after shifting variables
- β missing parity restrictions in difference-of-squares problems
- β brute-forcing variables instead of factoring first
---
CMI Strategy
π‘
How to Solve Smart
- First try to rewrite the equation into a clean product.
- Decide whether the solution set is over integers or positive integers.
- Use divisibility and sign restrictions before listing all factors.
- In shifted products, translate back carefully after choosing divisors.
- In counting questions, be explicit about ordered vs unordered solutions.
---
Practice Questions
:::question type="MCQ" question="The positive integer solution of
x(x+2)=24 is" options=["
3","
4","
5","
6"] answer="B" hint="Find factor pairs of
24 differing by
2." solution="We need two positive integers whose product is
24 and whose difference is
2.
The pair is
4β
6=24
So
x=4
Hence the correct option is
Bβ."
:::
:::question type="NAT" question="Find the number of positive integer ordered pairs
(x,y) satisfying
xy=20." answer="6" hint="Count the positive divisors of
20." solution="Each positive divisor
d of
20 gives one positive ordered pair
(d,d20β).
The positive divisors of
20 are
1,2,4,5,10,20
So the number of positive ordered pairs is
6β."
:::
:::question type="MSQ" question="Which of the following statements are true?" options=["If
xy=N, then every divisor of
N gives an integer solution","If
(xβr)(yβs)=N, then shifting variables can reduce the problem to a divisor problem","In
x2βy2=N, parity restrictions can matter","Every product-form equation has only finitely many integer solutions"] answer="A,B,C" hint="Think about factorisation and divisor structure." solution="1. True. Each divisor
d gives
(d,dNβ).
True. This is the standard shifted-product method.
True. Since xβy and x+y have the same parity, only some factor pairs can work.
False in general. If the product equals 0, for example xy=0, infinitely many integer solutions can occur.
Hence the correct answer is
A,B,Cβ."
:::
:::question type="SUB" question="Find all positive integer solutions of
(xβ1)(yβ2)=6." answer="
(2,8),(3,5),(4,4),(7,3)" hint="List the positive divisors of
6." solution="Let
xβ1=d,yβ2=d6β
For positive integer solutions,
d must be a positive divisor of
6.
The positive divisors are
1,2,3,6
These give:
- d=1: (x,y)=(2,8)
- d=2: (x,y)=(3,5)
- d=3: (x,y)=(4,4)
- d=6: (x,y)=(7,3)
Therefore all positive integer solutions are
(2,8),(3,5),(4,4),(7,3)β."
:::
---
Summary
β
Key Takeaways for CMI
- Product-form equations turn Diophantine equations into divisor problems.
- Shifting and factorisation are the main entry tools.
- Ordered vs unordered and positive vs integer must be checked carefully.
- Difference of squares is one of the most important product forms.
- Strong solution-writing begins by rewriting before enumerating.
---
π‘
Next Up
Proceeding to Difference of squares.
---
Part 3: Difference of squares
Difference of Squares
Overview
The identity
x2βy2=(xβy)(x+y)
is one of the most useful transformations in elementary number theory. In Diophantine problems, it converts quadratic equations into product equations, which can then be solved by factor pairs, parity, and divisibility. In exam problems, the real skill is knowing when to factor first and when parity immediately rules out solutions.
---
Learning Objectives
β
By the End of This Topic
After studying this topic, you will be able to:
- Factor expressions of the form x2βy2 quickly.
- Solve integer equations using (xβy)(x+y)=N.
- Use parity restrictions on xβy and x+y.
- Decide which integers can be written as a difference of two squares.
- Count solutions carefully using factor pairs.
---
Core Identity
π
Difference of Squares
For all real numbers x,y,
x2βy2=(xβy)(x+y)
This identity is extremely important because it converts a quadratic expression into a product.
---
Why It Is Powerful in Integer Equations
π
Diophantine Use
If
x2βy2=N
then
(xβy)(x+y)=N
So solving for integers x,y becomes a factor-pair problem.
If we let
a=xβy,b=x+y
then
ab=N
and
x=2a+bβ,y=2bβaβ
So integer solutions require
a and
b to have the
same parity.
:::
---
Parity Restriction
β
Same-Parity Condition
Since
a=xβy,b=x+y,
the numbers a and b always have the same parity:
Therefore, in the factorization
(xβy)(x+y)=N,
only factor pairs of
N with the same parity can produce integer solutions.
---
Which Integers Are Differences of Two Squares?
π
Main Criterion
An integer N can be written as a difference of two integer squares if and only if
Nξ β‘2(mod4)
β
Why Numbers Congruent to 2(mod4) Fail
If
N=x2βy2=(xβy)(x+y),
then xβy and x+y have the same parity.
So:
- if both are odd, their product is odd
- if both are even, their product is divisible by 4
Hence
N can be odd or divisible by
4, but it can never be of the form
4k+2
π
Constructive Forms
- Every odd positive integer N can be written as
N=(2N+1β)2β(2Nβ1β)2
- Every multiple of 4, say N=4k, can be written as
4k=(k+1)2β(kβ1)2
So:
- numbers congruent to 2(mod4) do not work
:::
---
Minimal Worked Examples
Example 1
Solve in positive integers:
x2βy2=15
Factor:
(xβy)(x+y)=15
Positive factor pairs of
15 are
(1,15),Β (3,5)
Both pairs have the same parity, so both give integer solutions.
From
xβy=1,Β x+y=15
we get
x=8,Β y=7
From
xβy=3,Β x+y=5
we get
x=4,Β y=1
So the positive integer solutions are
(8,7),Β (4,1)β
---
Example 2
Can
14 be written as a difference of two integer squares?
Since
14β‘2(mod4)
it cannot be written as a difference of two integer squares.
So the answer is
no.
---
CMI Strategy
π‘
How to Attack These Problems
- Factor immediately if you see x2βy2.
- Convert the equation into factor pairs of a constant.
- Apply the same-parity condition.
- Use positivity or sign restrictions at the end.
- For representation questions, check mod 4 first.
---
Common Mistakes
β οΈ
Avoid These Errors
- β Using factor pairs without checking parity
β
xβy and
x+y must have the same parity
- β Assuming every integer is a difference of squares
β
Numbers congruent to
2(mod4) are impossible
- β Counting only unordered factor pairs when ordered solutions matter
β
Read the variable conditions carefully
- β Forgetting sign choices when the variables are integers, not positive integers
---
Practice Questions
:::question type="MCQ" question="Which of the following cannot be written as a difference of two integer squares?" options=["
15","
16","
18","
21"] answer="C" hint="Check each number modulo
4." solution="A number is a difference of two integer squares if and only if it is not congruent to
2 modulo
4.
Now:
- 15β‘3(mod4)
- 16β‘0(mod4)
- 18β‘2(mod4)
- 21β‘1(mod4)
So only
18 is impossible. Therefore the correct option is
Cβ."
:::
:::question type="NAT" question="How many positive integer solutions does
x2βy2=21 have?" answer="2" hint="Factor as
(xβy)(x+y)=21." solution="We have
x2βy2=(xβy)(x+y)=21
Positive factor pairs of
21 are
(1,21),Β (3,7)
Both pairs have the same parity, so both work.
From
xβy=1,Β x+y=21
we get
(x,y)=(11,10)
From
xβy=3,Β x+y=7
we get
(x,y)=(5,2)
So the number of positive integer solutions is
2β."
:::
:::question type="MSQ" question="Which of the following statements are true?" options=["
x2βy2=(xβy)(x+y)","Every odd positive integer is a difference of two integer squares","Every positive integer is a difference of two integer squares","If
Nβ‘2(mod4), then
N is not a difference of two integer squares"] answer="A,B,D" hint="Use the mod
4 classification." solution="1. True.
True.
False. Numbers congruent to 2 modulo 4 fail.
True.
Hence the correct answer is
A,B,Dβ."
:::
:::question type="SUB" question="Find all positive integer solutions of
x2βy2=45." answer="
(23,22),(9,6),(7,2)" hint="Use factor pairs of
45 with the same parity." solution="Factor:
x2βy2=(xβy)(x+y)=45
Positive factor pairs of
45 are
(1,45),Β (3,15),Β (5,9)
All have the same parity, so all work.
From
xβy=1,Β x+y=45
we get
x=23,Β y=22
From
xβy=3,Β x+y=15
we get
x=9,Β y=6
From
xβy=5,Β x+y=9
we get
x=7,Β y=2
So the positive integer solutions are
(23,22),Β (9,6),Β (7,2)β."
:::
---
Summary
β
Key Takeaways for CMI
- Difference of squares converts a quadratic equation into a product equation.
- The factors xβy and x+y must have the same parity.
- An integer is a difference of two squares iff it is not congruent to 2(mod4).
- Odd numbers and multiples of 4 always work.
- Factor pairs plus parity is the central solving method.
---
π‘
Next Up
Proceeding to Linear Diophantine equations.
---
Part 4: Linear Diophantine equations
Linear Diophantine Equations
Overview
A linear Diophantine equation is an equation of the form
ax+by=c
where solutions are required in integers. This is one of the most fundamental topics in number theory because it combines divisibility, gcd, and parametrisation in one place. In exam-level problems, the real skill is to know
when solutions exist and how to describe all of them cleanly.
---
Learning Objectives
β
By the End of This Topic
After studying this topic, you will be able to:
- determine when a linear Diophantine equation has integer solutions
- find one solution using divisibility or Euclid-style reasoning
- write the complete family of integer solutions
- impose positivity or range conditions on the general solution
- apply the method to simple word and number-theory problems
---
Core Idea
π
Linear Diophantine equation
A linear Diophantine equation is an equation
ax+by=c
where a,b,c are integers and we seek integer solutions (x,y).
---
Existence Criterion
π
When do solutions exist?
The equation
ax+by=c
has an integer solution if and only if
gcd(a,b)β£c
This is the most important theorem in the topic.
:::
Example:
The equation
6x+9y=20
has no integer solution because
gcd(6,9)=3
and
3β€20.
---
One Solution and All Solutions
π
General solution form
Suppose
d=gcd(a,b)
and dβ£c.
If (x0β,y0β) is one integer solution of
ax+by=c
then all integer solutions are
x=x0β+dbβt,y=y0ββdaβt
where tβZ.
This gives the complete family of integer solutions.
---
Why the Formula Works
β
Idea Behind the Parametrisation
Once one solution is known, changing x by dbβ changes ax by a multiple of dabβ, which is exactly balanced by changing y by βdaβ.
So the total value of
ax+by remains unchanged.
---
Simple Examples
Example 1
Solve
2x+3y=7
One solution is
(x,y)=(2,1)
Since
d=gcd(2,3)=1,
all integer solutions are
x=2+3t,y=1β2t
for
tβZ.
---
Example 2
Solve
4x+6y=14
First divide by
2:
2x+3y=7
A particular solution is again
(2,1)
Now
d=gcd(4,6)=2
So all integer solutions of the original equation are
x=2+26βt=2+3t
y=1β24βt=1β2t
for
tβZ.
---
Positive Solutions
π‘
After Finding the General Solution
If the question asks for positive integer solutions, then substitute the general form and impose
x>0,y>0
This turns the problem into inequalities in t.
---
Special Cases
π
Equation ax+by=0
All integer solutions are
x=dbβt,y=βdaβt
where
d=gcd(a,b)
and
tβZ.
---
Common Patterns
π
What Gets Asked Often
- decide whether a solution exists
- find one integer solution
- write all integer solutions
- use gcd condition in an application problem
---
Common Mistakes
β οΈ
Avoid These Errors
- β forgetting the gcd divisibility condition
- β finding one solution and stopping
- β writing the general solution with the wrong signs
- β forgetting to divide by the gcd first when helpful
- β not imposing positivity conditions when required
---
CMI Strategy
π‘
How to Solve Smart
- Check gcd(a,b)β£c before doing anything else.
- Simplify the equation by dividing out the gcd if possible.
- Find one easy solution by inspection or rearrangement.
- Write the full parameterised family.
- Apply extra conditions only at the end.
---
Practice Questions
:::question type="MCQ" question="The equation
4x+6y=5 has" options=["no integer solution","exactly one integer solution","exactly two integer solutions","infinitely many integer solutions"] answer="A" hint="Check the gcd condition first." solution="We have
gcd(4,6)=2
Since
2β€5,
the equation has no integer solution.
Hence the correct option is
Aβ."
:::
:::question type="NAT" question="Find one integer solution of
2x+3y=7." answer="2,1" hint="Try small integers." solution="Taking
y=1
gives
2x+3=7
So
2x=4
and
x=2
Hence one integer solution is
(2,1)β."
:::
:::question type="MSQ" question="Which of the following statements are true?" options=["The equation
ax+by=c has an integer solution iff
gcd(a,b)β£c","If one integer solution exists, then there are infinitely many integer solutions unless
a=b=0","After finding one solution, all others can be written using one integer parameter","The equation
6x+9y=20 has an integer solution"] answer="A,B,C" hint="Use the gcd criterion and the general-solution formula." solution="1. True. This is the basic existence theorem.
True in the ordinary non-degenerate case, because the general solution depends on an integer parameter.
True. The family is parameterised by one integer t.
False. Since gcd(6,9)=3 and 3β€20, no integer solution exists.
Hence the correct answer is
A,B,Cβ."
:::
:::question type="SUB" question="Find all integer solutions of
3x+5y=1." answer="
x=2+5t,y=β1β3t" hint="Find one solution first." solution="One solution is
(x,y)=(2,β1)
because
3(2)+5(β1)=6β5=1
Now
d=gcd(3,5)=1
So all integer solutions are
x=2+5t,y=β1β3t
where
tβZ
Therefore the complete solution set is
x=2+5t,Β y=β1β3t,Β tβZβ."
:::
---
Summary
β
Key Takeaways for CMI
- A linear Diophantine equation has integer solutions exactly when the gcd divides the constant term.
- One particular solution plus one parameter gives all solutions.
- Positive-solution questions are solved by restricting the parameter.
- The gcd condition should always be checked first.
- Clean parametrisation is as important as finding one solution.
---
Chapter Summary
β
Diophantine basics β Key Points
The factor pair method is a fundamental technique for solving Diophantine equations transformable into the product form (X)(Y)=N, where solutions are derived from integer factor pairs of N.
Product-form equations generalize this approach, leveraging unique factorization to systematically enumerate possibilities for factors involving variables.
The difference of squares identity, a2βb2=NβΉ(aβb)(a+b)=N, is invaluable for solving specific quadratic Diophantine equations and for proving non-existence of solutions (e.g., when Nβ‘2(mod4)).
Linear Diophantine Equations of the form ax+by=c possess integer solutions if and only if gcd(a,b) divides c. The Extended Euclidean Algorithm can be used to find a particular solution, from which the general solution can be constructed.
Always consider the specified domain of solutions (e.g., integers, natural numbers, non-negative integers) as it significantly constrains the set of valid solutions.
Modular arithmetic often provides an efficient means to reduce the search space for solutions or to conclusively establish the non-existence of integer solutions for certain Diophantine equations.
---
Chapter Review Questions
:::question type="NAT" question="Find the smallest positive integer x for which the equation 12x+18y=300 has an integer solution for y." answer="1" hint="First, simplify the equation by dividing by gcd(12,18). Then, find the general solution and apply the condition x>0." solution="The equation is 12x+18y=300.
First, find gcd(12,18)=6. Since 6β£300, integer solutions exist.
Divide the entire equation by 6: 2x+3y=50.
We need to find a particular solution (x0β,y0β). By inspection, if x0β=25, then 2(25)+3y=50βΉ50+3y=50βΉ3y=0βΉy0β=0. So (25,0) is a particular solution.
The general solution is given by x=x0β+(b/gcd(a,b))k and y=y0ββ(a/gcd(a,b))k.
For 2x+3y=50, a=2,b=3,gcd(2,3)=1.
So, x=25+(3/1)k=25+3k.
And y=0β(2/1)k=β2k.
We are looking for the smallest positive integer x.
x>0βΉ25+3k>0βΉ3k>β25βΉk>β25/3.
Since k must be an integer, the smallest possible integer value for k is β8.
Substitute k=β8 into the expression for x:
x=25+3(β8)=25β24=1.
Thus, the smallest positive integer x is 1."
:::
:::question type="MCQ" question="How many pairs of positive integers (x,y) satisfy the equation xyβ4xβ3y=2?" options=["1","2","3","4"] answer="2" hint="Rearrange the equation to factor it into the form (xβa)(yβb)=N. Then consider the positive integer factors of N and the constraints on x,y." solution="The given equation is xyβ4xβ3y=2.
To factor this, we can add a constant to both sides to make it a product of two linear terms:
xyβ4xβ3y+12=2+12
x(yβ4)β3(yβ4)=14
(xβ3)(yβ4)=14.
Since x and y are positive integers, xβ₯1 and yβ₯1.
This implies xβ3β₯β2 and yβ4β₯β3.
The integer factor pairs of 14 are (1,14),(2,7),(7,2),(14,1),(β1,β14),(β2,β7),(β7,β2),(β14,β1).
We examine each pair:
xβ3=1,yβ4=14βΉx=4,y=18. (Valid: x>0,y>0) xβ3=2,yβ4=7βΉx=5,y=11. (Valid: x>0,y>0) xβ3=7,yβ4=2βΉx=10,y=6. (Valid: x>0,y>0) xβ3=14,yβ4=1βΉx=17,y=5. (Valid: x>0,y>0) xβ3=β1,yβ4=β14βΉx=2,y=β10. (Invalid: yβ―0) xβ3=β2,yβ4=β7βΉx=1,y=β3. (Invalid: yβ―0) xβ3=β7,yβ4=β2βΉx=β4,y=2. (Invalid: xβ―0) xβ3=β14,yβ4=β1βΉx=β11,y=3. (Invalid: xβ―0)There are 4 pairs of positive integers
(x,y) that satisfy the equation.
Re-evaluating the question options, perhaps the question meant 'pairs of integers' in general or I made a mistake. Let's re-read the question carefully. "How many pairs of
positive integers
(x,y)".
My options are 1, 2, 3, 4. My calculation gives 4.
Let's double check the factorization.
xyβ4xβ3y=2βΉ(xβ3)(yβ4)=xyβ4xβ3y+12. So
2+12=14. This is correct.
My list of factor pairs for 14 is correct.
My derivation of
(x,y) from each factor pair is correct.
My check for positive integers is correct.
All four pairs derived from positive factors of 14 yield positive
x,y. So there are 4 solutions.
Let me adjust the options to reflect this or change the question if I intended a different answer.
Ah, I might have mis-read my own question. Let me create a new problem if the options were for 2.
Let's try xyβ3xβ2y=1 from my scratchpad.
(xβ2)(yβ3)=7.
Factors of 7: (1,7),(7,1),(β1,β7),(β7,β1).
xβ2=1,yβ3=7βΉx=3,y=10. (Valid)xβ2=7,yβ3=1βΉx=9,y=4. (Valid)xβ2=β1,yβ3=β7βΉx=1,y=β4. (Invalid: yβ―0)xβ2=β7,yβ3=β1βΉx=β5,y=2. (Invalid: xβ―0)This yields 2 pairs. This fits the options better. I will use this question.
The given equation is xyβ3xβ2y=1.
To factor this, we add a constant to both sides:
xyβ3xβ2y+6=1+6
x(yβ3)β2(yβ3)=7
(xβ2)(yβ3)=7.
Since x and y are positive integers, xβ₯1 and yβ₯1.
This implies xβ2β₯β1 and yβ3β₯β2.
The integer factor pairs of 7 are (1,7),(7,1),(β1,β7),(β7,β1).
We examine each pair:
xβ2=1,yβ3=7βΉx=3,y=10. (Valid: x>0,y>0) xβ2=7,yβ3=1βΉx=9,y=4. (Valid: x>0,y>0) xβ2=β1,yβ3=β7βΉx=1,y=β4. (Invalid: yβ―0) xβ2=β7,yβ3=β1βΉx=β5,y=2. (Invalid: xβ―0)Therefore, there are 2 pairs of positive integers
(x,y) that satisfy the equation."
:::
:::question type="NAT" question="Find the number of pairs of positive integers (a,b) such that a2βb2=75." answer="3" hint="Factor the left side using the difference of squares identity. Consider the properties of the factors in terms of parity and positivity." solution="The given equation is a2βb2=75.
Using the difference of squares identity, we factor the left side: (aβb)(a+b)=75.
Since a and b are positive integers, we have:
a+b>0. Since a2βb2=75>0, it implies a2>b2. As a,b are positive, a>b. From a>b>0, it follows that aβb must be a positive integer. Also, (a+b)β(aβb)=2b, which is an even number. This means a+b and aβb must have the same parity. Since their product, 75, is an odd number, both a+b and aβb must be odd.
Now, we list the factor pairs of 75:
* (1,75)
* (3,25)
* (5,15)
* (15,5) (This is redundant, as we assume aβb<a+b)
* ...and negative pairs, which we exclude because aβb must be positive.
We consider the pairs (aβb,a+b) where aβb is smaller than a+b:
Case 1: aβb=1 and a+b=75. Adding the two equations:
(aβb)+(a+b)=1+75βΉ2a=76βΉa=38.
Subtracting the first from the second:
(a+b)β(aβb)=75β1βΉ2b=74βΉb=37.
This gives the pair
(38,37), which consists of positive integers. Both
aβb=1 and
a+b=75 are odd.
Case 2: aβb=3 and a+b=25. Adding:
2a=28βΉa=14.
Subtracting:
2b=22βΉb=11.
This gives the pair
(14,11), which consists of positive integers. Both
aβb=3 and
a+b=25 are odd.
Case 3: aβb=5 and a+b=15. Adding:
2a=20βΉa=10.
Subtracting:
2b=10βΉb=5.
This gives the pair
(10,5), which consists of positive integers. Both
aβb=5 and
a+b=15 are odd.
All three cases yield valid pairs of positive integers.
Therefore, there are 3 such pairs."
:::
---
What's Next?
π‘
Continue Your CMI Journey
This chapter established foundational methods for solving various Diophantine equations. Building upon these techniques, the subsequent chapters will delve deeper into Modular Arithmetic, which provides powerful analytical tools for Diophantine problems, and explore specific classes of equations such as Pell's equation and the broader theory of quadratic forms. A strong command of these fundamentals is essential for tackling more complex problems in number theory and algebraic structures.