Totally Greedy Sequences Defined by Second-Order Linear Recurrences With Constant Coefficients
Abstract: The change-making problem consists of representing a certain amount of money with the least possible number of coins, from a given, pre-established set of denominations. The greedy algorithm works by choosing the coins of largest possible denomination first. This greedy strategy does not always produce the least number of coins, except when the set of denominations obeys certain properties. We call a set of denominations with these properties a greedy set. If the set of denominations is an infinite sequence, we call it totally greedy if every prefix subset is greedy. In this paper we investigate some totally greedy sequences arising from second-order linear recurrences with constant coefficients, as well as their subsequences, and we prove sufficient conditions under which these sequences are totally greedy.
- Adamaszek, A. and M. Adamaszek: Combinatorics of the change-making problem. European Journal of Combinatorics 31, 47–63 (2010).
- Cai, X.: Canonical Coin Systems for Change-Making Problems. Procs. of the 9th IEEE Int. Conf. on Hybrid Intelligent Systems, 499–504 (2009).
- Chan, T.M. and Q. He: More on change-making and related problems. Journal of Computer and System Sciences, 124 (2022) 159–169.
- Crilly, T.: “Interleaving Integer Sequences”. The Mathematical Gazette 91 (2007), 27–33.
- OEIS: The On-Line Encyclopedia of Integer Sequences. http://oeis.org/classic/index.html.
- Pearson, D.: A polynomial-time algorithm for the change-making problem. Operations Research Letters 33, 231–234 (2005).
- Pérez-Rosés, H. M. Bras and J.M. Serradilla-Merinero: Greedy routing in circulant networks. Graphs and Combinatorics (to appear) (2022).
- Rajesh, V. and G. Leversha: “Some Properties of Odd Terms of the Fibonacci Sequence”. The Mathematical Gazette 88 (2004), 85–86.
- Shallit, J.: What This Country Needs is an 18c Piece. The Mathematical Intelligencer 25(2), 20–23 (2003).
- Silvester, J.R. “The r-Subsequences of the Fibonacci Sequence”. The Mathematical Gazette 90 (2006), 263–266.
- Suzuki, Y. and R. Miyashiro “Characterization of canonical systems with six types of coins for the change-making problem”. Theoretical Computer Science 955 (2023), DOI: https://doi.org/10.1016/j.tcs.2023.113822.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.