Greedy

Number Theory #3.1: Sieve Problems — Coin System DP via Sieve

Greedy optimality for divisibility-chain coin systems, DP over the maximum denomination, and a sieve-style transition by adding one larger coin.