In Computer Science feed, if you come across and then asked to find the value of , then one of the approaches is and then you assign the numbers their respective numbers from position in Alphabets, giving
But if you do that in , for some unknown positive integers ,
then it is a (You can't say 1st equation implies the 2nd)
But for how many ordered 10-tuples of distinct positive integers , are the above two equations simultaneously true ?
Details and assumptions :-
All the alphabets are distinct and are some positive integers.
The tuple is different from .
This is a part of the set Mistakes Give Rise to Problems!
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.
See that because A , B , C , D , E , F , G , H , I , J are distinct integers,
the minimum value of A + B + C + D + E will be for
( A , B , C , D , E ) = some permutation of ( 1 , 2 , 3 , 4 , 5 ) because these are the minimum distinct positive integers. Hence their sum can be minimum 1 5 , and it will be 1 5 in only this case.
Because it is given to be 1 5 , we can conclude that ( A , B , C , D , E ) is some permutation of ( 1 , 2 , 3 , 4 , 5 ) . (giving 5 ! = 1 2 0 ordered 5-tuples )
Now because F , G , H , I , J are distinct (other than A,B,C,D,E), they can have minimum sum by ( F , G , H , I , J ) = some permutation of ( 6 , 7 , 8 , 9 , 1 0 ) . And thus the minimum sum they can give will be 6 + 7 + 8 + 9 + 1 0 = 4 0 .
This gives us that ( F , G , H , I , J ) is some permutation of ( 6 , 7 , 8 , 9 , 1 0 ) . (giving 5 ! = 1 2 0 ordered 5-tuples )
Thus the total number of 1 0 − t u p l e s will be 5 ! × 5 ! (by rule of product) giving the final answer to be 1 4 4 0 0