Some Rational Diophantine Sextuples
数论
2007-05-23 v1
摘要
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.
引用
@article{arxiv.math/9902081,
title = {Some Rational Diophantine Sextuples},
author = {Philip Gibbs},
journal= {arXiv preprint arXiv:math/9902081},
year = {2007}
}