Skip to main content

Sigma Calculator — 527+ Free Calculator Tools

Money Math Calculator

Make change, break bills into coins, and solve money word problems instantly — exact coin combinations for any amount. Free and beginner-friendly.

Home » Math Calculators » Money Math Calculator

Money math is the arithmetic of everyday life: counting change, splitting bills, and figuring out which coins make a given amount. It looks simple until you are the cashier with a line of customers, the student facing a coin word problem, or the traveler converting bills into exact change. Our free Money Math Calculator takes any dollar amount and returns the optimal coin breakdown — the fewest coins that make the total — plus bill denominations, so you always know exactly what goes in the till.

US coinage is a canonical coin system: for quarters, dimes, nickels, and pennies, the greedy algorithm (always take the largest coin that fits) produces the fewest possible coins. That is not true of every currency or denomination set — with 1¢, 3¢, and 4¢ coins, the greedy choice for 6¢ gives 4+1+1 (three coins) while 3+3 uses only two. American money is mercifully well-designed, which is why the cashier’s rule of thumb actually works.

Beyond the register, money math trains number sense. Making change is repeated subtraction; coin combinations are integer partitions with constraints; “how many ways to make a dollar?” is a classic combinatorics problem (293 ways, as it happens). This calculator handles the practical side — exact change breakdowns — while the article below builds the intuition that makes the answers obvious.

How to Use the Money Math Calculator

  1. Enter a dollar amount (the example uses $3.87). Cents are fine — type 3.87, not 387.
  2. Click Break Into Coins. The calculator converts to cents and applies the greedy algorithm.
  3. Read the bills section first (largest denominations), then the coins section with the total coin count.
  4. Use the breakdown as exact change: hand over the listed bills and coins.
  5. Press Reset to restore the $3.87 example.

How Making Change Works

Making change is a greedy algorithm: repeatedly take the largest denomination that does not exceed the remaining amount. For $3.87: the largest bill fitting is $1 (three of them, leaving $0.87), then quarters (three, leaving $0.12), then a dime (leaving $0.02), then two pennies. Total: 3 bills + 6 coins. The calculator performs exactly these steps and reports each one.

The greedy algorithm is not always optimal — it works for US coins because the system is canonical. A coin system is canonical when greedy always yields the fewest coins. The US system (1, 5, 10, 25) is canonical; a hypothetical (1, 3, 4) system is not, as the 6¢ counterexample shows. Canonical systems have a neat property: each coin is at most twice the previous one in a certain precise sense, which is why 25 = 2× 10 + 5 keeps greediness safe.

Cashiers learn a streamlined version: counting up. If the bill is $3.87 and the customer pays $5, you count up from 3.87 — “3 pennies make 3.90, a dime makes 4.00, a dollar makes 5.00” — handing over 3 pennies, a dime, and a dollar. The change is $1.13, and counting up doubles as error-checking because you land exactly on the amount tendered.

Floating-point arithmetic is the hidden trap in money code. 0.1 + 0.2 = 0.30000000000000004 in binary floating point, so serious money math works in integer cents. This calculator converts your dollars to cents with Math.round(amt × 100) before doing anything else — the same discipline banks and payment processors use.

Change Formula and Worked Examples

Change = amount paid − cost; coin count via greedy: take ⌊remaining / denomination⌋ of each coin, largest first.

For US coins the greedy choice is provably optimal (fewest coins). The calculator rounds to integer cents first to avoid floating-point error.

Example 1 — $3.87 in coins

387¢: quarters: ⌊387/25⌋ = 15? No — the calculator first takes bills: ⌊387/100⌋ = 3 dollar bills, remainder 87¢. Then ⌊87/25⌋ = 3 quarters (75¢), remainder 12¢; ⌊12/10⌋ = 1 dime, remainder 2¢; ⌊2/1⌋ = 2 pennies. Result: 3 × $1, 3 × quarter, 1 × dime, 2 × pennies.

Example 2 — Change from $5.00 on a $3.87 purchase

Change = 5.00 − 3.87 = $1.13 = 113¢. Bills: ⌊113/100⌋ = 1 dollar bill, remainder 13¢. Coins: ⌊13/10⌋ = 1 dime, remainder 3¢; ⌊3/1⌋ = 3 pennies. Hand back: $1 bill, 1 dime, 3 pennies — and counting up (3.87 → 3.90 → 4.00 → 5.00) confirms it.

Example 3 — $0.99, all coins

99¢: ⌊99/25⌋ = 3 quarters (75¢), remainder 24¢; ⌊24/10⌋ = 2 dimes (20¢), remainder 4¢; ⌊4/1⌋ = 4 pennies. Total 9 coins. Compare $1.00: a single bill. Prices ending in .99 maximize coin count — one reason cashiers dislike them.

Example 4 — $68.40

6840¢: bills: ⌊6840/5000⌋ = 1 × $50, remainder 1840¢; ⌊1840/1000⌋ = 1 × $10, remainder 840¢; ⌊840/500⌋ = 1 × $5, remainder 340¢; ⌊340/100⌋ = 3 × $1, remainder 40¢. Coins: ⌊40/25⌋ = 1 quarter, remainder 15¢; ⌊15/10⌋ = 1 dime, remainder 5¢; ⌊5/5⌋ = 1 nickel. Clean and minimal.

Practical Example: The Cashier, the Vending Machine, and the Classroom

A cashier’s drawer is low on quarters during a rush. A customer pays $10 for a $6.32 item; change is $3.68. The calculator’s standard answer needs 2 quarters, but she mentally re-runs the greedy pass skipping quarters: 3 × $1, then dimes ⌊68/10⌋ = 6 (60¢), remainder 8¢ = 1 nickel + 3 pennies. She hands over 3 bills, 6 dimes, a nickel, and 3 pennies — more coins, but the drawer survives the rush.

A vending machine must return $1.41 in change with limited coin tubes. The greedy breakdown (5 quarters, 1 dime, 1 nickel, 1 penny = 8 coins) is what its firmware computes in integer cents — exactly like this calculator. Machine designers stock tubes to match greedy demand: quarters deplete fastest, which is why machines flash “exact change only” when the quarter tube runs low.

A teacher poses the classic: “You have 6 coins totaling 45¢. What are they?” Students guess randomly until one applies the greedy idea in reverse — a quarter leaves 20¢ for 5 coins, impossible (minimum 5¢), so try… working through, 1 quarter + 2 dimes = 45¢ is only 3 coins; the actual answer needs the constraint thinking: with 6 coins the average is 7.5¢, suggesting dimes and nickels — 4 dimes + 1 nickel = 45¢ is 5 coins; adding a penny means dropping a nickel for 6 pennies… the systematic search is the lesson, and the calculator verifies each candidate breakdown instantly.

Common Mistakes With Money Math

The Mathematics of Coin Systems

The coin problem asks: given denominations, which amounts can be formed and with how many coins? For canonical systems the greedy algorithm is optimal, and there is a clean characterization: a system is canonical if and only if greedy is optimal for all amounts up to a certain bound (a theorem of Pearson, 1994, gives an efficient test). The US system passes; many historical systems did not — which is why old cashiers needed genuine skill, not just an algorithm.

Counting ways to make change is a different, harder problem. The number of ways to make change for a dollar with US coins is 293 — a result computed via generating functions: the coefficient of x^100 in 1/((1−x)(1−x^5)(1−x^10)(1−x^25)(1−x^50)). For arbitrary amounts the count grows roughly like n^4/(4! × 1 × 5 × 10 × 25) — polynomial growth, but the exact count needs the full partition machinery.

The Frobenius coin problem asks for the largest amount that cannot be formed with given coprime denominations. For two denominations a and b, the answer is ab − a − b (Sylvester, 1884): with 5¢ and 7¢ coins, 5×7 − 5 − 7 = 23¢ is the largest unmakeable amount, and everything above it is formable. With a penny in the system, the answer is trivially “everything” — the penny is the universal solvent of coin problems.

More Worked Examples

Example 5 — $12.05

1205¢: bills: ⌊1205/1000⌋ = 1 × $10, remainder 205¢; ⌊205/100⌋ = 2 × $1, remainder 5¢. Coins: ⌊5/5⌋ = 1 nickel. Total: $10 + $1 + $1 + nickel. Four pieces, minimal.

Example 6 — $0.41 (the “no quarter” case)

41¢: ⌊41/25⌋ = 1 quarter, remainder 16¢; ⌊16/10⌋ = 1 dime, remainder 6¢; ⌊6/5⌋ = 1 nickel, remainder 1¢; 1 penny. Four coins: quarter, dime, nickel, penny — one of each, the classic “41 cents” showcase.

Example 7 — $250.00

25000¢: ⌊25000/10000⌋ = 2 × $100, remainder 5000¢; ⌊5000/5000⌋ = 1 × $50. No coins at all. Round amounts collapse to a few large bills — the greedy algorithm’s best case.

Key Takeaways

Related Calculators

Frequently Asked Questions

How do you make change for $3.87 from $5.00?

Subtract: 5.00 − 3.87 = $1.13. Break 113¢ greedily: 1 dollar bill, 1 dime, 3 pennies. Or count up from $3.87: 3 pennies → $3.90, a dime → $4.00, a dollar → $5.00.

What is the greedy algorithm for coins?

Repeatedly take the largest denomination that fits in the remaining amount. For US coins this yields the fewest possible coins because the system is canonical. The calculator applies it automatically.

Why do computers use cents instead of dollars?

Binary floating point cannot represent most decimals exactly (0.1 + 0.2 = 0.30000000000000004). Integer cents avoid this entirely. The calculator converts with Math.round(dollars × 100) before computing.

How many ways are there to make change for a dollar?

293 ways using US coins (pennies through half-dollars). Counting ways is a partition problem solved with generating functions — much harder than finding one optimal breakdown, which is what this calculator does.

What is a canonical coin system?

One where the greedy algorithm always produces the fewest coins. US coins (1, 5, 10, 25) are canonical; a (1, 3, 4) system is not, since greedy makes 6¢ as 4+1+1 instead of 3+3.

What is the largest amount you cannot make with nickels and dimes?

With 5¢ and 10¢ (not coprime — gcd 5), only multiples of 5¢ are possible. For coprime a, b the Frobenius number is ab − a − b; e.g., 5¢ and 7¢ cannot make 23¢, but can make everything larger.

How do cashiers count back change?

They count up from the purchase price to the amount tendered, handing over coins as they name each landing total: “$3.87… 3 pennies make $3.90, a dime makes $4.00, a dollar makes $5.00.” It self-verifies the change.

Why do prices end in .99?

Charm pricing exploits left-digit bias ($3.99 feels much cheaper than $4.00). As a side effect, .99 prices maximize coin counts in change — 99¢ needs 9 coins greedily versus 1 bill for $1.00.

Cite this page as: Money Math Calculator. Sigma Calculator. Retrieved October 10, 2026, from https://sigmacalculator.net/math-calculators/money-math-calculator/

Last updated: October 10, 2026

Sources: The U.S. coin denominations the greedy change algorithm uses — penny (1¢), nickel (5¢), dime (10¢), quarter (25¢), half dollar (50¢) and dollar ($1) — are specified by the U.S. Mint — Coin Specifications.

Written by Naveel, Sigma Calculator. Naveel writes and maintains the calculators on Sigma Calculator, testing each tool against hand-worked examples so the results match what you would get on paper.