100% FREE Updated: Apr 2026 Number Theory Integer Equations

Diophantine basics

Comprehensive study notes on Diophantine basics for CMI BS Hons preparation. This chapter covers key concepts, formulas, and examples needed for your exam.

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\qquad AB = N where AA and BB are integers and NN is fixed. Then all solutions must come from the factor pairs of NN. In exam problems, this method often appears directly in equations like xy=Nxy=N, but more often it is hidden inside rearrangements such as x+y+xy=n,x2βˆ’y2=n,1x+1y=1n\qquad x+y+xy=n,\qquad x^2-y^2=n,\qquad \frac{1}{x}+\frac{1}{y}=\frac{1}{n} 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\qquad AB = N

where A,BA,B are integers and NN is fixed, then every solution must come from a factor pair of NN.

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\qquad xy = N

then integer or positive-integer solutions come directly from factor pairs of NN.

πŸ“ Completing a Rectangle

If

xy+ax+ay=N\qquad xy + ax + ay = N

then add a2a^2 to both sides:

(x+a)(y+a)=N+a2\qquad (x+a)(y+a) = N + a^2

A particularly common case is x+y+xy=n\qquad x+y+xy = n which becomes (x+1)(y+1)=n+1\qquad (x+1)(y+1) = n+1 :::
πŸ“ Difference of Squares

If

x2βˆ’y2=N\qquad x^2-y^2 = N

then

(xβˆ’y)(x+y)=N\qquad (x-y)(x+y) = N

This is very useful when x,yx,y are integers and positivity/parity matter. :::
πŸ“ Reciprocal Form

If

1x+1y=1n\qquad \frac{1}{x}+\frac{1}{y}=\frac{1}{n}

with nonzero integers x,y,nx,y,n, then

x+yxy=1n\qquad \frac{x+y}{xy}=\frac{1}{n}

so

nx+ny=xy\qquad nx+ny=xy

and hence

(xβˆ’n)(yβˆ’n)=n2\qquad (x-n)(y-n)=n^2

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 NN are allowed.

If the variables are all integers, then both positive and negative factor pairs must be considered.

For example, if

AB=12\qquad AB = 12

then:

    • positive pairs are (1,12),(2,6),(3,4),(4,3),(6,2),(12,1)(1,12),(2,6),(3,4),(4,3),(6,2),(12,1)

    • integer pairs also include (βˆ’1,βˆ’12),(βˆ’2,βˆ’6),…(-1,-12),(-2,-6),\dots

---

Parity Check in Difference of Squares

πŸ“ Parity Restriction

If

x2βˆ’y2=(xβˆ’y)(x+y)\qquad x^2-y^2 = (x-y)(x+y)

then the factors xβˆ’yx-y and x+yx+y always have the same parity.

So when solving

(xβˆ’y)(x+y)=N\qquad (x-y)(x+y)=N,

only factor pairs of NN with the same parity can produce integer values of xx and yy.

This eliminates many impossible cases immediately. ---

Minimal Worked Examples

Example 1 Solve in positive integers: x+y+xy=5\qquad x+y+xy=5 Add 11 to both sides after completing the rectangle: x+y+xy+1=6\qquad x+y+xy+1 = 6 So (x+1)(y+1)=6\qquad (x+1)(y+1)=6 Now list positive factor pairs of 66: (2,3),Β (3,2)\qquad (2,3),\ (3,2) Thus x+1=2,Β y+1=3β€…β€ŠβŸΉβ€…β€Š(x,y)=(1,2)\qquad x+1=2,\ y+1=3 \implies (x,y)=(1,2) or x+1=3,Β y+1=2β€…β€ŠβŸΉβ€…β€Š(x,y)=(2,1)\qquad x+1=3,\ y+1=2 \implies (x,y)=(2,1) So the solutions are (1,2),Β (2,1)\qquad \boxed{(1,2),\ (2,1)} --- Example 2 Solve in positive integers: x2βˆ’y2=15\qquad x^2-y^2=15 Factor: (xβˆ’y)(x+y)=15\qquad (x-y)(x+y)=15 Positive factor pairs of 1515 are (1,15),Β (3,5)\qquad (1,15),\ (3,5) Both have the same parity, so both work. From xβˆ’y=1,Β x+y=15\qquad x-y=1,\ x+y=15 we get x=8,Β y=7\qquad x=8,\ y=7 From xβˆ’y=3,Β x+y=5\qquad x-y=3,\ x+y=5 we get x=4,Β y=1\qquad x=4,\ y=1 So the solutions are (8,7),Β (4,1)\qquad \boxed{(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(x-y)(x+y)=N without checking parity
βœ… xβˆ’yx-y and x+yx+y must have the same parity
    • ❌ Turning x+y+xy=nx+y+xy=n into (x+1)(y+1)=n(x+1)(y+1)=n
βœ… Correct form: (x+1)(y+1)=n+1\qquad (x+1)(y+1)=n+1
    • ❌ Listing unordered factor pairs when ordered pairs are required
βœ… Check whether (a,b)(a,b) and (b,a)(b,a) count separately
---

Quick Recognition Guide

πŸ“ Patterns to Spot Immediately
    • xy=Nxy = N
    • xy+x+y=Nxy+x+y = N
    • xy+ax+ay=Nxy+ax+ay = N
    • x2βˆ’y2=Nx^2-y^2 = N
    • 1x+1y=1n\dfrac{1}{x}+\dfrac{1}{y}=\dfrac{1}{n}
    • 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=8x+y+xy=8 can be rewritten as" options=["(x+1)(y+1)=8(x+1)(y+1)=8","(x+1)(y+1)=9(x+1)(y+1)=9","(xβˆ’1)(yβˆ’1)=8(x-1)(y-1)=8","xy=8xy=8"] answer="B" hint="Add 11 to both sides." solution="We have x+y+xy=8\qquad x+y+xy=8 Add 11 to both sides: x+y+xy+1=9\qquad x+y+xy+1=9 Hence (x+1)(y+1)=9\qquad (x+1)(y+1)=9 So the correct option is B\boxed{B}." ::: :::question type="NAT" question="How many ordered positive integer solutions does 1x+1y=12\dfrac{1}{x}+\dfrac{1}{y}=\dfrac{1}{2} have?" answer="3" hint="Convert to (xβˆ’2)(yβˆ’2)=4(x-2)(y-2)=4." solution="We have 1x+1y=12\qquad \frac{1}{x}+\frac{1}{y}=\frac{1}{2} So 2x+2y=xy\qquad 2x+2y=xy Rearrange: xyβˆ’2xβˆ’2y=0\qquad xy-2x-2y=0 Add 44 to both sides: (xβˆ’2)(yβˆ’2)=4\qquad (x-2)(y-2)=4 Positive factor pairs of 44 are (1,4),Β (2,2),Β (4,1)\qquad (1,4),\ (2,2),\ (4,1) Thus the ordered positive integer solutions are (3,6),Β (4,4),Β (6,3)\qquad (3,6),\ (4,4),\ (6,3) Hence the number of solutions is 3\boxed{3}." ::: :::question type="MSQ" question="Which of the following statements are true?" options=["If xy=Nxy=N with x,yx,y positive integers, then solutions come from positive factor pairs of NN","If x+y+xy=nx+y+xy=n, then (x+1)(y+1)=n+1(x+1)(y+1)=n+1","If x2βˆ’y2=Nx^2-y^2=N, then (xβˆ’y)(x+y)=N(x-y)(x+y)=N","For integer solutions of AB=NAB=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\boxed{A,B,C,D}." ::: :::question type="SUB" question="Find all positive integer solutions of x+y+xy=5x+y+xy=5." answer="(1,2),(2,1)(1,2),(2,1)" hint="Use (x+1)(y+1)=6(x+1)(y+1)=6." solution="We have x+y+xy=5\qquad x+y+xy=5 So x+y+xy+1=6\qquad x+y+xy+1=6 Hence (x+1)(y+1)=6\qquad (x+1)(y+1)=6 Positive factor pairs of 66 are (2,3)\qquad (2,3) and (3,2)\qquad (3,2) Therefore:
    • x+1=2,Β y+1=3β€…β€ŠβŸΉβ€…β€Š(x,y)=(1,2)x+1=2,\ y+1=3 \implies (x,y)=(1,2)
    • x+1=3,Β y+1=2β€…β€ŠβŸΉβ€…β€Š(x,y)=(2,1)x+1=3,\ y+1=2 \implies (x,y)=(2,1)
    So the required solutions are (1,2),(2,1)\boxed{(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=Nx^2-y^2=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=nxy=n, x(x+a)=nx(x+a)=n, and (xβˆ’r)(yβˆ’s)=N(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\qquad AB=N

    where A,BA,B are integers depending on the variables and NN is fixed.

    Once this is done, solving the equation becomes a divisor problem.

    ---

    Simplest Product Form

    πŸ“ Equation xy=Nxy=N

    If

    xy=N\qquad xy=N

    then every integer solution corresponds to an integer divisor dd of NN:

    x=d,y=Nd\qquad x=d,\qquad y=\dfrac{N}{d}

    If only positive integer solutions are allowed, then dd must be a positive divisor of NN.

    ❗ Ordered Pairs

    For ordered solutions, (d,Nd)(d,\frac{N}{d}) and (Nd,d)(\frac{N}{d},d) are different unless the two entries are equal.

    ---

    Shifted Product Form

    πŸ“ Equation (xβˆ’r)(yβˆ’s)=N(x-r)(y-s)=N

    If the equation becomes

    (xβˆ’r)(yβˆ’s)=N\qquad (x-r)(y-s)=N

    then for each divisor dd of NN,

    x=r+d,y=s+Nd\qquad x=r+d,\qquad y=s+\dfrac{N}{d}

    This is one of the most common Diophantine templates.

    ---

    Quadratic Product Form

    πŸ“ Equation x(x+a)=Nx(x+a)=N

    Equations like

    x2+ax=N\qquad x^2+ax=N

    can be rewritten as

    x(x+a)=N\qquad x(x+a)=N

    Then we look for factor pairs of NN differing by aa.

    Example pattern: If x(x+3)=40\qquad x(x+3)=40 then the two factors must differ by 33. ---

    Difference of Squares as Product Form

    πŸ“ Classical Factorisation

    If

    x2βˆ’y2=N\qquad x^2-y^2=N

    then

    (xβˆ’y)(x+y)=N\qquad (x-y)(x+y)=N

    This turns a quadratic-looking equation into a product equation immediately. :::
    ❗ Parity Check

    In
    (xβˆ’y)(x+y)=N\qquad (x-y)(x+y)=N,
    the factors xβˆ’yx-y and x+yx+y always have the same parity.

    So only divisor pairs of NN 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\qquad xy=12
    then integer solutions include
    (1,12),(2,6),(3,4),(βˆ’1,βˆ’12),(βˆ’2,βˆ’6),(βˆ’3,βˆ’4)\qquad (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\qquad xy=18 Positive divisors of 1818 are 1,2,3,6,9,18\qquad 1,2,3,6,9,18 So the positive ordered pairs are (1,18),(2,9),(3,6),(6,3),(9,2),(18,1)\qquad (1,18),(2,9),(3,6),(6,3),(9,2),(18,1) --- Example 2 Solve: (xβˆ’2)(y+1)=12\qquad (x-2)(y+1)=12 Let xβˆ’2=d\qquad x-2=d Then y+1=12d\qquad y+1=\dfrac{12}{d} So for each divisor dd of 1212, we get a solution x=2+d,y=βˆ’1+12d\qquad x=2+d,\qquad y=-1+\dfrac{12}{d} Then apply any positivity condition if needed. ---

    Common Patterns

    πŸ“ What Gets Asked Often

    • solve xy=Nxy=N

    • solve x(x+a)=Nx(x+a)=N

    • solve (xβˆ’r)(yβˆ’s)=N(x-r)(y-s)=N

    • solve x2βˆ’y2=Nx^2-y^2=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)=24x(x+2)=24 is" options=["33","44","55","66"] answer="B" hint="Find factor pairs of 2424 differing by 22." solution="We need two positive integers whose product is 2424 and whose difference is 22. The pair is 4β‹…6=24\qquad 4\cdot 6=24 So x=4\qquad x=4 Hence the correct option is B\boxed{B}." ::: :::question type="NAT" question="Find the number of positive integer ordered pairs (x,y)(x,y) satisfying xy=20xy=20." answer="6" hint="Count the positive divisors of 2020." solution="Each positive divisor dd of 2020 gives one positive ordered pair (d,20d)\qquad \left(d,\dfrac{20}{d}\right). The positive divisors of 2020 are 1,2,4,5,10,20\qquad 1,2,4,5,10,20 So the number of positive ordered pairs is 6\boxed{6}." ::: :::question type="MSQ" question="Which of the following statements are true?" options=["If xy=Nxy=N, then every divisor of NN gives an integer solution","If (xβˆ’r)(yβˆ’s)=N(x-r)(y-s)=N, then shifting variables can reduce the problem to a divisor problem","In x2βˆ’y2=Nx^2-y^2=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 dd gives (d,Nd)(d,\frac{N}{d}).
  • True. This is the standard shifted-product method.
  • True. Since xβˆ’yx-y and x+yx+y have the same parity, only some factor pairs can work.
  • False in general. If the product equals 00, for example xy=0xy=0, infinitely many integer solutions can occur.
  • Hence the correct answer is A,B,C\boxed{A,B,C}." ::: :::question type="SUB" question="Find all positive integer solutions of (xβˆ’1)(yβˆ’2)=6(x-1)(y-2)=6." answer="(2,8),(3,5),(4,4),(7,3)(2,8),(3,5),(4,4),(7,3)" hint="List the positive divisors of 66." solution="Let xβˆ’1=d,yβˆ’2=6d\qquad x-1=d,\qquad y-2=\dfrac{6}{d} For positive integer solutions, dd must be a positive divisor of 66. The positive divisors are 1,2,3,6\qquad 1,2,3,6 These give:
    • d=1d=1: (x,y)=(2,8)\qquad (x,y)=(2,8)
    • d=2d=2: (x,y)=(3,5)\qquad (x,y)=(3,5)
    • d=3d=3: (x,y)=(4,4)\qquad (x,y)=(4,4)
    • d=6d=6: (x,y)=(7,3)\qquad (x,y)=(7,3)
    Therefore all positive integer solutions are (2,8),(3,5),(4,4),(7,3)\qquad \boxed{(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)\qquad x^2-y^2=(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βˆ’y2x^2-y^2 quickly.

    • Solve integer equations using (xβˆ’y)(x+y)=N(x-y)(x+y)=N.

    • Use parity restrictions on xβˆ’yx-y and x+yx+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,yx,y,

    x2βˆ’y2=(xβˆ’y)(x+y)\qquad x^2-y^2=(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\qquad x^2-y^2=N

    then

    (xβˆ’y)(x+y)=N\qquad (x-y)(x+y)=N

    So solving for integers x,yx,y becomes a factor-pair problem.

    If we let a=xβˆ’y,b=x+y\qquad a=x-y,\qquad b=x+y then ab=N\qquad ab=N and x=a+b2,y=bβˆ’a2\qquad x=\frac{a+b}{2},\qquad y=\frac{b-a}{2} So integer solutions require aa and bb to have the same parity. ::: ---

    Parity Restriction

    ❗ Same-Parity Condition

    Since

    a=xβˆ’y,b=x+y\qquad a=x-y,\qquad b=x+y,

    the numbers aa and bb always have the same parity:

      • both odd, or

      • both even.


    Therefore, in the factorization

    (xβˆ’y)(x+y)=N\qquad (x-y)(x+y)=N,

    only factor pairs of NN with the same parity can produce integer solutions.

    ---

    Which Integers Are Differences of Two Squares?

    πŸ“ Main Criterion

    An integer NN can be written as a difference of two integer squares if and only if

    N≑̸2(mod4)\qquad N \not\equiv 2 \pmod 4

    ❗ Why Numbers Congruent to 2(mod4)2 \pmod 4 Fail

    If
    N=x2βˆ’y2=(xβˆ’y)(x+y)\qquad N=x^2-y^2=(x-y)(x+y),
    then xβˆ’yx-y and x+yx+y have the same parity.

    So:

      • if both are odd, their product is odd

      • if both are even, their product is divisible by 44


    Hence NN can be odd or divisible by 44, but it can never be of the form

    4k+2\qquad 4k+2

    πŸ“ Constructive Forms

    • Every odd positive integer NN can be written as


    N=(N+12)2βˆ’(Nβˆ’12)2\qquad N=\left(\frac{N+1}{2}\right)^2-\left(\frac{N-1}{2}\right)^2

    • Every multiple of 44, say N=4kN=4k, can be written as


    4k=(k+1)2βˆ’(kβˆ’1)2\qquad 4k=(k+1)^2-(k-1)^2

    So:
    • odd numbers work
    • multiples of 44 work
    • numbers congruent to 2(mod4)2 \pmod 4 do not work
    ::: ---

    Minimal Worked Examples

    Example 1 Solve in positive integers: x2βˆ’y2=15\qquad x^2-y^2=15 Factor: (xβˆ’y)(x+y)=15\qquad (x-y)(x+y)=15 Positive factor pairs of 1515 are (1,15),Β (3,5)\qquad (1,15),\ (3,5) Both pairs have the same parity, so both give integer solutions. From xβˆ’y=1,Β x+y=15\qquad x-y=1,\ x+y=15 we get x=8,Β y=7\qquad x=8,\ y=7 From xβˆ’y=3,Β x+y=5\qquad x-y=3,\ x+y=5 we get x=4,Β y=1\qquad x=4,\ y=1 So the positive integer solutions are (8,7),Β (4,1)\qquad \boxed{(8,7),\ (4,1)} --- Example 2 Can 1414 be written as a difference of two integer squares? Since 14≑2(mod4)\qquad 14 \equiv 2 \pmod 4 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βˆ’y2x^2-y^2.

    • 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 44 first.

    ---

    Common Mistakes

    ⚠️ Avoid These Errors
      • ❌ Using factor pairs without checking parity
    βœ… xβˆ’yx-y and x+yx+y must have the same parity
      • ❌ Assuming every integer is a difference of squares
    βœ… Numbers congruent to 2(mod4)2 \pmod 4 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=["1515","1616","1818","2121"] answer="C" hint="Check each number modulo 44." solution="A number is a difference of two integer squares if and only if it is not congruent to 22 modulo 44. Now:
    • 15≑3(mod4)15 \equiv 3 \pmod 4
    • 16≑0(mod4)16 \equiv 0 \pmod 4
    • 18≑2(mod4)18 \equiv 2 \pmod 4
    • 21≑1(mod4)21 \equiv 1 \pmod 4
    So only 1818 is impossible. Therefore the correct option is C\boxed{C}." ::: :::question type="NAT" question="How many positive integer solutions does x2βˆ’y2=21x^2-y^2=21 have?" answer="2" hint="Factor as (xβˆ’y)(x+y)=21(x-y)(x+y)=21." solution="We have x2βˆ’y2=(xβˆ’y)(x+y)=21\qquad x^2-y^2=(x-y)(x+y)=21 Positive factor pairs of 2121 are (1,21),Β (3,7)\qquad (1,21),\ (3,7) Both pairs have the same parity, so both work. From xβˆ’y=1,Β x+y=21\qquad x-y=1,\ x+y=21 we get (x,y)=(11,10)\qquad (x,y)=(11,10) From xβˆ’y=3,Β x+y=7\qquad x-y=3,\ x+y=7 we get (x,y)=(5,2)\qquad (x,y)=(5,2) So the number of positive integer solutions is 2\boxed{2}." ::: :::question type="MSQ" question="Which of the following statements are true?" options=["x2βˆ’y2=(xβˆ’y)(x+y)x^2-y^2=(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)N\equiv 2 \pmod 4, then NN is not a difference of two integer squares"] answer="A,B,D" hint="Use the mod 44 classification." solution="1. True.
  • True.
  • False. Numbers congruent to 22 modulo 44 fail.
  • True.
  • Hence the correct answer is A,B,D\boxed{A,B,D}." ::: :::question type="SUB" question="Find all positive integer solutions of x2βˆ’y2=45x^2-y^2=45." answer="(23,22),(9,6),(7,2)(23,22),(9,6),(7,2)" hint="Use factor pairs of 4545 with the same parity." solution="Factor: x2βˆ’y2=(xβˆ’y)(x+y)=45\qquad x^2-y^2=(x-y)(x+y)=45 Positive factor pairs of 4545 are (1,45),Β (3,15),Β (5,9)\qquad (1,45),\ (3,15),\ (5,9) All have the same parity, so all work.
  • From
  • xβˆ’y=1,Β x+y=45\qquad x-y=1,\ x+y=45 we get x=23,Β y=22\qquad x=23,\ y=22
  • From
  • xβˆ’y=3,Β x+y=15\qquad x-y=3,\ x+y=15 we get x=9,Β y=6\qquad x=9,\ y=6
  • From
  • xβˆ’y=5,Β x+y=9\qquad x-y=5,\ x+y=9 we get x=7,Β y=2\qquad x=7,\ y=2 So the positive integer solutions are (23,22),Β (9,6),Β (7,2)\qquad \boxed{(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βˆ’yx-y and x+yx+y must have the same parity.

    • An integer is a difference of two squares iff it is not congruent to 2(mod4)2 \pmod 4.

    • Odd numbers and multiples of 44 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\qquad 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\qquad ax+by=c

    where a,b,ca,b,c are integers and we seek integer solutions (x,y)(x,y).

    ---

    Existence Criterion

    πŸ“ When do solutions exist?

    The equation

    ax+by=c\qquad ax+by=c

    has an integer solution if and only if

    gcd⁑(a,b)∣c\qquad \gcd(a,b)\mid c

    This is the most important theorem in the topic. ::: Example: The equation 6x+9y=20\qquad 6x+9y=20 has no integer solution because gcd⁑(6,9)=3\qquad \gcd(6,9)=3 and 3∀20\qquad 3\nmid 20. ---

    One Solution and All Solutions

    πŸ“ General solution form

    Suppose
    d=gcd⁑(a,b)\qquad d=\gcd(a,b)
    and d∣cd\mid c.

    If (x0,y0)(x_0,y_0) is one integer solution of

    ax+by=c\qquad ax+by=c

    then all integer solutions are

    x=x0+bdt,y=y0βˆ’adt\qquad x=x_0+\dfrac{b}{d}t,\qquad y=y_0-\dfrac{a}{d}t

    where t∈Zt\in \mathbb{Z}.

    This gives the complete family of integer solutions. ---

    Why the Formula Works

    ❗ Idea Behind the Parametrisation

    Once one solution is known, changing xx by bd\dfrac{b}{d} changes axax by a multiple of abd\dfrac{ab}{d}, which is exactly balanced by changing yy by βˆ’ad-\dfrac{a}{d}.

    So the total value of ax+byax+by remains unchanged. ---

    Simple Examples

    Example 1 Solve 2x+3y=7\qquad 2x+3y=7 One solution is (x,y)=(2,1)\qquad (x,y)=(2,1) Since d=gcd⁑(2,3)=1\qquad d=\gcd(2,3)=1, all integer solutions are x=2+3t,y=1βˆ’2t\qquad x=2+3t,\qquad y=1-2t for t∈Zt\in\mathbb{Z}. --- Example 2 Solve 4x+6y=14\qquad 4x+6y=14 First divide by 22: 2x+3y=7\qquad 2x+3y=7 A particular solution is again (2,1)\qquad (2,1) Now d=gcd⁑(4,6)=2\qquad d=\gcd(4,6)=2 So all integer solutions of the original equation are x=2+62t=2+3t\qquad x=2+\dfrac{6}{2}t=2+3t y=1βˆ’42t=1βˆ’2t\qquad y=1-\dfrac{4}{2}t=1-2t for t∈Zt\in\mathbb{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\qquad x>0,\qquad y>0

    This turns the problem into inequalities in tt.

    ---

    Special Cases

    πŸ“ Equation ax+by=0ax+by=0

    All integer solutions are

    x=bdt,y=βˆ’adt\qquad x=\dfrac{b}{d}t,\qquad y=-\dfrac{a}{d}t

    where
    d=gcd⁑(a,b)\qquad d=\gcd(a,b)
    and
    t∈Z\qquad t\in\mathbb{Z}.

    ---

    Common Patterns

    πŸ“ What Gets Asked Often

    • decide whether a solution exists

    • find one integer solution

    • write all integer solutions

    • count positive 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\gcd(a,b)\mid 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=54x+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\qquad \gcd(4,6)=2 Since 2∀5\qquad 2\nmid 5, the equation has no integer solution. Hence the correct option is A\boxed{A}." ::: :::question type="NAT" question="Find one integer solution of 2x+3y=72x+3y=7." answer="2,1" hint="Try small integers." solution="Taking y=1\qquad y=1 gives 2x+3=7\qquad 2x+3=7 So 2x=4\qquad 2x=4 and x=2\qquad x=2 Hence one integer solution is (2,1)\boxed{(2,1)}." ::: :::question type="MSQ" question="Which of the following statements are true?" options=["The equation ax+by=cax+by=c has an integer solution iff gcd⁑(a,b)∣c\gcd(a,b)\mid c","If one integer solution exists, then there are infinitely many integer solutions unless a=b=0a=b=0","After finding one solution, all others can be written using one integer parameter","The equation 6x+9y=206x+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 tt.
  • False. Since gcd⁑(6,9)=3\gcd(6,9)=3 and 3∀203\nmid 20, no integer solution exists.
  • Hence the correct answer is A,B,C\boxed{A,B,C}." ::: :::question type="SUB" question="Find all integer solutions of 3x+5y=13x+5y=1." answer="x=2+5t,y=βˆ’1βˆ’3tx=2+5t,\\ y=-1-3t" hint="Find one solution first." solution="One solution is (x,y)=(2,βˆ’1)\qquad (x,y)=(2,-1) because 3(2)+5(βˆ’1)=6βˆ’5=1\qquad 3(2)+5(-1)=6-5=1 Now d=gcd⁑(3,5)=1\qquad d=\gcd(3,5)=1 So all integer solutions are x=2+5t,y=βˆ’1βˆ’3t\qquad x=2+5t,\qquad y=-1-3t where t∈Z\qquad t\in\mathbb{Z} Therefore the complete solution set is x=2+5t,Β y=βˆ’1βˆ’3t,Β t∈Z\qquad \boxed{x=2+5t,\ y=-1-3t,\ t\in\mathbb{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(X)(Y) = N, where solutions are derived from integer factor pairs of NN.
    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)=Na^2 - b^2 = N \implies (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)N \equiv 2 \pmod 4).
    Linear Diophantine Equations of the form ax+by=cax+by=c possess integer solutions if and only if gcd⁑(a,b)\gcd(a,b) divides cc. 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 xx for which the equation 12x+18y=30012x + 18y = 300 has an integer solution for yy." answer="1" hint="First, simplify the equation by dividing by gcd⁑(12,18)\gcd(12, 18). Then, find the general solution and apply the condition x>0x > 0." solution="The equation is 12x+18y=30012x + 18y = 300.
    First, find gcd⁑(12,18)=6\gcd(12, 18) = 6. Since 6∣3006 \mid 300, integer solutions exist.
    Divide the entire equation by 6: 2x+3y=502x + 3y = 50.
    We need to find a particular solution (x0,y0)(x_0, y_0). By inspection, if x0=25x_0 = 25, then 2(25)+3y=50β€…β€ŠβŸΉβ€…β€Š50+3y=50β€…β€ŠβŸΉβ€…β€Š3y=0β€…β€ŠβŸΉβ€…β€Šy0=02(25) + 3y = 50 \implies 50 + 3y = 50 \implies 3y = 0 \implies y_0 = 0. So (25,0)(25, 0) is a particular solution.
    The general solution is given by x=x0+(b/gcd⁑(a,b))kx = x_0 + (b/\gcd(a,b))k and y=y0βˆ’(a/gcd⁑(a,b))ky = y_0 - (a/\gcd(a,b))k.
    For 2x+3y=502x+3y=50, a=2,b=3,gcd⁑(2,3)=1a=2, b=3, \gcd(2,3)=1.
    So, x=25+(3/1)k=25+3kx = 25 + (3/1)k = 25 + 3k.
    And y=0βˆ’(2/1)k=βˆ’2ky = 0 - (2/1)k = -2k.
    We are looking for the smallest positive integer xx.
    x>0β€…β€ŠβŸΉβ€…β€Š25+3k>0β€…β€ŠβŸΉβ€…β€Š3k>βˆ’25β€…β€ŠβŸΉβ€…β€Šk>βˆ’25/3x > 0 \implies 25 + 3k > 0 \implies 3k > -25 \implies k > -25/3.
    Since kk must be an integer, the smallest possible integer value for kk is βˆ’8-8.
    Substitute k=βˆ’8k=-8 into the expression for xx:
    x=25+3(βˆ’8)=25βˆ’24=1x = 25 + 3(-8) = 25 - 24 = 1.
    Thus, the smallest positive integer xx is 1."
    :::

    :::question type="MCQ" question="How many pairs of positive integers (x,y)(x,y) satisfy the equation xyβˆ’4xβˆ’3y=2xy - 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(x-a)(y-b) = N. Then consider the positive integer factors of NN and the constraints on x,yx,y." solution="The given equation is xyβˆ’4xβˆ’3y=2xy - 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+12xy - 4x - 3y + 12 = 2 + 12
    x(yβˆ’4)βˆ’3(yβˆ’4)=14x(y-4) - 3(y-4) = 14
    (xβˆ’3)(yβˆ’4)=14(x-3)(y-4) = 14.
    Since xx and yy are positive integers, xβ‰₯1x \ge 1 and yβ‰₯1y \ge 1.
    This implies xβˆ’3β‰₯βˆ’2x-3 \ge -2 and yβˆ’4β‰₯βˆ’3y-4 \ge -3.
    The integer factor pairs of 14 are (1,14),(2,7),(7,2),(14,1),(βˆ’1,βˆ’14),(βˆ’2,βˆ’7),(βˆ’7,βˆ’2),(βˆ’14,βˆ’1)(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=18x-3=1, y-4=14 \implies x=4, y=18. (Valid: x>0,y>0x>0, y>0)

  • xβˆ’3=2,yβˆ’4=7β€…β€ŠβŸΉβ€…β€Šx=5,y=11x-3=2, y-4=7 \implies x=5, y=11. (Valid: x>0,y>0x>0, y>0)

  • xβˆ’3=7,yβˆ’4=2β€…β€ŠβŸΉβ€…β€Šx=10,y=6x-3=7, y-4=2 \implies x=10, y=6. (Valid: x>0,y>0x>0, y>0)

  • xβˆ’3=14,yβˆ’4=1β€…β€ŠβŸΉβ€…β€Šx=17,y=5x-3=14, y-4=1 \implies x=17, y=5. (Valid: x>0,y>0x>0, y>0)

  • xβˆ’3=βˆ’1,yβˆ’4=βˆ’14β€…β€ŠβŸΉβ€…β€Šx=2,y=βˆ’10x-3=-1, y-4=-14 \implies x=2, y=-10. (Invalid: yβ‰―0y \ngtr 0)

  • xβˆ’3=βˆ’2,yβˆ’4=βˆ’7β€…β€ŠβŸΉβ€…β€Šx=1,y=βˆ’3x-3=-2, y-4=-7 \implies x=1, y=-3. (Invalid: yβ‰―0y \ngtr 0)

  • xβˆ’3=βˆ’7,yβˆ’4=βˆ’2β€…β€ŠβŸΉβ€…β€Šx=βˆ’4,y=2x-3=-7, y-4=-2 \implies x=-4, y=2. (Invalid: xβ‰―0x \ngtr 0)

  • xβˆ’3=βˆ’14,yβˆ’4=βˆ’1β€…β€ŠβŸΉβ€…β€Šx=βˆ’11,y=3x-3=-14, y-4=-1 \implies x=-11, y=3. (Invalid: xβ‰―0x \ngtr 0)

  • There are 4 pairs of positive integers (x,y)(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)(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+12xy-4x-3y=2 \implies (x-3)(y-4) = xy-4x-3y+12. So 2+12=142+12=14. This is correct.
    My list of factor pairs for 14 is correct.
    My derivation of (x,y)(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,yx,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=1xy - 3x - 2y = 1 from my scratchpad.
    (xβˆ’2)(yβˆ’3)=7(x-2)(y-3) = 7.
    Factors of 7: (1,7),(7,1),(βˆ’1,βˆ’7),(βˆ’7,βˆ’1)(1,7), (7,1), (-1,-7), (-7,-1).

  • xβˆ’2=1,yβˆ’3=7β€…β€ŠβŸΉβ€…β€Šx=3,y=10x-2=1, y-3=7 \implies x=3, y=10. (Valid)

  • xβˆ’2=7,yβˆ’3=1β€…β€ŠβŸΉβ€…β€Šx=9,y=4x-2=7, y-3=1 \implies x=9, y=4. (Valid)

  • xβˆ’2=βˆ’1,yβˆ’3=βˆ’7β€…β€ŠβŸΉβ€…β€Šx=1,y=βˆ’4x-2=-1, y-3=-7 \implies x=1, y=-4. (Invalid: yβ‰―0y \ngtr 0)

  • xβˆ’2=βˆ’7,yβˆ’3=βˆ’1β€…β€ŠβŸΉβ€…β€Šx=βˆ’5,y=2x-2=-7, y-3=-1 \implies x=-5, y=2. (Invalid: xβ‰―0x \ngtr 0)

  • This yields 2 pairs. This fits the options better. I will use this question.

    The given equation is xyβˆ’3xβˆ’2y=1xy - 3x - 2y = 1.
    To factor this, we add a constant to both sides:
    xyβˆ’3xβˆ’2y+6=1+6xy - 3x - 2y + 6 = 1 + 6
    x(yβˆ’3)βˆ’2(yβˆ’3)=7x(y-3) - 2(y-3) = 7
    (xβˆ’2)(yβˆ’3)=7(x-2)(y-3) = 7.
    Since xx and yy are positive integers, xβ‰₯1x \ge 1 and yβ‰₯1y \ge 1.
    This implies xβˆ’2β‰₯βˆ’1x-2 \ge -1 and yβˆ’3β‰₯βˆ’2y-3 \ge -2.
    The integer factor pairs of 7 are (1,7),(7,1),(βˆ’1,βˆ’7),(βˆ’7,βˆ’1)(1,7), (7,1), (-1,-7), (-7,-1).
    We examine each pair:

  • xβˆ’2=1,yβˆ’3=7β€…β€ŠβŸΉβ€…β€Šx=3,y=10x-2=1, y-3=7 \implies x=3, y=10. (Valid: x>0,y>0x>0, y>0)

  • xβˆ’2=7,yβˆ’3=1β€…β€ŠβŸΉβ€…β€Šx=9,y=4x-2=7, y-3=1 \implies x=9, y=4. (Valid: x>0,y>0x>0, y>0)

  • xβˆ’2=βˆ’1,yβˆ’3=βˆ’7β€…β€ŠβŸΉβ€…β€Šx=1,y=βˆ’4x-2=-1, y-3=-7 \implies x=1, y=-4. (Invalid: yβ‰―0y \ngtr 0)

  • xβˆ’2=βˆ’7,yβˆ’3=βˆ’1β€…β€ŠβŸΉβ€…β€Šx=βˆ’5,y=2x-2=-7, y-3=-1 \implies x=-5, y=2. (Invalid: xβ‰―0x \ngtr 0)

  • Therefore, there are 2 pairs of positive integers (x,y)(x,y) that satisfy the equation."
    :::

    :::question type="NAT" question="Find the number of pairs of positive integers (a,b)(a,b) such that a2βˆ’b2=75a^2 - b^2 = 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=75a^2 - b^2 = 75.
    Using the difference of squares identity, we factor the left side: (aβˆ’b)(a+b)=75(a-b)(a+b) = 75.
    Since aa and bb are positive integers, we have:

  • a+b>0a+b > 0.

  • Since a2βˆ’b2=75>0a^2 - b^2 = 75 > 0, it implies a2>b2a^2 > b^2. As a,ba,b are positive, a>ba > b.

  • From a>b>0a > b > 0, it follows that aβˆ’ba-b must be a positive integer.

  • Also, (a+b)βˆ’(aβˆ’b)=2b(a+b) - (a-b) = 2b, which is an even number. This means a+ba+b and aβˆ’ba-b must have the same parity. Since their product, 75, is an odd number, both a+ba+b and aβˆ’ba-b must be odd.
  • Now, we list the factor pairs of 75:
    * (1,75)(1, 75)
    * (3,25)(3, 25)
    * (5,15)(5, 15)
    * (15,5)(15, 5) (This is redundant, as we assume aβˆ’b<a+ba-b < a+b)
    * ...and negative pairs, which we exclude because aβˆ’ba-b must be positive.

    We consider the pairs (aβˆ’b,a+b)(a-b, a+b) where aβˆ’ba-b is smaller than a+ba+b:

  • Case 1: aβˆ’b=1a-b = 1 and a+b=75a+b = 75.

  • Adding the two equations: (aβˆ’b)+(a+b)=1+75β€…β€ŠβŸΉβ€…β€Š2a=76β€…β€ŠβŸΉβ€…β€Ša=38(a-b) + (a+b) = 1 + 75 \implies 2a = 76 \implies a = 38.
    Subtracting the first from the second: (a+b)βˆ’(aβˆ’b)=75βˆ’1β€…β€ŠβŸΉβ€…β€Š2b=74β€…β€ŠβŸΉβ€…β€Šb=37(a+b) - (a-b) = 75 - 1 \implies 2b = 74 \implies b = 37.
    This gives the pair (38,37)(38, 37), which consists of positive integers. Both aβˆ’b=1a-b=1 and a+b=75a+b=75 are odd.
  • Case 2: aβˆ’b=3a-b = 3 and a+b=25a+b = 25.

  • Adding: 2a=28β€…β€ŠβŸΉβ€…β€Ša=142a = 28 \implies a = 14.
    Subtracting: 2b=22β€…β€ŠβŸΉβ€…β€Šb=112b = 22 \implies b = 11.
    This gives the pair (14,11)(14, 11), which consists of positive integers. Both aβˆ’b=3a-b=3 and a+b=25a+b=25 are odd.
  • Case 3: aβˆ’b=5a-b = 5 and a+b=15a+b = 15.

  • Adding: 2a=20β€…β€ŠβŸΉβ€…β€Ša=102a = 20 \implies a = 10.
    Subtracting: 2b=10β€…β€ŠβŸΉβ€…β€Šb=52b = 10 \implies b = 5.
    This gives the pair (10,5)(10, 5), which consists of positive integers. Both aβˆ’b=5a-b=5 and a+b=15a+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.

    🎯 Key Points to Remember

    • βœ“ Master the core concepts in Diophantine basics before moving to advanced topics
    • βœ“ Practice with previous year questions to understand exam patterns
    • βœ“ Review short notes regularly for quick revision before exams

    Related Topics in Number Theory

    More Resources

    Why Choose MastersUp?

    🎯

    AI-Powered Plans

    Personalized study schedules based on your exam date and learning pace

    πŸ“š

    15,000+ Questions

    Verified questions with detailed solutions from past papers

    πŸ“Š

    Smart Analytics

    Track your progress with subject-wise performance insights

    πŸ”–

    Bookmark & Revise

    Save important questions for quick revision before exams

    Start Your Free Preparation β†’

    No credit card required β€’ Free forever for basic features