A pack contains n cards numbered from 1 to n . Two consecutively numbered cards are removed from the pack and the sum of the remaining numbers is 1 2 2 4 . If the smaller of the numbers on the removed cards is k , then k − 2 0 is equal to
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.
For n = 5 0 , we have
2 n ( n + 1 ) = 1 2 7 5
Taking K = 2 5 ,
K + K + 1 = 5 1 and 1 2 7 5 − 5 1 = 1 2 2 4
K − 2 0 = 5
I like this sight very much. I like to work for this sight
you are right bro, sorry i have wrongly entered the answer.
Log in to reply
Thank you. I have updated the answer accordingly.
This is really a trial and error solution. Can you outline a rigorous solution to this problem?
Problem Loading...
Note Loading...
Set Loading...
Because the cards are ascending natural numbers, we know that the sum of all of them must be a triangular number. Let k be the lower of our integers. Therefore, 1224+k+(k+1) must equal a triangular number. The closes triangular number>1224 is 1225 (49 cards in the deck;49th triangular number). This obviously does not work, because then the two cards would have to sum to 1, and 0 is not a card in the set. The next highest is 1275 (50 cards). The difference between 1275 and 1224 is 51, which can be written as 26+25. 25 being the smaller, 2 5 − 2 0 = 5
N.B: Essentially, we are trying to find values satisfying the equation 2 n ( n + 1 ) = 1 2 2 4 + ( 2 k + 1 ) . There are infinite solutions natural number solutions to this. However, you will notice that all other solutions do not fit with the problem. e.g.: 2 5 3 ( 5 4 ) = 1 2 2 4 + 2 0 7 . While this does satisfy the equation, it is problematic because you would have to remove the two consecutive cards 103 and 104. This is a contradiction, because the deck in this case would have only 53 cards.