Some Rational Diophantine Sextuples
| dc.creator | Gibbs, Philip | |
| dc.date | 1999-02-13 | |
| dc.date.accessioned | 2026-07-07T05:27:54Z | |
| dc.date.available | 2026-07-07T05:27:54Z | |
| dc.description | A famous problem posed by Diophantus was to find sets of distinct positive rational numbers such that the product of any two is one less than a rational square. Some sets of six such numbers are presented and the computational algorithm used to find them is described. A classification of quadruples and quintuples with examples and statistics is also given. | |
| dc.identifier | https://arxiv.org/abs/math/9902081 | |
| dc.identifier | http://arxiv.org/abs/math/9902081 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/78099 | |
| dc.subject | Number Theory | |
| dc.title | Some Rational Diophantine Sextuples | |
| dc.type | text |