<?xml version="1.0" encoding="UTF-8"?>
<feed xmlns="http://www.w3.org/2005/Atom" xmlns:dc="http://purl.org/dc/elements/1.1/">
<title>Conference Papers</title>
<link href="https://hdl.handle.net/13049/689" rel="alternate"/>
<subtitle/>
<id>https://hdl.handle.net/13049/689</id>
<updated>2026-04-29T04:34:16Z</updated>
<dc:date>2026-04-29T04:34:16Z</dc:date>
<entry>
<title>Quadratic sequences in Pythagorean triples</title>
<link href="https://hdl.handle.net/13049/690" rel="alternate"/>
<author>
<name>Ochieng, Raymond Calvin</name>
</author>
<author>
<name>Chikunji, Chiteng'A John</name>
</author>
<author>
<name>Onyango-Otieno, Vitalis</name>
</author>
<id>https://hdl.handle.net/13049/690</id>
<updated>2026-03-17T08:54:24Z</updated>
<published>2022-06-16T00:00:00Z</published>
<summary type="text">Quadratic sequences in Pythagorean triples
Ochieng, Raymond Calvin; Chikunji, Chiteng'A John; Onyango-Otieno, Vitalis
Using the Euclid's formula, we obtain an alternative formula for generating Pythagorean triples, both primitive and non-primitive. It easy to classify Pythagorean triples using this formula based on the divisibility of the leg of a Pythagorean triple by any positive integer. The differences in lengths between the hypotenuse and the legs of a Pythagorean triple obtained by this alternative formula form Quadratic sequences. These quadratic sequences have applications in various fields such as tiling.
</summary>
<dc:date>2022-06-16T00:00:00Z</dc:date>
</entry>
</feed>
