What Is the Minimum Amount of Money Needed with Different Coin Combinations?

  • Thread starter mamma_mia66
  • Start date
  • Tags
    Discrete
In summary, the task is to determine the smallest amount of money that can be made using a combination of cents, nickels, dimes, and quarters. The solution for a) is 4 cents, for b) it is 9 cents, and for c) it is 19 cents. For d) and e), the use of 5 cents, 2 nickels, and 2 dimes is not allowed due to their equivalent values. Combinatorial methods can be used to find the solutions for d) and e).
  • #1
mamma_mia66
52
0

Homework Statement



use combinatorial methods to determine the smallest amount of money that using cents, nickels, dimes, or quarters, requires
a) four coins
b) five coins
c) six coins
d) seven coins
e) eight coins

Hint: Consider the ways to partition sets of those respective sizes and calculate their minimum values.

Homework Equations





The Attempt at a Solution



a) four coins => 4 cents (1cent+1cent+1cent+1cent)

b) five coins => 9 cents (1nickel + 4 cents)

c) six coins => 19 cents (1 nickel + 1 dime + 4 cents)

I don't know how to do d) ans e)

I can't use 5 cents , because this is makes 1 nickel.

Please help. Thank you.
 
Physics news on Phys.org
  • #2
mamma_mia66 said:
I can't use 5 cents , because this is makes 1 nickel.

By similar reasoning:
You can't use 2 nickels because they make 1 dime.
You can't use 2 dimes and 1 nickel because they make 1 quarter.
These restrictions help you pick the next coin, but the question requires the use of combinatorial methods.
 

FAQ: What Is the Minimum Amount of Money Needed with Different Coin Combinations?

1. What is discrete math?

Discrete math is a branch of mathematics that deals with mathematical structures and objects that are countable or distinct. It involves the study of discrete objects, such as integers, graphs, and trees, and the relationships between them.

2. What is counting in discrete math?

Counting in discrete math refers to the process of determining the number of elements in a set or group. It involves using mathematical principles and techniques, such as permutations and combinations, to calculate the number of possible outcomes or arrangements of a given set of elements.

3. What are the applications of counting in discrete math?

Counting has various applications in discrete math, such as in computer science, cryptography, and game theory. It is used to analyze and solve problems related to algorithms, data structures, and probability. It also has practical applications in fields like finance, engineering, and economics.

4. How is counting different from traditional arithmetic?

Counting in discrete math differs from traditional arithmetic in that it deals with discrete, countable objects, rather than continuous quantities. Traditional arithmetic involves operations on real numbers, while counting in discrete math involves counting and arranging a finite set of elements.

5. What are some common techniques used in counting?

Some common techniques used in counting include permutations, combinations, and the pigeonhole principle. Permutations refer to the number of ways to arrange a set of objects in a specific order, while combinations refer to the number of ways to select a subset of objects from a larger set. The pigeonhole principle states that if there are more objects than containers, at least one container must have more than one object.

Back
Top