Chocolate Numbers

zbMATH Open1364.11067arXiv1509.06093MaRDI QIDQ3465231FDOQ3465231

Authors: Caleb Ji, Tanya Khovanova, Robin Park, Angela Song 

Publication date: 21 January 2016

Abstract: In this paper, we consider a game played on a rectangular $mimesn$ 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 $mimesn$ bar, which we call chocolate numbers, and introduces four new sequences related to these numbers. Using various techniques, we prove interesting divisibility results regarding these sequences.

Full work available at URL: https://arxiv.org/abs/1509.06093

File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

Recommendations

• scientific article; zbMATH DE number 7306571
• Chocolate P automata

zbMATH Keywords

hypergeometric functiongenerating functionperiodicityrecursionRiccati equation\(p\)-adic order

Mathematics Subject Classification ID

Special sequences and polynomials (11B83)

Cited In (1)

• Cookie Monster devours naccis

Uses Software

• OEIS

This page was built for publication: Chocolate Numbers

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3465231)