Diophantine Equations of Matching Games I
Combinatorics
2011-04-21 v1 Number Theory
Abstract
We solve a family of quadratic Diophantine equations associated to a simple kind of games. We show that the ternary case, in many ways, is the most interesting and the least arbitrary member of the family.
Cite
@article{arxiv.1104.3900,
title = {Diophantine Equations of Matching Games I},
author = {Chun Yin Hui and Wai Yan Pong},
journal= {arXiv preprint arXiv:1104.3900},
year = {2011}
}
Comments
submitted to the journal INTEGERS