pith. sign in

arxiv: 1103.1208 · v1 · pith:TLQDEC4Snew · submitted 2011-03-07 · 💻 cs.DM · nlin.CG

Fractal behind smart shopping

classification 💻 cs.DM nlin.CG
keywords coinsnumberpaymentpursechangegasketmethodminimal
0
0 comments X
read the original abstract

The 'minimal' payment - a payment method which minimizes the number of coins in a purse - is presented. We focus on a time series of change given back to a shopper repeating the minimal payment. The delay plot shows visually that the set of successive change possesses a fine structure similar to the Sierpinski gasket. We also estimate effectivity of the minimal-payment method by means of the average number of coins in a purse, and conclude that the minimal-payment strategy is the best to reduce the number of coins in a purse. Moreover, we compare our results to the rule-60 cellular automaton and the Pascal-Sierpinski gaskets, which are known as generators of the discrete Sierpinski gasket.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.