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

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,10,1). x with the values 49, 51 and 99 are listed in the above articles with D values, 24, 26 and 98, respectively. It will be shown here that we can continue generating all those values of x not listed in these articles by employing the new sequence (not in the OEIS database) generated using the equation for a pair of numbers P(n) = n(25n − 1), n(25n + 1) corresponding to the various Ds:

0, 0, 24, 26, 98, 102, 222, 228, 396, 404, 620, 630, 894, 906, 1218, 1232, 1592, 1608, ...

where each pair uses the same value of n.

Accordingly, we can place each of these various D numbers in Table D along with their respective x values. All y values are 10.

Table D
n 12345678 91011121314
D242698102222228396404 62063089490612181232
x495199101149151199201 249251299301349351

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

RD = (5n1 + D)2 ∕ n1 = x + 10D)

where:

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

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 even D.

At this point it must be mentioned that the sequence shown above starts at the integer 24. The importance of this is that tables of least solution have D = 24 with only x=5 and y=1. However, here we have another instance, of a D whose x and y having multiple values, in this case x=49 and y=10 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,10,1) Triples

Table I D=24
x y z
49101
48019801
470449960301
4609920194099601
Table II D=26
x y z
51101
520110201
5304511040301
54100801106100401
Table III D=98
x y z
99101
1960119801
38808993920301
768398401776199601
Table IV D=102
x y z
101101
2040120201
41209014080301
832401601824200401
Table V D=222
x y z
149101
4440129801
132313498880301
39428976012646299601
Table VI D=228
x y z
151101
4560130201
137713519120301
41589024012754300401
Table VII D=396
x y z
199101
7920139801
3152179915840301
125455968016304399601
Table VIII D=404
x y z
201101
80801140201
32481801161660301
130576032016496400401
Table IX D=620
x y z
249101
12400149801
6175224924800301
3075249600112350499601
Table X D=630
x y z
251101
12600150201
6325225125200301
3175250400112650500401
Table XI D=894
x y z
299101
17880159801
10692269935760301
6393959520121384599601
Table XI D=906
x y z
301101
18120160201
10908270136240301
6566760480121816600401

This concludes Part XI. Go to Part XIIA. Go back to Part X.

Go back to homepage.


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