Gr ou p 3 - E le m en t ar y

algebra
𝒏

INFINITE
𝟐

DESCENT
PRINCIPLE
GR O U P 3

• NGUYEN TRAM ANH

• TRAN CHAU ANH
• HOANG HA MY
• TRAN TOAN THINH
• TRIEU HONG TU
THEOR
Y
HISTO R Y O F
IN F I N IT E
DE S C E N T
PRIN C I P L EThe Fermat’s Last Theorem
For n ≥ 3, there are no sets of positive integers that
satisfy the equation

De-escalating to indeterminate or descending to infinity

 E G AT IV E 1
PROV E N
STATE M E NT S

EXAMPLE: There does not exist a right

triangle with sides whose lengths are integers
and its area is a square number
 I T IV E 2
P R OV E P OS
STATE M E N T S

EXAMPLE: All primes with the

form 4n + 1 can be expressed as
sum of two square numbers
 3

HIS OTHER
RESULTS,
PROPOSITIO
NS
 4

SOLVE THE
INDETERMINAT
E PROBLEM
 5

DIOPHANTIN
E ANALYSIS
 6

NUMBER
THEORY OF
MATHEMATI
CS
In f in i te d e s c e n t
p ri n c i p le

Let C be a set of configurations, suppose C ∅ and

over C, there equips an order relation that allows us to
filter out the minimum element a ∈ C . Then by a
descendant method, we can point out there exists an
element b such that b < a. From that, we can deduce
C=∅
 EXERCISE

Find inte g e r s olu ti ons o f th e e qu ati o n

.
 EX: Find integer solutions of the equation (1)
SOLUTI
ON • is a solution of the equation (1)
𝑆= ( 𝑎 ; 𝑏 ; 𝑐 )|𝑎 =3 𝑏 +9 𝑐 , 𝑎 ; 𝑏 ; 𝑐 ∈ℤ , ( 𝑎 ; 𝑏 ; 𝑐 ) ≠ ( 0 ; 0 ; 0 )
3 3 3

• Let satisfying is smallest

• (contradiction)
• , we have, is divisible by 3 then put with
3 3 3
9 𝑥1 = 𝑦 + 3 𝑧
• is divisible by 3 then put with
3 3 3
3 𝑥1 =9 𝑦 1 + 𝑧
• is divisible by 3 then put with
3 3 3
𝑥1 =3 𝑦 1+ 9 𝑧 1 ( 2 )
 and (contradiction)
• We conclude that the integer solution of the equation (1) is
EXERC
ISES
Infinite descent
principle in
DIOPHANTI 𝟐
𝒙 + 𝒚 + 𝒛 𝟐 + 𝒖𝟐 =𝟐 𝒙𝒚
𝟐

NE 𝒛𝒖
EQUATIONS
 EXERCISE
1

Prove th at th e nu m be r 7 c an n ot b e
written as the su m of th e s qu a res of 3
rational numbers.
 EX1: Prove that the number 7 cannot be written as the sum of
the squares of 3 rational numbers

hIN T
Suppose

What can we say about the even/odd properties of x, y,

z, t?
LEMMA
All integer solutions of the equation are the
multiples of primitive Pythagorean triples
where

(m and n are coprime and only one of them is

odd, m n)
 EXERCISE
2

Prove that th e eq u a ti o n d o s e n ot h a v e
any inte g e r so luti on s s a ti s fy in g
 EX2: Prove that the equation dose not have any integer solutions
satisfying

hIN T

Transform the given equation to the form and apply the

result of lemma
Infinite descent
principle in
GEOMETRY
 EXERCISE
1

sis ti n g of p o in ts o n a li n e
Given a set M con
po in t o f e a c h li n e se g m e n t
such that the mid
o p o in ts in M is a ls o a p o in t
connecting any tw
in the set M.
se t M c o n s is ts o f in fin it e ly
Prove that: The
many points
 Given a set M consisting of points on a line such that the
midpoint of each line segment connecting any two points in
SOLU M is also a point in the set M.
TION Prove that: The set M consists of infinitely many points

• Suppose the set M consists of a finite number of points on the line

 There exists 2 points whose length is the smallest line segment
joining them. Suppose these two points are A and B
 The midpoint C of segment AB also belongs to set M (according to
assumption)

• AC AB  contradiction
 EXERCISE
2

Given convex polyg o n A li e s in s id e a c o n ve x

polygon B.
Prove that: The pe r im e te r o f th e p o ly g o n A is
g o n B li es in si d e ” m ea n s
less than of the poly (”
that lies in the interior)
 Given convex polygon A lies inside a convex polygon B.
Prove that: The perimeter of the polygon A is less than of
SOLU the polygon B
(”lies inside” means that lies in the interior)
TION • Assume that the convex polygon A = lies inside the convex polygon B.
 B
 divides the polygon B into 2 parts
𝑃 𝑀 1
≤ 𝑃 𝐵

• divides the polygon into 2 parts


 The chain of polygon B
• A 
• The sign “=” happens A is congruent to B (contradiction)

 EXERCISE
3

Prove that with 3 ≤ n 4 , th e r e d o e s n o t e x is t

an n-sided regula r po ly g o n w it h v e r ti c es
having integer coordinates
 Prove that with 3 ≤ n ≠ 4, there does not exist an n-sided
regular polygon with vertices having integer coordinates
SOLU
TION
 For n = 3
If the side of an equilateral triangle is ()
2 ∗
𝑎 ∈ℕ
 Area = I

 contradiction

 For n = 6
There exists an equilateral triangle which have 3 integer vertices
 It does not exist
 Prove that with 3 ≤ n ≠ 4, there does not exist an n-sided
regular polygon with vertices having integer coordinates
SOLU
TION
 Consider the remaining cases
• Suppose there exists a regular polygon
with n 3; 4; 6 is a regular polygon with integer vertices
that have the smallest edges
• Take such that:

 are also integer points

 The sides of the regular polygon have
integer coordinates and smaller than the sides of
(contradictory to the choice of polygon )
SUMMA
RY
1. Theory
1.1 History of Infinite descent principle
1.2 Infinite descent principle
1.3 Lemma of primitive Pythagorean triples
2. Exercise
2.1 Infinite descent principle in Diophantine equations
2.2 Infinite descent principle in Geometry
Thank You!