Four positive integers a , b , c , d satisfy a b c d = 1 0 ! .
What is the smallest possible value of a + b + c + d ?
Notation:
!
is the
factorial
notation. For example,
8
!
=
1
×
2
×
3
×
⋯
×
8
.
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.
yes sir that is correct and your initial solution was also detailed and more informative as it also provided the four numbers when the least possible sum will take place. thank you sir
Hows it by soing AM GM sir?
Log in to reply
Yes, good point. As Sathvik is also implying, we know that
a + b + c + d ≥ 4 × ( 1 0 ! ) 1 / 4 ≈ 1 7 4 . 5 8 .
Since a , b , c , d are integers this then means that a + b + c + d ≥ 1 7 5 ,
and the minimum can be achieved when ( a , b , c , d ) = ( 4 0 , 4 2 , 4 5 , 4 8 ) .
It is very clear that 1 can go with any of a, b, c, or d. So we will not consider 1.
It is clear that say group G1={10, 9, 8, 7} in {a,b,c,d} in same order to achieve minimum
by putting the four biggest numbers in separate letters.
Now the next group G2={ 3,4,5,6} in { a,b,c,d} in same order to achieve minimum product between elements of same letter.
Here is the catch. Here six can be obtained in TWO ways. 2 * 3 and 6 alone. (I missed this point!!)
Naturally, any one will be with 7 and the other with 8. So that now, corrected G2={4,5,6, 2 * 3}.
So G1 + G2={10 * 4, 9 * 5, 8 * 6, 7 * 3 * 2}= {a,b,c,d} and 1 with any one of the letters.
So a+b+c+d = 40 + 45 + 48 + 42 =
1
7
5
.
yeah that's a good solution but you can even find the answer without finding a,b,c and d by just approximating 4 times the 4th root of 10!.
The Minimum can be achieved Like Brian Sir, Did it, And I suggested this meathod, I did it like this
By AM - GM Inequality
4 a + b + c + d ≥ ( 1 0 ! ) 4 1 Making It
a + b + c + d ≥ 4 × ( 1 0 ! ) 4 1
So we get Minimum of a+b+c+d ≈ 1 7 4 . 5 8
So as a , b ,c ,d are integers
So M i n ( a + b + c + d ) = 1 7 5 and it is minimum at ( a , b , c , d ) = ( 4 0 , 4 2 , 4 5 , 4 8 ) .
sir can you please tell me how do we arrive at the values of a,b,c and d. is it that we have to make the factors as close as possible but my doubt is can we find a,b,c and d in one shot without checking whether there are other numbers that give a better minimum sum
Log in to reply
Its not possible I think. I just got it from @Brian Charlesworth sir. Also dont call me sir. I am a Xth standrd bou
Log in to reply
I believe anybody who has a greater knowledge than himself/herself deserves to be called with respect. thank you
Once the AM-GM analysis indicates that the minimum possible sum is 1 7 5 , and then we are able to find a , b , c , d such that a + b + c + d = 1 7 5 , we don't have to worry about there being numbers that give a better minimum sum. As for finding the specific optimal numbers for a , b , c , d , that just took a bit of juggling with the prime factors of 1 0 ! .
Problem Loading...
Note Loading...
Set Loading...
First note that 1 0 ! = 2 8 × 3 4 × 5 2 × 7 . To find the least possible sum of 4 factors of 1 0 ! , we are looking for the 4 factors closest to the 4th root of 1 0 ! , which is approximately 4 3 . 6 5 . Apportioning the prime factors optimally, the 4 factors closest to this value are
2 3 × 5 = 4 0 , 2 × 3 × 7 = 4 2 , 3 2 × 5 = 4 5 and 2 4 × 3 = 4 8 .
Thus a + b + c + d = 4 0 + 4 2 + 4 5 + 4 8 = 1 7 5 .