How many ordered quadruples of distinct positive integers ( a , b , c , d ) are there such that a 1 + b 1 + c 1 + d 1 = 1 ?
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
The preferred way of obtaining solutions (in Case 1) would be to use the factorization ( d − 6 ) ( c − 6 ) = 3 6 . However, all the students that presented a solution through this method only considered the positive factors of 36, and left out the negative factors.
I kept on inputting 6 and I got it wrong. Oops forgot to multiply by 4 ! . :(
As the numbers a,b,c and d are distinct positive integers, they will follow some order.
Let us take , for once, a > b > c > d. Then, 1/a < 1/b < 1/c < 1/d
So the given expression 1/a+ 1/b + 1/c+ 1/d (=1) < 4/d i.e., d<4 So d can attain values 1,2 ,3
d=1 is not possible since 1/a + 1/b+ 1/c cannot be 0 Now we have two possibilities, d=2 and d =3
Case 1: d=2
1/a +1/b+ 1/c = 1-1/2 = 1/2
As we have taken a >b>c>d , 1/a + 1/b + 1/c < 3/c i.e. 1/2 < 3/c i.e., c < 6 Since c is to be an integer, c can assume values 1,2,3,4,5 c = 1 and c=2 are clearly not possible.
(1) c= 3 1/a +1/b= 1/2 - 1/3 = 1/6
By the same assumption, 1/6 < 2/b i.e., b< 12 b can have values 1, 2,3,4,5,6,7,8,9,10,11 out of which b=1 or 2 or 3 are clearly not possible.
b=4 gives a = -2/24 not possible
b=5 gives a = -1/30 not possible
b=6 gives 1/a = 0 not possible
b=7 gives a= 42
b=8 gives a= 24
b=9 gives a= 18
b=10 gives a= 15
b=11 gives a= 5/66 not possible
(2) c = 4
1/a + 1/b = 1/2 - 1/4 = 1/4
By the similar argument, 1/4 < 2/b i.e. b< 8
Then, b=1,2, 3,4 can be rejected .
b =5 gives a= 20
b =6 gives a= 12
b=7 gives a=3/28 not possible
(3) for c=5 , 1/a+ 1/b = 3/10
b< 20/3 i.e, b can have values 1,2,3,4,5,6 of which all values are ineligible. Hence no possible solution for c=5.
Case 2: d=3 By similar calculations, we can check that there is no possible solution for d= 3 also.
Hence the final quadruples are- ( 42,7,3,2 ) , ( 24,8,3,2) , ( 18,9,3,2) , ( 15,10,3,2), (20,5,4,2) , and (12,6,4,2). Now that we had assumed in the beginning that a>b>c>d and worked for it, total number of quadruples would be 6* 4! i.e. total 144 possible quadruples {since we can arrange the integers a,b,c and d in 4! ways }
Without lost of the generality, assume a < b < c < d . It implies a 1 > b 1 > c 1 > d 1 . Then, 1 = a 1 + b 1 + c 1 + d 1 < a 4 ⟺ a < 4 but a = 1 . So there are only two possible value for a i.e. a = 2 or a = 3 .
Case 1 : a = 2
Hence, 2 1 = b 1 + c 1 + d 1 < b 3 ⟺ b < 6 and also b > a = 2 .
@ If b = 3 then 6 1 = c 1 + d 1 < c 2 ⟺ c < 1 2 and c > 6 .Therefore the possible value for c is 7 , 8 , 9 , 1 0 , 1 1 . After checking one by one we get solution ( 2 , 3 , 7 , 4 2 ) , ( 2 , 3 , 8 , 2 4 ) , ( 2 , 3 , 9 , 1 8 ) and ( 2 , 3 , 1 0 , 1 5 ) .
@ If b = 4 then 4 1 = c 1 + d 1 < c 2 ⟺ c < 8 and c > 4 .Therefore the possible value for c is 5 , 6 , 7 . After checking one by one we get solution ( 2 , 4 , 5 , 2 0 ) and ( 2 , 4 , 6 , 1 2 ) .
@ If b = 5 then 1 0 3 = c 1 + d 1 < c 2 ⟺ c < 3 2 0 and c > 5 implies c = 6 but there is no solution for d .
Case 2 : a = 3
Hence 3 2 = b 1 + c 1 + d 1 < b 3 ⟺ b < 2 9 and since b > a = 3 , implies b = 4 . Then we get 1 2 5 = c 1 + d 1 < c 2 ⟺ c < 5 2 4 . Since c > b = 4 there is no solution for c .
Therefore we get six solution, ( 2 , 3 , 7 , 4 2 ) , ( 2 , 3 , 8 , 2 4 ) , ( 2 , 3 , 9 , 1 8 ) , ( 2 , 3 , 1 0 , 1 5 ) , ( 2 , 4 , 5 , 2 0 ) , ( 2 , 4 , 6 , 1 2 ) . Since all of its permutation is also a solution we get total 6 × 4 ! = 1 4 4 solution.
Let us consider the lower bound for any of a, b, c or d.
Considering that each of the integers are distinct, consider the highest possible reciprocal sum of 4 numbers that do not include 2.
This is:
(1/3)+(1/4)+(1/5)+(1/6) = 19/20 < 1
Therefore, in order to get a sum total of 1, we need to have one of the integers as 2.
For now, assume that d = 2. Note that no other integers can be 2, as that would give us a sum of 1 already. So, we are left with:
1/a +1/b + 1/c = 1/2
Now, as 1/6 + 1/6 + 1/6 = 1/2, we notice that the average of the 3 fractions is 1/6, but, as they are all distinct, we can infer that atleast one of the fractions must be greater than 1/6, let us assume this is 1/c.
So,1/2> 1/c > 1/6
\Rightarrow 2< c <6.
So, c must be either 3, 4 or 5.
Let us consider these individual possibilities.
If c= 3,
then, 1/a + 1/b = 1/6
\Rightarrow (a-6)(b-6) = 36
As a-6 and b-6 are integers, let us consider the distinct integer pairs that multiply into 36,
(a-6)(b-6) = 36 x 1 = 18 x 2 = 12 x 3= 9 x 4
Pairing these individually, for example, a-6 = 36 and b-6 = 1 or a-6 = 18 and b-6= 2. we get 4 pairs of distinct integers, namely,
(42,7), (24,8), (18, 9), (15, 10).
Now let us consider the case that c = 4.
Following the same process, we get integer pairs, (20,5) and (12, 6).
Considering when c = 5, we find that there are no pair of unit fractions that satisfy the equation.
So, we have 4+2= 6 integer quadruples in total. Accounting for all the possible permutations,
we have 6 x 4!= 144 possible distinct integer quadruples.
First of all, let ( w , x , y , z ) be the ordered form of ( a , b , c , d ) , in other words, it is a permutation of ( a , b , c , d ) such that w < x < y < z .
We notice that w must be smaller than 3 or w 1 + x 1 + y 1 + z 1 ≤ 3 1 + 4 1 + 5 1 + 6 1 = 2 0 1 9 < 1 . Also w cannot be equal to 1 or x 1 + y 1 + z 1 = 0 contradicts that they are positive. So w = 2 .
So x 1 + y 1 + z 1 = 2 1
Now since 6 1 + 7 1 + 8 1 = 1 6 8 7 3 < 2 1 , using the same logic above we know that x < 6 . So x = 3 , 4 or 5 .
If x = 3 , we obtain y 1 + z 1 6 ( y + z ) ( y − 6 ) ( z − 6 ) = 6 1 = y z = 3 6 = 1 ⋅ 3 6 = 2 ⋅ 1 8 = 3 ⋅ 1 2 = 4 ⋅ 9 = 6 ⋅ 6 since y < z , we could have ( y , z ) = ( 7 , 4 2 ) , ( 8 , 2 4 ) , ( 9 , 1 8 ) or ( 1 0 , 1 5 ) .
If x = 4 , similar to above we obtain ( y − 4 ) ( z − 4 ) = 1 6 = 1 ⋅ 1 6 = 2 ⋅ 8 = 4 ⋅ 4 so ( y , z ) = ( 5 , 2 0 ) or ( 6 , 1 2 ) .
So ( w , x , y , z ) = ( 2 , 3 , 7 , 4 2 ) , ( 2 , 3 , 8 , 2 4 ) , ( 2 , 3 , 9 , 1 8 ) , ( 2 , 3 , 1 0 , 1 5 ) , ( 2 , 4 , 5 , 2 0 ) or ( 2 , 4 , 6 , 1 2 ) . For each ( w , x , y , z ) there are 4 ! = 2 4 solutions to ( a , b , c , d ) . Thus there are 6 ⋅ 2 4 = 1 4 4 quadruples in total.
Same way...
Let a < b < c < d .
Suppose a ≥ 3 .
Then a 1 + b 1 + c 1 + d 1 ≤ 3 1 + 4 1 + 5 1 + 6 1 < 1
Therefore a = 2 , since a = 1 , else a 1 + b 1 + c 1 + d 1 > 1
Thus b 1 + c 1 + d 1 = 2 1 .
Suppose b > 5 . Then b 1 + c 1 + d 1 ≤ 6 1 + 7 1 + 8 1 < 2 1 . Thus b ≤ 5
Suppose b = 5 . Then c 1 + d 1 = 1 0 3 .
If c = 6 , it is easy to see d is not an integer.
If c ≥ 7 , c 1 + d 1 ≤ 7 1 + 8 1 < 1 0 3 .
Thus we have:
Case 1: b = 3 and Case 2: b = 4
Case 1:
We see c 1 + d 1 = 2 1 − 3 1 = 6 1
Multiplying by 6 c d , we get
6 c + 6 d = c d
By rearranging, we get
c d − 6 c − 6 d + 3 6 = 3 6
( c − 6 ) ( d − 6 ) = 3 6
By factoring 36, we see c − 6 = 1 , 2 , 3 , or 4 , since c − 6 < d − 6
That makes 4 solutions in case 1.
Case 2:
We see c 1 + d 1 = 2 1 − 4 1 = 6 4 1
Multiplying by 4 c d , we get
4 c + 4 d = c d
By rearranging, we get
c d − 4 c − 4 d + 1 6 = 1 6
( c − 4 ) ( d − 4 ) = 1 6
By factoring 16, we see c − 4 = 1 or 2 , since c − 4 < d − 4
That makes 2 solutions in case 2.
Since the 6 solutions we found are ordered, we have to multiply by 4 !
Total quadruples = 6 × 4 ! = 1 4 4
WLOG, let a > b > c > d
Now if d = 1 it would not be possible as it implies a 1 + b 1 + c 1 = 0
If d ≥ 3 then;
a 1 + b 1 + c 1 + d 1 ≤ 6 1 + 5 1 + 4 1 + 3 1 = 2 0 1 9 < 1
Which is not what we want, so we have d < 3 or d = 2
Hence; a 1 + b 1 + c 1 = 2 1
Now if c ≥ 6 , then;
a 1 + b 1 + c 1 ≤ 8 1 + 7 1 + 6 1 = 1 6 8 7 3 < 2 1
Which is not what we want, so we have c < 6
So we need to consider the cases where c = 3 , 4 , 5
Case 1: c = 3
Hence a 1 + b 1 = 6 1 ⇒ ( a − 6 ) ( b − 6 ) = 3 6
Since a and b are integers, we would then only need to consider the factors of 36. And as;
3 6 = 3 6 × 1 = 1 8 × 2 = 1 2 × 3 = 9 × 4 = 6 × 6
We will get solutions ( a , b ) :
( 4 2 , 7 ) , ( 2 4 , 8 ) , ( 1 8 , 9 ) , ( 1 5 , 1 0 ) respectively. Note we reject the possibility of 6 × 6 as a and b are distinct.
Case 2: c = 4
Hence a 1 + b 1 = 4 1 ⇒ ( a − 4 ) ( b − 4 ) = 1 6
By a similar argument as above and that; 1 6 = 1 6 × 1 = 8 × 2 = 4 × 4
We will get solutions ( a , b ) :
( 2 0 , 5 ) , ( 1 2 , 6 ) respectively. Note we reject the possibility of 4 × 4 as a and b are distinct.
Case 3: c = 5
If so, a 1 + b 1 = 5 2
If b ≥ 7 ,
a 1 + b 1 ≤ 8 1 + 7 1 = 5 6 1 5 < 5 2
So b = 6 , but this means that a = 7 3 0 , where it is not an integer. Hence there is no possible solutions for this case.
Summing up, the solutions possible for ( a , b , c , d ) are ( 4 2 , 7 , 3 , 2 ) , ( 2 4 , 8 , 3 , 2 ) , ( 1 8 , 9 , 3 , 2 ) , ( 1 5 , 1 0 , 3 , 2 ) , ( 2 0 , 5 , 4 , 2 ) , ( 1 2 , 6 , 4 , 2 ) .
Hence we need to find the permutations of the 6 possible combinations of quadruples found, which is 6 × 4 ! = 1 4 4
First, we assume that 1 < a < b < c < d and count the number of solutions. Since 3 1 + 4 1 + 5 1 + 6 1 = 2 0 1 9 < 1 , thus we must have a < 3 . Since a > 1 , thus a = 2 . Now we want to solve b 1 + c 1 + d 1 = 2 1 . Since 6 1 + 7 1 + 8 1 < 6 3 = 2 1 , hence we must have 2 < b < 6 . We have the following cases:
Case 1: b = 3 , c 1 + d 1 = 6 1 . We have 6 1 > c 1 and 6 1 = c 1 + d 1 < c 1 + c 1 = c 2 which gives 6 < c < 1 2 . Thus, the solutions are ( c , d ) = ( 7 , 4 2 ) , ( 8 , 2 4 ) , ( 9 , 1 8 ) , ( 1 0 , 1 5 ) , and c = 1 1 does not yield an integer d .
Case 2: b = 4 , c 1 + d 1 = 4 1 . Similar to the argument above, we have 8 1 < c 1 < 4 1 which gives 4 < c < 8 . Thus the solutions are ( c , d ) = ( 5 , 2 0 ) , ( 6 , 1 2 ) , and c = 7 does not yield an integer d .
Case 3: b = 5 , c 1 + d 1 = 1 0 3 . Similar to the argument in Case 1, we have 2 0 3 < c 1 < 1 0 3 , which gives 4 ≤ c ≤ 6 . Since c > b = 5 , we have c = 6 , but this doesn’t yield an integer d .
Hence, with the assumption a < b < c < d , there are 6 solutions. Thus, there are 6 × 4 ! = 1 4 4 solutions in all.
Note: The standard way to solve c 1 + d 1 = 6 1 is to cross multiply to obtain c d = 6 c + 6 c ⇒ ( c − 6 ) ( d − 6 ) = 3 6 , and so c − 6 and d − 6 are (possibly negative) factors of 36. However, we cannot use the same procedure for c 1 + d 1 = 1 0 3 .
Problem Loading...
Note Loading...
Set Loading...
WLOG, let a < b < c < d . We will multiply our result by 4 ! at the end. If a ≥ 3 then a 1 + b 1 + c 1 + d 1 ≤ 3 1 + 4 1 + 5 1 + 6 1 < 1 . Clearly a = 1 doesn't work. Hence a = 2 is the only possible a . Hence b 1 + c 1 + d 1 = 2 1 , so b 1 > 6 1 , i.e. 3 ≤ b ≤ 5 .
Case 1. b = 3 : In a similar way c 1 + d 1 = 1 − 2 1 − 3 1 = 6 1 , so c 1 > 1 2 1 , i.e. 7 ≤ c ≤ 1 1 . We test these possible c and find that c = 7 , 8 , 9 , 1 0 gives integer d = 4 2 , 2 4 , 1 8 , 1 5 respectively.
Case 2. b = 4 : c 1 + d 1 = 1 − 2 1 − 4 1 = 4 1 , so c 1 > 8 1 , i.e. 5 ≤ c ≤ 7 . We test these possible c and find that c = 5 , 6 gives integer d = 2 0 , 1 2 respectively.
Case 3. b = 5 : c 1 + d 1 = 1 − 2 1 − 5 1 = 1 0 3 , so c 1 > 2 0 3 , i.e. c = 6 . ( c < 6 will not satisfy b < c ). c = 6 does not give an integer value for d .
Hence there are 6 solutions: ( a , b , c , d ) = ( 2 , 3 , 7 , 4 2 ) , ( 2 , 3 , 8 , 2 4 ) , ( 2 , 3 , 9 , 1 8 ) , ( 2 , 3 , 1 0 , 1 5 ) , ( 2 , 4 , 5 , 2 0 ) , ( 2 , 4 , 6 , 1 2 ) Then we multiply 4 ! = 2 4 as this question wants ordered quadruples (each of the above 6 solutions can be reordered in 2 4 different ways). Hence 6 × 2 4 = 1 4 4 .