The number of integral solution of $alpha+beta+gamma+delta$=18 such that..
$begingroup$
Question
The number of integral solution of the equation $$alpha+beta+gamma+delta=18$$, with the conditions:
$1leqalphaleq5$; ${-2}leqbetaleq4$; $0leqgammaleq5$ and $3leqdeltaleq9$ is $k$. Find $k$.
$$Attempt$$
I tried to do to it by giving the minimum number required to the variables to generate new variable to whom then nil can also be given and hence the equation I wrote is $$x+y+z+v=16$$ But, now, I had a problem in adjusting the higher limit for every variable for accounting each of them. Afterwards, I don't know what to do.
*Any hints or suggestions?*
Thanks for helping me!
combinatorics permutations combinations self-learning
asked Dec 18 '18 at 16:02
jayant98jayant98
655318
$endgroup$
add a comment |
$begingroup$
Question
The number of integral solution of the equation $$alpha+beta+gamma+delta=18$$, with the conditions:
$1leqalphaleq5$; ${-2}leqbetaleq4$; $0leqgammaleq5$ and $3leqdeltaleq9$ is $k$. Find $k$.
$$Attempt$$
I tried to do to it by giving the minimum number required to the variables to generate new variable to whom then nil can also be given and hence the equation I wrote is $$x+y+z+v=16$$ But, now, I had a problem in adjusting the higher limit for every variable for accounting each of them. Afterwards, I don't know what to do.
*Any hints or suggestions?*
Thanks for helping me!
combinatorics permutations combinations self-learning
asked Dec 18 '18 at 16:02
jayant98jayant98
655318
$endgroup$
2
$begingroup$
A computer could easily do this by brute force... I'm assuming you're looking for a more efficient method?
$endgroup$
– pwerth
Dec 18 '18 at 16:04
$begingroup$
@pwerth Yes. I have to do like these questions in exams.
$endgroup$
– jayant98
Dec 18 '18 at 16:07
1
$begingroup$
Use the method of generating functions
$endgroup$
– Foobaz John
Dec 18 '18 at 16:20
$begingroup$
@Foobaz Sorry, I don't know what you want to say. How can we generate functions?
$endgroup$
– jayant98
Dec 18 '18 at 16:21
$begingroup$
@pwerth A human could also easily do this by brute force.
$endgroup$
– Servaes
Dec 18 '18 at 16:33
add a comment |
$begingroup$
Question
The number of integral solution of the equation $$alpha+beta+gamma+delta=18$$, with the conditions:
$1leqalphaleq5$; ${-2}leqbetaleq4$; $0leqgammaleq5$ and $3leqdeltaleq9$ is $k$. Find $k$.
$$Attempt$$
I tried to do to it by giving the minimum number required to the variables to generate new variable to whom then nil can also be given and hence the equation I wrote is $$x+y+z+v=16$$ But, now, I had a problem in adjusting the higher limit for every variable for accounting each of them. Afterwards, I don't know what to do.
*Any hints or suggestions?*
Thanks for helping me!
combinatorics permutations combinations self-learning
asked Dec 18 '18 at 16:02
jayant98jayant98
655318
$endgroup$
Question
The number of integral solution of the equation $$alpha+beta+gamma+delta=18$$, with the conditions:
$1leqalphaleq5$; ${-2}leqbetaleq4$; $0leqgammaleq5$ and $3leqdeltaleq9$ is $k$. Find $k$.
$$Attempt$$
I tried to do to it by giving the minimum number required to the variables to generate new variable to whom then nil can also be given and hence the equation I wrote is $$x+y+z+v=16$$ But, now, I had a problem in adjusting the higher limit for every variable for accounting each of them. Afterwards, I don't know what to do.
*Any hints or suggestions?*
Thanks for helping me!
combinatorics permutations combinations self-learning
combinatorics permutations combinations self-learning
asked Dec 18 '18 at 16:02
jayant98jayant98
655318
asked Dec 18 '18 at 16:02
jayant98jayant98
655318
edited Dec 18 '18 at 23:16
jayant98
asked Dec 18 '18 at 16:02
jayant98jayant98
655318
asked Dec 18 '18 at 16:02
jayant98jayant98
655318
asked Dec 18 '18 at 16:02
jayant98jayant98
655318
655318
2
$begingroup$
A computer could easily do this by brute force... I'm assuming you're looking for a more efficient method?
$endgroup$
– pwerth
Dec 18 '18 at 16:04
$begingroup$
@pwerth Yes. I have to do like these questions in exams.
$endgroup$
– jayant98
Dec 18 '18 at 16:07
1
$begingroup$
Use the method of generating functions
$endgroup$
– Foobaz John
Dec 18 '18 at 16:20
$begingroup$
@Foobaz Sorry, I don't know what you want to say. How can we generate functions?
$endgroup$
– jayant98
Dec 18 '18 at 16:21
$begingroup$
@pwerth A human could also easily do this by brute force.
$endgroup$
– Servaes
Dec 18 '18 at 16:33
add a comment |
2
$begingroup$
A computer could easily do this by brute force... I'm assuming you're looking for a more efficient method?
$endgroup$
– pwerth
Dec 18 '18 at 16:04
$begingroup$
@pwerth Yes. I have to do like these questions in exams.
$endgroup$
– jayant98
Dec 18 '18 at 16:07
1
$begingroup$
Use the method of generating functions
$endgroup$
– Foobaz John
Dec 18 '18 at 16:20
$begingroup$
@Foobaz Sorry, I don't know what you want to say. How can we generate functions?
$endgroup$
– jayant98
Dec 18 '18 at 16:21
$begingroup$
@pwerth A human could also easily do this by brute force.
$endgroup$
– Servaes
Dec 18 '18 at 16:33
2
2
$begingroup$
A computer could easily do this by brute force... I'm assuming you're looking for a more efficient method?
$endgroup$
– pwerth
Dec 18 '18 at 16:04
$begingroup$
A computer could easily do this by brute force... I'm assuming you're looking for a more efficient method?
$endgroup$
– pwerth
Dec 18 '18 at 16:04
$begingroup$
@pwerth Yes. I have to do like these questions in exams.
$endgroup$
– jayant98
Dec 18 '18 at 16:07
$begingroup$
@pwerth Yes. I have to do like these questions in exams.
$endgroup$
– jayant98
Dec 18 '18 at 16:07
1
1
$begingroup$
Use the method of generating functions
$endgroup$
– Foobaz John
Dec 18 '18 at 16:20
$begingroup$
Use the method of generating functions
$endgroup$
– Foobaz John
Dec 18 '18 at 16:20
$begingroup$
@Foobaz Sorry, I don't know what you want to say. How can we generate functions?
$endgroup$
– jayant98
Dec 18 '18 at 16:21
$begingroup$
@Foobaz Sorry, I don't know what you want to say. How can we generate functions?
$endgroup$
– jayant98
Dec 18 '18 at 16:21
$begingroup$
@pwerth A human could also easily do this by brute force.
$endgroup$
– Servaes
Dec 18 '18 at 16:33
$begingroup$
@pwerth A human could also easily do this by brute force.
$endgroup$
– Servaes
Dec 18 '18 at 16:33
add a comment |
3 Answers
3
active
oldest
votes
$begingroup$
Converting to $$alpha'+beta'+gamma'+delta'=16$$
The number of ways to distribute $n$ identical things among $r$ different persons/parameters = $binom{n+r-1}{r-1}$
The number of ways of distributing $16$ among these $4$ i.e. $n=16$ and $r=4$, are $binom{16+4-1}{4-1}=binom{19}{3}$.
But there are conditions that $$0lealpha'leq 4, 0leq beta'leq 6, 0leq gamma'leq 5, 0leqdelta'leq 6$$
So, we need to subtract the number of ways of distribution in which these weren't followed.
For example: To calculate the number of sequences in which $alpha^{'}geq 5$, we will first allot $5$ out of $16$ to $alpha^{'}$ and then follow the same formula as follows (so as to distribute $11$ among $4$)
$$binom{16-5+4-1}{4-1}=binom{14}{3}$$
Similarly for $beta'geq7$
$$binom{16-7+4-1}{4-1}=binom{12}{3}$$
$gamma'geq6$
$$binom{16-6+4-1}{4-1}=binom{13}{3}$$
and $delta'geq7$
$$binom{16-7+4-1}{4-1}=binom{12}{3}$$
So, it becomes $$binom{19}{3}-binom{14}{3}-binom{12}{3}-binom{13}{3}-binom{12}{3}$$
Finally, the cases in which at least two conditions failed are also to be subtracted but since they are considered already in the cases in which at least one condition failed, we actually need to subtract them once. Why once? Cases of $alpha^{'}geq 5$ included cases of any of the other three ($beta'leq6;gamma'leq5;delta'leq6$) not following together with or putting similar argument for other three conditions, we can contemplate that all in all $4times 3=12$ terms are already subtracted and that we need to now add the "at least two disobeyed condition cases"($^4C_2=6$ in number).
So, calculating the cases to be added:
For the condition for $alpha$ and $beta$: $binom{16-5-7+3}{3}=binom{7}{3}$
Similarly for others...
The final answer comes out to be
$$binom{19}{3}-binom{14}{3}-binom{12}{3}-binom{13}{3}-binom{12}{3}+binom{7}{3}+binom{6}{3}+binom{6}{3}+binom{8}{3}+binom{7}{3}+binom{5}{3}$$
This is a widely used approach to questions like this and is pretty common! You may feel like a lot of things working but the format is pretty simple. $text{Total - at least one condition followed or whatever + at least two conditions... upto which it is not possible}$. (like here it wasn't possible for any three conditions to hold simultaneously obviously)
answered Dec 18 '18 at 17:42
Sameer BahetiSameer Baheti
5718
$endgroup$
$begingroup$
Thanks for your wonderful explanation. BTW in which year you're studying? My elder brother is also there.
$endgroup$
– jayant98
Dec 18 '18 at 23:34
$begingroup$
I'm a sophomore. What's his name?
$endgroup$
– Sameer Baheti
Dec 19 '18 at 9:13
$begingroup$
He is your senior....Prashant. May not be from same dept. (Since I don't know yours.)
$endgroup$
– jayant98
Dec 19 '18 at 9:41
$begingroup$
You preparing for JEE? This question shouldn't be more than 3 mins...btw from now on
$endgroup$
– Sameer Baheti
Dec 19 '18 at 11:08
$begingroup$
Not for JEE. Preparing for ISI.
$endgroup$
– jayant98
Dec 19 '18 at 13:24
add a comment |
$begingroup$
Here is a proof using the method of generating functions. By adjusting the constraints we may write the problem as finding the number of integral solutions to
$$
alpha'+beta'+gamma'+delta'=16
$$
with $0lealpha'leq 4, 0leq beta'leq 6, 0leq gamma'leq 5, 0leqdelta'leq 6$. The number of solutions is then the coefficient in the expansion of
$$
begin{align}
F(x)&=(1+x+x^2+x^3+x^4)(1+x+dotsb+x^6)^2(1+x+dotsb+x^5)\
&=frac{1-x^5}{1-x}frac{(1-x^7)^2}{(1-x)^2}frac{1-x^6}{1-x}\
&=frac{x^{25} - x^{20} - x^{19} - 2 x^{18} + x^{14} + 2 x^{13} + 2 x^{12} + x^{11} - 2 x^7 - x^6 - x^5 + 1}{(1-x)^4}.
end{align}
$$
For the coeffficient extraction use the fact that
$$
sum_{n=0}^inftybinom{n+3}{3}x^n=(1-x)^{-4}
$$
and linearity of coefficient extraction to get that the number of solutions is
$$
binom{16+3}{3}-binom{16-5+3}{3}-binom{16-6+3}{3}-2binom{16-7+3}{3}+binom{16-11+3}{3}+2binom{16-12+3}{3}+\2binom{16-13+3}{3}+binom{16-14+3}{3}
$$
answered Dec 18 '18 at 16:40
Foobaz JohnFoobaz John
22.3k41452
$endgroup$
$begingroup$
Can you please explain what did you do in the combinations & how? Thanks for the effort. After the line "the number of solutions is"
$endgroup$
– jayant98
Dec 18 '18 at 16:46
add a comment |
$begingroup$
One approach would be to first express it as a problem in positive integers; let $a=alpha-1$, $b=beta+2$, $c=gamma$ and $d=delta-3$. Then you want to find the number of nonnegative integers $aleq4$, $bleq6$, $cleq 5$, $dleq6$ such that
$$a+b+c+d=16.$$
Note that, since $a+b+cleq15$ we have $dgeq1$, and similarly $bgeq1$. So by the substitutions $b'=b-1$ and $d'=d-1$ we in fact want to find the number of nonnegative integers $aleq4$, $b'leq5$, $cleq5$, $d'leq5$ such that
$$a+b'+c+d'=14.$$
It is not hard to see that for any choice of $a$, $b'$ and $c$ with $a+b'+cgeq9$ there is a unique $d'$ satisfying the above, and there is no such $d'$ otherwise. So it suffices to count the number of nonnegative integers $aleq4$, $b'leq5$, $cleq5$ satisfying $a+b'+cgeq9$. We can count them as follows:
There is one solution to $a+b'=9$, and any value of $c$ yields a solution. This yields a total of $1times6=6$ solutions.
There are two solutions to $a+b'=8$, and any value of $cgeq1$ yields a solution. This yields a total of $2times5=10$ solutions.
There are three solutions to $a+b'=7$, and any value of $cgeq2$ yields a solution. This yields a total of $3times4=12$ solutions.
There are four solutions to $a+b'=6$, and any value of $cgeq3$ yields a solution. This yields a total of $4times3=12$ solutions.
There are five solutions to $a+b'=5$, and any value of $cgeq4$ yields a solution. This yields a total of $5times2=10$ solutions.
There are five solutions to $a+b'=4$, and any value of $cgeq5$ yields a solution. This yields a total of $5times1=5$ solutions.
For $a+b'<4$ there are no solutions. Adding all the above together yields a total of $6+10+12+12+10+5=55$ solutions.
answered Dec 18 '18 at 16:37
ServaesServaes
25.9k33996
$endgroup$
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%2f3045331%2fthe-number-of-integral-solution-of-alpha-beta-gamma-delta-18-such-that%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
3 Answers
3
active
oldest
votes
3 Answers
3
active
oldest
votes
active
oldest
votes
active
oldest
votes
$begingroup$
Converting to $$alpha'+beta'+gamma'+delta'=16$$
The number of ways to distribute $n$ identical things among $r$ different persons/parameters = $binom{n+r-1}{r-1}$
The number of ways of distributing $16$ among these $4$ i.e. $n=16$ and $r=4$, are $binom{16+4-1}{4-1}=binom{19}{3}$.
But there are conditions that $$0lealpha'leq 4, 0leq beta'leq 6, 0leq gamma'leq 5, 0leqdelta'leq 6$$
So, we need to subtract the number of ways of distribution in which these weren't followed.
For example: To calculate the number of sequences in which $alpha^{'}geq 5$, we will first allot $5$ out of $16$ to $alpha^{'}$ and then follow the same formula as follows (so as to distribute $11$ among $4$)
$$binom{16-5+4-1}{4-1}=binom{14}{3}$$
Similarly for $beta'geq7$
$$binom{16-7+4-1}{4-1}=binom{12}{3}$$
$gamma'geq6$
$$binom{16-6+4-1}{4-1}=binom{13}{3}$$
and $delta'geq7$
$$binom{16-7+4-1}{4-1}=binom{12}{3}$$
So, it becomes $$binom{19}{3}-binom{14}{3}-binom{12}{3}-binom{13}{3}-binom{12}{3}$$
Finally, the cases in which at least two conditions failed are also to be subtracted but since they are considered already in the cases in which at least one condition failed, we actually need to subtract them once. Why once? Cases of $alpha^{'}geq 5$ included cases of any of the other three ($beta'leq6;gamma'leq5;delta'leq6$) not following together with or putting similar argument for other three conditions, we can contemplate that all in all $4times 3=12$ terms are already subtracted and that we need to now add the "at least two disobeyed condition cases"($^4C_2=6$ in number).
So, calculating the cases to be added:
For the condition for $alpha$ and $beta$: $binom{16-5-7+3}{3}=binom{7}{3}$
Similarly for others...
The final answer comes out to be
$$binom{19}{3}-binom{14}{3}-binom{12}{3}-binom{13}{3}-binom{12}{3}+binom{7}{3}+binom{6}{3}+binom{6}{3}+binom{8}{3}+binom{7}{3}+binom{5}{3}$$
This is a widely used approach to questions like this and is pretty common! You may feel like a lot of things working but the format is pretty simple. $text{Total - at least one condition followed or whatever + at least two conditions... upto which it is not possible}$. (like here it wasn't possible for any three conditions to hold simultaneously obviously)
answered Dec 18 '18 at 17:42
Sameer BahetiSameer Baheti
5718
$endgroup$
$begingroup$
Thanks for your wonderful explanation. BTW in which year you're studying? My elder brother is also there.
$endgroup$
– jayant98
Dec 18 '18 at 23:34
$begingroup$
I'm a sophomore. What's his name?
$endgroup$
– Sameer Baheti
Dec 19 '18 at 9:13
$begingroup$
He is your senior....Prashant. May not be from same dept. (Since I don't know yours.)
$endgroup$
– jayant98
Dec 19 '18 at 9:41
$begingroup$
You preparing for JEE? This question shouldn't be more than 3 mins...btw from now on
$endgroup$
– Sameer Baheti
Dec 19 '18 at 11:08
$begingroup$
Not for JEE. Preparing for ISI.
$endgroup$
– jayant98
Dec 19 '18 at 13:24
add a comment |
$begingroup$
Converting to $$alpha'+beta'+gamma'+delta'=16$$
The number of ways to distribute $n$ identical things among $r$ different persons/parameters = $binom{n+r-1}{r-1}$
The number of ways of distributing $16$ among these $4$ i.e. $n=16$ and $r=4$, are $binom{16+4-1}{4-1}=binom{19}{3}$.
But there are conditions that $$0lealpha'leq 4, 0leq beta'leq 6, 0leq gamma'leq 5, 0leqdelta'leq 6$$
So, we need to subtract the number of ways of distribution in which these weren't followed.
For example: To calculate the number of sequences in which $alpha^{'}geq 5$, we will first allot $5$ out of $16$ to $alpha^{'}$ and then follow the same formula as follows (so as to distribute $11$ among $4$)
$$binom{16-5+4-1}{4-1}=binom{14}{3}$$
Similarly for $beta'geq7$
$$binom{16-7+4-1}{4-1}=binom{12}{3}$$
$gamma'geq6$
$$binom{16-6+4-1}{4-1}=binom{13}{3}$$
and $delta'geq7$
$$binom{16-7+4-1}{4-1}=binom{12}{3}$$
So, it becomes $$binom{19}{3}-binom{14}{3}-binom{12}{3}-binom{13}{3}-binom{12}{3}$$
Finally, the cases in which at least two conditions failed are also to be subtracted but since they are considered already in the cases in which at least one condition failed, we actually need to subtract them once. Why once? Cases of $alpha^{'}geq 5$ included cases of any of the other three ($beta'leq6;gamma'leq5;delta'leq6$) not following together with or putting similar argument for other three conditions, we can contemplate that all in all $4times 3=12$ terms are already subtracted and that we need to now add the "at least two disobeyed condition cases"($^4C_2=6$ in number).
So, calculating the cases to be added:
For the condition for $alpha$ and $beta$: $binom{16-5-7+3}{3}=binom{7}{3}$
Similarly for others...
The final answer comes out to be
$$binom{19}{3}-binom{14}{3}-binom{12}{3}-binom{13}{3}-binom{12}{3}+binom{7}{3}+binom{6}{3}+binom{6}{3}+binom{8}{3}+binom{7}{3}+binom{5}{3}$$
This is a widely used approach to questions like this and is pretty common! You may feel like a lot of things working but the format is pretty simple. $text{Total - at least one condition followed or whatever + at least two conditions... upto which it is not possible}$. (like here it wasn't possible for any three conditions to hold simultaneously obviously)
answered Dec 18 '18 at 17:42
Sameer BahetiSameer Baheti
5718
$endgroup$
$begingroup$
Thanks for your wonderful explanation. BTW in which year you're studying? My elder brother is also there.
$endgroup$
– jayant98
Dec 18 '18 at 23:34
$begingroup$
I'm a sophomore. What's his name?
$endgroup$
– Sameer Baheti
Dec 19 '18 at 9:13
$begingroup$
He is your senior....Prashant. May not be from same dept. (Since I don't know yours.)
$endgroup$
– jayant98
Dec 19 '18 at 9:41
$begingroup$
You preparing for JEE? This question shouldn't be more than 3 mins...btw from now on
$endgroup$
– Sameer Baheti
Dec 19 '18 at 11:08
$begingroup$
Not for JEE. Preparing for ISI.
$endgroup$
– jayant98
Dec 19 '18 at 13:24
add a comment |
$begingroup$
Converting to $$alpha'+beta'+gamma'+delta'=16$$
The number of ways to distribute $n$ identical things among $r$ different persons/parameters = $binom{n+r-1}{r-1}$
The number of ways of distributing $16$ among these $4$ i.e. $n=16$ and $r=4$, are $binom{16+4-1}{4-1}=binom{19}{3}$.
But there are conditions that $$0lealpha'leq 4, 0leq beta'leq 6, 0leq gamma'leq 5, 0leqdelta'leq 6$$
So, we need to subtract the number of ways of distribution in which these weren't followed.
For example: To calculate the number of sequences in which $alpha^{'}geq 5$, we will first allot $5$ out of $16$ to $alpha^{'}$ and then follow the same formula as follows (so as to distribute $11$ among $4$)
$$binom{16-5+4-1}{4-1}=binom{14}{3}$$
Similarly for $beta'geq7$
$$binom{16-7+4-1}{4-1}=binom{12}{3}$$
$gamma'geq6$
$$binom{16-6+4-1}{4-1}=binom{13}{3}$$
and $delta'geq7$
$$binom{16-7+4-1}{4-1}=binom{12}{3}$$
So, it becomes $$binom{19}{3}-binom{14}{3}-binom{12}{3}-binom{13}{3}-binom{12}{3}$$
Finally, the cases in which at least two conditions failed are also to be subtracted but since they are considered already in the cases in which at least one condition failed, we actually need to subtract them once. Why once? Cases of $alpha^{'}geq 5$ included cases of any of the other three ($beta'leq6;gamma'leq5;delta'leq6$) not following together with or putting similar argument for other three conditions, we can contemplate that all in all $4times 3=12$ terms are already subtracted and that we need to now add the "at least two disobeyed condition cases"($^4C_2=6$ in number).
So, calculating the cases to be added:
For the condition for $alpha$ and $beta$: $binom{16-5-7+3}{3}=binom{7}{3}$
Similarly for others...
The final answer comes out to be
$$binom{19}{3}-binom{14}{3}-binom{12}{3}-binom{13}{3}-binom{12}{3}+binom{7}{3}+binom{6}{3}+binom{6}{3}+binom{8}{3}+binom{7}{3}+binom{5}{3}$$
This is a widely used approach to questions like this and is pretty common! You may feel like a lot of things working but the format is pretty simple. $text{Total - at least one condition followed or whatever + at least two conditions... upto which it is not possible}$. (like here it wasn't possible for any three conditions to hold simultaneously obviously)
answered Dec 18 '18 at 17:42
Sameer BahetiSameer Baheti
5718
$endgroup$
Converting to $$alpha'+beta'+gamma'+delta'=16$$
The number of ways to distribute $n$ identical things among $r$ different persons/parameters = $binom{n+r-1}{r-1}$
The number of ways of distributing $16$ among these $4$ i.e. $n=16$ and $r=4$, are $binom{16+4-1}{4-1}=binom{19}{3}$.
But there are conditions that $$0lealpha'leq 4, 0leq beta'leq 6, 0leq gamma'leq 5, 0leqdelta'leq 6$$
So, we need to subtract the number of ways of distribution in which these weren't followed.
For example: To calculate the number of sequences in which $alpha^{'}geq 5$, we will first allot $5$ out of $16$ to $alpha^{'}$ and then follow the same formula as follows (so as to distribute $11$ among $4$)
$$binom{16-5+4-1}{4-1}=binom{14}{3}$$
Similarly for $beta'geq7$
$$binom{16-7+4-1}{4-1}=binom{12}{3}$$
$gamma'geq6$
$$binom{16-6+4-1}{4-1}=binom{13}{3}$$
and $delta'geq7$
$$binom{16-7+4-1}{4-1}=binom{12}{3}$$
So, it becomes $$binom{19}{3}-binom{14}{3}-binom{12}{3}-binom{13}{3}-binom{12}{3}$$
Finally, the cases in which at least two conditions failed are also to be subtracted but since they are considered already in the cases in which at least one condition failed, we actually need to subtract them once. Why once? Cases of $alpha^{'}geq 5$ included cases of any of the other three ($beta'leq6;gamma'leq5;delta'leq6$) not following together with or putting similar argument for other three conditions, we can contemplate that all in all $4times 3=12$ terms are already subtracted and that we need to now add the "at least two disobeyed condition cases"($^4C_2=6$ in number).
So, calculating the cases to be added:
For the condition for $alpha$ and $beta$: $binom{16-5-7+3}{3}=binom{7}{3}$
Similarly for others...
The final answer comes out to be
$$binom{19}{3}-binom{14}{3}-binom{12}{3}-binom{13}{3}-binom{12}{3}+binom{7}{3}+binom{6}{3}+binom{6}{3}+binom{8}{3}+binom{7}{3}+binom{5}{3}$$
This is a widely used approach to questions like this and is pretty common! You may feel like a lot of things working but the format is pretty simple. $text{Total - at least one condition followed or whatever + at least two conditions... upto which it is not possible}$. (like here it wasn't possible for any three conditions to hold simultaneously obviously)
answered Dec 18 '18 at 17:42
Sameer BahetiSameer Baheti
5718
edited Dec 18 '18 at 17:56
answered Dec 18 '18 at 17:42
Sameer BahetiSameer Baheti
5718
answered Dec 18 '18 at 17:42
Sameer BahetiSameer Baheti
5718
answered Dec 18 '18 at 17:42
Sameer BahetiSameer Baheti
5718
5718
$begingroup$
Thanks for your wonderful explanation. BTW in which year you're studying? My elder brother is also there.
$endgroup$
– jayant98
Dec 18 '18 at 23:34
$begingroup$
I'm a sophomore. What's his name?
$endgroup$
– Sameer Baheti
Dec 19 '18 at 9:13
$begingroup$
He is your senior....Prashant. May not be from same dept. (Since I don't know yours.)
$endgroup$
– jayant98
Dec 19 '18 at 9:41
$begingroup$
You preparing for JEE? This question shouldn't be more than 3 mins...btw from now on
$endgroup$
– Sameer Baheti
Dec 19 '18 at 11:08
$begingroup$
Not for JEE. Preparing for ISI.
$endgroup$
– jayant98
Dec 19 '18 at 13:24
add a comment |
$begingroup$
Thanks for your wonderful explanation. BTW in which year you're studying? My elder brother is also there.
$endgroup$
– jayant98
Dec 18 '18 at 23:34
$begingroup$
I'm a sophomore. What's his name?
$endgroup$
– Sameer Baheti
Dec 19 '18 at 9:13
$begingroup$
He is your senior....Prashant. May not be from same dept. (Since I don't know yours.)
$endgroup$
– jayant98
Dec 19 '18 at 9:41
$begingroup$
You preparing for JEE? This question shouldn't be more than 3 mins...btw from now on
$endgroup$
– Sameer Baheti
Dec 19 '18 at 11:08
$begingroup$
Not for JEE. Preparing for ISI.
$endgroup$
– jayant98
Dec 19 '18 at 13:24
$begingroup$
Thanks for your wonderful explanation. BTW in which year you're studying? My elder brother is also there.
$endgroup$
– jayant98
Dec 18 '18 at 23:34
$begingroup$
Thanks for your wonderful explanation. BTW in which year you're studying? My elder brother is also there.
$endgroup$
– jayant98
Dec 18 '18 at 23:34
$begingroup$
I'm a sophomore. What's his name?
$endgroup$
– Sameer Baheti
Dec 19 '18 at 9:13
$begingroup$
I'm a sophomore. What's his name?
$endgroup$
– Sameer Baheti
Dec 19 '18 at 9:13
$begingroup$
He is your senior....Prashant. May not be from same dept. (Since I don't know yours.)
$endgroup$
– jayant98
Dec 19 '18 at 9:41
$begingroup$
He is your senior....Prashant. May not be from same dept. (Since I don't know yours.)
$endgroup$
– jayant98
Dec 19 '18 at 9:41
$begingroup$
You preparing for JEE? This question shouldn't be more than 3 mins...btw from now on
$endgroup$
– Sameer Baheti
Dec 19 '18 at 11:08
$begingroup$
You preparing for JEE? This question shouldn't be more than 3 mins...btw from now on
$endgroup$
– Sameer Baheti
Dec 19 '18 at 11:08
$begingroup$
Not for JEE. Preparing for ISI.
$endgroup$
– jayant98
Dec 19 '18 at 13:24
$begingroup$
Not for JEE. Preparing for ISI.
$endgroup$
– jayant98
Dec 19 '18 at 13:24
add a comment |
$begingroup$
Here is a proof using the method of generating functions. By adjusting the constraints we may write the problem as finding the number of integral solutions to
$$
alpha'+beta'+gamma'+delta'=16
$$
with $0lealpha'leq 4, 0leq beta'leq 6, 0leq gamma'leq 5, 0leqdelta'leq 6$. The number of solutions is then the coefficient in the expansion of
$$
begin{align}
F(x)&=(1+x+x^2+x^3+x^4)(1+x+dotsb+x^6)^2(1+x+dotsb+x^5)\
&=frac{1-x^5}{1-x}frac{(1-x^7)^2}{(1-x)^2}frac{1-x^6}{1-x}\
&=frac{x^{25} - x^{20} - x^{19} - 2 x^{18} + x^{14} + 2 x^{13} + 2 x^{12} + x^{11} - 2 x^7 - x^6 - x^5 + 1}{(1-x)^4}.
end{align}
$$
For the coeffficient extraction use the fact that
$$
sum_{n=0}^inftybinom{n+3}{3}x^n=(1-x)^{-4}
$$
and linearity of coefficient extraction to get that the number of solutions is
$$
binom{16+3}{3}-binom{16-5+3}{3}-binom{16-6+3}{3}-2binom{16-7+3}{3}+binom{16-11+3}{3}+2binom{16-12+3}{3}+\2binom{16-13+3}{3}+binom{16-14+3}{3}
$$
answered Dec 18 '18 at 16:40
Foobaz JohnFoobaz John
22.3k41452
$endgroup$
$begingroup$
Can you please explain what did you do in the combinations & how? Thanks for the effort. After the line "the number of solutions is"
$endgroup$
– jayant98
Dec 18 '18 at 16:46
add a comment |
$begingroup$
Here is a proof using the method of generating functions. By adjusting the constraints we may write the problem as finding the number of integral solutions to
$$
alpha'+beta'+gamma'+delta'=16
$$
with $0lealpha'leq 4, 0leq beta'leq 6, 0leq gamma'leq 5, 0leqdelta'leq 6$. The number of solutions is then the coefficient in the expansion of
$$
begin{align}
F(x)&=(1+x+x^2+x^3+x^4)(1+x+dotsb+x^6)^2(1+x+dotsb+x^5)\
&=frac{1-x^5}{1-x}frac{(1-x^7)^2}{(1-x)^2}frac{1-x^6}{1-x}\
&=frac{x^{25} - x^{20} - x^{19} - 2 x^{18} + x^{14} + 2 x^{13} + 2 x^{12} + x^{11} - 2 x^7 - x^6 - x^5 + 1}{(1-x)^4}.
end{align}
$$
For the coeffficient extraction use the fact that
$$
sum_{n=0}^inftybinom{n+3}{3}x^n=(1-x)^{-4}
$$
and linearity of coefficient extraction to get that the number of solutions is
$$
binom{16+3}{3}-binom{16-5+3}{3}-binom{16-6+3}{3}-2binom{16-7+3}{3}+binom{16-11+3}{3}+2binom{16-12+3}{3}+\2binom{16-13+3}{3}+binom{16-14+3}{3}
$$
answered Dec 18 '18 at 16:40
Foobaz JohnFoobaz John
22.3k41452
$endgroup$
$begingroup$
Can you please explain what did you do in the combinations & how? Thanks for the effort. After the line "the number of solutions is"
$endgroup$
– jayant98
Dec 18 '18 at 16:46
add a comment |
$begingroup$
Here is a proof using the method of generating functions. By adjusting the constraints we may write the problem as finding the number of integral solutions to
$$
alpha'+beta'+gamma'+delta'=16
$$
with $0lealpha'leq 4, 0leq beta'leq 6, 0leq gamma'leq 5, 0leqdelta'leq 6$. The number of solutions is then the coefficient in the expansion of
$$
begin{align}
F(x)&=(1+x+x^2+x^3+x^4)(1+x+dotsb+x^6)^2(1+x+dotsb+x^5)\
&=frac{1-x^5}{1-x}frac{(1-x^7)^2}{(1-x)^2}frac{1-x^6}{1-x}\
&=frac{x^{25} - x^{20} - x^{19} - 2 x^{18} + x^{14} + 2 x^{13} + 2 x^{12} + x^{11} - 2 x^7 - x^6 - x^5 + 1}{(1-x)^4}.
end{align}
$$
For the coeffficient extraction use the fact that
$$
sum_{n=0}^inftybinom{n+3}{3}x^n=(1-x)^{-4}
$$
and linearity of coefficient extraction to get that the number of solutions is
$$
binom{16+3}{3}-binom{16-5+3}{3}-binom{16-6+3}{3}-2binom{16-7+3}{3}+binom{16-11+3}{3}+2binom{16-12+3}{3}+\2binom{16-13+3}{3}+binom{16-14+3}{3}
$$
answered Dec 18 '18 at 16:40
Foobaz JohnFoobaz John
22.3k41452
$endgroup$
Here is a proof using the method of generating functions. By adjusting the constraints we may write the problem as finding the number of integral solutions to
$$
alpha'+beta'+gamma'+delta'=16
$$
with $0lealpha'leq 4, 0leq beta'leq 6, 0leq gamma'leq 5, 0leqdelta'leq 6$. The number of solutions is then the coefficient in the expansion of
$$
begin{align}
F(x)&=(1+x+x^2+x^3+x^4)(1+x+dotsb+x^6)^2(1+x+dotsb+x^5)\
&=frac{1-x^5}{1-x}frac{(1-x^7)^2}{(1-x)^2}frac{1-x^6}{1-x}\
&=frac{x^{25} - x^{20} - x^{19} - 2 x^{18} + x^{14} + 2 x^{13} + 2 x^{12} + x^{11} - 2 x^7 - x^6 - x^5 + 1}{(1-x)^4}.
end{align}
$$
For the coeffficient extraction use the fact that
$$
sum_{n=0}^inftybinom{n+3}{3}x^n=(1-x)^{-4}
$$
and linearity of coefficient extraction to get that the number of solutions is
$$
binom{16+3}{3}-binom{16-5+3}{3}-binom{16-6+3}{3}-2binom{16-7+3}{3}+binom{16-11+3}{3}+2binom{16-12+3}{3}+\2binom{16-13+3}{3}+binom{16-14+3}{3}
$$
answered Dec 18 '18 at 16:40
Foobaz JohnFoobaz John
22.3k41452
answered Dec 18 '18 at 16:40
Foobaz JohnFoobaz John
22.3k41452
answered Dec 18 '18 at 16:40
Foobaz JohnFoobaz John
22.3k41452
answered Dec 18 '18 at 16:40
Foobaz JohnFoobaz John
22.3k41452
22.3k41452
$begingroup$
Can you please explain what did you do in the combinations & how? Thanks for the effort. After the line "the number of solutions is"
$endgroup$
– jayant98
Dec 18 '18 at 16:46
add a comment |
$begingroup$
Can you please explain what did you do in the combinations & how? Thanks for the effort. After the line "the number of solutions is"
$endgroup$
– jayant98
Dec 18 '18 at 16:46
$begingroup$
Can you please explain what did you do in the combinations & how? Thanks for the effort. After the line "the number of solutions is"
$endgroup$
– jayant98
Dec 18 '18 at 16:46
$begingroup$
Can you please explain what did you do in the combinations & how? Thanks for the effort. After the line "the number of solutions is"
$endgroup$
– jayant98
Dec 18 '18 at 16:46
add a comment |
$begingroup$
One approach would be to first express it as a problem in positive integers; let $a=alpha-1$, $b=beta+2$, $c=gamma$ and $d=delta-3$. Then you want to find the number of nonnegative integers $aleq4$, $bleq6$, $cleq 5$, $dleq6$ such that
$$a+b+c+d=16.$$
Note that, since $a+b+cleq15$ we have $dgeq1$, and similarly $bgeq1$. So by the substitutions $b'=b-1$ and $d'=d-1$ we in fact want to find the number of nonnegative integers $aleq4$, $b'leq5$, $cleq5$, $d'leq5$ such that
$$a+b'+c+d'=14.$$
It is not hard to see that for any choice of $a$, $b'$ and $c$ with $a+b'+cgeq9$ there is a unique $d'$ satisfying the above, and there is no such $d'$ otherwise. So it suffices to count the number of nonnegative integers $aleq4$, $b'leq5$, $cleq5$ satisfying $a+b'+cgeq9$. We can count them as follows:
There is one solution to $a+b'=9$, and any value of $c$ yields a solution. This yields a total of $1times6=6$ solutions.
There are two solutions to $a+b'=8$, and any value of $cgeq1$ yields a solution. This yields a total of $2times5=10$ solutions.
There are three solutions to $a+b'=7$, and any value of $cgeq2$ yields a solution. This yields a total of $3times4=12$ solutions.
There are four solutions to $a+b'=6$, and any value of $cgeq3$ yields a solution. This yields a total of $4times3=12$ solutions.
There are five solutions to $a+b'=5$, and any value of $cgeq4$ yields a solution. This yields a total of $5times2=10$ solutions.
There are five solutions to $a+b'=4$, and any value of $cgeq5$ yields a solution. This yields a total of $5times1=5$ solutions.
For $a+b'<4$ there are no solutions. Adding all the above together yields a total of $6+10+12+12+10+5=55$ solutions.
answered Dec 18 '18 at 16:37
ServaesServaes
25.9k33996
$endgroup$
add a comment |
$begingroup$
One approach would be to first express it as a problem in positive integers; let $a=alpha-1$, $b=beta+2$, $c=gamma$ and $d=delta-3$. Then you want to find the number of nonnegative integers $aleq4$, $bleq6$, $cleq 5$, $dleq6$ such that
$$a+b+c+d=16.$$
Note that, since $a+b+cleq15$ we have $dgeq1$, and similarly $bgeq1$. So by the substitutions $b'=b-1$ and $d'=d-1$ we in fact want to find the number of nonnegative integers $aleq4$, $b'leq5$, $cleq5$, $d'leq5$ such that
$$a+b'+c+d'=14.$$
It is not hard to see that for any choice of $a$, $b'$ and $c$ with $a+b'+cgeq9$ there is a unique $d'$ satisfying the above, and there is no such $d'$ otherwise. So it suffices to count the number of nonnegative integers $aleq4$, $b'leq5$, $cleq5$ satisfying $a+b'+cgeq9$. We can count them as follows:
There is one solution to $a+b'=9$, and any value of $c$ yields a solution. This yields a total of $1times6=6$ solutions.
There are two solutions to $a+b'=8$, and any value of $cgeq1$ yields a solution. This yields a total of $2times5=10$ solutions.
There are three solutions to $a+b'=7$, and any value of $cgeq2$ yields a solution. This yields a total of $3times4=12$ solutions.
There are four solutions to $a+b'=6$, and any value of $cgeq3$ yields a solution. This yields a total of $4times3=12$ solutions.
There are five solutions to $a+b'=5$, and any value of $cgeq4$ yields a solution. This yields a total of $5times2=10$ solutions.
There are five solutions to $a+b'=4$, and any value of $cgeq5$ yields a solution. This yields a total of $5times1=5$ solutions.
For $a+b'<4$ there are no solutions. Adding all the above together yields a total of $6+10+12+12+10+5=55$ solutions.
answered Dec 18 '18 at 16:37
ServaesServaes
25.9k33996
$endgroup$
add a comment |
$begingroup$
One approach would be to first express it as a problem in positive integers; let $a=alpha-1$, $b=beta+2$, $c=gamma$ and $d=delta-3$. Then you want to find the number of nonnegative integers $aleq4$, $bleq6$, $cleq 5$, $dleq6$ such that
$$a+b+c+d=16.$$
Note that, since $a+b+cleq15$ we have $dgeq1$, and similarly $bgeq1$. So by the substitutions $b'=b-1$ and $d'=d-1$ we in fact want to find the number of nonnegative integers $aleq4$, $b'leq5$, $cleq5$, $d'leq5$ such that
$$a+b'+c+d'=14.$$
It is not hard to see that for any choice of $a$, $b'$ and $c$ with $a+b'+cgeq9$ there is a unique $d'$ satisfying the above, and there is no such $d'$ otherwise. So it suffices to count the number of nonnegative integers $aleq4$, $b'leq5$, $cleq5$ satisfying $a+b'+cgeq9$. We can count them as follows:
There is one solution to $a+b'=9$, and any value of $c$ yields a solution. This yields a total of $1times6=6$ solutions.
There are two solutions to $a+b'=8$, and any value of $cgeq1$ yields a solution. This yields a total of $2times5=10$ solutions.
There are three solutions to $a+b'=7$, and any value of $cgeq2$ yields a solution. This yields a total of $3times4=12$ solutions.
There are four solutions to $a+b'=6$, and any value of $cgeq3$ yields a solution. This yields a total of $4times3=12$ solutions.
There are five solutions to $a+b'=5$, and any value of $cgeq4$ yields a solution. This yields a total of $5times2=10$ solutions.
There are five solutions to $a+b'=4$, and any value of $cgeq5$ yields a solution. This yields a total of $5times1=5$ solutions.
For $a+b'<4$ there are no solutions. Adding all the above together yields a total of $6+10+12+12+10+5=55$ solutions.
answered Dec 18 '18 at 16:37
ServaesServaes
25.9k33996
$endgroup$
One approach would be to first express it as a problem in positive integers; let $a=alpha-1$, $b=beta+2$, $c=gamma$ and $d=delta-3$. Then you want to find the number of nonnegative integers $aleq4$, $bleq6$, $cleq 5$, $dleq6$ such that
$$a+b+c+d=16.$$
Note that, since $a+b+cleq15$ we have $dgeq1$, and similarly $bgeq1$. So by the substitutions $b'=b-1$ and $d'=d-1$ we in fact want to find the number of nonnegative integers $aleq4$, $b'leq5$, $cleq5$, $d'leq5$ such that
$$a+b'+c+d'=14.$$
It is not hard to see that for any choice of $a$, $b'$ and $c$ with $a+b'+cgeq9$ there is a unique $d'$ satisfying the above, and there is no such $d'$ otherwise. So it suffices to count the number of nonnegative integers $aleq4$, $b'leq5$, $cleq5$ satisfying $a+b'+cgeq9$. We can count them as follows:
There is one solution to $a+b'=9$, and any value of $c$ yields a solution. This yields a total of $1times6=6$ solutions.
There are two solutions to $a+b'=8$, and any value of $cgeq1$ yields a solution. This yields a total of $2times5=10$ solutions.
There are three solutions to $a+b'=7$, and any value of $cgeq2$ yields a solution. This yields a total of $3times4=12$ solutions.
There are four solutions to $a+b'=6$, and any value of $cgeq3$ yields a solution. This yields a total of $4times3=12$ solutions.
There are five solutions to $a+b'=5$, and any value of $cgeq4$ yields a solution. This yields a total of $5times2=10$ solutions.
There are five solutions to $a+b'=4$, and any value of $cgeq5$ yields a solution. This yields a total of $5times1=5$ solutions.
For $a+b'<4$ there are no solutions. Adding all the above together yields a total of $6+10+12+12+10+5=55$ solutions.
answered Dec 18 '18 at 16:37
ServaesServaes
25.9k33996
edited Dec 18 '18 at 16:45
answered Dec 18 '18 at 16:37
ServaesServaes
25.9k33996
answered Dec 18 '18 at 16:37
ServaesServaes
25.9k33996
answered Dec 18 '18 at 16:37
ServaesServaes
25.9k33996
25.9k33996
add a comment |
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%2f3045331%2fthe-number-of-integral-solution-of-alpha-beta-gamma-delta-18-such-that%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
2
$begingroup$
A computer could easily do this by brute force... I'm assuming you're looking for a more efficient method?
$endgroup$
– pwerth
Dec 18 '18 at 16:04
$begingroup$
@pwerth Yes. I have to do like these questions in exams.
$endgroup$
– jayant98
Dec 18 '18 at 16:07
1
$begingroup$
Use the method of generating functions
$endgroup$
– Foobaz John
Dec 18 '18 at 16:20
$begingroup$
@Foobaz Sorry, I don't know what you want to say. How can we generate functions?
$endgroup$
– jayant98
Dec 18 '18 at 16:21
$begingroup$
@pwerth A human could also easily do this by brute force.
$endgroup$
– Servaes
Dec 18 '18 at 16:33