2 x + 2 x + 1 + 2 x + 2 + … + 2 x + 2 0 1 5 = 4 x + 4 x + 1 + 4 x + 2 + … + 4 x + 2 0 1 5
If x satisfies the equation above and it can be represented as lo g D ( 1 + B C A ) for positive integers A , B , C , and D , where B is prime, determine the smallest value of A + B + C + D .
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.
This is the wrong answer.
Since it has asked for smallest value, 2^2016 can be written in many ways and for the required smallst value, it will be denoted as 64^336.
Then we get x=log(base-2)[3÷(1+64^336)]
Hence A=3 B=64 C=336 D= 2
And A+B+C+D= 3+64+336+2 =405
did same...
Team plz respond .
B is prime
Problem Loading...
Note Loading...
Set Loading...
2 x + 2 x + 1 + 2 x + 2 + . . . + 2 x + 2 0 1 5 2 − 1 2 x ( 2 2 0 1 6 − 1 ) 3 ˙ 2 x ( 2 2 0 1 6 − 1 ) 2 x ( 2 2 0 1 6 + 1 ) ⇒ x = 4 x + 4 x + 1 + 4 x + 2 + . . . + 4 x + 2 0 1 5 = 4 − 1 4 x ( 4 2 0 1 6 − 1 ) = 2 2 x ( 2 2 0 1 6 − 1 ) ( 2 2 0 1 6 + 1 ) = 3 = lo g 2 ( 1 + 2 2 0 1 6 3 )
⇒ A + B + C + D = 3 + 2 + 2 0 1 6 + 2 = 2 0 2 3