The Pellian Equation x2 −Dy2 = ±1 Continuation (Part IIIB)

A Method for Generating Pellian Triples (x,y,±1) and (x,y,−1)

The Pellian equation x2 − Dy2 = 1 was covered in Part I and the negative Pellian equation x2 − Dy2 = −1 in Part II. The least solutions of the negative Pell equation, however, are not posted in either Wikipedia (which has a small section describing this topic) or listed in Recreations in the Theory of Numbers by Albert H. Beiler (1966) as were their positive Pell solutions, but the following equations on page 253 may be used for their computation:

x = [(p + qD)2n-1 + (p − qD)2n-1 ∕ 2]
y = [(p + qD)2n-1 + (p − qD)2n-1 ∕ 2D)]

In addition, the method of converting a quadratic surd D into continued fractions (pages 261-262) are also methods that can be used to generate these least solutions.

Furthermore, though R3 and R4 with D values ranging from 41 through 113 may be expressed via two expressions unlike R1 and R2 in Part IIIA which exist also in a cubed form. Thus, the reason for treating these expressions separate from Part IIIA. In addition, while this part and Part II can generate negative Pellian triples they differ in that y is constant for the negative Pell in Part II but variable here. The expressions for generating the triples are:

R3 = a + bD = (n3 + n4D)1∕2
R4 = (a + bD)2 = n3 + n4D

where a + bD is in actuality the negative Pell equation which we can generate from the regular Pell equation via exhaustive subtraction of D×a square from n3 until n3 is a perfect square. The negative Pell can also be constructed during the construction of Pell triples as described below.

In addition, a method of generating a sequence of Ds which can be used in these Pell equations has not been found to date and the OEIS database did not provide a definitive answer.

The Actual Method

R3 or R4 is initially multiplied and rounded off with the known least value solutions x and y of the positive Pell equation to generate a new x and y solutions with z = −1. This new row of values is then tested to make sure it fits the negative Pell equation. Further multiplication and rounding off of this row by either of these Rs produces staggered +1 and −1 Pell values. Once the desired number of rows is obtained we can backtrack and generate the approximate least solution values of the negative Pell equation by taking the initial +1 least solutions x and y and dividing by the R being used.

It is simple and generates the least solution of the negative Pell equation which we can tabulate in a new table by either extracting the x and y values from the staggered table or by creating the new table from scratch.

Tables of D and Pell (x,y,±1) and (x,y,−1) Triples

Table VI D=41
x y z
325 -1
20493201
131168204855-1
839680113113601
53752643283947525-1
Table VII D=41
x y z
325-1
131168204855-1
53752643283947525-1
Table VIII D=58
x y z
9913 -1
1960325741
3881493509665-1
7685552171009162441
15217781445919981925977-1
Table IX D=61
x y z
297183805 -1
17663190492261539801
10498293902608213441687969085-1
Table X D=73
x y z
1068125 -1
22812492670001
4872748932570312125-1
Table XI D=74
x y z
435 -1
3699401
31815736985-1
Table XII D=89
x y z
50053 -1
500001530001
50000150053000053-1
Table XIII D=97
x y z
5604569 -1
6280963363773521
70397037226871477361785-1
Table XIV D=106
x y z
4005389 -1
3208005131158901
25696121251524958279289-1
Table XV D=113
x y z
77673 -1
12043531132961
1869156632175835465-1

This concludes Part III. To see two new methods for generating Pellian triples from known sequences go to Part IV and Part V.
Go back to Part IIIA.

Go back to homepage.


Copyright © 2020 by Eddie N Gutierrez. E-Mail: enaguti1949@gmail.com