Difference between revisions of "Pell's equation (simple solutions)"
(→Equation of the form x^2 – 2y^2 = - 1) |
(→Pythagorean triangles with almost equal legs) |
||
Line 90: | Line 90: | ||
'''vladimir.shelomovskii@gmail.com, vvsss''' | '''vladimir.shelomovskii@gmail.com, vvsss''' | ||
==Pythagorean triangles with almost equal legs== | ==Pythagorean triangles with almost equal legs== | ||
− | Find all triangles with integer sides one leg of which is <math>1</math> more than the other. Find all natural solutions of the equation <math>x^2 + (x+1)^2 = y^2.</math> | + | Find all triangles with integer sides one leg of which is <math>1</math> more than the other. |
+ | |||
+ | Find all natural solutions of the equation <math>x^2 + (x+1)^2 = y^2.</math> | ||
+ | |||
<i><b>Solution</b></i> | <i><b>Solution</b></i> | ||
+ | |||
<cmath>x^2 +(x + 1)^2 = 2x^2 + 2x + 1 = y^2 \implies 4x^2 + 4x + 1 = 2y^2 - 1 \implies (2x+1)^2 – 2y^2 = -1.</cmath> | <cmath>x^2 +(x + 1)^2 = 2x^2 + 2x + 1 = y^2 \implies 4x^2 + 4x + 1 = 2y^2 - 1 \implies (2x+1)^2 – 2y^2 = -1.</cmath> | ||
− | All positive integer solutions of the equation <math>(2x+1)^2 – 2y^2 = -1</math> can be found using recursively transformation <cmath>2x_{i+1}+1 = 3 (2x_i + 1) + 4 y_i , y_{i+1} = 2 (2x_i +1) + 3 y_i \implies x_{i+1} = 3 x_i + 2 y_i + 1, y_{i+1} = 4 x_i + 3 y_i + 2</cmath> of the pare <math>\{x_0, y_0\} = \{0,1\}.</math> | + | All positive integer solutions of the equation <math>(2x+1)^2 – 2y^2 = -1</math> can be found using recursively transformation <cmath>2x_{i+1}+1 = 3 (2x_i + 1) + 4 y_i , y_{i+1} = 2 (2x_i +1) + 3 y_i \implies</cmath> |
+ | <cmath>x_{i+1} = 3 x_i + 2 y_i + 1, y_{i+1} = 4 x_i + 3 y_i + 2</cmath> of the pare <math>\{x_0, y_0\} = \{0,1\}.</math> | ||
<cmath>\begin{array}{c|c|c|c|c|c|c} | <cmath>\begin{array}{c|c|c|c|c|c|c} | ||
& & & & & & \\ [-2ex] | & & & & & & \\ [-2ex] |
Revision as of 09:32, 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.
Contents
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.
vladimir.shelomovskii@gmail.com, vvsss
Equation of the form
Prove that all positive integer solutions of the equation can be found using recursively transformation of the pare In another form
Proof
It is the form of Pell's equation, therefore
vladimir.shelomovskii@gmail.com, vvsss
Equation of the form
Prove that all positive integer solutions of the equation can be found using recursively transformation of the pare
Proof
Similarly as for equation
vladimir.shelomovskii@gmail.com, vvsss
Pythagorean triangles with almost equal legs
Find all triangles with integer sides one leg of which is more than the other.
Find all natural solutions of the equation
Solution
All positive integer solutions of the equation can be found using recursively transformation of the pare
vladimir.shelomovskii@gmail.com, vvsss