How many combinations of coins add up to $20
$begingroup$
We have four coins
Coin 1: $0.10
Coin 2: $1.00
Coin 3: $1.00
Coin 4: $1.00
How many ways can we get $20.00 from these coins?
My attempt:
I started by counting the total number of ways for each coin to reach $20.00
200 ways for coin 1
20 ways for coins 2, 3, and 4.
I now have an equation, a + b + c + d + e = 200
We want to get the total number of solutions without any constraints
$dbinom{200+5-1}{5-1} = dbinom{204}{4}$
Then I found the number of solutions with the constraint that the coin must be $leq$ 20. The total number of solutions with coin > 20 can be determined by purchasing 21 coins and leaving 181 at most to buy.
$dbinom{181+5-1}{5-1} = dbinom{185}{4}$
The final solution is:
$$dbinom{204}{4} - 3 times dbinom{185}{4} $$
combinatorics permutations
$endgroup$
add a comment |
$begingroup$
We have four coins
Coin 1: $0.10
Coin 2: $1.00
Coin 3: $1.00
Coin 4: $1.00
How many ways can we get $20.00 from these coins?
My attempt:
I started by counting the total number of ways for each coin to reach $20.00
200 ways for coin 1
20 ways for coins 2, 3, and 4.
I now have an equation, a + b + c + d + e = 200
We want to get the total number of solutions without any constraints
$dbinom{200+5-1}{5-1} = dbinom{204}{4}$
Then I found the number of solutions with the constraint that the coin must be $leq$ 20. The total number of solutions with coin > 20 can be determined by purchasing 21 coins and leaving 181 at most to buy.
$dbinom{181+5-1}{5-1} = dbinom{185}{4}$
The final solution is:
$$dbinom{204}{4} - 3 times dbinom{185}{4} $$
combinatorics permutations
$endgroup$
$begingroup$
If only four coins, why five vars a,b,c,d,e?
$endgroup$
– coffeemath
Dec 6 '18 at 18:20
$begingroup$
'e' represents the difference between 200 and the number of coins purchased.
$endgroup$
– Arthur Green
Dec 6 '18 at 18:21
$begingroup$
I don't understand what you mean by $200$ ways for coin 1. If the twenty dollars consists solely of coins of type 1, there will be $200$ of them, but that's only one way, isn't it? In fact the number of coins of type 1 bust be a multiply of $10$, so there are only $21$ choices for the number of coins of type 1.
$endgroup$
– saulspatz
Dec 6 '18 at 18:29
$begingroup$
@saulspatz I thought I could solve the problem using constraints. I wanted to take the total number of options, then remove the smaller constraints from that total.
$endgroup$
– Arthur Green
Dec 6 '18 at 18:37
add a comment |
$begingroup$
We have four coins
Coin 1: $0.10
Coin 2: $1.00
Coin 3: $1.00
Coin 4: $1.00
How many ways can we get $20.00 from these coins?
My attempt:
I started by counting the total number of ways for each coin to reach $20.00
200 ways for coin 1
20 ways for coins 2, 3, and 4.
I now have an equation, a + b + c + d + e = 200
We want to get the total number of solutions without any constraints
$dbinom{200+5-1}{5-1} = dbinom{204}{4}$
Then I found the number of solutions with the constraint that the coin must be $leq$ 20. The total number of solutions with coin > 20 can be determined by purchasing 21 coins and leaving 181 at most to buy.
$dbinom{181+5-1}{5-1} = dbinom{185}{4}$
The final solution is:
$$dbinom{204}{4} - 3 times dbinom{185}{4} $$
combinatorics permutations
$endgroup$
We have four coins
Coin 1: $0.10
Coin 2: $1.00
Coin 3: $1.00
Coin 4: $1.00
How many ways can we get $20.00 from these coins?
My attempt:
I started by counting the total number of ways for each coin to reach $20.00
200 ways for coin 1
20 ways for coins 2, 3, and 4.
I now have an equation, a + b + c + d + e = 200
We want to get the total number of solutions without any constraints
$dbinom{200+5-1}{5-1} = dbinom{204}{4}$
Then I found the number of solutions with the constraint that the coin must be $leq$ 20. The total number of solutions with coin > 20 can be determined by purchasing 21 coins and leaving 181 at most to buy.
$dbinom{181+5-1}{5-1} = dbinom{185}{4}$
The final solution is:
$$dbinom{204}{4} - 3 times dbinom{185}{4} $$
combinatorics permutations
combinatorics permutations
edited Dec 6 '18 at 18:27
Matt Samuel
38.8k63769
38.8k63769
asked Dec 6 '18 at 18:15
Arthur GreenArthur Green
796
796
$begingroup$
If only four coins, why five vars a,b,c,d,e?
$endgroup$
– coffeemath
Dec 6 '18 at 18:20
$begingroup$
'e' represents the difference between 200 and the number of coins purchased.
$endgroup$
– Arthur Green
Dec 6 '18 at 18:21
$begingroup$
I don't understand what you mean by $200$ ways for coin 1. If the twenty dollars consists solely of coins of type 1, there will be $200$ of them, but that's only one way, isn't it? In fact the number of coins of type 1 bust be a multiply of $10$, so there are only $21$ choices for the number of coins of type 1.
$endgroup$
– saulspatz
Dec 6 '18 at 18:29
$begingroup$
@saulspatz I thought I could solve the problem using constraints. I wanted to take the total number of options, then remove the smaller constraints from that total.
$endgroup$
– Arthur Green
Dec 6 '18 at 18:37
add a comment |
$begingroup$
If only four coins, why five vars a,b,c,d,e?
$endgroup$
– coffeemath
Dec 6 '18 at 18:20
$begingroup$
'e' represents the difference between 200 and the number of coins purchased.
$endgroup$
– Arthur Green
Dec 6 '18 at 18:21
$begingroup$
I don't understand what you mean by $200$ ways for coin 1. If the twenty dollars consists solely of coins of type 1, there will be $200$ of them, but that's only one way, isn't it? In fact the number of coins of type 1 bust be a multiply of $10$, so there are only $21$ choices for the number of coins of type 1.
$endgroup$
– saulspatz
Dec 6 '18 at 18:29
$begingroup$
@saulspatz I thought I could solve the problem using constraints. I wanted to take the total number of options, then remove the smaller constraints from that total.
$endgroup$
– Arthur Green
Dec 6 '18 at 18:37
$begingroup$
If only four coins, why five vars a,b,c,d,e?
$endgroup$
– coffeemath
Dec 6 '18 at 18:20
$begingroup$
If only four coins, why five vars a,b,c,d,e?
$endgroup$
– coffeemath
Dec 6 '18 at 18:20
$begingroup$
'e' represents the difference between 200 and the number of coins purchased.
$endgroup$
– Arthur Green
Dec 6 '18 at 18:21
$begingroup$
'e' represents the difference between 200 and the number of coins purchased.
$endgroup$
– Arthur Green
Dec 6 '18 at 18:21
$begingroup$
I don't understand what you mean by $200$ ways for coin 1. If the twenty dollars consists solely of coins of type 1, there will be $200$ of them, but that's only one way, isn't it? In fact the number of coins of type 1 bust be a multiply of $10$, so there are only $21$ choices for the number of coins of type 1.
$endgroup$
– saulspatz
Dec 6 '18 at 18:29
$begingroup$
I don't understand what you mean by $200$ ways for coin 1. If the twenty dollars consists solely of coins of type 1, there will be $200$ of them, but that's only one way, isn't it? In fact the number of coins of type 1 bust be a multiply of $10$, so there are only $21$ choices for the number of coins of type 1.
$endgroup$
– saulspatz
Dec 6 '18 at 18:29
$begingroup$
@saulspatz I thought I could solve the problem using constraints. I wanted to take the total number of options, then remove the smaller constraints from that total.
$endgroup$
– Arthur Green
Dec 6 '18 at 18:37
$begingroup$
@saulspatz I thought I could solve the problem using constraints. I wanted to take the total number of options, then remove the smaller constraints from that total.
$endgroup$
– Arthur Green
Dec 6 '18 at 18:37
add a comment |
1 Answer
1
active
oldest
votes
$begingroup$
There should be a multiple of 10 number of coins of type $1$. Hence, in effect we have four types of coin of $ $1$ and desire non-negative solutions to the equation $x_1+x_2+x_3+x_4=20$, which by the stars and bars problem is $binom{23}{3}$.
$endgroup$
$begingroup$
Very neat. I went through adding up the the stars and bars answer if there are $10k$ coins of type $1$, for $k=0,1,dots,20$ and eventually ended up with ${23choose3},$ but it never clicked that I could shortcut all that.
$endgroup$
– saulspatz
Dec 6 '18 at 19:15
$begingroup$
Thanks, @saulspatz.
$endgroup$
– Anubhab Ghosal
Dec 6 '18 at 19:51
add a comment |
Your Answer
StackExchange.ifUsing("editor", function () {
return StackExchange.using("mathjaxEditing", function () {
StackExchange.MarkdownEditor.creationCallbacks.add(function (editor, postfix) {
StackExchange.mathjaxEditing.prepareWmdForMathJax(editor, postfix, [["$", "$"], ["\\(","\\)"]]);
});
});
}, "mathjax-editing");
StackExchange.ready(function() {
var channelOptions = {
tags: "".split(" "),
id: "69"
};
initTagRenderer("".split(" "), "".split(" "), channelOptions);
StackExchange.using("externalEditor", function() {
// Have to fire editor after snippets, if snippets enabled
if (StackExchange.settings.snippets.snippetsEnabled) {
StackExchange.using("snippets", function() {
createEditor();
});
}
else {
createEditor();
}
});
function createEditor() {
StackExchange.prepareEditor({
heartbeatType: 'answer',
autoActivateHeartbeat: false,
convertImagesToLinks: true,
noModals: true,
showLowRepImageUploadWarning: true,
reputationToPostImages: 10,
bindNavPrevention: true,
postfix: "",
imageUploader: {
brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/3.0/"u003ecc by-sa 3.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
allowUrls: true
},
noCode: true, onDemand: true,
discardSelector: ".discard-answer"
,immediatelyShowMarkdownHelp:true
});
}
});
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3028847%2fhow-many-combinations-of-coins-add-up-to-20%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
1 Answer
1
active
oldest
votes
1 Answer
1
active
oldest
votes
active
oldest
votes
active
oldest
votes
$begingroup$
There should be a multiple of 10 number of coins of type $1$. Hence, in effect we have four types of coin of $ $1$ and desire non-negative solutions to the equation $x_1+x_2+x_3+x_4=20$, which by the stars and bars problem is $binom{23}{3}$.
$endgroup$
$begingroup$
Very neat. I went through adding up the the stars and bars answer if there are $10k$ coins of type $1$, for $k=0,1,dots,20$ and eventually ended up with ${23choose3},$ but it never clicked that I could shortcut all that.
$endgroup$
– saulspatz
Dec 6 '18 at 19:15
$begingroup$
Thanks, @saulspatz.
$endgroup$
– Anubhab Ghosal
Dec 6 '18 at 19:51
add a comment |
$begingroup$
There should be a multiple of 10 number of coins of type $1$. Hence, in effect we have four types of coin of $ $1$ and desire non-negative solutions to the equation $x_1+x_2+x_3+x_4=20$, which by the stars and bars problem is $binom{23}{3}$.
$endgroup$
$begingroup$
Very neat. I went through adding up the the stars and bars answer if there are $10k$ coins of type $1$, for $k=0,1,dots,20$ and eventually ended up with ${23choose3},$ but it never clicked that I could shortcut all that.
$endgroup$
– saulspatz
Dec 6 '18 at 19:15
$begingroup$
Thanks, @saulspatz.
$endgroup$
– Anubhab Ghosal
Dec 6 '18 at 19:51
add a comment |
$begingroup$
There should be a multiple of 10 number of coins of type $1$. Hence, in effect we have four types of coin of $ $1$ and desire non-negative solutions to the equation $x_1+x_2+x_3+x_4=20$, which by the stars and bars problem is $binom{23}{3}$.
$endgroup$
There should be a multiple of 10 number of coins of type $1$. Hence, in effect we have four types of coin of $ $1$ and desire non-negative solutions to the equation $x_1+x_2+x_3+x_4=20$, which by the stars and bars problem is $binom{23}{3}$.
answered Dec 6 '18 at 18:40
Anubhab GhosalAnubhab Ghosal
1,22319
1,22319
$begingroup$
Very neat. I went through adding up the the stars and bars answer if there are $10k$ coins of type $1$, for $k=0,1,dots,20$ and eventually ended up with ${23choose3},$ but it never clicked that I could shortcut all that.
$endgroup$
– saulspatz
Dec 6 '18 at 19:15
$begingroup$
Thanks, @saulspatz.
$endgroup$
– Anubhab Ghosal
Dec 6 '18 at 19:51
add a comment |
$begingroup$
Very neat. I went through adding up the the stars and bars answer if there are $10k$ coins of type $1$, for $k=0,1,dots,20$ and eventually ended up with ${23choose3},$ but it never clicked that I could shortcut all that.
$endgroup$
– saulspatz
Dec 6 '18 at 19:15
$begingroup$
Thanks, @saulspatz.
$endgroup$
– Anubhab Ghosal
Dec 6 '18 at 19:51
$begingroup$
Very neat. I went through adding up the the stars and bars answer if there are $10k$ coins of type $1$, for $k=0,1,dots,20$ and eventually ended up with ${23choose3},$ but it never clicked that I could shortcut all that.
$endgroup$
– saulspatz
Dec 6 '18 at 19:15
$begingroup$
Very neat. I went through adding up the the stars and bars answer if there are $10k$ coins of type $1$, for $k=0,1,dots,20$ and eventually ended up with ${23choose3},$ but it never clicked that I could shortcut all that.
$endgroup$
– saulspatz
Dec 6 '18 at 19:15
$begingroup$
Thanks, @saulspatz.
$endgroup$
– Anubhab Ghosal
Dec 6 '18 at 19:51
$begingroup$
Thanks, @saulspatz.
$endgroup$
– Anubhab Ghosal
Dec 6 '18 at 19:51
add a comment |
Thanks for contributing an answer to Mathematics Stack Exchange!
- Please be sure to answer the question. Provide details and share your research!
But avoid …
- Asking for help, clarification, or responding to other answers.
- Making statements based on opinion; back them up with references or personal experience.
Use MathJax to format equations. MathJax reference.
To learn more, see our tips on writing great answers.
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3028847%2fhow-many-combinations-of-coins-add-up-to-20%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
$begingroup$
If only four coins, why five vars a,b,c,d,e?
$endgroup$
– coffeemath
Dec 6 '18 at 18:20
$begingroup$
'e' represents the difference between 200 and the number of coins purchased.
$endgroup$
– Arthur Green
Dec 6 '18 at 18:21
$begingroup$
I don't understand what you mean by $200$ ways for coin 1. If the twenty dollars consists solely of coins of type 1, there will be $200$ of them, but that's only one way, isn't it? In fact the number of coins of type 1 bust be a multiply of $10$, so there are only $21$ choices for the number of coins of type 1.
$endgroup$
– saulspatz
Dec 6 '18 at 18:29
$begingroup$
@saulspatz I thought I could solve the problem using constraints. I wanted to take the total number of options, then remove the smaller constraints from that total.
$endgroup$
– Arthur Green
Dec 6 '18 at 18:37