What is the largest possible value of k in the following expression, where k ∈ N , n ≥ 0 ?
( ( 2 ) 1 + ( 2 ) 2 ) × ( ( 2 ) 3 + ( 2 ) 4 ) × . . . × ( ( 2 ) 2 0 1 7 + ( 2 ) 2 0 1 8 ) = 2 k + n
Enter your answer as k + 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.
I think there a few issues with this problem, but let's set those aside for now. You write ( 1 + 2 ) 1 0 0 9 = a + b 2 , where a are b are integers. You then write 2 5 0 9 0 4 0 ( a 2 + 2 b ) = 2 k + n . Your claim is that you cannot take out other factors of 2 in the left-hand side. How do you know? If a and b are even, then you could pull out more factors of 2.
Problem Loading...
Note Loading...
Set Loading...
( ( 2 ) 1 + ( 2 ) 2 ) × ( ( 2 ) 3 + ( 2 ) 4 ) × . . . × ( ( 2 ) 2 0 1 7 + ( 2 ) 2 0 1 8 ) = 2 k + n ( 2 ) 1 ( 1 + 2 ) × ( 2 ) 3 ( 1 + 2 ) × . . . × ( 2 ) 2 0 1 7 ( 1 + 2 ) = 2 k + n ( 2 ) 1 × ( 2 ) 3 × ( 2 ) 5 × . . . × ( 2 ) 2 0 1 7 × ( 1 + 2 ) 1 0 0 9 = 2 k + n ( 2 ) 1 + 3 + 5 + . . . + 2 0 1 7 × ( 1 + 2 ) 1 0 0 9 = 2 k + n Since n = 1 ∑ k 2 n − 1 = k 2 , ( 2 ) ( 1 0 0 9 2 ) × ( 1 + 2 ) 1 0 0 9 = 2 k + n ( 2 ) ( 1 0 1 8 0 8 1 ) × ( 1 + 2 ) 1 0 0 9 = 2 k + n ( 2 ) ( 1 0 1 8 0 8 0 ) × ( 2 ) ( 1 ) × ( 1 + 2 ) 1 0 0 9 = 2 k + n 2 5 0 9 0 4 0 × 2 × ( 1 + 2 ) 1 0 0 9 = 2 k + n Now let us consider the binomial expression of ( 1 + 2 ) 1 0 0 9 .
Let ( 1 + 2 ) 1 0 0 9 = a + b 2 . 2 5 0 9 0 4 0 × 2 × ( a + b 2 ) = 2 k + n 2 5 0 9 0 4 0 × ( a 2 + 2 b ) = 2 k + n As a will always be an odd integer, the bit in brackets will be irrational so will have no integer powers of 2 as factors, meaning that 5 0 9 0 4 0 is the greatest power of 2 in the left-hand side, so it is the greatest possible value of k . Therefore, k + 1 = 5 0 9 0 4 1