Fractal patterns related to dividing coins

DOI10.1016/J.CHAOS.2014.04.014zbMATH Open1349.91072arXiv1307.0911OpenAlexW2073060648MaRDI QIDQ340462FDOQ340462

Authors: Ken Yamamoto 

Publication date: 14 November 2016

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

Abstract: The present paper formulates and solves a problem of dividing coins. The basic form of the problem seeks the set of the possible ways of dividing coins of face values 1,2,4,8,... between three people. We show that this set possesses a nested structure like the Sierpinski-gasket fractal. For a set of coins with face values power of r, the number of layer of the gasket becomes r. A higher-dimensional Sierpinski gasket is obtained if the number of people is more than three. In addition to Sierpinski-type fractals, the Cantor set is also obtained in dividing an incomplete coin set between two people.

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

Recommendations

• Emergence of the Sierpinski gasket in coin-dividing problems
• FLIPPING COINS, FOLDING PAPER, AND FINDING FAMILIAR FRACTALS IN THE TOWER OF HANOI
• Sierpiński's pathological curve and its modern incarnations
• Modification of classical fractals by compound gold section of interval
• Elementary fractal geometry. new relatives of the Sierpiński gasket

zbMATH Keywords

Cantor setSierpinski gasketdividing coins

Mathematics Subject Classification ID

Fractals (28A80) Combinatorial games (91A46)

Cites Work

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

Cited In (3)

• Fractal surfaces from simple arithmetic operations
• Emergence of the Sierpinski gasket in coin-dividing problems
• The \(p\lambda n\) fractal decomposition: nontrivial partitions of conserved physical quantities

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

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