You can complete your question here or have a look at this discussion:

https://www.qalaxia.com/viewDiscussion?messageId=5dd7b7c2535ed576a0e39818

I found an answer from stackoverflow.com

How to find all combinations of **coins** when given some dollar value ...

You **have** a current total to fill, and a largest denomination (with **more than** 1 left).
... if there are no more **coins** or if we run **out** of money ... return 0 if ( lcoins. ... (
**quarter** = 25 cents, **dime** = **10** cents, nickel = 5 cents, penny = 1 cent) */ /* A: ...
solution in java that seemed smaller than all the others, so here goes -

For more information, see How to find all combinations of **coins** when given some dollar value ...

I found an answer from web.stanford.edu

HW2 Solutions

Answer: We **have** one random variable C which denotes the **coin** chosen (1, ...
probability of choosing two fair **coins**, and probabilities to get (HH,HT,TH,TT) of (1
. 4 ... Note that the **last** three cases for the **coins** chosen expand into eight
different ... get a **more** intuitive result: you are indeed better **off** minimizing the
number of ...

For more information, see HW2 Solutions