The change-making problem for six coin values and beyond

2023/02/28 by Cornelia A. Van Cott, Van Cott, Cornelia A., Qiyu Zhang +1
Computer Science · Mathematics · #05A17 #Benford’s Law and Fraud Detection #Combinatorics (math.CO) #Computability, Logic, AI Algorithms #FOS: Mathematics #semigroups and automata theory

paper · pdf · doi:10.48550/arxiv.2303.00078

openalex publication_date 2023/02/28 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

The change-making problem asks: given a positive integer v and a collection C of integer coin values c₁=1

Related

• The Greedy Coin Change Problem
• Canonical Coin Systems for Change-Making Problems
• Characterization of canonical systems with six types of coins for the change-making problem
• Completely greedy coin sets
• How many ways can you make change: Some easy proofs