olymmath

AHSME 1968 Problem 19

    Let nn be the number of ways 1010 dollars can be changed into dimes and quarters, with at least one of each coin being used. Then nn equals: (A) 40(B) 38(C) 21(D) 20(E) 19\text{(A) } 40 \text{(B) } 38 \text{(C) } 21 \text{(D) } 20 \text{(E) } 19

    Dataset text NuminaMath-1.5. Quoted with source.

    Show the answer

    19

    Solutions

    No solution is on olymmath yet. Official and human solutions come first when they arrive. AI solutions come after them, with a label.

    Add a solution

    Similar problems

    These problems have the most words in common with this statement.

    Locator ahsme/1968/p19 · Tag H1E51RBVDP · Edit this page on GitHub · Keys: j next, k previous