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

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,4,1). x equal to 9, 15 and 17 were described in Part I and all three follow a general pattern. The triples (9,4,1), (15,4,1) and (17,4,1) belong to the three D values 5, 14 and 18, respectively, as shown in the two articles 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 A074378 which can be generated using the equation for a pair of numbers P(n) = n(4n − 1), n(4n + 1) corresponding to the various Ds:

0, 0, 3, 5, 14, 18, 33, 39, 60, 68, 95, 105, 138, 150, 189, 203, 248, 264, 315, 333...

where an extra zero has been added to the sequence so as to form the pair 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 = (n1 + D)2 ∕ ½n1 = x + 4D)

where:

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

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 ten Ds of the above sequence and the accompanying triple tables generated for each D where D may be even or odd.

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

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

Table I D=3
x y z
741
97561
1351127801
18817108641
2620871513161
Table II D=5
x y z
941
161721
288912921
51841231841
9302494160201
Table III D=14
x y z
1541
4491201
1345535961
4032011077601
1208257532292041
Table IV D=18
x y z
1741
5771361
1960146201
6658571569441
2261953753314761
Table V D=33
x y z
2341
10571841
4859984601
22344973889761
102738263178844361
Table VI D=39
x y z
2541
12492001
6242599961
31200014996001
155937625249700041
Table VII D=60
x y z
3141
19212481
119071153721
73804819528161
457470751590592201
Table VIII D=68
x y z
3341
21772641
143649174201
947865711494561
625447713758466761
Table IX D=95
x y z
3941
30413121
237159243321
1849536118975841
14424009991479872201
Table X D=105
x y z
4141
33613281
275561268921
2259264122048161
18523210011807680201

This concludes Part VI. Go to Part VII. Go back to Part V.

Go back to homepage.


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