# Determine the #a# value #0 < a < 1# in #1/16 log_a256^("colog"_(a^2)256^(log_(a^4)256^{cdots^("colog"_(a^(2^64))256)}))="Im"[z]# where #z# is the solution for #2^4033 z^2-2^2017 z+1 = 0# #(A)1/4, (B)1/8, (C)1/16, (D)1/32, (E) 1/64# ?

##### 1 Answer

The only answer I can give you is assuming (based on the lack of parentheses) that everything to the left each

I am not sure how to solve it otherwise, without using mathematics way beyond what is considered "Algebra".

The "solutions" are

#### Explanation:

First, solving for

#2^4033z^2-2^2017z + 1 = 0#

#z = (2^2017 +- sqrt(2^(2*2017)-4(1)(2^4033)))/(2(2^4033))#

#z = (2^2017 +- sqrt(2^4034 - 2^4035))/2^4034#

#z = (2^2017 +- sqrt(-2^4034))/2^4034#

#z = (2^-2017 +- 2^-2017i)#

#therefore Im[z] = +-2^-2017#

~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Just to refresh your memory:

#"colog"_a(x) = -log_a(x)#

#log_(a^b)(x) = 1/b log_a(x)#

Also, your pattern of logs and cologs doesn't make sense, since it should end up with the

~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Now, onto simplifying this horrific logarithm power tower (the math formatting literally cannot handle an expression of this size, so excuse the poor notation):

#1/16 log_a256^("colog"_(a^2)...^log_a^(2^64)(256))#

We can pull the exponent out of the logarithm:

#= 1/16 "colog"_(a^2)256^(...^log(a^(2^64))256) * log_a(256)#

And again:

#= 1/16 log_(a^4)(256^(...^log...)) * "colog"_(a^2)(256) * log_a(256)#

At this point, you can probably see where this is going. Each time we pull the exponent out of the logarithm, there's another exponent in THAT logarithm that can be pulled out too. So we can basically unravel this entire chain of logarithms into a simple product:

#= 1/16 log_a256 * "colog"_(a^2)256 * log_(a^4)256* "colog"_(a^8)256...*log_(a^(2^64))256#

Now, let's turn all of the cologs into negative logs:

#= 1/16 log_a256 * (-log_(a^2)256) * log_(a^4)256* (-log_(a^8)256)...*log_(a^(2^64))256#

The negative signs occur in every other term, and there are 65 terms. Therefore, there will be 32 negative signs. Since this is an even number, we can just cancel out all the negative signs (using the fact that

#= 1/16 log_a256 * log_(a^2)256 * log_(a^4)256* log_(a^8)256...*log_(a^(2^64))256#

Now that we just have a product of a bunch of logs, we can use the second rule from above, to rewrite all of the logs into base

#= 1/16 log_a256 * (1/2log_a256) * (1/4log_a256)* (1/8log_a256)...*(1/2^64log_a256)#

#= 1/16(1/2*1/4*1/8...*1/2^64)(log_a(2^8))^65#

#= 1/16(1/2^(1+2+3...+64))(8log_a2)^65#

#= 1/16(1/2^2080)8^65(log_a2)^65#

#= 1/2^2096(2^3)^65(log_a2)^65#

#= 1/2^2096(2^195)(log_a2)^65#

#= 1/2^1901(log_a2)^65#

Now, we can set this equal to the

#1/2^1901(log_a2)^65 = +- 1/2^2017#

#(log_a2)^65 = +- 1/2^116#

#log_a2 = 2^(+-116/65)#

#2 = a^(2^(+-116/65)#

#2^(1/(2^(+-116/65))) = a#

This produces the solutions

Like I said before, I'm not sure how else to help with this problem. If these solutions were what you were looking for, that's great, but if not, I would contact someone to ask them why such a mess of a problem was created.