The Pellian Equation x2 −Dy2 = 1 from a Paired Sequence P(n) (Part IX)

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

The Pellian equation is the Diophantine equation x2 − Dy2 = z2 where z equals 1. The least solutions of the Pell equation are posted in Wikipedia. and also listed in Table 91, page 254 of Recreations in the Theory of Numbers by Albert H. Beiler (1966), where the values for D on page 252-253 have been computed using the following two expressions:

x = [(p + qD)n + (p − qD)n ∕ 2]
y = [(p + qD)n + (p − q2D)n ∕ 22D)]

The tables in these two articles show a series of numbers of which I will focus on those triples of the type (x,8,1). x equal to 33 was described in Part I. In addition, the triple (33,8,1) belongs to D value of 17 in the articles listed above. It will be shown here that we can continue generating all those values of x not listed in these articles by employing the sequence with the OEIS number A157716 which can be generated using the equation for a pair of numbers P(n) = n(16n − 1), n(16n + 1) corresponding to the various Ds:

0, 0, 15, 17, 62, 66, 141, 147, 252, 260, 395, 405, 570, 582, 777, 791, 1016, 1032, 1287, 1305, 1590, 1610, ...

where an extra zero has been added to the sequence so that P(0) = (0,0). In addition, each pair uses the same value of n.

The method involves multiplying the initial least solutions by either of the two parts of the following mathematical expression:

RD = (4n1 + D)2 ∕ n1 = x + 8D)

where:

n1 are consecutive integers, 1, 2, 3, 4, 5, ...
the values of adjacent xs in a pair is (32n1 − 1, 32n1 + 1).
D are the values from the above sequence starting at 15.

then multiplying and rounding off each row of triples generated by the RD for as many triples as are desired. The lists below show the patterns generated for the twelve Ds of the above sequence and the accompanying triple tables generated for each D where a D may be even number or odd.

At this point it must be mentioned that the sequence shown above starts at the integer 15. The importance of this is that tables of least solution have D = 15 with only x=4 and y=1. However, here we have the third instance, of a D whose x and y having multiple values, in this case x=31 and y=8 and so this D is being included as the first entry below. *Note that the first instance is covered in Part VI.

Tables of D and Pell (x,8,1) Triples

Table I D=15
x y z
3181
19214961
119071307441
738048119056321
Table II D=17
x y z
3381
21775281
143649348401
947865722989121
Table III D=62
x y z
6381
693710081
9999991270001
125991937160009921
Table IV D=66
x y z
6581
844910401
10983051351921
1142771201175739201
Table V D=141
x y z
9581
1804915201
34292152887921
651532801548689601
Table VI D=147
x y z
9781
1881715521
36504013010801
708158977584079681
Table VII D=252
x y z
12781
3225720321
81931515161201
20810280971310924481
Table VIII D=260
x y z
12981
3328120641
85863695325041
22152499211373839681
Table IX D=395
x y z
15981
5056125441
160782398089841
511282894412572543681
Table X D=405
x y z
16181
5184125761
166926418294641
53749785612670848321
Table XI D=570
x y z
19181
7296130561
2787091111673841
106466150414459376321
Table XI D=582
x y z
19381
7449730881
2875564911919601
110996060174600934721

This concludes Part IX. Go to Part X. Go back to Part VIII.

Go back to homepage.


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