Pete summed up 10 consecutive powers of 2, starting from some power, while Basil summed up several consecutive positive integers starting from 1. Can they get the same result?
If yes, enter your answer as the least common sum. Else, enter 999
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.
Same Way. And they of course can get equal values because if they didn't what would we type in the answer box? So you should only ask for the value remove the line which says "if yes".
You should perhaps justify that this common sum is indeed the minimum. This is not immediately apparent since 1 0 2 3 = 3 . 1 1 . 3 1 . We could have, for instance, let n = 3 . 2 k + 2 while n + 1 = 3 4 1 . Although no solution exist to such equations, it should be verified for completeness.
Log in to reply
@ZK LIn I'm not sure I understand. Could you please explain more? Like what more should I add to the solution?
Log in to reply
I agree with him. I was about to ask you that. We want you to prove that this is the only solution. And by the way how as your JSTSE?
Log in to reply
@Kushagra Sahni – JSTSE was , uh good as far as I can say
I'm scoring 153.I know, it is less. Physics was all theoretical :(
@Kushagra Sahni – What is the highest score you know of? And how much do you expect the cutoff to be?
Log in to reply
@Mehul Arora – Last year the cut off was 142 and I qualified. I think you can also qualify.
Log in to reply
@Kushagra Sahni – How much did you get?
Log in to reply
@Mehul Arora – Around 150 because GK was very difficult.
Log in to reply
@Kushagra Sahni – Yeah GK was really difficult in our paper too.
Some case checking (or just a line that indicates that you have verified them).
Since n ( n + 1 ) = 2 k + 2 . 1 0 2 3 , there can be multiple ways to assign factors of 1 0 2 3 to n or n + 1 .
For example, n = 3 . 2 k + 2 , n + 1 = 3 4 1 and n = 3 1 . 2 k + 2 , n + 1 = 3 3 . If a solution n exists to these equations, then apparently, n < 1 0 2 3 and so 5 2 3 7 7 6 is not the least common sum.
how did u get the idea of taking 2^k+2 as common term,why don't it be 2^k+1
This should not be Level 5.
Log in to reply
Presently, 11/66 people got it right. I set it as Level 4. It's upto the people :P
Same way! Cheers!
Great problem, thanks for sharing! Anyway, here's how I did it:
We have:
2 x + 2 x + 1 + ⋯ + 2 x + 9 = 2 y ( y + 1 )
We notice that the LHS is a geometric sequence. Simplifying: 2 x + 1 ( 2 1 0 − 1 ) = y ( y + 1 ) 1 0 2 3 ∗ 2 x + 1 = y ( y + 1 )
Notice that both the LHS and RHS consists of an odd number multiplied by an even number.
Thus we know that either y or y + 1 has 2 x + 1 as a divisor. So we can re-write either y or y + 1 as a ∗ 2 x + 1 Thus we have:
1 0 2 3 ∗ 2 x + 1 = a ∗ 2 x + 1 ( a ∗ 2 x + 1 ± 1 )
a 1 0 2 3 = ( a ∗ 2 x + 1 ± 1 )
Both sides of the equation are integers, so a is a divisor of 1 0 2 3 . So a can be equal to: 1 , 3 , 1 1 , 3 1 , 3 3 , 9 3 , 3 4 1 , 1 0 2 3
Re-arranging:
a 2 1 0 2 3 ± a = 2 x + 1
We now try all possible cases ( 1 6 cases, 8 possible numbers for a and 2 possible variations of the ± sign) of a and we find that a can only equal 1 for x to be an integer, with the ± showing + .
From the above equation, we then find that x = 9 .
The answer, as required:
1 0 2 3 ∗ 2 x = 5 2 3 7 7 6
Problem Loading...
Note Loading...
Set Loading...
Indeed, they can.
2 k + 1 + 2 k + 2 + . . . . . . . + 2 k + 1 0 = 1 + 2 + 3 + . . . . . + n
2 k + 2 ( 2 1 0 − 1 ) = n ( n + 1 )
We see that it works for n = 2 1 0 − 1 , k = 8
Thus, the common sum = 2 2 1 0 × ( 2 1 0 − 1 ) = 5 2 3 7 7 6