The Diophantine Equation x² + Dy² = z² (Part I)

A Method of Generating Triples from Novel Equations

A new, general method for generating triples of the form (x,y,z) for the Diophantine equation x² + Dy² = z², where D, the coefficient of y can be any integer greater than zero is being introduced here. The method produces a set of novel second order equations which generates the triples by either random or sequential means. These equations are listed below using the following table heading format:

	δ₁	x	y	z	δ₂
k		Dk² - n	mk	Dk² + n

where k is a counter starting at zero, D is the coefficient of y and (n, m) are values taken from the table below so that whenever n = j² then m = 2j for all j > 0:

Table of n & m values
n	1	4	9	16	25	36	49	64	81	100	...
m	2	4	6	8	10	12	14	16	18	20	...

Since there are an infinite number of (n, m) integers there are also an infinite number of tables which can be tabulated with their accompanying equations; equations whose purpose is to generate the triples either by random or sequential access. A second sequential access is also possible using the δ₁ and δ₂ columns whose δ₁δ₁ and δ₂δ₂ are both 2 for all the tables. In addition, a substantial number of triples are composed of numbers which can be simplified further via prime division. When D equals one the Diophantine equation takes the form of x² + y² = z² also known as the Pythagorean equation.

Table I
	δ₁	x	y	z	δ₂
k		k² - 1	2k	k² + 1
0		-1	0	1
	1				1
1		0	2	2
	3				3
2		3	4	5
	5				5
3		8	6	10
	7				7
4		15	8	17
	9				9
5		24	10	26
	11				11
6		25	12	37
	13				13
7		48	14	50

Table II
	δ₁	x	y	z	δ₂
k		k² - 4	4k	k² + 4
0		-4	0	4
	1				1
1		-3	4	5
	3				3
2		0	8	8
	5				5
3		5	12	13
	7				7
4		12	16	20
	9				9
5		21	20	29
	11				11
6		32	24	40
	13				13
7		45	28	53

Next comes Tables III and IV.

Table III
	δ₁	x	y	z	δ₂
k		k² - 9	6k	k² + 9
0		-9	0	9
	1				1
1		-8	6	10
	3				3
2		-5	12	13
	5				5
3		0	18	18
	7				7
4		7	24	25
	9				9
5		16	30	34
	11				11
6		27	36	45
	13				13
7		40	42	58

Table IV
	δ₁	x	y	z	δ₂
k		k² - 16	8k	k² + 16
0		-16	0	16
	1				1
1		-15	8	17
	3				3
2		-12	16	20
	5				5
3		-7	24	25
	7				7
4		0	32	32
	9				9
5		9	40	41
	11				11
6		20	48	52
	13				13
7		33	56	65

Next comes Tables V and VI.

Table V
	δ₁	x	y	z	δ₂
k		k² - 25	10k	k² + 25
0		-25	0	25
	1				1
1		-24	10	26
	3				3
2		-21	20	29
	5				5
3		-16	30	34
	7				7
4		-9	40	41
	9				9
5		0	50	50
	11				11
6		11	60	61
	13				13
7		24	70	74

Table VI
	δ₁	x	y	z	δ₂
k		k² - 36	12k	k² + 36
0		-36	0	36
	1				1
1		-35	12	37
	3				3
2		-32	24	40
	5				5
3		-27	36	45
	7				7
4		-20	48	52
	9				9
5		-11	60	61
	11				11
6		0	72	72
	13				13
7		13	84	85

Finally we have Tables VII and VIII.

Table VII
	δ₁	x	y	z	δ₂
k		k² - 49	14k	k² + 49
0		-49	0	49
	1				1
1		-48	14	50
	3				3
2		-45	28	53
	5				5
3		-40	42	58
	7				7
4		-33	56	65
	9				9
5		-24	70	74
	11				11
6		-13	84	85
	13				13
7		0	98	98

Table VIII
	δ₁	x	y	z	δ₂
k		k² - 64	16k	k² + 64
0		-64	0	64
	1				1
1		-63	16	65
	3				3
2		-60	32	68
	5				5
3		-55	48	73
	7				7
4		-48	64	80
	9				9
5		-39	80	89
	11				11
6		-28	96	100
	13				13
7		-15	112	113

Only eight triples, (x,y,z), were used in the calculation for the Diophantine equation x² + y² = z² , normally known as the Pythagorean equation, to get an idea of its versatility. Note that the tables produced can be expanded downward indefinitely. In addition, using the tables one can generate the appropriate equations that are useful for generating any triple in a table using a random access method or using δ₁ and δ₂ to access the (x,y,z)s sequentially.

This concludes Part I. Go to Part II.

Go back to homepage.

The Diophantine Equation x2 + Dy2 = z2 (Part I)

A Method of Generating Triples from Novel Equations

The Diophantine Equation x² + Dy² = z² (Part I)