Dimes and Quarters: System of Equations

Already Got the Answer? Check It Here

What's Really Going On Here

Most coin problems hand you consistent numbers and ask you to turn the crank. This one is different: the crank turns perfectly, the algebra is flawless, and the result is still nonsense. That makes it a rare chance to practice something textbooks seldom teach.

• Building a two-equation system from a coin story, one equation for how many coins and one for how much they are worth.
• Keeping units consistent by converting dollars to cents before writing the value equation.
• Interpreting an algebraic answer in context: a negative count is the math's way of saying the story is impossible.
• Testing feasibility before solving by finding the smallest and largest totals the coins could possibly make.
• Recognizing a well-posed problem and knowing the difference between "I made a mistake" and "the problem is broken."

Solution: Method 1 — The Two-Equation System

The classic approach: translate each fact in the story into an equation, then solve the system by substitution. We will do exactly that and then examine honestly what the answer means.

Step 1 — Name the unknowns

Let d be the number of dimes and q be the number of quarters. Both are counts of physical coins, so in any real jar they must be whole numbers that are zero or larger.

Step 2 — Organize the information in a table

Here is what the problem looks like once each coin type gets its own row. Notice that the "total value" column is count × value per coin, and we work in cents so that no decimals get in the way ($46.20 = 4620 cents).

Step 3 — Write one equation for each column that has a total

The "Count" column gives the first equation and the "Total value" column gives the second:

Step 4 — Substitute and solve

From the first equation, q = 162 − d. Replace q in the second equation, distribute, and combine like terms:

Then q = 162 − (−38) = 200.

Step 5 — Ask whether the answer can exist in a jar

The system says James has −38 dimes and 200 quarters. Arithmetically, that "works": 200 quarters are worth $50.00, and −38 dimes subtract $3.80, leaving $46.20. But a jar cannot contain a negative number of coins, and 200 quarters would already exceed the 162-coin limit.

Solution: Method 2 — The All-Dimes Swap Count

This method uses no variables at all. Start with an extreme jar and see how many coins you would need to change to reach the target.

Step 1 — Start with the cheapest possible jar

Suppose all 162 coins are dimes. The value is 162 × 10¢ = 1620¢ = $16.20.

Step 2 — Measure the gap

The target is 4620¢, so the jar is short by 4620 − 1620 = 3000¢.

Step 3 — Price one swap

Replacing one dime with one quarter keeps the coin count at 162 but adds 25¢ − 10¢ = 15¢ to the total.

Step 4 — Count the swaps needed

We would need to swap 200 dimes for quarters, but there are only 162 coins to swap. Even after swapping every single coin, we'd be short. Pushing the idea past its limit gives 162 − 200 = −38 dimes, the same −38 that the algebra found.

Two completely different routes land on the same impossible number, which is strong evidence that the arithmetic is right and the problem itself is the issue.

Solution: Method 3 — The Feasibility Ceiling

The fastest method needs no solving at all. Before writing a single equation, ask: what is the largest total 162 dimes-or-quarters could ever make?

Step 1 — Find the largest and smallest possible totals

The jar is worth the most when every coin is a quarter, and the least when every coin is a dime:

Step 2 — Compare with the stated total

Every achievable total is in the range $16.20 to $40.50. The problem claims $46.20, which is $5.70 above the ceiling.

The $46.20 target sits outside the green band of totals that 162 dimes-and-quarters can make.

Step 3 — Conclude

No arrangement of 162 dimes and quarters totals $46.20, so there is no answer to find. This ceiling test takes about ten seconds, and it is a habit worth building: check that the target is reachable before you try to hit it.

The Answer

Verification

Checking a "no solution" result means confirming two things: the algebra is correct, and the contradiction is real.

Check 1 — Does d = −38, q = 200 satisfy the equations?

Both equations hold, so the algebra is right. The problem is the meaning of the numbers: a count of −38 is not physically possible.

Check 2 — An independent route to the same −38

All quarters gives $40.50 = 4050¢. The shortfall to 4620¢ is 570¢. Each dime-for-quarter swap moves the total by 15¢, and 570 ÷ 15 = 38. That is exactly the 38 "extra" coins hidden inside the negative sign, so the ceiling test and the algebra agree.

Check 3 — Would the method work on a feasible problem?

Change only the total to $37.50 (3750¢). Then 4050 − 15d = 3750 gives d = 20 and q = 142. Check: 20 + 142 = 162 and 200 + 3550 = 3750. ✓ The setup is sound; the original numbers are what fail.

What Trips People Up

The Pattern Behind This: Totals Live in a Window

Every two-coin problem has a hidden structure. If you have n coins worth a and b cents each (with a < b), then starting from all cheap coins, each swap adds b − a cents. With k coins of the pricier type:

For dimes and quarters, b − a = 15, and with n = 162 the formula becomes:

Now the problem is easy to diagnose. The total 4620¢ passes the divisibility test (3000 ÷ 15 = 200, a whole number) but fails the window test (200 > 162). That is why the algebra produces a clean-looking integer, and why the answer looks so deceptively "almost right."

The same logic applies to every mixture problem, including solutions, alloys, and ticket sales: a mixture can never be richer than its richest ingredient or poorer than its poorest. When your computed answer lands outside the ingredients' range, a negative or "too big" count is how algebra reports it.

Try These Variations

These four problems are built to be solvable with whole numbers, so you can practice the full method on jars that can actually exist. They progress from repairing the original to working a case where $46.20 finally becomes possible.