Corpus ID: 18221699

Chocolate Numbers

@article{Ji2016ChocolateN,
  title={Chocolate Numbers},
  author={Caleb Ji and T. Khovanova and Robin Park and Angela Song},
  journal={J. Integer Seq.},
  year={2016},
  volume={19},
  pages={16.1.7}
}
In this paper, we consider a game played on a rectangularm×n gridded chocolate bar. Each move, a player breaks the bar along a grid line. Each move after that consists of taking any piece of chocolate and breaking it again along existing grid lines, until just mn individual squares remain. This paper enumerates the number of ways to break an m × n bar, which we call chocolate numbers, and introduces four new sequences related to these numbers. Using various techniques, we prove interesting… Expand
1 Citations

Figures and Tables from this paper

Enumerative Properties of Posets Corresponding to a Certain Class of Games of No Strategy
  • Caleb Ji
  • Mathematics, Computer Science
  • J. Integer Seq.
  • 2017

References

SHOWING 1-7 OF 7 REFERENCES
Winning Ways for Your Mathematical Plays
Lessons in Play: An Introduction to Combinatorial Game Theory
Combinatorial Game Theory
An Introduction to the Theory of Numbers
Generalized hypergeometric series
Ordinary Differential Equations.
generatingfunctionology: Third Edition