Professional Documents
Culture Documents
Florentin Smarandache
University of New Mexico
200 College Road
Gallup, NM 87301, USA
ABSTRACT
We consider the equation
(1) ax − by + c = 0, with a , b ∈ N and c ∈ Z .
2 2 * *
INTRODUCTION
If ab = k 2 is a perfect square (k ∈ N ) the equation (1) has at
most a finite number of integer solutions, because (1) become:
(2) (ax − ky )(ax + ky ) = −ac .
If (a , b ) does not divide c , the Diophantine equation hasn't
solutions.
-1-
Let (x 0 , y 0 ), (x 1 , y 1 ) be the smallest positive integer solutions
for (1), with 0 ≤ x 0 < x 1 . We construct the recurrent sequences:
⎧x n +1 − α x n + β y n
(3) ⎨
⎩ y n +1 = γ x n + δ y n
-2-
where (α 0 , γ 0 ) is the smallest, positive integer solution of (10)
⎛ b ⎞
⎜ α0 γ0
such that α 0γ 0 ≠ 0 . Let A = a ⎟ ∈ M2 ( Z ) .
⎜⎜ ⎟⎟
⎝ γ 0 α0 ⎠
Of course, if (x ′, y ′) is an integer solution for (1), then
⎛x ′⎞ ⎛x ′⎞
A ⎜ ⎟ , A −1 ⎜ ⎟ are another ones -- where A −1 is the inverse
⎝ y ′⎠ ⎝ y ′⎠
matrix of A , i.e. A −1 ⋅ A = A ⋅ A −1 = I (unit matrix). Hence, if
(1) has an integer solution it has an infinite ones. (Clearly
A −1 ∈ M2 ( Z ) ).
The general positive integer solution of the equation (1) is
(x n′ , y n′ ) = (| x n |,| y n |) .
⎛xn ⎞ ⎛x0 ⎞
(GS 1 ) with ⎜ ⎟ = A n ⋅ ⎜ ⎟ , for all n ∈ Z ,
⎝yn ⎠ ⎝y0⎠
where by conversion A 0 = I and A − k = A −1 L A −1 of k times.
In problems it is better to write (GS ) as
⎛ x n′ ⎞ n ⎛ 0 ⎞
x
⎜ ′ ⎟ = A ⋅⎜ ⎟, n ∈ N
⎝yn ⎠ ⎝y0⎠
.
⎛ x n′′ ⎞ n ⎛ 1⎞
x
(GS 2 ) and ⎜ ⎟ = A ⋅ ⎜ ⎟ , n ∈ N *
⎝ y n′′ ⎠ ⎝ y1 ⎠
We proof, by reduction ad absurdum, (GS 2 ) is a general
positive integer solution for (1).
Let (u ,v ) be a positive integer particular solution for (1). If
-3-
⎛ x0 ⎞ ⎛ x1 ⎞
∃k0 ∈ N : (u, v) = Ak 0 ⎜ ⎟ , or ∃k1 ∈ N * : (u, v) = Ak1 ⎜ ⎟ then
⎝ y0 ⎠ ⎝ y1 ⎠
⎛u ⎞
(u, v) ∈ (GS2 ) . Contrary to this, we calculate (ui +1 , vi +1 ) = A−1 ⎜ i ⎟
⎝ vi ⎠
for i = 0,1, 2,K where u0 = u , v0 = v . Clearly ui +1 < ui for all i .
After a certain rank x0 < ui0 < x1 it finds either 0 < ui0 < x0 but that
is absurd.
It is clear we can put
⎛xn ⎞ ⎛x0 ⎞
(GS 3 ) ⎜ ⎟ = A n ⋅ ⎜ ⎟ , n ∈ N , where ε = ±1.
⎝yn ⎠ ⎝ε y 0 ⎠
We shall now transform the general solution (GS 3 ) in a
closed expression.
Let λ be a real number. Det ( A − λ ⋅ I ) = 0 involves the
solutions λ1,2 and the proper vectors V1,2 (i.e.
t
⎛v 1 ⎞
Avi = λi vi , i ∈ {1, 2} ). Note P = ⎜ ⎟ ∈ M2 (R ).
⎝v 2 ⎠
⎛ λ1 0 ⎞ ⎛ λ1n 0 ⎞ −1
Then P −1 AP = ⎜ ⎟ , whence A n
= P ⎜ n ⎟
P , and
⎝ 0 λ2 ⎠ ⎝ 0 λ2 ⎠
EXAMPLES
-4-
n
⎛ xn ⎞ ⎛ 5 6 ⎞ ⎛ 2 ⎞
⎜ ⎟=⎜ ⎟ ⋅⎜ ⎟, n ∈ N
⎝ yn ⎠ ⎝ 4 5 ⎠ ⎝ 3 ⎠
and λ1,2 = 5 ± 2 6, ν 1,2 = ( 6, ±2) , whence a closed expression
for xn and yn :
⎧ 4+ε 6 4−ε 6
⎪ xn = (5 + 2 6 )n + (5 − 2 6 )n
⎪ 4 4
⎨ ,
⎪ y = 3ε + 2 6 (5 + 2 6 )n + 3ε − 2 6 (5 + −2 6 )n
⎪⎩ n 6 6
for all n ∈ N .
3. x 2 − 12 y 2 + 3 = 0
[ ⎛ xn ⎞ ⎛ 7 24 ⎞ ⎛ 3 ⎞
Remark: ⎜ ⎟ = ⎜
n
⎟ ⋅ ⎜ ⎟ = ?, n ∈ N
⎝ yn ⎠ ⎝ 2 7 ⎠ ⎝ ε ⎠
]
-5-
4. x 2 − 6 y 2 − 10 = 0 .
[ ⎛ xn ⎞ ⎛ 5 12 ⎞ ⎛ 4 ⎞
Remark: ⎜ ⎟ = ⎜
n
⎟ ⋅ ⎜ ⎟ = ?, n ∈ N
⎝ yn ⎠ ⎝12 5 ⎠ ⎝ ε ⎠
]
5. x 2 − 12 y 2 − 9 = 0
[ n
⎛ xn ⎞ ⎛ 7 24 ⎞ ⎛ 3 ⎞
Remark: ⎜ ⎟ = ⎜ ⎟ ⋅ ⎜ ⎟ = ?, n ∈ N
⎝ yn ⎠ ⎝ 2 7 ⎠ ⎝ 0 ⎠
]
6. 14 x 2 − 3 y 2 − 18 = 0
GENERALIZATIONS
If f ( x, y ) = 0 is a Diophantine equation of second degree and
with two unknowns, by linear transformations it becomes
(12) ax2 + by2 + c = 0, with a, b, c 0 Z.
If ab ≥ 0 the equation has at most a finite number of integer
solutions which can be found by attempts.
It is easier to present an example:
7. The Diophantine equation
(13) 9 x 2 + 6 xy − 13 y 2 − 6 x − 16 y + 20 = 0
can becomes
(14) 2u − 7ν + 45 = 0 , where
2 2
(15) u = 3x + y − 1 and v = 2 y + 1
We solve (14). Thus:
⎧un +1 = 15un + 28ν n
(16) ⎨ , n ∈ N with (u0 ,ν 0 ) = (3,3ε )
⎩ν n +1 = 8un + 15ν n
-6-
First solution:
By induction we proof that: for all n ∈ N we have ν n is odd,
and un as well as ν n are multiple of 3. Clearly ν 0 = 3ε ,u0 . For
n + 1 we have: ν n +1 = 8un + 15ν n = even + odd= odd , and of
course un +1 ,ν n +1 are multiples of 3 because un ,ν n are multiple of
3, too.
Hence, there exist xn , yn in positive integers for all n ∈ N :
⎧ xn = (2un −ν n + 3) / 6
(17) ⎨
⎩ yn = (ν n − 1) / 2
(from (15)). Now we find the (GS3 ) for (14) as closed
expression, and by means of (17) it results the general integer
solution of the equation (13).
Second solution
Another expression of the (GS3 ) for (13) we obtain if we
transform (15) as: un = 3xn + yn − 1 and ν n = 2 yn + 1 , for all
n ∈ N . Whence, using (16) and doing the calculus, it finds
⎧ 52 11
⎪x n +1 = 11x n + y n +
(18) ⎨ 3 3 , n ∈N ,
⎪⎩ y n +1 = 12x n + 19 y n + 3
with ( x 0 , y 0 ) = (1,1) or (2, −2) (two infinitude of integer solutions).
Let
⎛ 11 52 / 3 11/ 3 ⎞ ⎛ xn ⎞ ⎛ 1⎞
⎜ ⎟ ⎜ ⎟ ⎜ ⎟
A = ⎜ 12 19 3 ⎟ Then ⎜ y n ⎟ = An ⎜ 1⎟
⎜0 0 1 ⎟⎠ ⎜1 ⎟ ⎜ 1⎟
⎝ ⎝ ⎠ ⎝ ⎠
or
-7-
⎛x n ⎞ ⎛2 ⎞
⎜ ⎟ n ⎜ ⎟
⎜ y n ⎟ = A ⎜ −2 ⎟ , always n ∈ N . (19)
⎜1 ⎟ ⎜1 ⎟
⎝ ⎠ ⎝ ⎠
From (18) we have always yn +1 ≡ yn ≡ L ≡ y0 ≡ 1(mod 3) ,
hence always xn ∈ Z . Of course, (19) and (17) are equivalent as
general integer solution for (13).
[The reader can calculate A n (by the same method liable to
the start on this note) and find a closed expression for (19).]
More generally:
This method can be generalized for the Diophantine
equations
n
(20) ∑a X
i =1
i i
2
= b, will all ai , b in Z .
-8-
(The reader will be able to try his force for the Diophantine
equation ax 2 + by 2 − cz 2 + d = 0 , with a, b, c ∈ N * and d ∈ Z ) .
REFERENCES
M. Bencze, Aplicaţii ale unor şiruri de recurenţă în teoria
ecuaţiilor diofantiene, Gamma (Braşov), XXI-XXII, Anul VII,
Nr.4-5, 1985, pp.15-18.
Z. I. Borevich - I. R. Shafarevich, Teora numerelor, EDP,
Bucharest, 1985.
A. Kenstam, Contributions to the Theory of the Diophantine
Equations Ax n − By n = C .
-9-
F. Smarandache, Sur la résolution d'équations du second degré a
deux inconnues dans Z , in the book Généralizations et
généralités, Ed. Nouvelle, Fès, Marocco; MR:85h:00003.
[Published in "Gaceta Matematica", 2a Serie, Volumen 1,
Numero 2, 1988, pp.151-7; Madrid; translated in Spanish by
Francisco Bellot Rasado: «Un metodo de resolucion de la
ecuacion diofantica».]
- 10 -