Diophantine Equations of Matching Games I
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.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.