Article
Licensed
Unlicensed
Requires Authentication
Diophantine Equations of Matching Games I
-
Chun Yin Hui
and
Wai Yan Pong
Published/Copyright:
March 27, 2012
Abstract.
We solve a family of quadratic Diophantine equations associated with a simple kind of game. We show that the ternary case, in many ways, is the most interesting and the least arbitrary member of the family.
Received: 2011-01-26
Accepted: 2011-09-02
Published Online: 2012-03-27
Published in Print: 2012-April
© 2012 by Walter de Gruyter Berlin Boston
You are currently not able to access this content.
You are currently not able to access this content.
Articles in the same Issue
- Masthead
- Odd Catalan Numbers Modulo
- Variations of the Poincaré Map
- Diophantine Equations of Matching Games I
- Norm Euclidean Quaternionic Orders
- A New Proof of Winquist's Identity
- Counting Depth Zero Patterns in Ballot Paths
- Codes Associated with and Power Moments of Kloosterman Sums
- Subprime Factorization and the Numbers of Binomial Coefficients Exactly Divided by Powers of a Prime
- Generalized Nonaveraging Integer Sequences
- The Robin Inequality for 7-Free Integers
- On 3-adic Valuations of Generalized Harmonic Numbers
Articles in the same Issue
- Masthead
- Odd Catalan Numbers Modulo
- Variations of the Poincaré Map
- Diophantine Equations of Matching Games I
- Norm Euclidean Quaternionic Orders
- A New Proof of Winquist's Identity
- Counting Depth Zero Patterns in Ballot Paths
- Codes Associated with and Power Moments of Kloosterman Sums
- Subprime Factorization and the Numbers of Binomial Coefficients Exactly Divided by Powers of a Prime
- Generalized Nonaveraging Integer Sequences
- The Robin Inequality for 7-Free Integers
- On 3-adic Valuations of Generalized Harmonic Numbers
