Saved in:
| Main Author: | |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2407.19137 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866917735261274112 |
|---|---|
| author | Young, Andrew J. |
| author_facet | Young, Andrew J. |
| contents | We show that the binary coin set minimizes the number of coins needed to guarantee the ability to make change in any one transaction and its asymptotic uniform average cost is no worse than that of any completely greedy coin set. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2407_19137 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Completely greedy coin sets Young, Andrew J. Combinatorics We show that the binary coin set minimizes the number of coins needed to guarantee the ability to make change in any one transaction and its asymptotic uniform average cost is no worse than that of any completely greedy coin set. |
| title | Completely greedy coin sets |
| topic | Combinatorics |
| url | https://arxiv.org/abs/2407.19137 |