0% found this document useful (0 votes)
5 views7 pages

DIOPHANTINE EQUATIONS - Handout

The document discusses Diophantine equations and key concepts related to them, including modular arithmetic, factorization, and various methods for solving these equations. It presents a series of problems that involve finding integer solutions and proving properties related to these equations. The problems range in complexity and cover various mathematical techniques and theories.

Uploaded by

Sonia Sharma
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
5 views7 pages

DIOPHANTINE EQUATIONS - Handout

The document discusses Diophantine equations and key concepts related to them, including modular arithmetic, factorization, and various methods for solving these equations. It presents a series of problems that involve finding integer solutions and proving properties related to these equations. The problems range in complexity and cover various mathematical techniques and theories.

Uploaded by

Sonia Sharma
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 7

Diophantine Equations

Devansh Kumar Tripathi


November 2024

1 Key Points : Modular Arithmetic


Squares:
x2 ≡ 0, 1 (mod 2, 3, 4)
2
x ≡ 0, ±1 (mod 5)
2
x ≡ 0, 1, 3, 4 (mod 6, 7)
2
x ≡ 0, 1, 4 (mod 8)
2
x ≡ 0, 1, 4, 7 (mod 9)

Cubes:
x3 ≡ 0, ±1 (mod 3, 4, 7, 9)
3
x ≡ 0, ±1, ±2 (mod 5)
3
x ≡ 0, ±1, ±2, 3 (mod 6)
3
x ≡ 0, ±1, ±3 (mod 8)

4th Powers:
x4 ≡ 0, 1 (mod 3, 4, 5, 8, 16)
4
x ≡ 0, 1, 4 (mod 6)
4
x ≡ 0, 1, 2, 4 (mod 7)
4
x ≡ 0, 1, 4, 7 (mod 9)

2 Key Ideas
• Factorisation
• Monotonicity

• Bounding Arguments and Inequalities


• Discriminant Method
• Divisibility and GCD (Greatest Common Divisor)

1
• Reduction of Variables
• Infinite Descent
• Vieta’s Jumping
• Use of Modular Arithmetic:

– Number Modulo
– Polynomial Modulo
• Cyclotomic Polynomials

• Parametric Assumptions
• Mathematical Induction (PMI) and Strong Mathematical Induction (SMI)
• Pythagorean Related Diophantine Equations
• Pell’s Equation

• Use of Ring Theory

2
3 Problems
3.1 P-1
Find all ordered pairs (m, n) where m and n are positive integers such that
n3 +1
mn−1 is an integer.

3.2 P-2
A natural number n is said to have the property P, if, for all a, n2 divides an − 1
whenever n divides an − 1.
a.) Show that every prime number n has property P.
b.) Show that there are infinitely many composite numbers n that possess
property P.

3.3 P-3
Let k be a positive integer. Show that there are infinitely many perfect squares
of the form n · 2k − 7 where n is a positive integer.

3.4 P-4
Find all x, y and z in positive integer: z + y 2 + x3 = xyz and x = gcd(y, z).

3.5 P-5
We call a positive integer q a convenient denominator for a real number α if
p 1
|α − | < for some integer p. Prove that if two irrational numbers α and β
q 10q
have the same set of convenient denominators then either α + β or α − β is an
integer.

3.6 P-6
Given natural number n such that, for any natural a, b number 2a 3b + 1 is not
divisible by n.Prove that 2c + 3d is not divisible by n for any natural c and d

3.7 P-7
Determine all pairs (x, y) of integers such that

1 + 2x + 22x+1 = y 2 .

3
3.8 P-8
Let a > b > c > d be positive integers and suppose that

ac + bd = (b + d + a − c)(b + d − a + c).

Prove that ab + cd is not prime.

3.9 P-9
Does there exist a positive integer n such that n has exactly 2000 prime divisors
and n divides 2n + 1?

3.10 P-10
Find all pairs of positive integers m, n ≥ 3 for which there exist infinitely many
positive integers a such that
am + a − 1
an + a2 − 1
is itself an integer.

3.11 P-11
Let p be an odd prime and a1 , a2 , ..., ap be integers. Prove that the following
two conditions are equivalent:
1) There exists a polynomial P (x) with degree ≤ p−1 2 such that P (i) ≡ ai
(mod p) for all 1 ≤ i ≤ p
2) For any natural d ≤ p−1
2 ,

p
X
(ai+d − ai )2 ≡ 0 (mod p)
i=1

where indices are taken (mod p). (This is harder than you expect)

3.12 P-12
Solve the equation
x2 + 4 = y n ,
where n is an integer greater than 1.

3.13 P-13
Let p = 4m − 1 be a prime, and let x and y be relatively prime integers such
that
x2 + y 2 = z 2m
for some integer z. Prove that p | xy.

4
3.14 P-14
Find all quadruples (u, v, w, s) satisfying the generalized Pythagorean equation:
r2 + u2 + v 2 = s2 .

3.15 P-15
Prove that there are infinitely many triplets (a, b, c) of integers such that
a4 + b3 = c2 .

3.16 P-16
Consider the system
x + y = z + u,
2xy = zu.
Find the greatest value of the real constant m such that m ≤ x/y for any
positive integer solution (x, y, z, u) of the system, with x ≥ y.

3.17 P-17
Prove that if the difference of two consecutive cubes is n2 , then 2n − 1 is a
square.

3.18 P-18
Prove that there exists two strictly increasing sequences (an ) and (bn ) such that
an (an + 1) divides b2n + 1 for every natural n.

3.19 P-19
Find all the pairs of positive integers (x, p) such that p is a prime, x ≤ 2p and
xp−1 is a divisor of (p − 1)x + 1.

3.20 P-20
a3 + b3
Prove that every positive rational number can be represented in the form
c3 + d3
where a,b,c,d are positive integers.

3.21 P-21
(a) Prove that if there is a triple (x, y, z) of positive integers such that
x2 + y 2 + 1 = xyz,
then z = 3.
(b) Find all such triples.

5
3.22 P-22
Prove that for all integers n ≥ 2, there are odd integers x and y such that
|x2 − 17y 2 | = 4n.

3.23 P-23
Prove that there are unique positive integers a and n such that
an+1 − (a + 1)n = 2001.

3.24 P-24
Let x and y be integers such that
x2 + y 2 + 1 = 2xy.
Prove that x = y.

3.25 P-25
Find all triples (x, y, z) of nonnegative integers such that
5x · 7y + 4 = 3z .

3.26 P-26
Find all pairs (x, y) of positive integers for which
x2 − y! = 2001.

3.27 P-27
Find all pairs (x, y) of positive integers satisfying the equation
3x − 2y = 7.

3.28 P-28
Find all positive integers p, q, r, s > 1 such that
p! + q! + r! = 2s .

3.29 P-29
Show that there do not exist natural numbers a1 , a2 , . . . , a2018 such that the
numbers
(a1 )2018 + a2 , (a2 )2018 + a3 , . . . , (a2018 )2018 + a1
are all powers of 5.

6
3.30 P-30
Find all triples (x, y, z) of integers such that
1 2 3 2
+ 2+ 2 = .
x2 y z 3

You might also like