Difference between revisions of "Pell's equation (simple solutions)"
(→Equation of the form x^2 – 2y^2 = 1) |
(→Equation of the form x^2 – 2y^2 = 1) |
||
Line 11: | Line 11: | ||
==Equation of the form <math>x^2 – 2y^2 = 1</math>== | ==Equation of the form <math>x^2 – 2y^2 = 1</math>== | ||
− | <math>\boldsymbol{a.}</math> Let integers <math>(x_i, y_i)</math> are the solution | + | Prove that all positive integer solutions of the equation <math>x^2 – 2y^2 = 1</math> can be found using recursively transformation <math>x_{i+1} = 3 x_i + 4 y_i , y_{i+1} = 2 x_i + 3 y_i </math> of the pare <math>\{x_0, y_0\} = \{1,0\}.</math> |
+ | |||
+ | <i><b>Proof</b></i> | ||
+ | |||
+ | <math>\boldsymbol{a.}</math> Let integers <math>(x_i, y_i)</math> are the solution of the equation <math>\hspace{10mm} x_i^2 - 2 y_i^2 = 1,</math> | ||
<cmath>\begin{equation} \left\{ \begin{aligned} | <cmath>\begin{equation} \left\{ \begin{aligned} | ||
x_{i+1} &= 3 x_i + 4 y_i ,\\ | x_{i+1} &= 3 x_i + 4 y_i ,\\ | ||
y_{i+1} &= 2 x_i + 3 y_i . | y_{i+1} &= 2 x_i + 3 y_i . | ||
\end{aligned} \right.\end{equation}</cmath> | \end{aligned} \right.\end{equation}</cmath> | ||
− | + | Then <cmath>x_{i+1}^2 - 2 y_{i+1}^2 = (3 x_i + 4 y_i)^2 - 2 (2 x_i + 3 y_i)^2 = x_i^2 - 2 y_i^2 = 1.</cmath> | |
− | + | Therefore integers <math>(x_{i+1}, y_{i+1})</math> are the solution of the given equation. If <math>i > 0</math> then <cmath>x_{i+1} > y_{i+1} \ge 2(x_i + y_i) > x_i > y_i > 0.</cmath> | |
+ | <cmath>\{(x_i, y_i) \} = \{(1,0), (3,2), (17,12), (99,70),...\}.</cmath> | ||
− | + | <math>\boldsymbol{b.}</math> Suppose that the pare of the positive integers <math>(x_I, y_I)</math> is the solution different from founded in <math>\boldsymbol{a.}\hspace{10mm} x_I^2 - 2 y_I^2 = 1.</math> Let | |
− | |||
− | <math>\boldsymbol{b.}</math> | ||
<cmath>\begin{equation} \left\{ \begin{aligned} | <cmath>\begin{equation} \left\{ \begin{aligned} | ||
x_{i+1} &= 3 x_i - 4 y_i ,\\ | x_{i+1} &= 3 x_i - 4 y_i ,\\ | ||
Line 30: | Line 33: | ||
therefore integers <math>(x_{i+1}, y_{i+1})</math> are the solution of the given equation. | therefore integers <math>(x_{i+1}, y_{i+1})</math> are the solution of the given equation. | ||
− | + | <math>x_i^2 = 2 y_i^2 +1 > 2 y_i^2 \implies x_i > y_i >0.</math> Similarly <math>x_{i +1}> y_{i+1}.</math> | |
+ | |||
+ | There is no integer solution if <math> y_j = 1. y_j = 0</math> is impossible. So <math>y_i > 1.</math> | ||
+ | <cmath>9 y_i^2 \ge 8 y_i^2 + 4 = 4 x_i^2 \implies 3y_i \ge 2x_i \implies y_{i+1} \ge 0.</cmath> | ||
+ | |||
+ | <cmath> 0 \le y_{i+1} = y_i - 2 (x_i – y_i) < y_i. </cmath> | ||
+ | |||
+ | There is no member <math>y_j = 0</math> in the sequence <math>\{y_i \},</math> hence it is infinitely decreasing sequence of natural numbers. There is no such sequence. Contradiction. |
Revision as of 04:17, 17 April 2023
Pell's equation is any Diophantine equation of the form where is a given positive nonsquare integer, and integer solutions are sought for and
Denote the sequence of solutions It is clear that
During the solution we need:
a) to construct a recurrent sequence or two sequences
b) to prove that the equation has no other integer solutions.
Equation of the form
Prove that all positive integer solutions of the equation can be found using recursively transformation of the pare
Proof
Let integers are the solution of the equation Then
Therefore integers are the solution of the given equation. If then
Suppose that the pare of the positive integers is the solution different from founded in Let then therefore integers are the solution of the given equation.
Similarly
There is no integer solution if is impossible. So
There is no member in the sequence hence it is infinitely decreasing sequence of natural numbers. There is no such sequence. Contradiction.