Solution 1
Rearranging the inequality we get d−c>b−a. Let e=11, then (a,b−a,c−b,d−c,e−d) is a partition of 11 into 5 positive integers or equivalently: (a−1,b−a−1,c−b−1,d−c−1,e−d−1) is a partition of 6 into 5 non-negative integer parts. Via a standard stars and bars argument, the number of ways to partition 6 into 5 non-negative parts is (46+4)=(410)=210. The interesting quadruples correspond to partitions where the second number is less than the fourth. By symmetry, there are as many partitions where the fourth is less than the second. So, if N is the number of partitions where the second element is equal to the fourth, our answer is (210−N)/2.
We find N as a sum of 4 cases:
- two parts equal to zero, (28)=28 ways,
- two parts equal to one, (26)=15 ways,
- two parts equal to two, (24)=6 ways,
- two parts equal to three, (22)=1 way.
Therefore, N=28+15+6+1=50 and our answer is (210−50)/2=080
Solution 2
Let us consider our quadruple (a,b,c,d) as the following image xaxbcxxdxx. The location of the letter a, b, c, d represents its value and x is a place holder. Clearly the quadruple is interesting if there are more place holders between c and d than there are between a and b.
0 holders between a and b means we consider a and b as one unit ab and c as cx yielding (38)=56 ways;
1 holder between a and b means we consider a and b as one unit axb and c as cxx yielding (36)=20 ways;
2 holders between a and b means we consider a and b as one unit axxb and c as cxxx yielding (34)=4 ways.
Since there cannot be 3 holders between a and b so our total is 56+20+4=080.
Solution 3 (Slightly bashy)
We first start out when the value of a=1.
Doing casework, we discover that d=5,6,7,8,9,10. We quickly find a pattern.
Now, doing this for the rest of the values of a and d, we see that the answer is simply:
(1)+(2)+(1+3)+(2+4)+(1+3+5)+(2+4+6)+(1)+(2)+(1+3)+(2+4) +(1+3+5)+(1)+(2)+(1+3)+(2+4)+(1)+(2)+(1+3)+(1)+(2)+(1)=080
Solution 4 (quick)
Notice that if a+d>b+c, then (11−a)+(11−d)<(11−b)+(11−c), so there is a bijection between the number of ordered quadruples with a+d>b+c and the number of ordered quadruples with $a+d.
Quick counting gives that the number of ordered quadruples with a+d=b+c is 50. To count this, consider our numbers 1,2,3,4,5,6,7,8,9,10. Notice that if, for example, a+d=b+c=8, that the average of a,d and b,c must both be 4. In this way, there is a symmetry for this case, centered at 4. If instead, say, a+d=b+c=7, an odd number, then there is symmetry with (a,d);(b,c) about 3.5. Further, the number of cases for each of these centers of symmetry correspond to a triangular number. Eg centered at 2.5 and 3 there is 1 case for each, followed by 3 cases for 3.5 and 4, and so on, until it reaches 5.5, where there are 10 possible cases. Then from 6 to 8.5, the number of cases for each goes back down all the way to 1. Adding these all, we have 2(1+1+3+3+6+6)+10=50.
Thus the answer is 2(410)−50=080.
~minor edits by andrewxliu
Solution 5
Think about a,b,c,and d as distinct objects, that we must place in 4 of 10 spaces. However, in only 1 of 24 of these combinations, will the placement of these objects satisfy the condition in the problem. So we know the total number of ordered quadruples is (10∗9∗8∗7/24)=210
Next, intuitively, the number of quadruples where a+d>b+c is equal to the number of quadruples where a+d.Soweneedtofindthenumberofquadrupleswherethetwoquantitiesareequal.Todothis,allwehavetodoisconsiderthecaseswhena-drangesfrom3to9.Itwouldseemnaturalthatarangeof3wouldproduce1option,andarangeof4wouldproduce2options.However,sincebandccannotbeequal,arangeof3or4produces1optioneach,arangeof5or6produces2optionseach,arangeof7or8produces3optionseach,andarangeof9willproduce4options.Inaddition,arangeofnhas10−noptionsforcombinationsofaandd.Multiplyingthenumberofcombinationsofaanddbythecorrespondingnumberofoptionsforbandcgivesus50totalquadrupletswherea+d=b+c$.
So the answer will be 2210−50=080.
Solution 6
Let b=a+x and c=a+x+y and d=a+x+y+z for positive integers x,y,z. In order to satisfy the other condition we need z>x so we let z=x+k. Now the only other condition we need to satisfy so a+2x+y+k≤10. This condition can be transformed into a+2x+y+k+b=11 for positive a,x,y,k,b. Now we use generating functions to finish. We find the generating function of the whole expression is (x+x2+⋯)4⋅(x2+x4+⋯) and we are looking for the x11 coefficient. This simplifies to finding the x5 coefficient of (1+x+⋯)4⋅(1+x2+⋯)=(1−x)41⋅1+x1. Now this expression simplifies to
((44)+(45)+⋯+(44+k)xk)(1−x+x2−x3⋯).
The x5 coefficient ends up to be (49)−(48)+(47)−(46)+(45)−(44)=126−70+35−15+5−1=080.
Solution 7 (Slightly Slower)
First, let a=1 and d=10. If b=2, then c can be from 3 to 8. If b=3, then 4 to 7. If b=4, then c is between 5 and 6. We find a pattern that whenever b increases by 1, when a and d are stationary, then the possible values of c decrease by 2, unless it gets to zero or negative, in which case that case ends. Counting up, we have 6+4+2=12 different possibilities when a=1 and d=10. For a=1 and d=9, b=2, then c can be from 3 to 7. If b=3, then c can be from 4 to 6, and so on. Notice that the possible values for each case of b gets one less than if d were one greater, unless that number is zero, in which it stays zero. We then use this pattern to find all the values: 12+9+6+4+2+1+9+6+4+2+1+6+4+2+1+4+2+1+2+1+1⇒12⋅1+9⋅2+6⋅3+4⋅4+2⋅5+1⋅6=12+18+18+16+10+6=080.
~SweetMango77
Note
Note that the first value of each of the rows, if we arrange them based on values of a, is deleted after each row.
Solution 8
Rearranging the equation obtains b−a.Leta-0=e_0,b-a=e_3+e_1,c-b=e_2,d-c=e_3,11-d=e_4.Addupallofthesenewlydefinedequationstoobtaine_0+e_1+e_2+2e_3+e_4=11.Notethatsincealle_nweredefinedtobee_n\ge1,toformourstarsandbarsargumentwecanletd_n+1=e_nforalln.Thenweobtaind_0+d_1+d_2+2d_3+d_4=5whered_nisnonnegative.Now,wecanmovethe2d_3$ term to the other side and perform casework.
If 2d3=0: 5 objects for 4 variables -> (38)
If 2d3=2: 3 objects for 4 variables -> (36)
If 2d3=4: 1 object for 4 variables -> (34)
Adding all of these cases up, we get 56+20+4=080 as our requested answer.
~sigma