Let A = { 1 , 2 , 3 , . . . 2 2 0 1 5 } . Consider the higher odd divisors of each of the elements A and sum them.
If that sum can express as b 4 a + 2
Find a + b + 4 .
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.
How about a+b+c=2+4030+3=4035?
We have to "extract" the highest power of 2 from each element of A to get the highest odd divisor of each of the elements.
For the odd elements the highest power of 2 is of course 0 , so we add all the odd numbers, 2 2 0 1 4 of them in total, to get
1 + 3 + 5 + . . . . . + ( 2 2 0 1 5 − 1 ) = ( 2 2 0 1 4 ) 2 = 4 2 0 1 4 ,
since the sum of the first n odd natural numbers is n 2 .
Next, divide by 2 those elements of A for which the highest power of 2 in their prime factorization is 1 . What remains is
1 + 3 + 5 + . . . . . + ( 2 2 0 1 4 − 1 ) = ( 2 2 0 1 3 ) 2 = 4 2 0 1 3 .
We then deal with the elements of A for which the highest power of 2 in their prime factorizations is 2 . What remains is
1 + 3 + 5 + . . . . . + ( 2 2 0 1 3 − 1 ) = ( 2 2 0 1 2 ) 2 = 4 2 0 1 2 .
We continue this process for successively higher powers k of 2 , in each case the sum of highest odd divisors being 4 2 0 1 4 − k for 0 ≤ k ≤ 2 0 1 4 . We thus end up with the geometric series
4 2 0 1 4 + 4 2 0 1 3 + 4 2 0 1 2 + . . . . . + 4 2 + 4 1 + 4 0 = 3 4 2 0 1 5 − 1 .
Finally we need to consider 2 2 0 1 5 itself, the highest odd divisor being of course 1 . So the desired sum is
3 4 2 0 1 5 − 1 + 1 = 3 4 2 0 1 5 + 2 ,
and so a + b + c = 4 + 2 0 1 5 + 3 = 2 0 2 2 .
Problem Loading...
Note Loading...
Set Loading...
Let m ϵ A are three cases:
m = 2 n ⇒ the greatest odd divisor is 1
m = 2 k ⇒ the greatest odd divisor is k
3. m = 2 k − 1 ⇒ the greatest odd divisor is 2 k − 1
Then S ( 1 , 2 , 3 . . . 2 2 0 1 5 sum of the greatest odd divisor each elemte of A
Have that
S 2 1 0 5 = S ( 1 , 2 , 3 . . . 2 2 0 1 5 ) = S ( 1 , 3 , 5 . . . 2 2 0 1 5 − 1 ) + S ( 2 , 4 , 6 . . . 2 2 0 1 5 )
S ( 1 , 2 , 3 . . . 2 2 0 1 5 ) = ( 2 2 0 1 4 ) 2 + S ( 1 , 2 , 3 . . . 2 2 0 1 4 )
S ( 1 , 2 , 3 . . . 2 2 0 1 5 ) = ( 2 2 0 1 4 ) 2 + S 2 0 1 4
Then S 2 0 1 4 = S ( 1 , 3 , 5 , . . 2 2 0 1 4 − 1 ) + S ( 2 , 4 , 6 . . . 2 2 0 1 4 )
S 2 0 1 4 = ( 2 2 0 1 3 ) 2 + S ( 2 , 4 , 6 . . . 2 2 0 1 4 )
S 2 0 1 4 = ( 2 2 0 1 3 ) 2 + S 2 0 1 3
and so successively.
Later
S 2 0 1 5 − S 2 0 1 4 = ( 2 2 0 1 4 ) 2 = 4 2 0 1 4
S 2 0 1 4 − S 2 0 1 3 = ( 2 2 0 1 3 ) 2 = 4 2 0 1 3
⋮
S 3 − S 2 = ( 2 2 ) 2 = 4 2
S 2 − S 1 = ( 2 1 ) 2 = 4 1
⇒ ( S 2 0 1 5 − S 2 0 1 4 ) + ( S 2 0 1 4 − S 2 0 1 3 ) + . . . + ( S 3 − S 2 ) + ( S 2 − S 1 ) = S 2 0 1 5 − S 1
S 2 0 1 5 − S 1 = 4 2 0 1 4 + 4 2 0 1 3 + 4 2 0 1 2 . . . 4 3 + 4 2 + 4 = 4 − 1 4 2 0 1 5 − 4
S 2 0 1 5 − 2 = 3 4 2 0 1 5 − 4
S 2 0 1 5 = 3 4 2 0 1 5 − 4 + 2
S 2 0 1 5 = 3 4 2 0 1 5 + 2
So
a = 2 0 1 5
b = 3
a + b = 4 + 2 0 1 5 + 3 = 2 0 2 2