How many integer solutions are there for $x_1+x_2+x_3+x_4+x_5=75$, with $1\leq i \leq 5,$ and $ x_1=x_5$ ?
I think I understand that if $x_1=x_5$ wasn't part of it, then it would be $\binom{n-1}{k-1}.$
But if someone could explain how I deal with the $x_1=x_5$ that would be great!
On
Remember if $x_1=x_5$ this expression can be rewritten as $2x_1+x_2+x_3+x_4=75$
This implies $3\leq x_2+x_3+x_4\leq73$ and that sum is odd. Can you find how many ways this is true
On
I haven't done combinatorics in a long time so I might not give you the correct answer but here are some thoughts:
First off, perhaps you should clarify/consider if zeros are allowed. Let's suppose this is so. Think about how your formula can be justified combinatorially: using balls and walls. You can read that here: https://math.dartmouth.edu/archive/m68f09/public_html/m68l02.pdf
I would think of a simpler case. writing 5 as a sum of 4 parts c1, c2, c3 and c4. My idea would then be that we would have 3 cases: c1=c4=0,1 or 2 (3 won't do it). Also notice that I'm using a multiple of 5 for a reason. I guess you would have to take the floor or ceiling function of 75/2.
We're gonna have to use 3 walls (k-1 in your formula). Case 1 looks like this: $\underset{c1}{}|\underset{c2}{\text{some balls}}|\underset{c3}{\text{some balls}}|\underset{c4}{}$. Of course, under "some balls" we know we have 5 of them and c1 and c4 are chosen to have none. The problem then becomes: in how many ways can we write 5 has a sum of 2 nonnegative integers? Here, n=5 and k=1.
Case 2 has c1=c4=1 so we have the question: in how many ways can we write 5-2=3 as a sum of 2 nonnegative integers (remaining balls)? Run through all the cases and add them up.
Does this makes sense? Maybe there's a way easier way to solve this but hey, its an idea. What I'm saying is that my strategy would be to consider the actual proof and see what modifications need to be made
Hint: Consider calculating how many positive integer solutions there are to $$2x_1 + x_2 + x_3 + x_4= 75\;?$$