Fractal patterns related to dividing coins

DOI10.1016/j.chaos.2014.04.014zbMath1349.91072arXiv1307.0911OpenAlexW2073060648MaRDI QIDQ340462

Ken Yamamoto

Publication date: 14 November 2016

Published in: Chaos, Solitons and Fractals (Search for Journal in Brave)

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

zbMATH Keywords

Cantor setSierpinski gasketdividing coins

Mathematics Subject Classification ID

Fractals (28A80) Combinatorial games (91A46)

Related Items (2)

Fractal surfaces from simple arithmetic operations ⋮ The \(p\lambda n\) fractal decomposition: nontrivial partitions of conserved physical quantities

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Emergence of the Sierpinski gasket in coin-dividing problems
• An exact algorithm for large unbounded knapsack problems
• Optimal denominations for coins and currency
• More on optimal denominations for coins and currency
• A polynomial-time algorithm for the change-making problem
• Complexity of the Frobenius problem
• When the Greedy Solution Solves a Class of Knapsack Problems
• On a new class of planar fractals: the Pascal-Sierpinski gaskets
• Golden gaskets: variations on the Sierpi ski sieve

This page was built for publication: Fractal patterns related to dividing coins